Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 49 views

    Design and Analysis of Algorithms Feb 2022

    Uploaded by

    Qwerty
    This document contains a sample exam paper for the Design and Analysis of Algorithms course. It has two parts - Part A contains 6 short answer questions worth a total of 14 marks, and Part B contains 4 longer answer questions worth 56 marks total, with students required to answer any 4 of these questions. The questions cover a range of algorithm and data structures topics, including time complexity analysis, divide and conquer algorithms, dynamic programming, greedy algorithms, graph algorithms, and NP-complete problems.

    Copyright:

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

    Design and Analysis of Algorithms Feb 2022

    Uploaded by

    Qwerty
    49 views2 pages
    This document contains a sample exam paper for the Design and Analysis of Algorithms course. It has two parts - Part A contains 6 short answer questions worth a total of 14 marks, and Part B contains 4 longer answer questions worth 56 marks total, with students required to answer any 4 of these questions. The questions cover a range of algorithm and data structures topics, including time complexity analysis, divide and conquer algorithms, dynamic programming, greedy algorithms, graph algorithms, and NP-complete problems.

    Original Title

    DESIGN AND ANALYSIS OF ALGORITHMS FEB 2022

    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 a sample exam paper for the Design and Analysis of Algorithms course. It has two parts - Part A contains 6 short answer questions worth a total of 14 marks, and Part B contains 4 longer answer questions worth 56 marks total, with students required to answer any 4 of these questions. The questions cover a range of algorithm and data structures topics, including time complexity analysis, divide and conquer algorithms, dynamic programming, greedy algorithms, graph algorithms, and NP-complete problems.

    Copyright:

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

    Design and Analysis of Algorithms Feb 2022

    Uploaded by

    Qwerty
    This document contains a sample exam paper for the Design and Analysis of Algorithms course. It has two parts - Part A contains 6 short answer questions worth a total of 14 marks, and Part B contains 4 longer answer questions worth 56 marks total, with students required to answer any 4 of these questions. The questions cover a range of algorithm and data structures topics, including time complexity analysis, divide and conquer algorithms, dynamic programming, greedy algorithms, graph algorithms, and NP-complete problems.

    Copyright:

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

    Code No: R1632053 R16 SET - 1

    III B. Tech II Semester Supplementary Examinations, February-2022


    DESIGN AND ANALYSIS OF ALGORITHMS
    (Computer Science and Engineering)
    Time: 3 hours Max. Marks: 70
    Note: 1. Question Paper consists of two parts (Part-A and Part-B)
    2. Answer ALL the question in Part-A
    3. Answer any FOUR Questions from Part-B
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
    PART –A (14 Marks)
    1. a) Define the term: Time Complexity. [2M]
    b) Write the abstract Divide and Conquer algorithm. [2M]
    c) State the Job-Sequencing with Deadline Problem. [2M]
    d) State the Purge Rule in 0/1 Knapsack problem using Dynamic Programming. [3M]
    e) Draw the state-space tree along with answer nodes for 4-queens problem. [3M]
    f) Define LC-Search. [2M]
    PART –B (56 Marks)
    2. a) Write different pseudo code conventions used to represent an algorithm. [7M]
    b) What do you mean by performance analysis? Give the algorithm for matrix [7M]
    multiplication and find the time complexity using step–count method.

    3. a) Write a recursive algorithm for binary search and also bring out its efficiency. [7M]
    b) Apply Merge Sort to sort the list 𝑎[1,10] = (31,28,17,65,35,42. ,86,25,45,52). [7M]
    Draw the tree of recursive calls of merge sort functions.

    4. a) Use the greedy algorithm for sequencing unit time jobs with deadlines and [7M]
    profits to generate the solution when 𝑛 = 7,
    (𝑝1, 𝑝2, … 𝑝7) = (3, 5, 20, 18, 1, 6, 30),
    and
    (𝑑1, 𝑑2, … , 𝑑7) = (1, 3, 4, 3, 2, 1, 2).
    b) What is a Spanning tree? Explain Prim’s Minimum cost spanning tree [7M]
    algorithm with suitable example.

    5. a) Explain the methodology of Dynamic programming. Mention the applications [7M]


    of Dynamic programming.
    b) Construct an optimal travelling sales person tour using Dynamic Programming [7M]
    forthe given data:

    1 of 2

    |''|'||||''|'''|||'|
    Code No: R1632053 R16 SET - 1

    6. a) Write control abstraction for backtracking. Explain with an example. [7M]


    b) What are the applications of graph coloring? Explain in detail. [7M]

    7. a) Distinguish between backtracking and branch – and bound techniques. [7M]


    b) Generate FIFO branch and bound solution for the given knapsack problem, [7M]
    m = 15, n = 3, (P1, P2, P3) = (10, 6, 8) and (w1, w2, w3) = (10, 12, 3).
    ******

    2 of 2

    |''|'||||''|'''|||'|

    You might also like