ADVANCED DATA STRUCTURES
Choose: Units II, III, IV, VI, VII and VIII (2,3,4,6,7 and 8)
Unit II
Check List after study

  • Overloading (function & Operator)
  • Templates
  • Virtual Functions
  • Abstract Classes


Unit III
Check List after study

  • Time and Space Complexity
  • Stacks & Queues Programs
  • Two Stacks with single array
  • ADTs of List, Stack, Queue


Unit IV
Check List after study

  • Dictionaries
  • Skip Lists
  • Hash Functions
  • Collision Resolutions


Unit VI
Check List after study

  • Binary Search Trees ADT
  • AVL Trees ADT
  • Algorithm of BST
  • Algorithm of AVL

Note: If you don't know program write algorithm, atleast you will get some marks


Unit VII
Check List after study

  • Red-Black Trees ADT
  • B-Trees ADT
  • Splay Trees
  • Comparisons

Note: If you don't know program write algorithm, atleast you will get some marks

Unit VIII
Check List after study

  • Brute Force
  • KMP
  • Tries