University of Allahabad Computer Science B.Sc.Part II Paper III Syllabus

Computer Science

B.Sc Part II Year

Paper III- Data Structures

Introduction:- 

 Data Structures, Representation and Implementation, Complexity calculation of algorithms, Linear & Non Linear Data Structures.

Linear Data Structures:- 

Arrays, Ordered List and their representations, List Operations- insertion deletion & transversal; Stack, Queues, Priority Queues, Linked lists, Doubly linked Lists, multi- channel lists and their variations; Algorithms for polynomial additions, sparse matrix representation, Infix and post fix expressions, Garbage collection.

Non Liner Data Structures:- 

 Binary trees &  their representations, Binary tree traversals,  Threaded binary trees, Height balancing and AVL tree, union and find algorithms, Decision tree, graphs, and their representations, Graphs and their representations. Graph search, Graph traversal, connected components and spanning trees; Shortest path.

Searching & Sorting:-

 Sequential search, binary search, hashing, Chaining and Symbol table, Collision processing, Indexed Search Techniques, Internal & External Sorting.