Show simple item record

dc.contributor.authorLeff, Avraham
dc.identifier.citationLeff, A. (2022, Fall). COM2545: Algorithms. Yeshiva College, Yeshiva University.en_US
dc.descriptionYC course syllabus / YU onlyen_US
dc.description.abstractCOM 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 hoursen_US
dc.publisherYeshiva College, Yeshiva Universityen_US
dc.relation.ispartofseriesYeshiva College Course Syllabi Fall 2022;COM2545
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.subjectcomputer scienceen_US
dc.titleCOM2545: Algorithmsen_US
dc.typeLearning Objecten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States