Course Archives Documentation Research and Training Centre Unit
Course: Data Structures and Computer Programming
Level: Postgraduate
Time: Currently not offered
Syllabus
Past Exams


Syllabus: Fundamentals of programming techniques, flowcharting, Introduction to C programming language. Arrays. Linked Lists: Singly linked, doubly linked and circularly linked. Stacks and queues. Applications Polish postfix conversion, FCFS scheduling. Binary trees Implementation, Traversal algorithms. Binary Search Tree, AVL tree. B-tree application in database design. Recursive programming Differences between recursion and iteration. Sorting Bubble sort, Selection sort, Insertion sort, Quick sort, Merge sort, Heap sort. Searching Linear search, Binary search. Hashing - Chaining and open addressing, collisions. Graphs. Pointer-based and array-based representation. Breadth-first and depth-first traversals. Shortest path algorithms. Fixed length / variable length records pinned / unpinned record, indexed files. Object oriented programming. Java or a similar language.

Reference Texts:


Top of the page

Past Exams
Midterm
16.pdf 17.pdf
Semestral
16.pdf 17.pdf
Supplementary and Back Paper

Top of the page

[Indian Statistical Institute]