![]() | Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course. |
CMPS 323 - Design and Analysis of Algorithms |
---|
Associated Term:
Fall 2023
Learning Objectives: Algorithms are fundamental in Computer Science. At the resolution step of any problem, we always need to design efficient algorithms. In this course, after giving an introduction about algorithm analysis, we analyze algorithms on searching, sorting, and other different problems. A comprehensive study of problem-solving using the greedy method, divide-and-conquer, backtracking, dynamic programming and branch-and-bound techniques will also give some methodology about how to build good algorithms or solutions to several kinds of problems. We finally include an introduction to NP-completeness. Required Materials: Technical Requirements: |
Return to Previous | New Search |
![]() |