Chapter

• 1
  Chapter 1

  Study of an analysis of one of the most basic problems in CS - sorting. Introduction to all basic kinds of analysis of algorithms and asymptotic analysis and notations.

  Estimated time: ~50 Minutes
• 2
  Chapter 2

  Discussion of recurrences and recursion trees in the context of merge sort and analyzing the performance of merge sort. It also introduces Big-O notations in the context of algorithm analysis.

  Estimated time: ~36 Minutes
• 3
  Chapter 3

  Introduces and analyzes various different types of sorting algorithms. This chapter discusses their efficiency, how they compare to each other and how they are different from each other. It covers bubble sort, quick sort and selection sort. It also introduces the problem of searching, discusses linear and binary search algorithms and their efficiency through analyzing them.

  Estimated time: ~40 Minutes
• 4
  Chapter 4

  Introduction to the Divide and Conquer Paradigm of solving problems, in the context of algorithm analysis using recurrences and recursion trees. The most common divide and conquer solutions are introduced - merge sort, binary search, powering a number and Fibonacci.

  Estimated time: ~30 Minutes
• 5
  Chapter 5

  Introduction to a common problem in CS - the symbol-table problem and how it is solved through hashing. Discusses hashing concepts such as choosing a hash function and properties of a good hash function, collision resolution through chaining. Presents analysis of the speed of hashing operations.

  Estimated time: ~41 Minutes
• Exam
  Locked

  You must complete all chapters before taking the course exam.