SHRI RAMSWAROOP MEMORIAL GROUP OF PROFESSIONAL COLLEGE
B.Tech. [SEM V (CS/IT)]
QUIZ TEST-2
(Session: 2018-19)
DESIGN & ANALYSIS OF ALGORITHMS
(RCS-502)
Roll No.
(To be filled by the
Student)
Note:
Attempt all the questions and given examples to justify your
answer.
Part – A
(Questions from Tutorial Sheet)[10 Marks]Q1) A standard implementation of Fibonacci heaps require four pointers per node (parent, child and two siblings). Show how to reduce the number of pointers, at the cost of at most a constant factor in running time(Q13) [5M]Q2)Prove that the maximum degree D(n) of any node in an n-node Fibonacci heap is O(lg n). (Q3)
[3+2M]
Part – B
[20 Marks]
Q1) Answer the following short question.
You've reached the end of your free preview.
Want to read the whole page?
- Fall '19
