Downloaded From www.rejinpaul.com eel eee Question Paper Code : 43296 aXAMINATION, MAY/JUNB 2015. Reg. M.E/M.Tech. DEGRE First Semester 5 5 ‘Computer Science and Engineering ce cP 7102 — ADVANCED DATA STRUCTURES AND spol) (Common to M.E.Biometrica and cyber security, M.E. Compubé, Scifnce and Engineering (with specilization in networks), M.E. Multi hnology, ME. Software Engineering and M.Tech Herne ts Tet icacloas) (Regulation 2013) ¢ y Time : Three hours om 4 Maximum : 100 marks Anower ALL guest parr A-€ (104g = BW marks) A What do you mean by ‘Loop Tnyariang? How do you prove correct jomyvith: ‘Strong induction? ° ‘i Define flow problems,» GO What is —< How sub instances aretreated in dynamic programming? What do you méan by ‘Halting problem’? mk Differgfffate Transient and Persistent Communication. ‘State the principal drawbacks of Sequential Consistency. ‘Howido you implement a List based Set? Give examples. List out the three different pool methods. + PART B— (6 x 16 = 80 marks) 1 2 5) 4 5. 6. 1. 8 2 1. (2) (@ Write a recursive algorithm to find the Kth smallest one from a set of elements. Also illustrate the above algorithm with suitable examples. ® (i) Explain ackermann’s function using suitable algorithm. Also derive yecurrence relation for the above function and solve it. ®) Or S rejinpaul.com (Grow With Us(6) @ Write recursive routines to: (1) Return the maximum of data fields of nodes in a binary tree. a) (2) Return the height of the binary tree. w (3) Return the number of leaves in binary tree, i) Discuss about the steps involved in developing an it algorithm. r 42. (@) @ Explain the Reachability problem of Graphs with (Appropriate algorithm and ranning time analysis. J (0) (i) Weite down the steps involved in develi recursive backtracking. © or ce r ©) @ Explain Dijkotra’s shortest path ee: with suitable code, example and leop invariants. jum fy a0) @) Discuss about the Primal dual Pid] climbing algorithm with suitable examples. i 6) a y 13. (@) @ What do you megn by ag on of the Little Bird”?. What are the cca aud loa ern in it? Also narrate about Repeated eee oa (i) “A dynamic Genin algorithm is fast only if the given fa instance qéoe "vo many sub instancss”. Justify and prove this stateme : © Cg Or b) Wes xoloring problem is NP-complete? Explain. 8) (j) How Randomized Primality Testing could be performed? Explain Aoo\ With an example. @) 14, @PG) Explain 2-Thread solutions with respect to LockOne , LockTwo and Peterson Lock algorithm. (12) A —— Gi) Write short notes on Parallel Programming. ® Or (») (Sketch the dava Memory Model with Locks, Volatile and Final fields ®) Gi) Explain Lamport’s bakery algorithm in detail with respect to deadlocks. 8 . 3 ; (> Cit inpaul.com Grow Wits usDownloaded From www.rejinpaul.com Discuss the illustration of an Unhounded Lock Free Queue with an example. | ® Compate Coarse grained synchronization with fine grained synchronization with appropriate routines and examples. ® Or Construct an elimination back off stack using a lock- free linesrizable stack implementation. ar How a bounded partial queue differs from an oo \ Explain, 43296 rejinpaul.com (Grow With Us