Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
92 views

01cs6105 s1 Advanced Data Structures and Algorithms

KTU question paper

Uploaded by

ak164746
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
92 views

01cs6105 s1 Advanced Data Structures and Algorithms

KTU question paper

Uploaded by

ak164746
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY First Semester M.Tech Degree Examination 01C86105: Advanced Data Structures and Algorithms Time : 3 Hours Marks: 60 (Answer any Two Questions from each part) PARTA, 1) Explain Decrease-Key operation on Fibonacci heap and determine the running time. b) Write and explain Extended-Euclid algorithm and analyse its running time. 2a) What is the total cost of executing of the stack operations PUSH, POP and MULTIPOP, assuming that the stack begins with s» objects and finishes with s, objects? b) Rewrite BINOMIAL-HEAP-INSERT to insert a node directly into a binomial heap without calling BINOMIAL-HEAP-UNION. 3. a) Show how to implement a queue with two ordinary stacks so that the amortized cost of each ENQUEUE and each DEQUEUE operation is (1). b) Explain Miller-Rabin algorithm. How is the error rate reduced? (2x9=18 marks) PARTB 4, a) State and prove max-flow min-cut theorem. b) Explain Rabin-Karp string matching algorithm and analyse its running time. 5. a) Compute the prefix function for the pattern ababbabbabbababbabb. b) Explain maximum bipartite matching problem and its solution. Analyse the running time, 6. a) Explain space complexity classes by Analyze the running time of push-relabel algorithm, (2x9=18 marks) PARTC 4) Explain the algorithm for finding the closest pair of points in a set of n points 5) Differentiate between Las Vegas and Monte-Carlo algorithms. Explain probabilistic counting algorithm. 4) Explain Graham's Scan algorithm for obtaining convex hull and analyse the running time. b) Write notes on randomized complexity classes. 4) Explain the algorithm that checks whether any pair of line segments from a given set of n line segments intersect. Prove that the algorithm runs in O(n log n) time. ) Explain probabilistic algorithm for verifying matrix multiplication and give the running time. (2x12=24 marks)

You might also like