CRS Acad Level: UG
Course #: CPTR 3850
Credits: 3
About the Course:
This course introduces algorithmic design and analysis of algorithms, exposes students to variety of important computer science problems including sorting, searching, shortest-path, pattern-matching, interval scheduling, Traveling Salesman Problem and compare available algorithms for these problems; introduces computational complexity theory and P vs. NP problems. Prerequisite: CPTR2300.
