COMP 2545C - Algorithms

Institution:

Yeshiva University

Subject:

Computer Science (UW)

Description:

Advanced data structures and algorithms: tables, AVL and red-black trees, B and B+ trees, heaps, disjoint sets. Graph algorithms: minimum spanning trees, shortest path, and maximum flow algorithms. Selected algorithms in parallel computers, string matching, and computational geometry. Lecture: 3 hours; lab: 2 hours. Prerequisites: COMP 1320C, COMP 1504C, MATH 1412.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.yu.edu

Phone Number:

(212) 960-5400

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.