6.9K views

Uploaded by MyWBUT - Home for Engineers

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

save

- Analysis and Design of Algorithms - MC0080
- Sham Daa Mcq
- Algorithm Question Set
- Rr210504 Design and Analysis of Algorithms
- 50756667 Data Structure Objective Questions
- Data Structures and Algorithms Multiple Choice Questions and Answers PDF
- Software Engineering Solved Mcqs
- Quiz#1Reschduled CS502 Design and Analysis of Algorithms
- Data Structure MCQ
- Design and Analysis of Algorithms may 2008 Question Paper
- Data Mining Mcq
- Algorithms Design and Analysis Mcqs With Answers Set 1
- Analysis & Design Algorithm MCQ'S
- Analysis And Design Of Algorithms (ADA) 2 marks question
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1
- Algorithm Analysis and Design
- CS501 Design and Analysis of Algorithm
- Software Engineering Quiz
- r05220502-design-and-analysis-of-algorithms
- DAA 2MARKS
- Multiple Choice Question of Computer Networking
- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_
- Advance Computer Architecture Mcq's
- Design and Analysis of Algorithms
- mcq computer graphics.pdf
- Algo Mcq Compiled
- 43-Mca-Or-Design and Analysis of Algorithm
- Optimal-Storage-on-Tapes
- MCQ on Operating System
- Microprocessor Multiple Choice Ques
- Euler’s method, Runge Kutta methods, Predictor-Corrector methods
- CS502 Microprocessors & Microcontrollers
- CS501 Design and Analysis of Algorithm
- System of Linear Equation
- Chapter 1 - Representation of Signals
- CS503 Discrete Mathematics
- CS504B (FE) Data Communication
- NOTICE FOR B.Tech – 4th year, 2013 PASSING OUT BATCH
- CS504A (FE) Circuit Theory & Networks
- Chapter 2 - Probability and Random Variables
- Interpolation
- CS504C (FE) Digital Signal Processing
- HU501 Economics for Engineers
- Computer Number Systems, Approximation in Numerical Computation
- TEXCAVATOR 2013 Committee.
- Sample Resume 4 for Fresh Engineering Graduates
- Suggestion Paper for IT 501 - Object Technology & UML
- Data Structure Suggestion Paper
- Suggestion Paper for EI 302 – ELECTRONIC MEASUREMENT & INSTRUMENTATION
- WBUT 3rd Semester Routine 2010
- Sample Resume 3
- Suggestion Paper for M (CS) – 312 NUMERICAL METHODS & PROGRAMMING
- Sample Resume 1
- Suggestion Paper for CS521 - Formal Language & Automata Theory
- WBUT 7th Semester Routine 2010
- WBUT 5th Semester Routine 2010
- Sample Resume 2
- Suggestion Paper for EC 312 – DIGITAL ELECTRONICS & LOGIC DESIGN
- Circuit Theory Suggestion Paper

You are on page 1of 3

**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?

- Analysis and Design of Algorithms - MC0080Uploaded byTanmay Majumder
- Sham Daa McqUploaded byshambhand2020
- Algorithm Question SetUploaded bylokenders801
- Rr210504 Design and Analysis of AlgorithmsUploaded bySrinivasa Rao G
- 50756667 Data Structure Objective QuestionsUploaded byAnushaWisodm
- Data Structures and Algorithms Multiple Choice Questions and Answers PDFUploaded byRao_Surender_Kosalia
- Software Engineering Solved McqsUploaded byshilpareddy888
- Quiz#1Reschduled CS502 Design and Analysis of AlgorithmsUploaded byImran
- Data Structure MCQUploaded byVallari Shah
- Design and Analysis of Algorithms may 2008 Question PaperUploaded byelimelek
- Data Mining McqUploaded bySk Reddy
- Algorithms Design and Analysis Mcqs With Answers Set 1Uploaded byKande Archana K
- Analysis & Design Algorithm MCQ'SUploaded byGuruKPO
- Analysis And Design Of Algorithms (ADA) 2 marks questionUploaded byAdarsh Gumashta
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1Uploaded bysridv774648
- Algorithm Analysis and DesignUploaded byashok_bbsr
- CS501 Design and Analysis of AlgorithmUploaded byMyWBUT - Home for Engineers
- Software Engineering QuizUploaded byKapil Samadhiya
- r05220502-design-and-analysis-of-algorithmsUploaded bySRINIVASA RAO GANTA
- DAA 2MARKSUploaded byPradeep Kumar
- Multiple Choice Question of Computer NetworkingUploaded bySayandip Mondal
- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_Uploaded byArabinda Parida
- Advance Computer Architecture Mcq'sUploaded byGuruKPO
- Design and Analysis of AlgorithmsUploaded byAbdul Baasit
- mcq computer graphics.pdfUploaded bySushil Kumar
- Algo Mcq CompiledUploaded bysny2ksa
- 43-Mca-Or-Design and Analysis of AlgorithmUploaded bySrinivasa Rao G
- Optimal-Storage-on-TapesUploaded byapi-19981779
- MCQ on Operating SystemUploaded by13suraj07
- Microprocessor Multiple Choice QuesUploaded byrraje82

