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

Welcome to Scribd!

  • 61 views

    Question Paper Code: (10×2 20 Marks)

    Uploaded by

    sathishne
    The document is a question paper for an examination in advanced data structures and algorithms. It contains 3 parts with a total of 16 questions. Part A contains 10 multiple choice questions worth 2 marks each. Part B contains 5 questions worth 13 marks each, with internal choices. Part C contains 1 question worth 15 marks, with internal choices. The questions cover topics such as asymptotic analysis, binary trees, graphs, dynamic programming, greedy algorithms, NP-completeness and other algorithm design and analysis concepts.

    Copyright:

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

    Question Paper Code: (10×2 20 Marks)

    Uploaded by

    sathishne
    61 views3 pages
    The document is a question paper for an examination in advanced data structures and algorithms. It contains 3 parts with a total of 16 questions. Part A contains 10 multiple choice questions worth 2 marks each. Part B contains 5 questions worth 13 marks each, with internal choices. Part C contains 1 question worth 15 marks, with internal choices. The questions cover topics such as asymptotic analysis, binary trees, graphs, dynamic programming, greedy algorithms, NP-completeness and other algorithm design and analysis concepts.

    Original Title

    X85401

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a question paper for an examination in advanced data structures and algorithms. It contains 3 parts with a total of 16 questions. Part A contains 10 multiple choice questions worth 2 marks each. Part B contains 5 questions worth 13 marks each, with internal choices. Part C contains 1 question worth 15 marks, with internal choices. The questions cover topics such as asymptotic analysis, binary trees, graphs, dynamic programming, greedy algorithms, NP-completeness and other algorithm design and analysis concepts.

    Copyright:

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

    Question Paper Code: (10×2 20 Marks)

    Uploaded by

    sathishne
    The document is a question paper for an examination in advanced data structures and algorithms. It contains 3 parts with a total of 16 questions. Part A contains 10 multiple choice questions worth 2 marks each. Part B contains 5 questions worth 13 marks each, with internal choices. Part C contains 1 question worth 15 marks, with internal choices. The questions cover topics such as asymptotic analysis, binary trees, graphs, dynamic programming, greedy algorithms, NP-completeness and other algorithm design and analysis concepts.

    Copyright:

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

    *X85401* Reg. No.

    Question Paper Code : X 85401

    M.E./M.Tech. Degree Examinations, November/December 2020


    First Semester
    Biometrics and Cyber Security
    cp 5151 – advanced data structures and algorithms
    (Common to M.E. Computer Science and Engineering/M.E. Computer Science
    and Engineering (with specialization in Networks)/M.E. Multimedia Technology/
    M.E. software Engineering / M.Tech. information Technology
    / M.E. Big Data Analytics)

    (Regulations 2017)

    Time : Three Hours Maximum : 100 Marks


    Answer all questions

    Part – A (10×2=20 Marks)

    1. Define time complexity and space complexity of an algorithm.

    2. Design an algorithm to test whether the three numbers represent the sides of a
    right angle triangle.

    3. List properties of Red-Black Trees.

    4. How does a key delete from a B-tree ?

    5. What is topological ordering ?

    6. List the approaches to find shortest paths in Directed Acyclic Graphs.

    7. Define principle of optimality.

    8. Write any two characteristics of Greedy algorithm.

    9. When does a problem become non deterministic polynomial ?

    10. Differentiate tractable and intractable problems.


    X 85401 -2- *X85401*

    Part – B (5×13=65 Marks)

    11. a) With suitable example, explain the various asymptotic notation.


    (or)
    b) Describe a recursive algorithm to find the kth smallest element of a set S.
    Write the recurrence equation and perform asymptotic analysis for best case
    and worst case.

    12. a) What is Binary Tree ? Explain Representation of Binary tree. Also explain
    different operation that can be performed on Binary tree.
    (or)
    b) Write a necessary algorithm to insert a node into heap with suitable example.

    13. a) i) Describe various graph representations with examples. (6)


    ii) Write an algorithm to find Topological ordering for the following graph. (7)


    (or)

    b) Explain the Kruskal’s algorithm to solve minimum cost spanning tree problem.

    14. a) Discriminate elements of dynamic programming and Greedy strategy.


    (or)

    b) Explain in detail the Huffman coding algorithm with example.

    15. a) Illustrate P, NP and NP complete problems.


    (or)

    b) Write a note on :
    i) Polynomial-Time verification. (6)
    ii) NP-Completeness Proofs. (7)
    *85401* -3- X 85401

    Part – C (1×15=15 Marks)

    16. a) i) Construct a tree for the given inorder and postorder traversals.
    Inorder : DGBAHEICF
    Postorder : gdbhiefca (5)
    ii) Provide greedy algorithm and find an optimal solution for the following
    fractional Knapsack instance : Number of items (n)=7, maximum capacity
    of knapsack (m)=20, Profits(p1,p2,p3,p4,p5,p6,p7)=(1,2,3,4,9,4,8,10) and
    weights (w1,w2,w3,w4,w5,w6,w7) = (3,4,2,3,2,5,6). (10)
    (or)
    b) i) Using forward approach, solve the following multistage graph problem to
    find the shortest path between S and T. (10)


    ii) Design a polynomial time algorithm for a 2 coloring problem. (5)
    ___________________

    You might also like