SET - 1 GR 11 CODE: GR11A2082

II B. Tech II Semester Regular Examinations,GR11D5104

May, 2014
GR11D5104
Design and Analysis of AlgorithmsGR11D5104
(Common to CSE, IT ) GR11D5104
Time: 3 hours Max Marks: 75
GR11D5104
Answer any FIVE questions
All questions carry equal marks
*****

1). a Why do we need asymptotic notations? Describe different types of asymptotic [8]
notations used to represent time complexities.

b Discuss about profiling and debugging in detail. [7]

2). a Write a greedy algorithm to the Job sequencing with deadlines. [8]

b Explain Prim’s algorithm with suitable example. Write its time complexity. [7]

3). a Solve the 0/1-Knapsack problem using dynamic programming for the following [8]
terms.

b Explain matrix chain multiplication algorithm using dynamic programming. [7]

4). a Write an algorithm of 8-queens problem using backtracking. [8]

b Discuss the general algorithm for Branch and Bound. [7]

5). a Write a Branch and Bound algorithm for the Job sequencing with deadlines. [8]

b Explain the classes of NP-hard and NP-complete. [7]

6). a Define an articulation point. Also discuss the algorithm for finding articulation point. [8]

b Write and explain the control abstraction algorithm of divide and conquer. [7]

7). a Draw a portion of state space tree for solving sum-of-subset problem the following [8]
weights and

b Explain the strategy to prove that a problem is NP hard. [7]

SET - 1 GR 11 CODE: GR11A2082

***** GR11D5104
GR11D5104
GR11D5104
GR11D5104
GR11D5104