/Design-and-Analysis-of-Algorithms-Lab

Design and Analysis of Algorithms Lab (MA39203)

Primary LanguageC++MIT LicenseMIT

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:

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

  2. Navigate to the appropriate lab assignment folder:

    cd foldername

  3. Compile and run the C++ programs:

    g++ filename.cpp -o outputfile
./outputfile

License

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