Jawaharlal Nehru Technological University Hyderabad 2007 M.C.A Computer Aplications DATA STRUCTURES (THROUGH JAVA) Y- - Question Paper

R6
Code No: 21/MCA(R6)
M.C.A II-Semester Examinations, July-2007.
DATA STRUCTURES (THROUGH JAVA)
Time: three hours Max.Marks: 60
ans any 5 ques.
All ques. carry equal marks
--------

1. a) define string handling operations of JAVA with your own example.
b) define the basic features of JAVA.

2. a) What is inheritance? describe it. discuss the method of overriding.
b) Explain about multiple inheritance in interfaces.

3. a) Write an algorithm that converts the provided infix expression into prefix expression.
b) What are the advantages of priority queues? Write an algorithm to implement them.

4. Define the subsequent with your own examples:
(a) Tree (b) Binary tree (c) Skewed tree
(d) Complete Binary tree (e) Full Binary tree (f) Heap tree
(g) AVL tree (h) Binary Search tree (i) B-tree

5. a) Define a graph. How it is various from a tree. Write an algorithm for adjacency matrix
representation of graphs.
b) Write an algorithm to insert a new data element in a binary search tree.

6. a) Write an algorithm to implement radix sort.
b) Compare searching and sorting methods with respect to – time and space complexities.

7. a) Describe KMP algorithm.
b) Explain about standard and compressed tries.

8. Write short notes on the following:
(a) Collision handling schemes of Hashtables
(b) multiple threads
(c )stacks
(d) text compression

Earning:   Approval pending.