Saturday, May 30, 2015

SRM University BE CSE CS0203 Design and Analysis of Algorithms 2010 question paper

University: SRM UNIVERSITY
Course: Department of Computer Science and Engineering
Question Paper Sub Title: Design and Analysis of Algorithms
Question Paper Sub Code: CS0203
Marks: 100 Time: 3 Hours

PART-A (10X2=20)
(Attempt all questions)
Q.1 Define time & space complexity.
Q.2 Write a recursive algorithm for the output- 4,3,2,1,0,1,2,3,4

Q.3 What is PIVOT ?

Q.4 What is feasible & optimal solution?

Q.5 Draw a graph with Articulation point.

Q.6 List the tree traversal techniques.

Q.7 What is planer graph?

Q.8 Define branch & bound method.

Q.9 Define deterministic algorithm.

Q.10 What is polynomial time?

PART B-(5X16=80)
(Attempt any FIVE questions)

Q.11-A)What is recurrence relation?Explain.
B)Explain various types asymptotic notations.

Q.12 Write an algorithm for Quick sort with example and analyze complexity.

Q.13 Explain DFS graph traversal with algorithm.

Q.14 What is knapsack problem.

Q.15 Write short note on-
A) NP complete
B) Relationship between NP HARD & NP Complete

Q16 Explain graph coloring algorithm.

Q.17 Explain in detail about sum of subset problem with example.

Duraimani

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!