DATA STRUCTURES (DS), B.E. Computer Science (CS), Semester 3, December 2010.

DATA STRUCTURES (DS), B.E. Computer Science (CS),

Semester 3, December 2010.

Con.5594-10

GT-6228

(3 Hours)

[Total Mark: 100]

N. B.: (1) Question no 1 is compulsory.

(2) Attempt any four questions from Q. Nos 2 to 7.

(3) Use diagram wherever necessary.

(4) Assume suitable data wherever required bust justify the same.

1. (a) Explain different types of data structure with example. --- (5 Marks)
(b) Write recursive Java Method that finds minimum and maximum values in an array of int values without using any loops. --- (5 Marks)
(c) Define: - --- (5 Marks)

1. Abstract Data Type
2. Binary Tree
3. Graph

(d) Write short note on Priority queue. Explain with example. --- (5 Marks)

2. (a) Write a program in Java to delete a node from the given binary search tree. Consider all cases. --- (10 Marks)
(b) Write a program in Java to perform insertion sort. --- (10 Marks)
Sort the following using insertion sort

10,

3,

8,

4,

2

3.(a) Construct binary Tree for the preorder and inorder traversal sequences Given below.---(10 Marks)

Preorder	:	ABDGCEHIF
Inorder	:	DGBAHEICF

(b) Write a program which will read a text and count all occurrences of particular word. --- (10 Marks)

4. (a) Write a program to reverse the circular linked list. --- (10 Marks)
(b) Hash the following in a table of size 11. Use any two collision resolution. Techniques. --- (10 Marks)

23,

0,

52,

61,

78,

33,

100,

8,

10,

90,

14

5. (a) Write a program in Java to create a doubly linked list and perform following Operations. ---- (12 Marks)

• Insert Into list
• Search for Data
• Delete from List
• Display

(b) What are different methods to represent graph in memory? What are applications of graph? --- (8 Marks)

6. (a) Write a program to implement conversion of a given number to its equivalent Binary form using stack. --- (10 Marks)
(b) Write a program in Java to read data form file. Read file name from command line. --- (10 Marks)

7. Write notes on: --- (20 Marks)
a) AVL Tree

b) Array Representation of linked list

c) Binary Search

d) Graph traversal algorithms

Also see Data structures question papers for May 2010