BIIT

Data Structures Using C & C++ Course for All Classes
Sr. No.	Topic	Hours
1	Introduction to Data Structure and its Characteristics Array: Representation of single and multidimensional arrays; Sprase arrays – lower and upper triangular matrices and Tridiagonal matrices with Vector Representation also.	7
2	Stacks and Queues: Introduction and primitive operations on stack; Stack application; Infix, postfix, prefix expressions; Evaluation of postfix expression; Conversion between prefix, infix and postfix, introduction and primitive operation on queues, D- queues and priority queues.	10
3	Lists: Introduction to linked lists; Sequential and linked lists, operations such as traversal, insertion, deletion searching, Two way lists and Use of headers	6
4	Trees: Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion, deletion; Binary Search Tree	5
5	B-Trees: Introduction, The invention of B-Tree; Statement of the problem; Indexing with binary search trees; a better approach to tree indexes; B-Trees; working up from the bottom; Example for creating a B-Tree	5
6	Sorting Techniques: Insertion sort, selection sort, merge sort, heap sort, searching Techniques: linear search, binary search and hashing	7
Total Hours		40