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

Welcome to Scribd!

  • 26 views

    B.Tech. Degree Examination Cse/It: (Oct-18) (EID-305)

    Uploaded by

    Vamshidhar Reddy
    1. The document is a past exam paper for the 5th semester B.Tech. Degree Examination in Computer Science/IT. 2. It contains 5 modules each with 1 or 2 questions related to algorithms and their analysis. Topics include matrix multiplication, sorting, dynamic programming, graph algorithms, approximation algorithms and more. 3. Students must answer 1 question from each module for a total of 5 questions to be answered out of the 10 questions provided.

    Copyright:

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

    B.Tech. Degree Examination Cse/It: (Oct-18) (EID-305)

    Uploaded by

    Vamshidhar Reddy
    26 views2 pages
    1. The document is a past exam paper for the 5th semester B.Tech. Degree Examination in Computer Science/IT. 2. It contains 5 modules each with 1 or 2 questions related to algorithms and their analysis. Topics include matrix multiplication, sorting, dynamic programming, graph algorithms, approximation algorithms and more. 3. Students must answer 1 question from each module for a total of 5 questions to be answered out of the 10 questions provided.

    Original Description:

    Original Title

    5488EID-305

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document is a past exam paper for the 5th semester B.Tech. Degree Examination in Computer Science/IT. 2. It contains 5 modules each with 1 or 2 questions related to algorithms and their analysis. Topics include matrix multiplication, sorting, dynamic programming, graph algorithms, approximation algorithms and more. 3. Students must answer 1 question from each module for a total of 5 questions to be answered out of the 10 questions provided.

    Copyright:

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

    B.Tech. Degree Examination Cse/It: (Oct-18) (EID-305)

    Uploaded by

    Vamshidhar Reddy
    1. The document is a past exam paper for the 5th semester B.Tech. Degree Examination in Computer Science/IT. 2. It contains 5 modules each with 1 or 2 questions related to algorithms and their analysis. Topics include matrix multiplication, sorting, dynamic programming, graph algorithms, approximation algorithms and more. 3. Students must answer 1 question from each module for a total of 5 questions to be answered out of the 10 questions provided.

    Copyright:

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

    [Oct-18]

    [EID-305]
    B.Tech. Degree Examination
    CSE/IT
    V SEMESTER
    DESIGN AND ANALYSIS OF ALGORITHMS
    (Effective from the admitted batch 2015–16)
    Time: 3 Hours Max.Marks: 60
    --------------------------------------------------------------------------------------- -------------
    Instructions: Each module carries 12 marks.
    Answer all modules choosing one question from each module.
    All parts of the module must be answered in one place only.
    Figures in the right hand margin indicate marks allotted.
    ---------------------------------------------------------------------------------------------------
    MODULE-I
    1. a) Explain Strassen’s matrix multiplication 6
    b) Write an algorithm for merge sort. Sort 52, 61, 77, 23, 32, 44, 32
    by using above sorting method 6
    OR
    2. a) Write down the algorithms for QUICK-SORT and PARTITION
    procedure. Specify the best case and worst case time complexity
    of quick sort 6
    b) Design a divide and conquer algorithm for finding the minimum
    and the maximum elements of ‘n’ numbers using not more than
    3n/2 comparisons 6
    MODULE-II
    3. a) Write a short note on “knapsack Problem” 6
    b) Solve the following job sequencing with dead lines when n = 6,
    (P1 , P2 , P3 , …., P6) = ( 5, 8, 18, 16, 1, 9) and (d1 , d2 , d3 ,…. ,
    d6) = ( 1, 3 , 4 , 3, 2, 1) 6
    OR
    4. a) How the Greedy paradigm of Algorithm differs from that of
    Dynamic Programming ? What is Single source shortest path
    problem? Suggest the Greedy algorithm to find the shortest path
    from the designated vertex start to all the other vertices in a
    connected weighted, n vertex graph 8
    b) What is spanning tree? Explain 4
    MODULE-III
    5. a) What is dynamic programming? How it can be applied for
    travelling salesman problem ? Explain 7
    b) What is multistage graph? Explain the role of multi stage graph
    in dynamic programming 5
    OR

    6. a) Explain the multistage graph problem with a suitable example 6


    b) What is approximation ratio? Approximate the travelling sales
    man problem with triangle inequality 6
    MODULE-IV
    7. a) Write down the algorithm for Depth First Search. Specify the
    running time of the algorithm with a suitable example 6
    b) What is binary tree? Write an algorithm to calculate the number
    of leaf nodes in a binary tree 6
    OR
    8. a) A graph can be represented using adjacency matrix and adjacency
    list in memory. Justify about the time complexity and space
    complexity of DFS algorithm for the above said data structures 6
    b) Explain the Eight Queen problem with a suitable example 6
    MODULE-V
    9. a) Explain the “Travelling Salesman Problem” 6
    b) Explain all about Newtonian interpolation with algorithms 6
    OR
    10. How the branch & bound technique is used to solve Travelling
    salesman problem ? Explain with a suitable example 12

    [3,7/V S/118]

    You might also like