Subject

SUB-0101-02Algorithms and Theory

active

Design and analysis of algorithms, complexity, computability, and theoretical foundations.

Canonical ID: urn:taxonomy:cip-aligned:subject:0101-02

Also known as: Theory of Computation, Algorithms

algorithmscomplexitycomputabilitydata structures

Browse

Courses

Select a course to view its taxonomy record.

CRS-0101-02-001

activeintroductory

Introduces algorithmic thinking, asymptotic analysis, recurrences, sorting, searching, and basic graph algorithms.

CRS-0101-02-002

activeintroductory

Covers algorithm design paradigms including divide-and-conquer, greedy, dynamic programming, and network flow.

CRS-0101-02-003

activeintermediate

Examines NP-completeness, approximation algorithms, randomized algorithms, and complexity classes.

CRS-0101-02-004

activeintermediate

Applies algorithmic techniques to domains such as bioinformatics, networking, scheduling, and data mining.

CRS-0101-02-005

activeadvanced

Advanced study of computability, automata, complexity, and contemporary algorithmic research topics.