CMPS 345 - Analysis of Algorithms

Institution:

Ramapo College of New Jersey

Subject:

Description:

This course provides a comprehensive introduction to computer algorithms. The emphasis is on the design of efficient algorithms and data structures, proofs of their correctness, and analysis of their complexity. A number of algorithmic concepts and techniques are covered, including recursion, incremental design, divide-and-conquer, greedy algorithms, amortized analysis, and dynamic programming. The algorithms studied include sorting, searching, breadth-first search, depth-first search, minimum spanning trees, shortest paths, network flow, and string matching. Data structures studied include hash tables, heaps, binary search trees, and red-black trees. This course is meant as a follow-up to a course in data structures. Knowledge of elementary data structures such as stacks, queues, and linked lists are assumed. In addition, a module will be given on algorithms relevant to bioinformatics, which studies molecular sequence data (DNA, RNA, and protein). Much of the material learned in this course, such as graphs, trees, dynamic programming, and search algorithms apply to this new discipline. 0.000 TO 4.000 Credit Hours 0.000 TO 4.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Theoretical & Applied Science College Computer Science Department

Credits:

0.00 - 4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.ramapo.edu

Phone Number:

(201) 684-7500 ext 7500

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.