COM2545: Algorithms

dc.contributor.author	Leff, Avraham
dc.date.accessioned	2022-05-18T15:30:37Z
dc.date.available	2022-05-18T15:30:37Z
dc.date.issued	2022-08
dc.identifier.citation	Leff, A. (2022, Fall). COM2545: Algorithms. Yeshiva College, Yeshiva University.	en_US
dc.identifier.uri	https://hdl.handle.net/20.500.12202/8191
dc.description	YC course syllabus / YU only	en_US
dc.description.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	en_US
dc.language.iso	en_US	en_US
dc.publisher	Yeshiva College, Yeshiva University	en_US
dc.relation.ispartofseries	Yeshiva College Course Syllabi Fall 2022;COM2545
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	algorithms	en_US
dc.subject	computer science	en_US
dc.title	COM2545: Algorithms	en_US
dc.type	Learning Object	en_US

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