https://github.com/samya-s/design-and-analysis-of-algorithms-lab

Design and Analysis of Algorithms Lab (MA39203)
https://github.com/samya-s/design-and-analysis-of-algorithms-lab

algorithm-design algorithms algorithms-and-data-structures cpp design-and-analysis-of-algorithms design-and-analysis-of-algorithms-lab

Last synced: about 2 months ago
JSON representation

Design and Analysis of Algorithms Lab (MA39203)

• Host: GitHub
• URL: https://github.com/samya-s/design-and-analysis-of-algorithms-lab
• Owner: Samya-S
• License: mit
• Created: 2024-07-24T12:47:35.000Z (10 months ago)
• Default Branch: main
• Last Pushed: 2024-10-21T04:55:13.000Z (7 months ago)
• Last Synced: 2024-10-21T07:47:47.777Z (7 months ago)
• Topics: algorithm-design, algorithms, algorithms-and-data-structures, cpp, design-and-analysis-of-algorithms, design-and-analysis-of-algorithms-lab
• Language: C++
• Homepage:
• Size: 1.64 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Design and Analysis of Algorithms Lab (MA39203)

**L-T-P:** 0-0-3   |   **Credits:** 2  

## Syllabus

1. **Arrays** _[6 Lectures]_

   - Implementation of array operations

   - Stacks and Queues, Circular Queues: Adding and deleting elements  

2. **Merging Problem** _[4 Lectures]_

   - Evaluation of expressions

   - Operations on multiple stacks and queues  

3. **Linked Lists** _[8 Lectures]_

   - Implementation of linked lists

   - Inserting, deleting, and inverting a linked list

   - Implementation of stacks and queues using linked lists

   - Polynomial addition and multiplication

   - Sparse matrix multiplication and addition  

4. **Trees** _[6 Lectures]_

   - Recursive and non-recursive traversal of trees

   - AVL tree implementation  

5. **Hashing** _[6 Lectures]_

   - Hash table implementation

   - Searching, inserting, and deleting  

6. **Heaps**

7. **Graphs** _[6 Lectures]_

   - Shortest path algorithms

   - Minimum cost spanning tree

   - Graph/Tree traversals

   - All-pair shortest paths  

8. **Sorting** _[4 Lectures]_

   - Quick sort

   - Insertion sort

   - Merge sort  

## References

1. T. A. Standish: *Data Structures, Algorithms and Software Principles*, Addison-Wesley, Reading, Mass., 1995.

2. L. Nyhoff: *C++ - An Introduction to Data Structures*, Prentice Hall, Englewood Cliffs, 1998.

3. A. M. Tannenbaum and M. J. Augesestein: *Data Structures Using PASCAL*, Prentice Hall, New Jersey, 1981.

4. D. E. Knuth: *The Art of Computer Programming*, Vol. 1, 2nd ed. Narosa/Addison-Wesley, New Delhi/London, 1973.

5. T. A. Standish: *Data Structure Techniques*, Addison-Wesley, Reading, Mass., 1980.

6. E. Horowitz and S. Sahni: *Fundamentals of Data Structures*, CBS, New Delhi, 1977.

7. R. L. Kruse: *Data Structures and Program Design in C*, Prentice Hall of India, New Delhi, 1996.

8. A. Aho, J. Hopcroft, and J. Ullman: *Data Structures and Algorithms*, Addison-Wesley, Reading, Mass., 1983.

9. B. Salzberg: *File Structures: An Analytical Approach*, Prentice Hall, New Jersey, 1988.

10. T. Harbron: *File System Structure and Algorithms*, Prentice Hall, New Jersey, 1987.

## How to Use this Repository

1. Clone this repository:  

   ```bash

   git clone https://github.com/Samya-S/Design-and-Analysis-of-Algorithms-Lab.git

   ```

2. Navigate to the appropriate lab assignment folder:  

   ```bash

   cd foldername

   ```

3. Compile and run the C++ programs:  

   ```bash

   g++ filename.cpp -o outputfile

   ./outputfile

   ```

## License

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.