💻 DAA Lab Programs – 4th Sem BCA (24BCA42P)

Welcome to the official repository for Design and Analysis of Algorithms Lab Programs designed specifically for 4th Semester BCA students.

This collection includes important algorithm implementations such as searching, sorting, graph algorithms, dynamic programming, and backtracking techniques. The programs are written in a simple and beginner-friendly way, making them useful for lab exams and understanding core DAA concepts.

📁 Contents 🔸 Searching/ – Linear Search, Binary Search 🔸 Sorting/ – Selection Sort, Quick Sort 🔸 Divide_and_Conquer/ – Min & Max problem 🔸 Graph_Algorithms/ – BFS, Prim’s, Kruskal’s, Floyd’s, Warshall’s 🔸 Dynamic_Programming/ – Optimal Binary Search Tree 🔸 Backtracking/ – 4-Queens, Subset Sum 🔸 String_Matching/ – Boyer-Moore Algorithm 🔸 Classic_Problems/ – Tower of Hanoi

🧑‍🎓 Who Should Use This? ✅ 4th Semester BCA students ✅ Students preparing for DAA lab exams ✅ Beginners learning algorithms ✅ Anyone interested in problem-solving techniques

🛠 Requirements You may need the following to run the programs: Python 3.x 🐍 Any code editor (VS Code, PyCharm, Notepad++, etc.) Basic knowledge of programming

🚀 How to Use Clone the repository or download it as a ZIP file Open the folder in your code editor Run any program using: python filename.py For programs with graphs, ensure required libraries (like matplotlib) are installed

📝 Contributing Have improvements or extra programs to share? Feel free to fork the repo and submit a pull request. Educational contributions are always welcome.

📧 Contact For questions or suggestions, contact: Manoj P (Assistant Professor) BCA Department/ Maintainer 📧 Email: 15manojp08@gmail.com 📱 Mobile No: 9663000319

📚 License This project is open-source and free to use for educational purposes.

📌 List of Programs 24BCA42P : Design and Analysis of Algorithms Lab

1.Write a program to implement Linear Search Algorithm and plot time vs n.

2.Write a program to implement Binary Search Algorithm and plot time vs n.

3.Write a program to solve Tower of Hanoi for different number of disks.

4.Write a program to perform Selection Sort and analyze time complexity.

5.Write a program to find Minimum and Maximum using Divide & Conquer.

6.Write a program to perform Quick Sort and analyze time complexity.

7.Write a program for Optimal Binary Search Tree (Dynamic Programming).

8.Write a program to implement Floyd’s Algorithm (All-pairs shortest path).

9.Write a program for Boyer-Moore String Matching Algorithm.

10.Write a program to implement Breadth First Search (BFS).

11.Write a program for Prim’s Algorithm (Minimum Spanning Tree).

12.Write a program for Kruskal’s Algorithm (Minimum Spanning Tree).

13.Write a program for Topological Sorting and Warshall’s Algorithm.

14.Write a program to solve 4-Queens Problem (Backtracking).

15.Write a program to solve Subset Sum Problem.