🚀 Analysis and Design of Algorithms (ADA)

BMS College of Engineering, Bengaluru

---

👨‍🎓 Student Details

Detail	Information
Name	Priyanshu Sharan
USN	1WA24CS223
Department	Computer Science and Engineering
College	BMS College of Engineering

---

👩‍🏫 Faculty Details

Detail	Information
Faculty Name	Tr. Amrutha Varshini
Course	Design and Analysis of Algorithms (DAA)
College	BMSCE

---

📚 About Repository

This repository contains all the ADA Laboratory Programs implemented in C Programming Language as part of the Analysis and Design of Algorithms Laboratory course at BMS College of Engineering.

The programs are implemented according to the VTU/BMSCE syllabus and include:

• Sorting Algorithms
• Greedy Algorithms
• Dynamic Programming
• Graph Algorithms
• Backtracking Algorithms
• Divide and Conquer Techniques

---

🧠 Algorithms Implemented

🔹 Divide and Conquer

• Merge Sort
• Quick Sort

🔹 Transform and Conquer

• Heap Sort

🔹 Greedy Algorithms

• Prim's Algorithm
• Kruskal's Algorithm
• Dijkstra's Algorithm
• Fractional Knapsack

🔹 Dynamic Programming

• 0/1 Knapsack
• Floyd Warshall Algorithm

🔹 Backtracking

• N-Queens Problem
• Johnson-Trotter Algorithm

🔹 Graph Algorithms

• Topological Sort

---

📂 Program List

Sl No	Program Name	File Name
1	Merge Sort	merge-sort.c
2	Quick Sort	quick-sort.c
3	Heap Sort	heap-sort.c
4	Prim's Algorithm	prims-algorithm.c
5	Kruskal's Algorithm	kruskals-algorithm.c
6	Dijkstra's Algorithm	dijkstra-shortest-path.c
7	Floyd Warshall Algorithm	floyd-warshall-algorithm.c
8	Fractional Knapsack	fractional-knapsack.c
9	0/1 Knapsack using DP	0-1-knapsack-using-dynamic-programming.c
10	Topological Sort	topological-sort-algorithm.c
11	Johnson-Trotter Algorithm	johnson-trotter-algorithm.c
12	N-Queens using Backtracking	n-queens-problem-using-backtracking.c

---

⚙️ How to Run

✅ Compile the Program

gcc filename.c -o output

▶️ Execute the Program

Linux / MacOS

./output

Windows

output.exe

---

🛠️ Technologies Used

• Programming Language: C
• Compiler: GCC
• IDE: Visual Studio Code
• Version Control: Git & GitHub

---

🎯 Repository Objectives

• Learn algorithm design techniques
• Implement algorithms using C
• Understand time and space complexity
• Practice problem solving
• Prepare for lab exams and viva

---

📖 Course Topics Covered

• Asymptotic Analysis
• Divide and Conquer
• Greedy Method
• Dynamic Programming
• Graph Algorithms
• Backtracking
• NP-Completeness

---

⭐ Thank You ⭐

Created by

Priyanshu Sharan

USN: 1WA24CS223

BMS College of Engineering, Bengaluru