7.2K views

Uploaded by MyWBUT - Home for Engineers

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

- Data Structures and Algorithms Multiple Choice Questions and Answers PDF
- mcq computer graphics.pdf
- CS501 Design and Analysis of Algorithm
- Analysis and Design of Algorithms - MC0080
- Algorithm Question Set
- Sham Daa Mcq
- Rr210504 Design and Analysis of Algorithms
- Analysis And Design Of Algorithms (ADA) 2 marks question
- Analysis & Design Algorithm MCQ'S
- Algorithms Design and Analysis Mcqs With Answers Set 1
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1
- Quiz#1Reschduled CS502 Design and Analysis of Algorithms
- Data Structure MCQ
- Design and Analysis of Algorithms may 2008 Question Paper
- Data Mining Mcq
- Design and Analysis of Algorithms
- Software Engineering Solved Mcqs
- Algorithm Analysis and Design
- 253.pdf
- r05220502-design-and-analysis-of-algorithms

You are on page 1of 3

a) upper bound c) light bound

b) lower 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 c) 4

b) 3 d) 1

om

iii) Kruskal algorithm is a

b) Asymptotically tight t.c d) none of these

bu

b) All NP complete are NP hard

c) Some NP complete problems are NP hard

d) None of these

yw

a) c)

m

b) ) d)

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 ) c) O ( V3 )

b) O ( E2 ) d) O ( E3 )

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

a) 1 c) -1

b) 0 d) both 0 and 1

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

b) Merge sort d) Heap sort

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.

om

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)

t.c

5. Write the algorithm of Quick sort. Find the best case, worst case and average case time

complexities of this algorithm.

bu

6. Compare and contrast BFS vis-à-vis DFS.

yw

b) Discuss what you mean by polynomial reductions.

m

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.

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

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?

om

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?

t.c

10. a) Differentiate between greedy method and dynamic programming.

b) What do you mean by non-deterministic algorithms?

bu

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

yw

m

a) Recursion Tree

b) FFT algorithm

c) Approximation algorithms

d) 0/1 knapsack problem

- Data Structures and Algorithms Multiple Choice Questions and Answers PDFUploaded byRao_Surender_Kosalia
- mcq computer graphics.pdfUploaded bySushil Kumar
- CS501 Design and Analysis of AlgorithmUploaded byMyWBUT - Home for Engineers
- Analysis and Design of Algorithms - MC0080Uploaded byTanmay Majumder
- Algorithm Question SetUploaded bylokenders801
- Sham Daa McqUploaded byshambhand2020
- Rr210504 Design and Analysis of AlgorithmsUploaded bySrinivasa Rao G
- Analysis And Design Of Algorithms (ADA) 2 marks questionUploaded byAdarsh Gumashta
- Analysis & Design Algorithm MCQ'SUploaded byGuruKPO
- Algorithms Design and Analysis Mcqs With Answers Set 1Uploaded byKande Archana K
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1Uploaded bysridv774648
- 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
- Design and Analysis of AlgorithmsUploaded byAbdul Baasit
- Software Engineering Solved McqsUploaded byshilpareddy888
- Algorithm Analysis and DesignUploaded byashok_bbsr
- 253.pdfUploaded bysk15021993
- r05220502-design-and-analysis-of-algorithmsUploaded bySRINIVASA RAO GANTA
- DAA 2MARKSUploaded byPradeep Kumar
- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_Uploaded byArabinda Parida
- data-structures-a-algorithms-multiple-choice-questions-mcqs-objective-set-2Uploaded bytrojan100t
- 43-Mca-Or-Design and Analysis of AlgorithmUploaded bySrinivasa Rao G
- Algo Mcq CompiledUploaded bysny2ksa
- MCQ on Operating SystemUploaded by13suraj07
- Optimal-Storage-on-TapesUploaded byapi-19981779
- CG MCQsUploaded byPrashant Mane
- Microprocessor Multiple Choice QuesUploaded byrraje82

