This action might not be possible to undo. Are you sure you want to continue?

: _____

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 Prim’s 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 Kruskal’s 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

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

Sign up to vote on this title

UsefulNot useful- DAA
- NR-220502- Design and Analysis of Algorithms
- CS2251-QB
- CS2251-QB
- 4.Design Analysis of Algorithm QB
- ADA QB
- 00 Intro
- PIC10B_lecture14
- Algorithms Short Exam
- ma
- A Notes on Design & Analysis of Algorithm
- Data Structures - Question Set
- lec01_algorithmanalysis
- Analysis and Design of Algorithms _ADA_ _Elective I
- 596_596_596
- Lab 1 Report
- MELJUN CORTES ALGORITHM_Brute Force Algorithm Design Technique
- Analysis & Design of Algorithm July 2011
- Decision Maths 1 Algorithms
- Algorhtms-Introduction
- Decision Maths 1 Algorithms (2)
- DAA-2011-Syll
- A.O.A
- v3-3-30
- Lesson Plan DAA
- Edexcel D1 Sample Chapter - Chapter 1
- Sample chapter from Oxford A Level Mathematics for Edexcel Decision D1
- Analysis & Design of Algorithm Jan 2010
- Lecture 1
- Resource Leveling
- 15-150703-Design and Analysis of Algorithms.pdf

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd