 |
![[Courses]](../icons/up.png){kind=icon}
![[Unix]](../icons/prev.png){kind=icon}
![[Home]](../icons/home.png){kind=icon}
![[Photos]](../icons/next.png){kind=icon}
![[PHome]](../icons/author.png){kind=icon}
| Spring Quarter 2000 |
This course extends the study of algorithms introduced in CS-285. Topics include searching, sorting, selection, graph structures, and traversal algorithms. Applications such as dynamic memory management, data compression, optimization problems, and database indexing are also discussed. Laboratory activities include the implementation and comparison of problem-specific algorithms, as well as the use of generic algorithms from the C++ standard library. (prereq: CS-285, SE-280) (2-2-3)
Objectives
On successful completion of this course, the student will:
- Be able to use generic algorithms from the STL and implement additional generic algorithms.
- Be able to apply asymptotic time complexity analysis to choose among competing algorithms.
- Understand how sorting algorithms such as heapsort and quicksort work.
- Understand how graph and tree structures are implemented.
- Be familiar with engineering applications for many of the fundamental algorithms discussed in the course.
- Be familiar with dynamic programming.
The above course description and goals were taken from the official course description.
General Course Policies
Please review the general course policies webpage.
Textbook
Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, McGraw-Hill, 1990.
My Schedule
| Time | Mon | Tue | Wed | Thu | Fri |
|---|---|---|---|---|---|
| 8:00 | CS183-1 CC48 | ||||
| 9:00 | CS183-1 CC48 | CS183-1 CC48 | CS183-1 CC48 | ||
| 10:00 | Office Hour | Office Hour | Office Hour | ||
| 11:00 | CS183-3 CC49 | XX | |||
| 12:00 | XX | CS183-3 CC49 | CS183-3 CC49 | CS183-3 CC49 | |
| 1:00 | DEPT MTG | Office Hour | Office Hour | ||
| 2:00 | Fac Senate | ||||
| 3:00 | CS286 CC48 | CS286 CC48 | CS286L CC61 | ||
| 4:00 | DirStudy |
Quizzes
A quiz will be given at the beginning of each lab period. The lowest quiz score will be dropped. No make-up quizzes will be given.
Grading
| Quizzes: (Weekly) | 40% |
| Lab projects: | 40% |
| Mid-Term Exam (April 5): | 10% |
| Final exam: (May 17) | 10% |
| Total: | 100% |
| Tentative Schedule |
