Advanced Problem Solving M.Tech (CSE) Question Bank UNIT-I 1. a) Compare and contrast Java arrays with vectors.

b) Discuss exception handling in Java. 2. a) Explain about OOP concepts b) Give the Asymptotic analysis and its properties? 3. Explain Performance analysis for algorithms 4. Explain Exception handling in Java with Example? UNIT_II 1. Briefly explain the linked representation of a linear list and also discuss operations on it. 2. a) Convert the following infix expression into postfix expression, trace the stack. ((a* (b + c) +d) / (e + f)) b) Give a note on Priority Queue ADT? 3. a) Discuss in detail about the Applications of Stacks? b) Explain queues in Java.util? 4. a) How can you do insert, delete operations in Double Linked List? b) Explain Skip Lists Implementation?

UNIT-III 1. What is disjoint set? Give the algorithm for Union and Find 2. Explain Realizing a Priority Queue using Heap? 3. a) Explain about balanced Search trees b) Explain insertion and Searching operations in AVL Trees? 4. a) Explain Comparison of Search Trees b) Explain about Red-Black Trees UNIT_IV 1. What is Hashing? Explain about hashing in java.util 2. a) Explain about Comparison of Searching methods b) Give the algorithm for Quick sort with example 3. Give the algorithm for Heap Sort with example 4. Explain Comparison of Sorting methods UNIT-V 1. Give the Kruskals Algorithm for Minimum cost Spanning trees, 2. Explain Graph traversals-DFS and BFS with one example 3. Give The Knuth-Morris-Pratt algorithm with example 4. Explain about Compressed Tries, Suffix tries.