JNTU R6-R7 MCA-II Semester Supplementary Examinations DATA STRUCTURES (THROUGH JAVA) August 2009 Question Paper | Indian Shout

You are here: » JNTU R6-R7 MCA-II Semester Supplementary Examinations DATA STRUCTURES (THROUGH JAVA) August 2009 Question Paper

JNTU R6-R7 MCA-II Semester Supplementary Examinations DATA STRUCTURES (THROUGH JAVA) August 2009 Question Paper


R6-R7
Code No: 32002
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

MCA-II Semester Regular Examinations, August 2009

DATA STRUCTURES (THROUGH JAVA)


Time : 3hours       Max.Marks:60
Answer any FIVE questions
All questions carry equal marks

– – –

1. a)  Explain the concept of dynamic method dispatch. Illustrate with suitable program.
b)  Give a note on “Super’ Keyword.

2. a)  What is the role of CLASSPATH variable in Java packages. Explain.
b)  What is a thread? Discuss about multithreading.

3.a)  Explain the asymptotic notation of performance analysis.
b)  Discuss the concept of ADT.

4.a)  Explain the concept of Dequeue.
b)  Discuss the applications of stacks.

5.a) Describe the data structures for  representing binary trees.(8M)
b)  List the advantages and disadvantages of Breadth First search graph traversal.
(4M)

6.a)  Explain insertion operation in to AVL search tree.
b)  Make comparison between AVL trees and B- trees.

7.a)  Discuss linear search with an example.
b)  Explain bucket addressing.
c)  Describe bubble sort technique.

8.a)  Differentiate between a tree and a trie . Quote suitable example.(4M)
b)  Explain Huffman coding algorithm for text compression.(8M)

ilook website
 
 

Categories:MCA;Tags: , ,

   

No Comment to “JNTU R6-R7 MCA-II Semester Supplementary Examinations DATA STRUCTURES (THROUGH JAVA) August 2009 Question Paper”

  1. No Comment yet. Be the first to comment...
Leave your comment here: