Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Gujarat Technological University

    Uploaded by

    HS Harshil Parmar

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    HS Harshil Parmar
    13 views3 pages

    Original Title

    SUMMER 18

    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
    13 views3 pages

    Gujarat Technological University

    Uploaded by

    HS Harshil Parmar

    Copyright:

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

    http://www.gujaratstudy.

    com
    Seat No.: ________ Enrolment No.___________
    GUJARAT TECHNOLOGICAL UNIVERSITY
    BE - SEMESTER–V (NEW) - EXAMINATION – SUMMER 2018
    Subject Code:2150703 Date:04/05/2018
    Subject Name:Analysis and Design of Algorithms
    Time:02:30 PM to 05:00 PM Total Marks: 70
    Instructions:
    1. Attempt all questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.
    Q.1 (a) Define Algorithm. Discuss key characteristics of algorithm. 03
    (b) Prove or disprove that f(n) = 1 + 2 + 3 + .... + n ∈ Θ(n^2). 04

    (c) Which are the basic steps of counting sort? Write counting sort algorithm. 07
    Derive its time complexity in worst case.

    Q.2 (a) What are the advantages of dynamic programming method over devide-&- 03
    conquer method?

    (b) Solve following recurrence using recursion tree method: T(n) = 3T(n/3) + 04
    n^3.

    (c) Write standard(conventional) algorithm and Strassen's algorithm for matrix 07


    multiplication problem. What is the recurrence for Strassen's algorithm?
    Solve it using master method to derive time complexity of Strassen's
    algorithm.

    OR
    (c) Discuss best case, average case and worst case time complexity of quick sort. 07

    Q.3 (a) Justify with example that shortest path problem satisfies the principle of 03
    optimality.
    (b) Which are the three basic steps of the development of the dynamic 04
    programming algorithm? Mention any two examples of dynamic
    programming that we are using in real life.
    (c) Solve the following making change problem using dynamic programming 07
    method: Amount = Rs. 7 and Denominations: (Rs. 1, Rs. 2 and Rs. 4)

    OR
    Q.3 (a) Justify with example that longest path problem does not satisfy the principle 03
    of optimality.
    (b) Discuss general characteristics of greedy method. Mention any two examples 04
    of greedy method that we are using in real life.

    http://www.gujaratstudy.com
    http://www.gujaratstudy.com
    (c) Solve all pair shortest path problem for the following graph using Floyd's 07
    algorithm.

    Q.4 (a) What are the disadvantages of greedy method over dynamic programming 03
    method?

    (b) What is DFS? Explain with example. Show the ordering of vertices produced 04
    by Topological-sort for the following graph.

    (c) Solve the following Knapsack Problem using greedy method. Number of 07
    items = 5, knapsack capacity W = 100, weight vector = {50, 40, 30, 20, 10}
    and profit vector = {1, 2, 3, 4, 5}.

    OR
    Q.4 (a) Write an algorithm for Huffman code. 03
    (b) What is an approximation algorithm? Explain performance ratio for 04
    approximation algorithm.
    (c) Explain use of branch and bound technique for solving assignment problem. 07

    Q.5 (a) Write Naive string-matching algorithm. Explain notations used in the 03
    algorithm.

    (b) Explain polynomial-time reduction algorithm. 04


    (c) Working modulo q = 11. How many spurious hits does the Rabin-Karp 07
    matcher encounter in the text T = 3141592653589793 when looking for the
    pattern P =26?

    http://www.gujaratstudy.com
    http://www.gujaratstudy.com

    OR

    Q.5 (a) Which are the three major concepts used to show that a problem is an NP- 03
    Complete problem?
    (b) Explain breadth first search with example. 04
    (c) Find minimum spanning tree for the following undirected weighted graph 07
    using Kruskal’s algorithm.

    *************

    http://www.gujaratstudy.com

    You might also like