Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    FInal DAA QB 1-3

    Uploaded by

    sri santosh angadi
    This document contains 10 questions from Unit 1 of the Design and Analysis of Algorithms (DAA) subject for the 3rd year B.Tech IT semester 1 exam. The questions cover topics like algorithm characteristics, notations, time/space complexity, sorting algorithms like merge sort and quick sort, searching algorithms like binary search, and greedy algorithms. Students are asked to write pseudo code, explain concepts in 2-3 sentences, and solve simple examples related to these algorithm design and analysis topics.

    Copyright:

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

    FInal DAA QB 1-3

    Uploaded by

    sri santosh angadi
    24 views6 pages
    This document contains 10 questions from Unit 1 of the Design and Analysis of Algorithms (DAA) subject for the 3rd year B.Tech IT semester 1 exam. The questions cover topics like algorithm characteristics, notations, time/space complexity, sorting algorithms like merge sort and quick sort, searching algorithms like binary search, and greedy algorithms. Students are asked to write pseudo code, explain concepts in 2-3 sentences, and solve simple examples related to these algorithm design and analysis topics.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 10 questions from Unit 1 of the Design and Analysis of Algorithms (DAA) subject for the 3rd year B.Tech IT semester 1 exam. The questions cover topics like algorithm characteristics, notations, time/space complexity, sorting algorithms like merge sort and quick sort, searching algorithms like binary search, and greedy algorithms. Students are asked to write pseudo code, explain concepts in 2-3 sentences, and solve simple examples related to these algorithm design and analysis topics.

    Copyright:

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

    FInal DAA QB 1-3

    Uploaded by

    sri santosh angadi
    This document contains 10 questions from Unit 1 of the Design and Analysis of Algorithms (DAA) subject for the 3rd year B.Tech IT semester 1 exam. The questions cover topics like algorithm characteristics, notations, time/space complexity, sorting algorithms like merge sort and quick sort, searching algorithms like binary search, and greedy algorithms. Students are asked to write pseudo code, explain concepts in 2-3 sentences, and solve simple examples related to these algorithm design and analysis topics.

    Copyright:

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

    ANDHRA LOYOLA INSTITUTE OF ENGINEERING AND TECHNOLOGY

    VIJAYAWADA-8
    ACADEMIC YEAR: 2021-2022
    YEAR: III B.TECH Branch: IT
    SEMESTER: I
    SUBJECT NAME: Design and Analysis of Algorithms (DAA)

    Cognitive levels
    L1– Remember, L2-Understanding, L3- Applying /Analyzing
    Question – Bank

    Unit-I
    Q.No Question Marks Cognitive level
    Define Algorithm and Explain the Characteristics of
    1. Algorithm? 10M L1

    Explain different types of decision making methods


    2 with applications? 10M L2

    Explain Notations (Big oh, Omega, Theta, Little Oh)


    10M
    with example? L2
    3

    Define Notations? If the function F (n)


    =9n^3+7n^2+2n+1, evaluate the Notations for this 10M L3
    4 function?

    Define Space Complexity and Time Complexity of an


    Algorithm with one Example? 10M
    5
    L2

    Write a Pseudo code for sum of n numbers?


    6 10M L3
    Define Notations? If the function F(n)= 8n^2+7n+1,
    evaluate the Worst Case, Best Case, Average Case
    7. and Worst in worst case for the above function? 10M L3

    Define Amortized Analysis and explain the different


    types of Amortized Analysis?
    8. 10M L2

    Write a Pseudo code for factorial of n numbers and


    find out the time complexity of Matrix
    9. multiplication? 10M L3

    Write a Pseudo code for maximum of three


    numbers?
    10. 10M L3

    Unit-II
    Q.No Question Marks Cognitive level
    Write and explain Binary Search Algorithm with an
    example given below Elements are:

    1. -15,-6,0,7,9,23,54,82,101,112,125,131,142,151 10M L3
    and the search element is 125

    Write and explain Quick Sort Algorithm with an


    example given below. The elements are :
    2 1,1,1,1,1,1,1,5,5,8,3,4,3,2 10M L3
    Write and explain Merge Sort algorithm with the
    example. The elements are 10M
    L3
    3 100,300,150,450,250,350,200,400,500

    Write and explain Find Maximum and Minimum


    10M L3
    algorithm with the example. The elements are
    4
    22, 13,-5, -8, 15, 60,17,31,47

    n=7,max.weight=15, p1=10, p2=5, p3=15,

    p4=7, p5=6, p6=18, p7=3 w1=2, w2=3, w3=5,

    w4=7, w5=1, w6=4, w7=1 10M


    5
    L3
    To find out the optimal solution using Knapsack
    problem in Greedy method?

    6 10M L3

    Write algorithm and explain above graph using


    single source shortest path problem?
    Explain Optimal merge pattern algorithm? And
    Given a set of unsorted files: 5, 3, 2, 7, 9, 13 Now,
    arrange these elements in ascending order using
    7. Optimal Merge Patterns? 10M L3
    Write Prim’s Algorithm with an example?
    8. 10M L2

    Write Kruskal’s Algorithm with an example?


    9. 10M L2

    Write the general Method Algorithm for Divide and


    Conquer Method and Greedy Method with
    10. applications? 10M L2

    Unit -III
    Q.No Question Marks Cognitive level
    n=7,max.weight=15, p1=10, p2=5, p3=15,

    p4=7, p5=6, p6=18, p7=3 w1=2, w2=3, w3=5,

    w4=7, w5=1, w6=4, w7=1


    1. 10M L3
    To find out the optimal solution using Knapsack
    problem in Dynamic programming?

    Explain Knapsack problem using dynamic


    2 10M L2
    programming
    N=6 m=165

    (P1,p2,p3,p4,p5,p6)=(w1,w2,w3,w4,w5,w6)={100,5
    0,20,10,7,3} 10M
    L3
    3
    To find out the optimal solution using Knapsack
    problem in Dynamic programming?
    T (1) =1,
    T (n) =2T (n/2) + n
    10M L2
    4 Prove that t(n)= O (n log n)
    Write a general method algorithm for greedy
    method?

    T (1) =1,

    T (n) = T (n/2) +1 prove


    10M
    5 that T (n) = (log n) L2
    Write a general method algorithm for Dynamic
    programming method?

    6 Solve minimum distances or all pairs shortest path


    problem using dynamic progamming

    7 Find the shortest path by using multi-stage graph

    8 Consider the following elements with frequencies and


    construct optimal binary search tree.
    10 20 30 40
    4 2 6 3
    9 Find the shortest path using travelling sales man
    problem

    You might also like