Foundations of Algorithms and Complexity [Hebrew]
Undergraduate course, Ben-Gurion University of the Negev, Department of Industrial Engineering and Management, 2022
Course overview
This introductory course in algorithms and computational complexity covers sorting algorithms, data structures for efficient search, and fundamental graph algorithms. The final part of the course is devoted to the P vs NP question - one of the most profound open problems in computer science.
Students learn to design algorithms using generic paradigms for combinatorial problems and to analyze their time complexity formally.
Course materials
You can download the exercise handout here:
📄 Download Foundations of Algorithms and Complexity (PDF)
Exercise Slides
Below are the exercise slide decks used throughout the semester:
| # | Topic | |
|---|---|---|
| 01 | Big-O Notation | EX01P.pdf |
| 02 | Count Sort | EX02P.pdf |
| 03 | Merge Sort | EX03P.pdf |
| 04 | Binary Search Trees | EX04P.pdf |
| 05 | Binary Heaps | EX05P.pdf |
| 06 | Graphs | EX06P.pdf |
| 07 | Minimum Spanning Tree | EX07P.pdf |
| 08 | Shortest Path | EX08P.pdf |
| 09 | Bipartite Matching | EX09P.pdf |
| 10 | Maximum Flow | EX10P.pdf |
| 11 | Reductions | EX11P.pdf |
| 12 | NP-Completeness | EX12P.pdf |
| 13 | Exam Preparation | EX13P.pdf |