Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.12202/8191| Title: | COM2545: Algorithms |
| Authors: | Leff, Avraham |
| Keywords: | algorithms computer science |
| Issue Date: | Aug-2022 |
| Publisher: | Yeshiva College, Yeshiva University |
| Citation: | Leff, A. (2022, Fall). COM2545: Algorithms. Yeshiva College, Yeshiva University. |
| Series/Report no.: | Yeshiva College Course Syllabi Fall 2022;COM2545 |
| 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 |
| Description: | YC course syllabus / YU only |
| URI: | https://hdl.handle.net/20.500.12202/8191 |
| Appears in Collections: | Yeshiva College Syllabi -- 2021 - 2022 courses (past versions for reference ONLY) -- COMP SCI (Computer Science) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| COM2545 Introduction to Algorithm LEFF Fall 2022R.pdf Restricted Access | 92.38 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
