249

BE II EXAMINATION APRILRMAY,2009
COMPUTER ENGG/INFORMATION TECHNOLOGY
2C0202/21T402 .
DATA STRUCTURE USING C
Duration: 3Hrs Max Marks: 100
Min Marks: 35
NOTE: - There are total five questions. All of these questions are
compulsory. There are three subparts in each of the questions, attempt
any two subparts out of three. Assume C/C++ as the programming
language for writing the programs.

01 (A) Explain various dynamic allocation techniques in detail. '-'.. .-

1'0
(8) Calculate the time complexity of the Merge sort algorithm. Sort the following data 10
using Merge Sort: -
210,4,5,6,11,567,23,54,56,1 0,29,30,42,333,1000,90,654,2345,1
(C) Write a program to implement Linked List using structures and pointers as features 10
available in C. in this program, implement the following functions-
InsertAfter, DeIeteAfter, InsertAtHead, DeleteAtHead,Traversal
02 (A) Why stack is considered to be LIFO structure? Explain whether stack can be 10
implemented using queue. Write an algorithm for the same.
(8) What is meant by recursion? How recursion can be eliminated from the recursive 10
programs? Explain this with an example.
(8) Write an algorithm to translate an arithmetic expression given in infix notation into 10
postfix notation. Translate the following infix expression into corresponding postfix
one: -
1 O+W*E/R*T$Y$u$i$(O+P) *A+S-D$F$G
2 Z +X-C*V$ b$n$m *I*k+j $h$g* (f+d*s+a)
03 (A) What is meant by priority queue? Write a program to implement it using linked list. 10
(8) Write a program to implement queue using static implementation. 10
(C) 1 Explain the contents of circular queue on each step for the following data and 05
operations: -
10,12,32,del,dei,34,45,56,76,54,43,del,90,09, 13,del,del,del
2 How a circular queue can be traversed? Explain this with an example. 05
Q4(A)1 Define tree as data structure and describe its various applications. 05
2 Differentiate between AVL tree and binary search tree with an example 05
(8) Explain the three different traversals techniques of binary tree with algorithms. 10
(C) What is meant by murtiway search tree? Differentiate between B-tree, B+-tree and 10
B'-tree by considering the different types of applications of them.
05(A) Write short notes on following (any two) 10
1 Difference between search and traversal for graph
2 Difference between matrix implementation and list implementation of graph
3 Difference between breadth first search and depth first search of graph
(8) Define the following: - 10
1 Forest
2 Articulation point
3 Connected component
4 Directed graph
5 Connected graph
(C) Write an algorithm to determine minimum spanning tree from a weighted 10
connected graph.
**********************************