Department of Computer Science & Engineering

MBM University, Jodhpur

Subject: Design & Analysis of Algorithms Name:
Time: 01 Hour Roll No.:
Q1. Define 0/1 Knapsack Problem. Solve the following Item Weight Value
given instance Using Greedy Approach. Is this solution 1 10 60
Optimal? Capacity of Knapsack is 50. 2 20 100
3 30 120
Q2. Describe an algorithm to sort n given integers in the range 1 to k in O(n+k)
processing time.
Q3. Distinguish between divide-and-conquer and dynamic programming with suitable examples.
Q4. What do you mean by complexity? Explain space and time complexity of a program.

Department of Computer Science & Engineering

MBM University, Jodhpur
Subject: Design & Analysis of Algorithms Name:
Time: 01 Hour Roll No.:

Q1.Define 0/1 Knapsack Problem. Solve the following given

Item Weight Value
instance Using Greedy Approach. Is this solution 1 10 60
Optimal? Capacity of Knapsack is 50. 2 20 100
3 30 120
Q2. Describe an algorithm to sort n given integers in the
range 1 to k in O(n+k) processing time.
Q3. Distinguish between divide-and-conquer and dynamic programming with suitable examples.
Q4. What do you mean by complexity? Explain space and time complexity of a program.

Department of Computer Science & Engineering

MBM University, Jodhpur
Subject: Design & Analysis of Algorithms Name:
Time: 01 Hour Roll No.:

Q1.Define 0/1 Knapsack Problem. Solve the following given instance Using Greedy
Approach. Is this solution Optimal? Capacity of Item Weight Value
Knapsack is 50. 1 10 60
2 20 100
Q2. Describe an algorithm to sort n given integers in the 3 30 120
range 1 to k in O(n+k) processing time.
Q3. Distinguish between divide-and-conquer and dynamic programming with suitable examples.
Q4. What do you mean by complexity? Explain space and time complexity of a program.

Page 1 of 1