Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    DAA Mid-1 Imp Q - A

    Uploaded by

    mr. potter
    This document contains questions and answers about algorithms and data structures. It asks about the differences between algorithms and pseudocode, definitions of time and space complexity, asymptotic notations with examples, solving a recurrence relation using the Master's Theorem, writing and using the merge sort algorithm to sort sample elements, writing union and find algorithms with examples, finding all pair shortest paths in a graph using dynamic programming, solving the knapsack problem using dynamic programming, and stating the time complexity of Strassen's matrix multiplication algorithm. The document encourages the reader to solve additional problems.

    Copyright:

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

    You might also like

    DAA Mid-1 Imp Q - A

    Uploaded by

    mr. potter
    14 views22 pages
    This document contains questions and answers about algorithms and data structures. It asks about the differences between algorithms and pseudocode, definitions of time and space complexity, asymptotic notations with examples, solving a recurrence relation using the Master's Theorem, writing and using the merge sort algorithm to sort sample elements, writing union and find algorithms with examples, finding all pair shortest paths in a graph using dynamic programming, solving the knapsack problem using dynamic programming, and stating the time complexity of Strassen's matrix multiplication algorithm. The document encourages the reader to solve additional problems.

    Original Description:

    design analysis of algorithm

    Original Title

    DAA Mid-1 Imp Q_A

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains questions and answers about algorithms and data structures. It asks about the differences between algorithms and pseudocode, definitions of time and space complexity, asymptotic notations with examples, solving a recurrence relation using the Master's Theorem, writing and using the merge sort algorithm to sort sample elements, writing union and find algorithms with examples, finding all pair shortest paths in a graph using dynamic programming, solving the knapsack problem using dynamic programming, and stating the time complexity of Strassen's matrix multiplication algorithm. The document encourages the reader to solve additional problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    14 views22 pages

    DAA Mid-1 Imp Q - A

    Uploaded by

    mr. potter
    This document contains questions and answers about algorithms and data structures. It asks about the differences between algorithms and pseudocode, definitions of time and space complexity, asymptotic notations with examples, solving a recurrence relation using the Master's Theorem, writing and using the merge sort algorithm to sort sample elements, writing union and find algorithms with examples, finding all pair shortest paths in a graph using dynamic programming, solving the knapsack problem using dynamic programming, and stating the time complexity of Strassen's matrix multiplication algorithm. The document encourages the reader to solve additional problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 22

    DAA Mid-1 Important Q & A

    1) a) Difference between Algorithm and Psudeocode


    Ans:-
    1) b) Define Time and Space complexities.
    Ans:-
    2) Explain Asymptotic Notations with Examples
    Ans:-
    3) Solve following Recurrence Relation using Master’s Theorem
    T(n) = 4T(n/4) + T(n)
    Ans:-
    There is no exact answer but a similar answer is

    4) Write the Merge Sort algorithm and Sort the elements


    62,71,72,80,82,60,52,51,42
    Ans:-
    5) Write Union & Find Algorithms with examples.
    Ans:-
    6) Find All Pair Shortest Path Problem of Graph ‘G’ using Dynamic
    Programming

    Ans:-
    7) Knapsack Problem using Dynamic Programming
    Ans:-
    8) Strassen’s Matrix Multiplication Time Complexity
    Ans:-
    All the best
    Now do the
    Rest…

    You might also like