EFFICIENT ALGORITHMS (CS3046)

Home>Academic Catalog 2024-2025>Course Catalog>

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
Discipline: 
CS (Computer Science)
Type: 
Regular
Level: 
Undergraduate
Credits: 
4
Can be taken twice for credit?: 
No
Pre-requisites: 
CS2071 AND (MA2400 OR MA2400CCD)
Co-requisites: 
None

Learning Outcomes

  1. Have a basic understanding of theory of computation.
  2. Have an understanding of the design of algorithms.
  3. Have been exposed to a wealth of computer science algorithms.

Offering(s)

Term Code Name
Spring 2025 CS3046 EFFICIENT ALGORITHMS

Archived Syllabi