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

www.vturesource.com

06CS43

**MODEL QUESTION PAPER-2 Fourth Semester B.E. Degree Examination, June/July 2008
**

COMPUTER SCIENCE / INFORMATION SCIENCE ENGINEERING

**Analysis and Design of Algorithms
**

Time : 3 hours Max Marks:100

Note: Answer atleast two full questions from each part. PART -A 1. a) b) c) Explain the Notion of algorithm and its important characteristics with the help of an algorithm. (06 Marks) Write an algorithm to check whether the given number is an Armstrong number or not.(Ex: 13+53+33=153) (06 Marks) Briefly explain the following terms(08 Marks) i) Dictionary ii) Stable algorithm iii) ADT iv) First child next sibling representation of trees Explain the various asymptotic notations with examples. (08 Marks) Use the informal definitions of O, Ω, θ to determine whether the following assertions are true or false. (06 Marks) 3 2 i) n(n+1)/2 € O(n ) ii)n(n+1)/2 € O(n ) iii) n(n+1)/2 € θ (n3) iv) n(n+1)/2€ Ω (n) Discuss the algorithm for element uniqueness problem for its Efficiency. (06 Marks) Explain selection sort algorithm and its efficiency. (08 Marks) Discuss the merge sort algorithm with recursive tree and its efficiency. Apply the same algorithm to sort the list {4,6,1,3,9,5,2,7}. (12 Marks) Briefly explain Strassen’s matrix multiplication. Obtain its (12 Marks) complexity. Apply the algorithm to multiply the given 2 matrices. 1 3 b) 2 4 5 7 6 8

2.

a) b)

c) 3. a) b)

4.

a)

X

Differentiate between DFS and BFS tree traversals. Explain how DFS algorithm can be used to obtain the topological sorting with an example. (08 Marks)

ALL BRANCHES | ALL SEMESTERS | NOTES|QUESTION PAPERS|LAB MANUALS | FREE AT

**www .vturesource.com
**

Page 1

DOWNLOAD THIS FREE AT

www.vturesource.com

06CS43

PART -B

5.

a) b)

6

a) b)

Write and explain the Heap sort algorithm using top-down approach. Sort the elements {M,O,R,N,I,N,G} in alphabetical order. (10 Marks) Explain the Boyer-Moore algorithm for string matching with an example. (10 Marks) Construct the open hash table and closed hash table for the input: 30,20,56,75,31,19 using the hash function h(k)=k mod 11. (08 Marks) State all-pairs shortest path algorithm. Solve the given (12 Marks) problem using that0 6 ∞ ∞ 3 2 0 ∞ ∞ ∞ ∞ 3 0 2 ∞ 1 2 4 0 ∞ ∞ ∞ ∞ 3 0

7.

a)

b) 8. a) b)

What is Greedy technique? Explain how the different steps of this technique are taken care in generating a minimum spanning tree through a sequence of expanding sub trees. Apply this algorithm to the following graph(10 Marks) Explain the concept of Decision tree for searching the sorted Array. (10 Marks) Distinguish between P,NP and NP complete problems. Give example for each category. (10 Marks) Solve the following instance of Assignment problem using Branch-Bound technique (10 Marks) Job1 9 6 5 7 Job2 2 4 8 6 Job3 7 3 1 9 Job4 8 7 8 4

ALL BRANCHES | ALL SEMESTERS | NOTES|QUESTION PAPERS|LAB MANUALS | FREE AT

**www .vturesource.com
**

Page 2

vtu 4th semester cse model question paper

vtu 4th semester cse model question paper

- ADA Model Question Paper-1
- Design & Analysis of Algorithm Dec 2012 NEW
- C++ VTU notes
- Mtech 2nd Sem - Question Papers - Year 2011
- VTU 7TH SEM CSE/ISE DATA WAREHOUSING & DATA MINING NOTES 10CS755/10IS74
- Data Structures - Question Set
- Analysis & Design of Algorithm Jan 2010
- Analysis and Design of Algorithms _ADA_ _Elective I
- Algo
- lec01_algorithmanalysis
- Algorithms Short Exam
- 4.Design Analysis of Algorithm QB
- ADA QB
- Analysis & Design of Algorithm July 2011
- MELJUN CORTES ALGORITHM_Brute Force Algorithm Design Technique
- Design and Analysis of Algorithms-TCS-503
- Lesson Plan DAA
- Decision Maths 1 Algorithms (2)
- Decision Maths 1 Algorithms
- Detail Syl
- CP
- Sample chapter from Oxford A Level Mathematics for Edexcel Decision D1
- DAA-2011-Syll
- v3-3-30
- 596_596_596
- A.O.A
- Josiah Sample
- 00 Intro
- Clrs Content
- 24351786_lese_1
- VTU ADA MODEL QUESTION PAPER

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