|Data Structures Using C & C++
Course for All Classes
|1||Introduction to Data Structure and its Characteristics
Representation of single and multidimensional arrays; Sprase arrays – lower and upper triangular matrices and Tridiagonal matrices with Vector Representation also.
|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.
Introduction to linked lists; Sequential and linked lists, operations such as traversal, insertion, deletion searching, Two way lists and Use of headers
Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion, deletion; Binary Search Tree
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
Insertion sort, selection sort, merge sort, heap sort, searching Techniques: linear search, binary search and hashing