Jawaharlal Nehru Technological University Hyderabad 2010-2nd Sem M.C.A -ester Supplementary s DATA STRUCTURES (through JAVA) - Question Paper

Code No: 32002
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA-II Semester Supplementary exams July 2010
DATA STRUCTURES (through JAVA)
Time: 3hours Max.Marks:60
ans any 5 ques.
All ques. carry equal Marks
- - -
1. Write short notes on the subsequent
a) Dynamic Method Dispatch
b) Member Access Rules
c) Interfaces and abstract classes
2.a) What is a Thread? discuss its Life Cycle?
b) discuss and implement how to create User-defined Exception class with an example
program?
3.a) What is Pseudo-code? define in Pseudo-code how to insert an element at the
beginning of Doubly Linked List?
b) discuss in detail various ways of analyzing algorithms?
4. What is Queue? discuss the methods of Queue ADT? Write the code-fragments for
Array-based java implementation of the Queue?
5. Write Pseudo-code for the Pre-order, Post-order, In-order traversal of the sub-tree
rooted at node 'V'?
6.a) describe and discuss AVL trees with an example?
b) Draw the order-7 B-Tree resulting from inserting the subsequent keys (in this order)
into an initially empty Tree T:
4, 40, 23, 50, 11, 34, 62, 78, 66, 22, 90, 59, 25, 72, 64, 77, 39, 12
7.a) Write an algorithm for java Implementation of Merge Sort?
b) What is hash-code? Compare and contrast insertion sort, merge sort, quick sort and
Radix-sort?
8.a) Write Huffman-Coding – Algorithm?
b) Write Knuth-Morris-Pratt algorithm for trend matching?

Earning:   Approval pending.