CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 1

Last update August 28, 2002

Topics References

1. Syllabus Syllabus

2. Objectives Objectives

3. Outline Outline

4. Review of Worst Case Analysis Binary Search (Recursive and Non-recursive)

5. Big-Oh, Big-Omega, Big-Theta Textbook p.p. 41 - 48

6. Properties of Big-Oh Textbook p.p. 49 - 50

7. Computation of Big-Oh Relationships with L'Hospital's Rule Notes on Calculation of Big-Oh

8. Big-Oh Relationships between Common Functions Summary of Big-Oh

Back to Lectures Home Page

Back to CS600 Home Page

Back to Toida's Home Page

Topics	References

1. Syllabus	Syllabus
2. Objectives	Objectives
3. Outline	Outline
4. Review of Worst Case Analysis	Binary Search (Recursive and Non-recursive)
5. Big-Oh, Big-Omega, Big-Theta	Textbook p.p. 41 - 48
6. Properties of Big-Oh	Textbook p.p. 49 - 50
7. Computation of Big-Oh Relationships with L'Hospital's Rule	Notes on Calculation of Big-Oh
8. Big-Oh Relationships between Common Functions	Summary of Big-Oh