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

Welcome to Scribd!

  • 51 views

    Gujarat Technological University: Instructions

    Uploaded by

    hbjethva6977
    Compare Iterative and Recursive algorithm to find out Fibonacci series. Explain why analysis of algorithms is important? (iii) Explain characteristics of Greedy Algorithm. (iv) Explain Principle of Optimality? Explain its use in Dynamic Programming Method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Gujarat Technological University: Instructions

    Uploaded by

    hbjethva6977
    51 views1 page
    Compare Iterative and Recursive algorithm to find out Fibonacci series. Explain why analysis of algorithms is important? (iii) Explain characteristics of Greedy Algorithm. (iv) Explain Principle of Optimality? Explain its use in Dynamic Programming Method.

    Original Description:

    Original Title

    150703

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Compare Iterative and Recursive algorithm to find out Fibonacci series. Explain why analysis of algorithms is important? (iii) Explain characteristics of Greedy Algorithm. (iv) Explain Principle of Optimality? Explain its use in Dynamic Programming Method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    51 views1 page

    Gujarat Technological University: Instructions

    Uploaded by

    hbjethva6977
    Compare Iterative and Recursive algorithm to find out Fibonacci series. Explain why analysis of algorithms is important? (iii) Explain characteristics of Greedy Algorithm. (iv) Explain Principle of Optimality? Explain its use in Dynamic Programming Method.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Seat No.

    : ________

    Enrolment No.______________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE- Vth SEMESTEREXAMINATION MAY/JUNE - 2012

    Subject code: 150703 Subject Name: Design and Analysis of Algorithms Time: 02:30 pm 05:00 pm

    Date: 04/06/2012 Total Marks: 70

    Instructions:
    1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks. Answer the following. Q.1 14 (i) Compare Iterative and Recursive algorithm to find out Fibonacci series. Explain why analysis of algorithms is important? Explain: Worst Case, Best Case (ii) & Average Case Complexity. (iii) Explain characteristics of Greedy Algorithm. (iv) What is Principle of Optimality? Explain its use in Dynamic Programming Method. Q.2 (a) Write a program/algorithm of Selection Sort Method. What is Complexity of the 07 method? 07 (b) Explain Quick Sort Method with example. OR (b) What is Divide and Conquer Technique? Give the use of it for Binary Searching 07 Method. (a) Define Minimal Spanning Tree(MST). Explain Krushkals Algorithm to find MST with example. (b) Solve Making Change problem using Dynamic Programming. (denominations: d1=1,d2=4,d3=6). Give your answer for making change of Rs. 8. OR (a) Explain Dijkstras algorithm to find minimum distance of all nodes from a given node. (Greedy algorithm) (b) Solve the following Knapsack Problem using Dynamic Method. Write the equation for solving above problem. n = 5, W = 100 Object 1 2 3 4 5 Weight (w) 10 20 30 40 50 Value (v) 20 30 66 40 60 07 07

    Q.3

    Q.3

    06 08

    Q.4

    (a) Explain Backtracking Method. What is N-Queens Problem? Give solution of 4- 07 Queens Problem using Backtracking Method. (b) Explain Breadth First Traversal Method for Graph with algorithm. 07
    OR

    Q.4

    Q.5

    (a) (b) (c) (a) (b)

    Q.5

    (a) (b) (c)

    Explain Chained Matrix Multiplication with example. Define: Acyclic Directed Graph, Articulation Point, Dense Graph, Sparse Graph. Explain Min Max Principle. Explain in Breif: P Problem, NP Problem, Heap Tree, Travelling Salesman Problem Explain finite automata for string matching. OR Explain Rabin- carp method for string matching and also give the algorithm. What is Recursion? Give the implementation of Tower of Hanoi problem using Recursion. Define :Big Oh, Big Omega and Big Theta Notation.
    ************* 1

    07 04 03 08 06 07 04 03

    You might also like