Scribd
Upload
24 views

Mtech 1 Sem Cse Advanced Algorithms Cse503b May 2019

This document is the question paper for an M. Tech. examination in Advanced Algorithms. It contains 8 questions across 4 units. Students must attempt 5 questions total, selecting at least one from each unit. All questions carry equal marks. The questions cover topics like asymptotic notation, recursion trees, master's method, splay trees, binomial and Fibonacci heaps, graph algorithms, and information theory bounds.

Uploaded by

Ahmedi Begum
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

Mtech 1 Sem Cse Advanced Algorithms Cse503b May 2019

This document is the question paper for an M. Tech. examination in Advanced Algorithms. It contains 8 questions across 4 units. Students must attempt 5 questions total, selecting at least one from each unit. All questions carry equal marks. The questions cover topics like asymptotic notation, recursion trees, master's method, splay trees, binomial and Fibonacci heaps, graph algorithms, and information theory bounds.

Uploaded by

Ahmedi Begum
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

No. of Printed Pages : 03 Roll No. .......................

AA582
M. Tech. EXAMINATION, May 2019
(First Semester)

(B. Scheme) (Re-appear Only)


(CSE)
CSE503B
ADVANCED ALGORITHMS

Time : 3 Hours] [Maximum Marks : 75

Before answering the question-paper candidates


should ensure that they have been supplied to correct
and complete question-paper. No complaint, in this
regard, will be entertained after the examination.

Note : Attempt Five questions in all, selecting at


least one question from each Unit. All
questions carry equal marks.

(2-21/20) M-AA582 P.T.O.

http://www.dcrustonline.com
Unit I 4. What are various operations that can be
performed on a splay tree ? Discuss amortized
1. (a) Give examples of functions f(n) which complexity of each. 15
are member of BigO(x2) and Small o(x2).
5 Unit III
(b) Solve T(n) = n2 + T(n/2) using recursion 5. Compare Binomial heaps with Fibonacci
tree method. 5 Heaps. Write algorithm to consolidate the nodes
(c) Describe the limitations of Masters of a Fibonacci Heap. Also discuss its
Method. Also give some examples of complexity. 7,8
recurrence relations that are not solvable 6. With the help of an example explain the
by Master's method. 5 application of Binomial Heap to minimum
spanning tree. 15
2. With the help of neat diagrams explain the
Big oh, small oh, Omega, small Omega and Unit IV
theta notations. 15
7. (a) What are cut vertices ? Explain a method
Unit II to find the strongly connected component
from a given graph. 7
3. (a) Derive an expression to find the length (b) What are the significance of information
of longest path in a red black tree with theory bound. 8
n number of internal nodes. 7
8. Write short notes on the following :
(b) Compare 2-3 tree with 2-3-4 tree. Also (a) Adversary arguments
discuss deletion operation in 2-3 tree
(b) Amortized analysis. 15
with a suitable example. 8
M-AA582 2 (2-21/21) M-AA582 3 100

http://www.dcrustonline.com

You might also like