Gujarat University 2007 B.E Computer Engineering-Data structure & Algorithm - Question Paper
2/867 (9 y> Candidates Seat No __
GUJARAT UNIVERSITY B. E. Sem III (C.E.) (New) Examination Data Structure & Algorithm Thursday, 3rd January, 2008] [Time : 3 Hours
w . Max. Marks : 100
* - ..4
Instructions : (1) Attempt all questions. -
(2) Answer to the two sections must be written in separate answer books.
(3) Assume suitable data if required.
(4) Figures to the right indicate fiill marks.; ->s
!
SECTION I
:;s'
1 (a) Write an algorithm to insert a node into linked list at last position. [6 J
(b) Explain various operation of circular queue. [6]
(e) Create binary search tree for following value. |6j
15,25,30,5,10,8,32,34,7,6,28.
2 (a) Trace bubble sort for following values. [7 j
(b) What is searching ? Write a program for binary search. [7]
OR
2 ( a) Define heap tree. Explain creation of heap tree with example. [ 71
(b) Explain radix sort with example. | 7]
l
3 Attempt any three. [18]
(a) Convert following General tree into binary tree.
(b) Write a short note on threaded binary tree.
(c ) Convert following expression into prefix notation,
(i) p + (q + r)*s (ii) p A q * r \ s (iii) (p + q) \ r * s.
(d) Write an algorithm for checking balanced parenthesis of e*pression.
(e) Write a short note on priori I v queue. p j q
4 (a) Define : i) Graph ii) Weighted Graph iii) Sparse matrix
iv) Reachability matrix ' " [8]
(b) What is traversal ? Which are various traversal method of tree. Explain any one with example.. [5]
(c) Write a recursive and nonnrecursive program for finding factorial of
given number . Which is better one ? How? [5]
5 (a) Write and explain shortest path algorithm. [7]
(b) Write a recursive program to create binary tree. [73
5 (a) Explain weight balance tree with example. [7}
(b) What is hash collision? Explain various bash collision resolution
techniques. [7]
6 Attempt any three of following question. |18]
(a) Write a DFS traversal algorithm.
(b) Draw DFS traversal for following graph.
(d) Explain procedure to find path matrix from adjacency matrix with example.
(e) Write an algorithm for addition of two polynomials.
|
Attachment: |
| Earning: Approval pending. |
