DSA Lab Programs (Semester 3)

This repository contains my college DSA lab programs from Semester 3. Below is the list of programs included in this collection.

---

List of Programs

No.	Description	Code	Output
1	Program to find the highest and lowest element in an array.
2	Program to implement a stack using arrays.
3	Program to implement a queue using arrays.
4	Program to perform binary search on an array.
5	Program to implement a linked list.
6	Program to implement a binary tree.
7	Program to perform quicksort on an array.
8	Program to perform mergesort on an array.
9	Program to implement a graph using adjacency matrix.
10	Program to implement Dijkstra's algorithm.

How to Use

1. Clone the repository:

   git clone https://github.com/UmeshCode1/DSA_LAB_COLLEGE.git

2. Navigate to the directory:

   cd DSA_LAB_COLLEGE

Requirements

• A C++ compiler (e.g., g++, clang++)
• Basic understanding of Data Structures and Algorithms

Contributing

1. Fork the repository.
2. Create a new branch:

   git checkout -b feature-branch

3. Make your changes and commit them:

   git commit -m "Add some feature"

4. Push to the branch:

   git push origin feature-branch

5. Open a pull request.

License

This project is licensed under the MIT License - see the LICENSE file for details.

GitHub Pages

The repository is also published at GitHub Pages. Visit the page to see the programs in action.

Page Address: https://umeshcode1.github.io/DSA_LAB_COLLEGE/

Academic Details

• Academic Year: 2024-25
• Department: CSE-AIML
• Student Name: Umesh Patel
• Enrollment Number: 0126AL231140
• Class: AIML 3rd "B"

Connect with Me

Feel free to reach out if you have any questions or suggestions!

---

"Learning never stops, and neither does coding." 😊

Acknowledgements

Special thanks to my professors and peers for their support and guidance throughout the semester.

Feedback

If you have any feedback, please reach out to me at umesh.code1@gmail.com.