Welcome to the CSE221 - Algorithms repository. This repository contains all the lab assignments and the lab final for the course (done in Summer 2023), organized for easy access and reference.
⚙️ All codes are written in Python 3.10 series. Please make sure your environment supports it for full compatibility.
| Lab No. | Topic | File Link |
|---|---|---|
| 1 | File I/O & Sorting basics | Lab 01 |
| 2 | Divide and Conquer Algorithm | Lab 02 |
| 3 | Divide and Conquer & Quick Sort | Lab 03 |
| 4 | Introduction to Graph & Graph Traversal (BFS & DFS) | Lab 04 |
| 5 | Topological Sort & Strongly Connected Components (SCC) – Kahn's & Kosaraju's Algo | Lab 05 |
| 6 | Shortest Path from a Single Source (Dijkstra) | Lab 06 |
| 7 | Greedy Approach & Disjoint Set Union | Lab 07 |
| 8 | Minimum Spanning Tree (MST) & Dynamic Programming | Lab 08 |
| Exam Type | Covered Labs | File Link |
|---|---|---|
| Lab Final | Lab 1-8 | Lab Final |
-
Download the Zip.
-
Navigate to the desired lab folder.
-
Open the files using your preferred IDE or code editor (VS Code, Jupyter, etc.).
-
Run and explore the implementations provided.