Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    Adsa Assignment Questions

    Uploaded by

    LOKESWARI G

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Adsa Assignment Questions

    Uploaded by

    LOKESWARI G
    34 views4 pages

    Original Title

    ADSA ASSIGNMENT QUESTIONS-converted

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    34 views4 pages

    Adsa Assignment Questions

    Uploaded by

    LOKESWARI G

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    GATES INSTITUTE OF TECHNOLOGY.

    ADSA ASSIGNMENT QUESTIONS

    Uint - 1

    ASSIGNMENT-1

    2 MARKS QUESTIONS

    1)What is an algorithm?

    2)What is meant by Asymptotic notation?

    3)Show that 5𝑛𝑛2 − 6𝑛𝑛 = Θ(𝑛𝑛2) are correct.

    10 MARKS QUESTIONS

    1. Explain in detailed about Asymptotic Notation?

    2. Explain about Analyzing Recursive Programs?

    ASSIGNMENT-2

    2 MARKS QUESTIONS

    1)Write an algorithm using recursive function to find sum of n numbers.

    2)Define space complexity

    3)Define time complexity

    10 MARKS QUESTIONS

    2. Explain about Analyzing Recursive Programs?

    3. Explain the performance analysis of the algorithm?

    Uint - 2

    ASSIGNMENT-1

    2 MARKS QUESTIONS

    1)Define AVL trees

    ADSA 1
    GATES INSTITUTE OF TECHNOLOGY.

    2)What are the applications of AVL trees

    3)Define binary search tree

    10 MARKS QUESTIONS

    1. Explain in detail about AVL Trees?

    2. Explain in detail about B-Trees?

    ASSIGNMENT-2

    2 MARKS QUESTIONS

    4)List out the operations of binary search tree

    5)Define the B trees

    6)Differentiate binary search tree and AVL tree

    10 MARKS QUESTIONS

    1. Explain in detail about AVL Trees?

    3. Explain the Applications of AVL Trees?

    Uint - 3

    ASSIGNMENT-1

    2 MARKS QUESTIONS

    1)Define red-black trees

    2)List out applications of splay trees

    3)Define hash functions

    10 MARKS QUESTIONS

    1. Explain in detail about Red-Black Trees?

    2. Explain in detail about Hash Structure?

    ASSIGNMENT-2

    2 MARKS QUESTIONS

    4)Write about linear open addressing?

    5)What are the applications of hash functions?

    ADSA 2
    GATES INSTITUTE OF TECHNOLOGY.

    6)Write about hash structure

    10 MARKS QUESTIONS

    1. Explain in detail about Red-Black Trees?

    3. Explain in detail about Hashing?

    Uint - 4

    ASSIGNMENT-1

    2 MARKS QUESTIONS

    1)Write the control abstraction for divide-and conquer

    2)Give computing time for binary search.

    3)Define minimum spanning tree.

    10 MARKS QUESTIONS

    1.Explain about Strassen’s matrix multiplication?

    2.Write an algorithm of quick sort and explain with an example?

    ASSIGNMENT-2

    2 MARKS QUESTION

    4)What is the worst case complexity in quick sort, why?

    5)How many spanning trees can be generated from a graph with 4 nodes?

    6)What is knapsack problem?

    10 MARKS QUESTIONS

    4.Explain 0/1 knapsack problem N=3,M=30,

    (p1,p2,p3) = (25,24,15)

    (w1,w2,w3) = (18,15,10)

    5.Explain Single source shortest path problem with an example?

    Uint - 5

    ASSIGNMENT-1

    ADSA 3
    GATES INSTITUTE OF TECHNOLOGY.

    2 MARKS QUESTIONS

    1)Define Hamiltonian graph with an example.

    2)Explain NP complete problems.

    3)Write the general procedure of dynamic programming.

    10 MARKS QUESTIONS

    1.Explain 0/1 knapsack problem by using dynamic programming?

    2.Explain about travelling salesperson problem by using dynamic programming?

    ASSIGNMENT-2

    2 MARKS QUESTIONS

    4)Explain 8-queens problem.

    5)Write some applications of travelling salesperson problem.

    6)An NP problem can be solved in deterministic polynomial time, how?

    10 MARKS QUESTIONS

    4.Explain about sum of subsets problem with an example?

    5.Explain about all pairs shortest path by using dynamic programming?

    ADSA 4

    You might also like