Download DBATU B.Tech 2019 March 2nd Semester Design and Analysis of Algorithms Question Paper

Download DBATU (Dr. Babasaheb Ambedkar Technological University) B Tech 2019 March (Bachelor of Technology) 2nd Semester Design and Analysis of Algorithms Question Paper

?W are?
DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, L?DNii. '
Mid Semester Examination ? March 2019
i
,
Course: S.Y.B.Tech(CSE) Sem: 11
Subject Name: Design & Analysis of Algorithms Subject Code: BTCOC401
Max Marks: 20 Date:- 11/Mar/2019 Duration:- 1 Hr.
Instructions to the Students:
1. Check that you have received a correct Question paper.
2. Assume suitable data if necessary and mention it clearly
Q.1. Attempt any six Questions ? (1 *6 = 6 Marks)
1? Which of the following asymptotic notation is the worst of all?
a) O(n+9999) b) 0 (113) c) O(log (n)) d) 0 (2n)
2. Two main measures for ef?ciency of algorithm are :
21) Processor & Memory b) Complexity & capacity
( c) Time & space d) Data & space
3. Which of the following does not exist in complexity theory?
a) Best case b) Worst case 0) Average case (1) Base case
4. Merging 4 sorted ?les containing 50. 10, 25 and 15 records will take optima}
time.
a) O (200) b) 0(100) c) 0(175) d) O (150)
5. De?ne Feasible & optimal solution of Greedy algorithm.
6. Dljkstra?s al gorithm is also called shortest path problem.
a) Multiple source b) Single source
' 0) Single destination d) Multiple destination
7. State necessary criterion for a recursive function.
Q. 2. Attempt any two of the following (2*3 =6 Marks)
A. Explain Divide & Conquer strategy of algorithm development.
B. Consider the following iustancas OfthC Kil?p-S?ck prublcm:
n=3,m=20,(p1,p2,p3)=(24,25715) and (wl ,w2,w3)=(18,15,20).
Find feasible solutions.
C . Obtain optimal solutions for the followingjobs:
J obs J 1 J 2 J 3 J4
Deadline 2 1 2 1
Pro?t 27 1 00 1 5 , 1 0
[P.T.O]

Q.3. Attempt any one of the following (1 * 8 = 8 Marks)
A. Construct heap tree for following list of numbers.
20,10,30,50,60,20,35,40,50,25,80 & perform heap sort.
B. Write a program for Merge Sort.
**>I=END*>X=*