• Course Code: COMP333
  • Credits: 3
  • Hours Distribution: (3Crs.: 2Lec,3Lab)
  • Course Type: Computer Engineering Core Courses (CECC)

Course Description

The P=NP question. Time complexity of algorithms. The classes PNP. Solving recurrences. Divide and-conquer. Greedy algorithms. Dynamic programming. Graph algorithms. Geometric algorithms. Algorithms on matrices and polynomials. Number theoretic algorithms. Reductions between problems. Theory of NP completeness. Examples of NP complete problems. Some approximation algorithms. Pre-req.: COMP 231.