- Euler’s method, Runge Kutta methods, Predictor-Corrector methodsUploaded byMyWBUT - Home for Engineers
- CS502 Microprocessors & MicrocontrollersUploaded byMyWBUT - Home for Engineers
- CS501 Design and Analysis of AlgorithmUploaded byMyWBUT - Home for Engineers
- System of Linear EquationUploaded byMyWBUT - Home for Engineers
- Chapter 1 - Representation of SignalsUploaded byMyWBUT - Home for Engineers
- CS503 Discrete MathematicsUploaded byMyWBUT - Home for Engineers
- CS504B (FE) Data CommunicationUploaded byMyWBUT - Home for Engineers
- NOTICE FOR B.Tech – 4th year, 2013 PASSING OUT BATCHUploaded byMyWBUT - Home for Engineers
- CS504A (FE) Circuit Theory & NetworksUploaded byMyWBUT - Home for Engineers
- Chapter 2 - Probability and Random VariablesUploaded byMyWBUT - Home for Engineers
- InterpolationUploaded byMyWBUT - Home for Engineers
- CS504C (FE) Digital Signal ProcessingUploaded byMyWBUT - Home for Engineers
- HU501 Economics for EngineersUploaded byMyWBUT - Home for Engineers
- Computer Number Systems, Approximation in Numerical ComputationUploaded byMyWBUT - Home for Engineers
- TEXCAVATOR 2013 Committee.Uploaded byMyWBUT - Home for Engineers
- Sample Resume 4 for Fresh Engineering GraduatesUploaded byMyWBUT - Home for Engineers
- Suggestion Paper for IT 501 - Object Technology & UMLUploaded byMyWBUT - Home for Engineers
- Data Structure Suggestion PaperUploaded byMyWBUT - Home for Engineers
- Suggestion Paper for EI 302 – ELECTRONIC MEASUREMENT & INSTRUMENTATIONUploaded byMyWBUT - Home for Engineers
- WBUT 3rd Semester Routine 2010Uploaded byMyWBUT - Home for Engineers
- Sample Resume 3Uploaded byMyWBUT - Home for Engineers
- Suggestion Paper for M (CS) – 312 NUMERICAL METHODS & PROGRAMMINGUploaded byMyWBUT - Home for Engineers
- Sample Resume 1Uploaded byMyWBUT - Home for Engineers
- Suggestion Paper for CS521 - Formal Language & Automata TheoryUploaded byMyWBUT - Home for Engineers
- WBUT 7th Semester Routine 2010Uploaded byMyWBUT - Home for Engineers
- WBUT 5th Semester Routine 2010Uploaded byMyWBUT - Home for Engineers
- Sample Resume 2Uploaded byMyWBUT - Home for Engineers
- Suggestion Paper for EC 312 – DIGITAL ELECTRONICS & LOGIC DESIGNUploaded byMyWBUT - Home for Engineers
- Circuit Theory Suggestion PaperUploaded byMyWBUT - Home for Engineers