Syllabus for Test3

  1. Graphs (page-1080)
  2. Free trees (page-1085)
  3. Rooted trees (page-1087)
  4. Binary trees (page-1088)
  5. Number of nodes of a binary and k-ary tree (page-1090)
  6. Height of a binary and k-ary tree in terms of number nodes.
  7. Representation of graphs (page-527) (Adjacancy martix, Adjacancy list and Incidence matrix)
  8. The divide-and-conquer approach of designing algorithms (page-28)
  9. The merge-sort algorithm in detail (page-32 and 29)
  10. The binary search algorithm in detail
  11. Analysing divide-and-conquer algorithms (page-32)
  12. The master method of solving recurrence (page-73)
  13. Iterative method or recursion tree method of solving recurrence (page-67)