Theory of Algorithms (1901341)

Instructor: Dr. Jamal Alsakran
Office location: KASIT 1st floor (Computer Science Department)
Office hours: 10 - 11 (Sun, Tues, Thurs)

Prerequisite: Data Structures (1901231)

Syllabus pdf

Course Content:

Date Topic Slides Notes
July 25 Ch1: The role of algorithms in computing 2   6
July 26 Ch2: Getting Started 2   6
July 30 Ch3: Growth of Functions 2   6
August 1 Complexity Practice Exercises
August 1 Sample Quiz
August 2 Ch4: Recurrences 2  6
August 8 Ch6: Heap Sort 2  6
August 12 Practice: Recurrences Solution
August 12 Homework: Binary vs Trinary Heap Due Date: Sunday August 20 by Midnight
MidTerm Exam on Sunday 13/8 at 12:30
August 14 Ch7: Quick Sort 2  6
August 16 Ch22: Graph - part 1 2  6
August 17 Ch22: Graph - part 2 2  6
August 20 Ch22: Graph - part 3 2  6
August 21 Ch22: Graph - part 4 2  6
August 22 Ch23: Minimum Spanning Trees 2  6
Hw 1 scores
Hw 2 scores
Totals (out of 50)
Final Exam on Monday 28/8/2017, Time: 12 - 2, Location: KASIT 103

Evaluation:

MidTerm Homework & Quizzes Final
30 20 50

Text Book:
Introduction to Algorithms, by: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, & Clifford Stein, Third Edition 2009

Computer Graphics with OpenGl

Book website:
http://mitpress.mit.edu/algorithms/
http://highered.mcgraw-hill.com/sites/0070131511/student_view0/