- CS504A (FE) Circuit Theory & NetworksUploaded byMyWBUT - Home for Engineers
- CS502 Microprocessors & MicrocontrollersUploaded byMyWBUT - Home for Engineers
- Euler’s method, Runge Kutta methods, Predictor-Corrector methodsUploaded byMyWBUT - Home for Engineers
- System of Linear EquationUploaded byMyWBUT - Home for Engineers
- CS504B (FE) Data CommunicationUploaded byMyWBUT - Home for Engineers
- CS503 Discrete MathematicsUploaded byMyWBUT - Home for Engineers
- Chapter 1 - Representation of SignalsUploaded byMyWBUT - Home for Engineers
- NOTICE FOR B.Tech – 4th year, 2013 PASSING OUT BATCHUploaded 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
- InterpolationUploaded byMyWBUT - Home for Engineers
- Chapter 2 - Probability and Random VariablesUploaded byMyWBUT - Home for Engineers
- Suggestion Paper for EI 302 – ELECTRONIC MEASUREMENT & INSTRUMENTATIONUploaded byMyWBUT - Home for Engineers
- Sample Resume 1Uploaded byMyWBUT - Home for Engineers
- Suggestion Paper for M (CS) – 312 NUMERICAL METHODS & PROGRAMMINGUploaded byMyWBUT - Home for Engineers
- WBUT 3rd Semester Routine 2010Uploaded 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 EC 312 – DIGITAL ELECTRONICS & LOGIC DESIGNUploaded byMyWBUT - Home for Engineers
- rr7sem10Uploaded byTamal Guha
- Circuit Theory Suggestion PaperUploaded byMyWBUT - Home for Engineers
- Suggestion Paper for CS521 - Formal Language & Automata TheoryUploaded byMyWBUT - Home for Engineers
- Sample Resume 2Uploaded byMyWBUT - Home for Engineers
- WBUT 5th Semester Routine 2010Uploaded byMyWBUT - Home for Engineers
- WBUT Semester Routine 2010 for 1st Semester StudentsUploaded byMyWBUT - Home for Engineers
- CV2Uploaded byAparna Gulavani

- 02-asympUploaded byRavneet Singh
- SortingUploaded byFatima Shakeel
- EC6301-OOPs and Data Structures-Anna University-Question PapersUploaded bybhuvangates
- Electrical Engineering Syllabus OldUploaded byAmitabha
- BT0065-C Programming and Data Structures-283Uploaded bycontactalok
- Pds Lab Manual 1Uploaded byM.Gomathi
- SomeLectureNotes_Semester1Uploaded bynes104
- Updated Scheme and Syllabus 2016-17 Version16Feb2016 (1)Uploaded byvarun3dec1
- TurKit: Human Computation Algorithms on Mechanical TurkUploaded byMarkWhiting
- DAA Privious Gate-FinalUploaded byArpkeet IJ
- comp1927 .docxUploaded byvem
- DSUploaded byVijay Kumar
- ECE SYLLABUSUploaded byHarman Rao
- Engineering a Sort FunctionUploaded bynikhil4tp
- Data Structure AlgorithmsUploaded byUmakant Yadav
- Art_of_Programming_Contest_SE_for_uva.pdfUploaded byAbhishek Sharma
- new FINAL 1Uploaded byV.v. Vinoth
- 2150703Uploaded byUDV Developers
- Data Structures Technical Interview QuestionsUploaded byManoj Kumar G
- r Programming InterviewUploaded byRahul Shrivastava
- CSC 3110_Study GuideUploaded byanon_29869256
- Epilight Python NewUploaded byabrahamaudu
- Data_Structures_and_Algorithm_Uploaded bykarthikonthenet
- D1,L2 Sorting Algorithms.pptUploaded bymokhtarppg
- Merge SortUploaded bysubbulakshmiv02
- mca-syllabus-2011-final[1]Uploaded byrenju121
- algorithm pancake.pdfUploaded bysishke
- COP3502_27_MergeSortUploaded byRobby Daigle
- Java OOP Arrays and ExceptionsUploaded byJava OOP
- AP-Computer-Science-A-Syllabus-08-20-2014.pdfUploaded byjed