Scribd Logo
Upload

Welcome to Scribd!

  • ADA Tutorial Index 23-24

    Uploaded by

    Khushali Suthar
    2 views2 pages
    This document outlines 25 tutorials on algorithms and data structures. The tutorials cover sorting algorithms like selection sort, insertion sort, merge sort, and quick sort, as well as graph algorithms, string matching, recurrence relations, and complexity classes. Students will learn algorithms for shortest paths, minimum spanning trees, longest common subsequences, and NP-complete problems. They will analyze time complexity and order of growth for each algorithm.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines 25 tutorials on algorithms and data structures. The tutorials cover sorting algorithms like selection sort, insertion sort, merge sort, and quick sort, as well as graph algorithms, string matching, recurrence relations, and complexity classes. Students will learn algorithms for shortest paths, minimum spanning trees, longest common subsequences, and NP-complete problems. They will analyze time complexity and order of growth for each algorithm.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views2 pages

    ADA Tutorial Index 23-24

    Uploaded by

    Khushali Suthar
    This document outlines 25 tutorials on algorithms and data structures. The tutorials cover sorting algorithms like selection sort, insertion sort, merge sort, and quick sort, as well as graph algorithms, string matching, recurrence relations, and complexity classes. Students will learn algorithms for shortest paths, minimum spanning trees, longest common subsequences, and NP-complete problems. They will analyze time complexity and order of growth for each algorithm.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Tutorial Index

    No Aim of practical Date Teacher’s


    Sign

    1 Write and explain the working of the Selection Sort algorithm.


    Derive the order of growth.

    2 Write and explain the working of the Selection Sort algorithm.


    Derive the order of growth.

    3 Write and explain the working of the Insertion Sort algorithm.


    Derive the order of growth.

    4 Write and explain the working of the Merge Sort algorithm. Derive
    the order of growth.

    5 Write and explain the working of the Quick Sort algorithm. Derive
    the order of growth.

    6 Write and explain the working of the Heap Sort algorithm. Derive
    the order of growth.

    7 Write and explain the working of the Counting Sort, Bucket Sort
    and Radix Sort algorithm. Prove that the order of growth is O(n) in
    these sorting algorithms.

    8 Write and explain the Masters theorem for solving recurrences.

    9 Explain with examples the recurrence tree method of solving


    recurrences.

    10 Explain with examples the substitution method of solving


    recurrences.

    11 Explain amortised analysis.

    12 Write the algorithm for Longest Common Subsequence and explain


    its working.

    13 Write the algorithm for Chain Matrix Multiplication and explain its
    working.

    14 Write the Dijkstra’s algorithm for Shortest Paths in a graph and


    explain its working.
    15 Write the Bellman Ford algorithm for shortest paths and explain its
    working.

    16 Write the Floyd Warshall algorithm for shortest paths and explain
    its working.

    17 Derive the order of growth of Kruskal's algorithm for minimum


    spanning tree.

    18 Derive the order of growth of Prim’s algorithm for minimum


    spanning tree.

    19 Write the Rabin Karp String matching algorithm and explain its
    working.

    20 Explain the process of string matching with finite automata.

    21 Write the KMP algorithm for string matching and explain its
    working.

    22 List down NP Complete problems and NP Hard problems.

    23 Write a note on Polynomial reduction.

    24 Show the relationship among P, NP and NP Complete and NP


    Hard problems.

    25 Categorize the Travelling Salesman problem and Hamiltonian


    problem according to hardness.

    You might also like