CS-214: Analysis of Algorithms
Design and Analysis of Algorithms
  CS Department, LUMS CS-214 / Winter 2003-04

Home

Description

Lectures

Quizzes

Exams

Animations

Links

Course Description

 
 
Course Code: CS 214
Course Title: Analysis of Algorithms
Units: 4
Prerequisites: CS 211 (Discrete Mathematics), CS 213 (Data Structures and Algorithms)
Instructor: Dr Ashraf Iqbal

Motivation
1. To provide a Comprehensive study of Computer Algorithms.
2. To provide in depth coverage to Analysis and Design of Algorithms.
3. To become familiar with solution of classical problems and to study how these solutions can help in solving other related problems.
4. To study and design approximate algorithms for problems, which cannot be solved by exact algorithms.

Text Books/Readings:
Thomas H Corman, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms (2nd edition, 2001).

Lectures:
Two lectures every week, duration 100 minutes per lecture. One in class mid-term and a comprehensive Final Exam.

Grading Scheme:
Quizzes: 35%
Midterm: 30%
Final Exam: 35%

you can download the course outline from here