EFFICIENT ALGORITHMS in Spring 2025 (CS3046)

Develops skill in devising combinatorial algorithms and in analyzing their behavior. Starts with a brief introduction on formal systems, automata and Turing machines and continues with a study of algorithms for sorting, searching, string processing, geometry, graphs, numeric, and algebraic applications.

Term: 
Spring 2025
Discipline: 
CS (Computer Science)
Credits: 
4 credits
Type: 
Regular
Level: 
Undergraduate
Can be taken twice for credit?: 
No
Exam Date: 
Monday, May 5, 2025 - 09:00
Pre-requisites: 
CS2071 AND (MA2400 OR MA2400CCD)
Co-requisites: 
None

Professor(s)