Course Description
This course provides an introduction to mathematical foundations for analyzing and designing algorithms. The course covers various algorithm design paradigms including brute-force, divide-and-conquer, greedy algorithms, and dynamic programming. The course emphasizes solving some well-known problems including sorting, searching, and graph problems using algorithmic techniques learned in the course.
Course ID: CSC 301
| Credit hours | Theory | Practical | Laboratory | Lecture | Studio | Contact hours | Pre-requisite | 3 | 3 | 3 | CSC 231 |
|---|
