Syllabus for Test3

  1. o-notation (page-47)
  2. little omega notation (page-48)
  3. Graphs (page-1080)
  4. Free trees (page-1085)
  5. Rooted trees (page-1087)
  6. Binary trees (page-1088)
  7. Number of nodes of a binary and k-ary tree (page-1090)
  8. Representation of graphs (page-527)
  9. The divide-and-conquer approach of designing algorithms (page-28)
  10. The merge-sort algorithm in detail (page-32 and 29)
  11. The binary search algorithm in detail (refer homework solutions)
  12. Analysing divide-and-conquer algorithms (page-32)
  13. The master method of solving recurrence (page-73)