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

BooksAudiobooksComicsSheet Music### Categories

### Categories

### Categories

### Publishers

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

Suggestion Paper for CS503 - Design and Analysis of Algorithm|Views: 3,559|Likes: 8

Published by MyWBUT - Home for Engineers

Suggestion Paper for CS503 - Design and Analysis of Algorithm, for more papers, visit - http://www.mywbut.com/

Suggestion Paper for CS503 - Design and Analysis of Algorithm, for more papers, visit - http://www.mywbut.com/

Published by: MyWBUT - Home for Engineers on Dec 03, 2010

Copyright:Attribution Non-commercial

See more

See less

https://www.scribd.com/doc/44598391/Suggestion-Paper-for-CS503-Design-and-Analysis-of-Algorithm

10/04/2015

text

original

**Multiple Choice Questions
**

1. i) O-notation provides an asymptotic a) upper bound b) lower bound

c) light bound d) none of these

ii) The minimum number of colors needed to color a graph having n>3 vertices and 2 edges is a) 2 b) 3 iii) Kruskal algorithm is a a) Asymptotically loose b) Asymptotically tight iv) Which one of the following is true? a) b) c) d) c) 4 d) 1

v) Time complexity for recursive relation T(n) = 2T ( a) b) ) c) d)

yw

bu

) + 1 is c) O ( V3 ) d) O ( E3 ) c) -1 d) both 0 and 1 c) Quick sort

All NP hard problems are NP complete All NP complete are NP hard Some NP complete problems are NP hard None of these

vii) Time complexity for the Floyd’s algorithm to find all parts of shortest path of a graph G with V vertices and E edges using dynamic programming method is a) O ( V2 ) b) O ( E2 )

viii) The diagonal of the adjacency matrix of a graph with a self loop contains a) 1 b) 0

ix) In which sorting technique at every step each element is placed in its proper position? a) Bubble sort

m

t.c

om

c) same as big oh d) none of these

b) Merge sort x) Optimal substructure property is exploited by a) Dynamic programming b) Greedy method

d) Heap sort

c) Both (a) & (b) d) None of these

**Short Answer Type Questions
**

2. Write down the difference between : a) Prim’s algorithm and Kruskal’s algorithm b) Linear search and binary search 3. Use a recursion tree to give an asymptotically tight solution to the recurrence: T(n) = T (n – a) + T (a) + cn where a >= 1 and c>0 are constant. 4. Find the minimum number of operations requird for the following matrix chain multiplication using dynamic programming: A(10 х 20) * B (20 50) * C (50 х 1) * D (1 х 100) 5. Write the algorithm of Quick sort. Find the best case, worst case and average case time complexities of this algorithm. 6. Compare and contrast BFS vis-à-vis DFS.

Long Answer Type Questions

7. a) Define the classes P and NP. b) Discuss what you mean by polynomial reductions. c) Discuss diagrammatically the relations among P class, NP class, NP hard and NP complete. d) Describe Clique Decision Problem (CDP). e) Prove that CDP is NP complete.

m

yw

bu

t.c

om

8. a) Find out the minimum cost spanning tree using any algorithm:

11. Write short notes on any three of the following: a) Recursion Tree b) FFT algorithm c) Approximation algorithms d) 0/1 knapsack problem

m

yw

10. a) Differentiate between greedy method and dynamic programming. b) What do you mean by non-deterministic algorithms? c) A newspaper agent daily drops te newspaper to the area assigned in such a manner that he has to cover all the houses in the respective area with minimum travel cost. Compute the minimum travel cost. The area assigned to the agent where he has to drop the newspaper is shown in the figure below:

bu

t.c

9. a) Find out the worst case time complexity of merge sort. b) Design a back tracking algorithm to find all the Hamiltonian cycles in a Hamiltonian graph. What is the worst-case time complexity of the algorithm?

om

b) Let (u, v) be a minimum weight edge in a graph G. Show that (u, v) belongs to some minimum spanning tree of G. c) What is union-find algorithm?

TEXCAVATOR 2013 Committee.

NOTICE
FOR B.Tech – 4th year, 2013 PASSING OUT BATCH

HU501 Economics for Engineers

CS504C (FE) Digital Signal Processing

CS504B (FE) Data Communication

CS504A (FE) Circuit Theory & Networks

CS503 Discrete Mathematics

CS502 Microprocessors & Microcontrollers

CS501 Design and Analysis of Algorithm

c Aptitude Questions & Answers

System of Linear Equation

Interpolation

Euler’s method, Runge Kutta methods, Predictor-Corrector methods

Computer Number Systems, Approximation in Numerical Computation

Chapter 2 - Probability and Random Variables

Chapter 1 - Representation of Signals

Suggestion Paper for CS521 - Formal Language & Automata Theory

Suggestion Paper for IT 501 - Object Technology & UML

Sample Resume 3

Sample Resume 2

Sample Resume 1

Sample Resume 4 for Fresh Engineering Graduates

Suggestion Paper for EC 312 – DIGITAL ELECTRONICS & LOGIC DESIGN

Suggestion Paper for M (CS) – 312 NUMERICAL METHODS & PROGRAMMING

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Analysis & Design Algorithm MCQ'S

Sham Daa Mcq

Quiz#1Reschduled CS502 Design and Analysis of Algorithms

Algorithm Design MCQ,question,GATE

1000+ microprocessor 8085,8086 mcq

1000+ MCQ on Microprocessor & Microcontroller

Microprocessor Multiple Choice Ques

Are you sure?

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

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->