COM 5100
Advanced Algorithms
Yeshiva University · UGRD · Fall 2026
1 section
Catalog description
Designing efficient algorithms is one of the most important tools computers scientists use to solve difficult problems. This course covers techniques for designing efficient algorithms, as well as advanced topics such as self-adjusting search trees, network flows, linear programming, approximation algorithms, and randomization algorithms. Students apply these tools and techniques to real-world problems, such as airline scheduling, image segmentation, social networking, genomic sequencing, and survey design. Prerequisite(s): COM 5000 and COM 5002 .
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #yeshiva-COM5100Fall 2026UGRD3 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?