Teaching                                                                                                              Calendar

Currently Teaching

    • MCA 201: Data Structures and File Processing

    • MCA 201: Data Structures and File Processing

      Syllabus

      Basic Data Structures: Abstract data structures- stacks, queues, linked lists and binary trees.

      Sets: Dictionary implementation, use of priority queues, hashing, binary trees, balanced trees, sets with merge-find operations.

      Searching: Internal and external searching, use of hashing and balancing techniques.

      Memory Management: Garbage collection algorithms for equal sized blocks, storage allocation for objects with mixed size, buddy systems.

      Physical Devices: Characteristics of storage devices such as disks and tapes, I/O buffering.

      Basic File System Operations: Create, open, close, extend, delete, read-block, write-block, protection mechanisms.

      File Organizations: Sequential, indexed sequential, direct, inverted, multi-list, directory systems, Indexing using B-tree, B+tree and their variants, hashing – hash function, collision handling methods, extendible hashing.


      References

      • M.T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, John Wiley & Sons, Inc., 2004.
      • T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms(2nd ed.), Prentice-Hall of India, 2006.
      • M.J. Folk, B. Zoellick and G. Riccardi, File Structures: An Object Oriented Approach With C++(3rd ed.), Addison- Wesley, 1997.
      • Robert L. Kruse and A.J. Ryba, Data structures and program design in C++Prentice- Hall, Inc., NJ, 1998.
      • B.Stroupstrup,The C++ Programming LanguageAddison Wesley, 2004.
      • D.E.Knuth,Fundamental AlgorithmsVol. I, Addison Wesley, 1997.
    • MCA 202: Discrete Mathematics

    Courses Taught During July 2012 - November 2012

    Subjects Taught Previously

    Undergraduate Level

    • 1989 - 2002: Systems Analysis and Design, Computer System Architecture, Programming languages from COBOL, Pascal to C, Discrete Structures, Data Structures, Algorithms, Theory of Computation/ Automata Theory, Statistical Techniques

    Postgraduate Level