COSC 428 - Design and Analysis of Algorithms

3 Credits

(Spring)
Prerequisite(s): COSC 214. This course will include the design and analysis of algorithms. Algorithms that manipulate data structures such as lists, stacks, queues, trees, and graphs are discussed in terms of efficiency and existence. Algorithms for data compression, memory management, and advanced hashing techniques will be studied. Topics also include balancing algorithms, divide‐and‐conquer algorithms, dynamic programming, the greedy approach, backtracking, branch‐and‐bound, advanced search/sort techniques, the P=NP problem, parallel algorithms, and newly promoted algorithms will be studied and researched.