1 Up votes0 Down votes

2.0K views2 pagesvtu 4th semester cse model question paper

Feb 03, 2011

© Attribution Non-Commercial (BY-NC)

PDF or read online from Scribd

vtu 4th semester cse model question paper

Attribution Non-Commercial (BY-NC)

2.0K views

vtu 4th semester cse model question paper

Attribution Non-Commercial (BY-NC)

- Steve Jobs
- Wheel of Time
- NIV, Holy Bible, eBook
- NIV, Holy Bible, eBook, Red Letter Edition
- Cryptonomicon
- The Woman Who Smashed Codes: A True Story of Love, Spies, and the Unlikely Heroine who Outwitted America's Enemies
- Contagious: Why Things Catch On
- Crossing the Chasm: Marketing and Selling Technology Project
- Everybody Lies: Big Data, New Data, and What the Internet Can Tell Us About Who We Really Are
- Zero to One: Notes on Start-ups, or How to Build the Future
- Console Wars: Sega, Nintendo, and the Battle that Defined a Generation
- Dust: Scarpetta (Book 21)
- Hit Refresh: The Quest to Rediscover Microsoft's Soul and Imagine a Better Future for Everyone
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- Crushing It!: How Great Entrepreneurs Build Their Business and Influence—and How You Can, Too
- Make Time: How to Focus on What Matters Every Day
- Algorithms to Live By: The Computer Science of Human Decisions
- Wild Cards

You are on page 1of 2

com 06CS43

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

PART -A

1. a) Explain the Notion of algorithm and its important characteristics with the

help of an algorithm. (06 Marks)

b) Write an algorithm to check whether the given number is an Armstrong

number or not.(Ex: 13+53+33=153) (06 Marks)

c) Briefly explain the following terms- (08 Marks)

i) Dictionary ii) Stable algorithm

iii) ADT iv) First child next sibling representation of trees

2. a) Explain the various asymptotic notations with examples. (08 Marks)

b) 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)

c) Discuss the algorithm for element uniqueness problem for its

Efficiency. (06 Marks)

3. a) Explain selection sort algorithm and its efficiency. (08 Marks)

b) 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)

4. a) Briefly explain Strassen’s matrix multiplication. Obtain its (12 Marks)

complexity. Apply the algorithm to multiply the given 2 matrices.

1 2 5 6

3 4 X 7 8

DFS algorithm can be used to obtain the topological sorting

with an example. (08 Marks)

MANUALS | FREE AT

www .vturesource.com

Page 1

DOWNLOAD THIS FREE AT www.vturesource.com 06CS43

PART -B

5. a) 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)

b) Explain the Boyer-Moore algorithm for string matching with

an example. (10 Marks)

6 a) 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)

b) State all-pairs shortest path algorithm. Solve the given (12 Marks)

problem using that-

0 2 ∞ 1 ∞

6 0 3 2 ∞

∞ ∞ 0 4 ∞

∞ ∞ 2 0 3

3 ∞ ∞ ∞ 0

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)

b) Explain the concept of Decision tree for searching the sorted

Array. (10 Marks)

8. a) Distinguish between P,NP and NP complete problems. Give example

for each category. (10 Marks)

b) Solve the following instance of Assignment problem using

Branch-Bound technique (10 Marks)

9 2 7 8

6 4 3 7

5 8 1 8

7 6 9 4

MANUALS | FREE AT

www .vturesource.com

Page 2

