Description
YC course syllabus / YU only
Abstract
COM 2545 - Algorithms
Sorts (insertion sort, merge sort, heap sort and quicksort); growth of functions and recurrences; hash tables; binary search trees and red-black trees; Huffman codes; graph algorithms including minimum spanning trees and shortest path problems; cryptography, string matching and computational geometry. (lecture: 3 hours; lab: 2 hours). Prerequisites: COM 1320, COM 1504, MAT 1412
3.000 TO 4.000 Credit hours
Citation
Leff, A. (2022, Fall). COM2545: Algorithms. Yeshiva College, Yeshiva University.
*This is constructed from limited available data and may be imprecise.
