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.
Code
CS3046
Name
EFFICIENT ALGORITHMS
Credits
4
Pre-requisites
CS2071 AND MA2400
Co-requisites
None
Can be taken twice for credit?
No
Discipline
CS (Computer Science)
Level
Undergraduate
Type
Regular
CAMS ID
2692
Last update with CAMS
Have a basic understanding of theory of computation.
Have an understanding of the design of algorithms.
Have been exposed to a wealth of computer science algorithms.
| Term | Code | Name |
|---|---|---|
| Spring 2021 | CS3046 | EFFICIENT ALGORITHMS |