CS-04 - Data Structure through 'C' and 'PASCAL'

Syllabus effective till December 2004

The objective of the course is to introduce the basic concepts of data structure and discuss important features of using two popular high level programming languages 'C' and 'PASCAL'. Since data structure, is an essential component in the development of a software, the intention is to provide a wide range of topics on this subject with appropriate examples. The course is organised in the following manner:

Block I introduces the essential features of PASCAL programming languages, data types, looping statements bit wise operations, recursion' and string processing pointers, etc.

Block 2 and 3 cover the essential and advance features of C, including its various construct, bitwise operations, functions, macros etc.

Block 4 discussion on advanced Data Structures component such as Arrays, Lists, Stacks, Queues Graphs and their uses.

Block 5 is a discussion on advanced Data Structures, such as Binary Tree, B Tree, AVL Tree etc., and File Organisation. Students should also read topics on Threaded Binary Tree, Binary Tree representation, Inorder and Preorder from reference literatures given in the block.

Block 6 presents simple and advanced searching and sorting techniques such as quick sort and Heap sort.

Reference : Fundamentals. of Data Structures, Horowitz and Sahni.

Students are requested to refer to the prescribed reference material. Some questions are asked from books also.