- Full Body Harness Inspection - ChecklistUploaded byZamzairil Zulkepli
- C++ VTU notesUploaded byarmyraj09
- Mtech 2nd Sem - Question Papers - Year 2011Uploaded byivsvarun
- IGC2 Examiner's ReportsUploaded bysaqibsaeed18
- IGC2 PP MARCH 201023112011481333.pdfUploaded byarqureshi
- Analysis And Design Of Algorithms (ADA) 2 marks questionUploaded byAdarsh Gumashta
- Nebosh IGC 2 ANSUploaded byPrakash Kothandapani
- NEBOSH-IGC-2Uploaded bynarendra161188
- VTU 7TH SEM CSE/ISE DATA WAREHOUSING & DATA MINING NOTES 10CS755/10IS74Uploaded byEKTHATIGER633590
- nebosh igc2Uploaded byasifbaruani
- Nebosh Idip Ia Sample PaperUploaded byfaradayzzz
- Examiners Reports IGC2 December 2012 IGC2Uploaded byAasif Equbal
- Examiners Reports IGC2 September 2012 IGC2Uploaded byHamza Gasim
- Art of Programming Contest SE for UvaUploaded bymarcelozeballos96
- new exams IGC-2Uploaded byHossamKandil
- NEBOSH IGC2 Elements 1 - Movement of people and vehicleUploaded byjimboy378
- ADA Model Question Paper-1Uploaded byvturesource
- Software Engineering 2015 Solved Question Papers for VTU Information Science Semester 5Uploaded byShiva Kammath
- Examiners-Reports-IGC2_September-2009-IGC2.pdfUploaded bybharathost
- Nebosh IGC2 Part 3Uploaded byMuhammadAkram
- GC2 IGC Examiners' Report May - July 2014Uploaded byjohnmason246
- Design & Analysis of Algorithm Dec 2012 NEWUploaded byPrasad C M
- IGC2 Examiners Report 2011Uploaded byKevin Raman
- Conflict of Interest Policy-1Uploaded bybmkallarackal
- Nebosh Question - Q2Uploaded byhussein546
- Nebosh Question - Q4Uploaded byhussein546
- NEBOSH Examiner PaperUploaded byalanjcherry
- Pset Advice Cs161Uploaded bydts99
- AlgorithmsUploaded bygivememypdfs
- Ch2 Complexity Growth WDUploaded byHarsha Madhwani

- Applied and Computational Linear Algebra a First Course Charles L. ByrneUploaded byAshoka Vanjare
- Graphs - Discrete MathematicsUploaded byCarlos Cano Muñoz
- Program on cUploaded bySwaraj Kumar
- Routh Hurwitz AnalysisUploaded byilg1
- Linear ConvolutionUploaded byRahul Deshpande
- A_Textbook_of_Engineering_Mathematics_(Volume_II).pdfUploaded byPriyanshu Joshi
- Optimization Using Linear ProgrammingUploaded bykishorerocx
- homework_04.pdfUploaded byAnonymous 96NePMZ
- Engineering Mathematics –III (MAT-ELE-201) RCSUploaded byAbhijan Carter Biswas
- Discovering Advanced Algebra Solutions ManualUploaded byJerry Myer Lim
- Ch8_3_TrigIntegralsUploaded byLynn Hollenbeck Breindel
- Seminar LinksUploaded byNaveen Goyal
- Oscillation Theory for Second Order Linear, Half-Linear, Superlinear and Sublinear Dynamic Equations.pdfUploaded byKenzi
- AkumeUploaded byPiero Conislla Cardenas
- ABC2 Solutions 2016Uploaded byNizŏǾŏ Wait For-it Ismail
- MathematicsUploaded byDalton Chan
- Cv ExamplesUploaded byJuan Felipe
- reward based wireless network algorithmUploaded byJyothiradithyan M
- MATLAB Basic Exercises 2Uploaded byJohn Bofarull Guix
- LimitsUploaded byM Jamshaid Sarwar
- AG RaviUploaded bynothard
- Calculus Cheat Sheet Limits Definitions Limit at Infinity :Uploaded byapi-11922418
- (chapter 3) quadratic functionUploaded bydenixng
- LA205FAD.pdfUploaded byfalcon724
- A - Review of Set Theory.pdfUploaded byrrameshsmit
- Abstract Algebra Study Guide for Beginners - John A. Beachy.pdfUploaded byErvin Isaac Ramirez
- CSCI 4020 Computer AlgorithmsUploaded byByungHun Lee
- ASSIGNMENT (CH-DETERMINANTS).pdfUploaded byManas Ranjan Jena
- Notes on Smith's an Introduction to Godels Incompleteness TheoremsUploaded byebshear
- real.pdfUploaded byRay Gobbi

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.