Lecture 2

Learning objectives

After this class, you should be able to:

1. Given an algorithm, derive its asymptotic time complexity.
2. Prove properties of big-oh, big-omega, big-theta, little-oh, and little-omega.

Reading assignment

1. Lec-2 slides.
2. CLR: Chapter 3.
3. CLR: Chapter 4 - Pages 65-66 and page 75.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 3.1-2.
  2. Exercise 3.2-2.

• Questions on next lecture's material
  1. (Post your answer on the discussion board) Give the recurrence relation for some algorithm that you studied in COP 4530 - Data Structures.
  2. (Post your answer on the discussion board) Given an example of two matrices and their product.