Scribd
Upload
269 views2 pages

15-150703-Design and Analysis of Algorithms PDF

This document appears to be an exam for a course on Design and Analysis of Algorithms. It contains 5 questions assessing students' knowledge of key algorithm concepts like complexity analysis, dynamic programming, greedy algorithms, divide and conquer, graph algorithms, and NP-complete problems. Students are asked to define terms, explain algorithms, analyze complexity, solve problems like knapsack and string matching, and more. The exam covers a wide range of fundamental algorithm topics.

Uploaded by

Harshang Rana
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
269 views2 pages

15-150703-Design and Analysis of Algorithms PDF

This document appears to be an exam for a course on Design and Analysis of Algorithms. It contains 5 questions assessing students' knowledge of key algorithm concepts like complexity analysis, dynamic programming, greedy algorithms, divide and conquer, graph algorithms, and NP-complete problems. Students are asked to define terms, explain algorithms, analyze complexity, solve problems like knapsack and string matching, and more. The exam covers a wide range of fundamental algorithm topics.

Uploaded by

Harshang Rana
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Seat No.

: _____

Enrolment No.______

GUJARAT TECHNOLOGICAL UNIVERSITY


B.E. Sem-Vth Examination December 2010

Subject code:150703 Subject Name: Design & Analysis of Algorithms


Date: 16 /12 /2010 Time: 03.00 pm - 05.30 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) Answer the following. (i)What is an algorithm? Explain various properties of an algorithm. (ii) Explain: Worst Case, Best Case & Average Case Complexity. (iii)Define: Directed Acyclic Graph, Principle of Optimality. (iv) Explain P and NP Problems giving examples. (b) Arrange following rate of growth in increasing order. 2N, n log n, n2, 1 , n, log n, n!, n3 12

02

Q.2

(a) Answer the following 07 (i)Compare Dynamic Programming Technique with Greedy Algorithms. (ii) Give the recursive algorithm to find Fibonacci sequence. Comment on the complexity of the algorithm. (b) Explain how to apply the divide and conquer strategy for sorting the elements 07 using quick sort with example. OR (b) Explain the use of Divide and Conquer Technique for Binary Search Method. 07 Give the algorithm for Binary Search Method. What is the complexity of Binary Search Method? (a) Give and Explain the Prims Algorithm to find out Minimum Spanning Tree with illustration. (b) Write an algorithm of Selection Sort Method. Give its complexity. (c) What do you mean by Asymptotic Notations? Explain. OR (a) Give and Explain the Kruskals Algorithm to find out Minimum Spanning Tree with illustration. (b) Explain why the Heap sort method is called an efficient sorting algorithm. Sort the following data using Heap sort method. 65, 77, 5, 25, 32, 45, 99, 83, 69, 81 07 05 02 07 07

Q.3

Q.3

Q.4

(a) Solve the following 0/1 Knapsack Problem using Dynamic Programming. There 08 are five items whose weights and values are given in following arrays. Weight w[] = { 1,2,5,6,7 } Value v[] = { 1,6,18, 22, 28 } Show your equation and find out the optimal knapsack items for weight capacity of 11 units.
1

Q.4

(b) Give the algorithm for Depth First Search of a Graph. Also define Articulation 06 Point of the graph and explain how to find it. OR Explain how to find out Longest Common Subsequence of two strings using (a) 08 Dynamic Programming method.Find any one Longest Common Subsequence of given two strings using Dynamic Programming. S1=abbacdcba S2=bcdbbcaac (b) Answer the following. 06 (i) Explain Branch and Bound Technique in brief. (ii) Explain minimax principle with its use. (a) Answer the following. (i) Compare NP-Hard with NP-Complete problems. (ii)Give the algorithm to solve Tower of Hanoi Problem. Comment on the complexity of the algorithm. (b) Explain the use of Backtracking method for solving Eight Queens Problem giving its algorithm. OR (a) Answer the following: (i) Give the characteristics of Greedy Algorithms. (ii)Define: Directed Acyclic Graph, Dense graph, Sparse graph, Preconditioning. (b) Explain Rabin-Karp method for string matching and also give the algorithm.
*************

Q.5

07

07

Q.5

07

07

You might also like