CSC 311 Syllabus (Fall Semester 2008)


Design and Analysis of Algorithms

Credit hours: 3

Prerequisites: CSC212 + CSC281

Goals of the course:  (a) Provide students with the tools necessary to analyze and evaluate the algorithms; and (b) Introduce the students to some common algorithm design techniques/paradigms.


  • A. Levitin, Introduction to the Design & Analysis of Algorithms, 2/e, Pearson Addison-Wesley, 2006. This is the official textbook for the course.
  • E. Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms, Computer Science Press, 1998. Supplementary text.


Topics (tentative): Mathematical essentials. Overview of space and time complexities and the introduction of asymptotic notations. Practical complexities. Advanced data structures. Main design techniques: divide and conquer, greedy algorithms, dynamic programming, backtracking, branch and bound. Introduction to NP theorem (time permitting)


Exam dates (tentative):

Midterm-I: Sat, 1 Dhul-Hijja, 1429 (= 29.11.2008)                                           Midterm-II: Sat, 13 Muharram, 1430 (= 10.01.2009)


 Evaluation: Homework + term project: 15 points; Midterm exams (2): 40 points (better of the two worth's 25pt); Final exam:  45 points


Yahoo group for this course: http://groups.yahoo.com/group/CSC311-KSU/ . You must subscribe to the group in order to post/download materials. To join, send a short email to: CSC311-KSU-subscribe@yahoogroups.com


Below you'll find some old exams and a cheat sheet.



CSC311 Project (Spring 07).pdfCSC311 Project (Spring 07)عقيل محمد مصطفى عبدالرحمن العظ
CSC311 Project (Spring 08).pdfCSC311 Project (Spring 08)عقيل محمد مصطفى عبدالرحمن العظ
CSC311_Final_Spring08.pdfCSC311_Final_Spring08عقيل محمد مصطفى عبدالرحمن العظ
CSC311_Midterm_II_Spring08.pdfCSC311_Midterm_II_Spring08عقيل محمد مصطفى عبدالرحمن العظ
CSC311_Midterm_I_Spring08.pdfCSC311_Midterm_I_Spring08عقيل محمد مصطفى عبدالرحمن العظ
Useful Mathematical Formulas.pdfUseful Mathematical Formulasعقيل محمد مصطفى عبدالرحمن العظ