Complexity of problems and algorithms

Course materials, tutorials, exercises, and assessment questions focused on the analysis of algorithmic complexity and problem complexity.

Lectures

Complexity of Algorithms and Problems — P, NP, and NP-Completeness

Course Materials · 41 pages · 2026. Fundamental Concepts, Complexity Analysis, Recurrence Relations, Problem Classes, and Satisfiability.

Assignment 1 — Complexity

Graph algorithms, Kruskal, Prim, Dijkstra, Bellman-Ford, 2-SAT, Hamiltonian paths and cycles.

SAT Application — Computer Network Security

Boolean Modeling of Firewall, VPN, and IDS Mechanisms · Exercise and Answers.

SAT Application — Server Room Access Control

Badge Restrictions, Biometrics, and Administrator Permissions · Exercise and Answers.

Grade-Level Assignment — 2022–2023

Big-O notation, problem complexity, and graph algorithm analysis.

Grade-Level Assignment — 2023–2024

Complexity classes, SAT, insertion sort, and the eight queens problem.