Chap1

  1. Classification of DS
  2. classification of DS examples
  3. Primitive DS and its operations
  4. ADT

Chap2

  1. Asymptotic Notations
  2. Multiplying Sq matrix is O(n3) how
  3. Space required
    • sum of array elements
    • Matrix Multiplication
    • Factorial of a number
    • GCD
    • Fibonacci
  4. Time complexity for matrix multiplication using and
    1. Factorial
    2. GCD
    3. Fibonacci
  5. Bubble sort . Sequential sort. Their complexities

Chap3

  1. Different Storage representation of strings
  2. Their advantages and disadvantages
  3. Find substring from given string, given index
  4. Find index of a sub-string inside a string
  5. insert,delete,replace sub-strings
  6. Naive Pattern Matching
  7. KMP
  8. adv and disadv of the above 2

Chap4

  1. how are arrays stores in memory
  2. multi-dimentional array
  3. insert,delete from an array

Chap5

  1. Linear,Binary search
  2. Bubble sort
  3. Selection sort
  4. Insertoin sort
  5. Merge sort
  6. Internal vs External sort

Chap6

  1. Memory Representation types of 2-D array
  2. Addition
  3. Subtraction
  4. Multiplication
  5. Sparse checker [program]
  6. transpose checker [program]

Chap7

  1. Adv of Linked Lists over Arrays
  2. LL representaion using array
  3. dynamic v static representation of LL
  4. getNode, freeNode
  5. Singly Linked Lists
  6. Circular LL, adv n disadv, applications
  7. Header node and its types
  8. Header node vs External node
  9. Doubly LL,adv n disadv, applications
  10. static and dynamic implementation
  11. Implement stack using CLL
  12. Implement queue using CLL
  13. adv of stack and queue using LL

Chap8

  1. Stack using arrays
  2. Push Pop should always have overflow and underflow checks
  3. stacktop() , isempty()
  4. Stack using structures
  5. Combining two stacks, maintaing the same order
  6. Infix to prefix [polish]
  7. prefix to Infix
  8. infix to postfix [reverse polish]
  9. postfix to infix
  10. prefix to postfix
  11. postfix to prefix

Chap9

  1. How are queues represented in memory
  2. Types of queue
  3. Operations on queue
  4. Types of queues
  5. Linear vs circular
  6. implementation of both using arrays
  7. Priority queue
  8. Types of priority queue
  9. Representing priority queue
  10. Double-ended queue Dequeue
  11. Types in Dequeue
  12. Insertion and deletion on unsorted queues
  13. Applications of queues

Chap10

  1. Directed, Undirected graph
  2. subgraph
  3. Degress
  4. Adjacent , incident vertices
  5. complete graph
  6. Types based on edges
  7. Types based on connections
  8. connected, strongly connected,disconnected
  9. path v simple path. cycle v simple cycle
  10. Representation types - matrix ,list, path matrix
  11. DFS , BFS

Chap11

  1. Tree v binary tree
  2. Binary tree v btree
  3. Types of trees
  4. Types of binary trees
  5. Types of btrees
  6. Depth/height, siblings
  7. properties of binary tree and btree
  8. Strictly binary,complete,full,almost,perfect
  9. Representation
  10. adv n disadv of Sequential
  11. adv n disadv of LL
  12. 3 traversals
  13. Sequential Traversal [level order traversal]
  14. search item
  15. insert item
  16. Delete item
  17. The above 3 for BSt
  18. BST delete item with all 3 cases

Final Test

  1. [program] String length,concatenation,reverse
  2. Bin search
  3. Selection sort
  4. tower of hanoi
  5. GCD using recursion
  6. infix to postfix
  7. Circular queue using arrays [program]
  8. Circular queue using diff method [program]
  9. Create and traverse BST
  10. Creation,Insertion,Deletion,Display on SLL[program]
  11. Stack using LL [program]
QUICC
  1. Classification of DS
  2. Time and Space complexity
  4. Row major - col major representaion
  5. Bubble sort and other sorting efficiency
  6. ADV of LL over arrays
  7. adv of diff types of LL
  8. Application of stack
  9. Application of queue
  10. Application of LL
  11. Program to find
  12. Explain Asymptotic notation with example
  13. Insert,delete,replace on strings
  14. Selection sort
  15. Memory representaion of LL
  16. Types of LL
  17. Insert at desired pos in LL
  18. [program]Double LL and CLL
  19. [program]Push ,pop,isempty,stacktop
  20. Priority queue
  21. Dequeue or Deque
  22. Insert Delete on CLL
  23. Graph traversal Techniques
  24. Program for above
  25. Binary Tree traversal
  26. Construction of BST
  27. Examples of ADT
  28. what is garbage collection
  29. DMA
  30. Pattern matching algoritms of strings
  31. Selection Sort
  32. Types of LL
  33. Types of Queues
  34. Evaluate postfix
  35. Evaluate infix
  36. Evaluate prefix
  37. Recursive and iterative function for tree traversal
  38. Graph traversal
  39. [Program]Insertion sort
  40. Operations on non-primitive DS