Rajasthan Technical University 2009-6th Sem B.Tech Electrical Engineering : (- ) Data Structure in C - Question Paper
Rajathan tech. University
Electrical Engineering
(B.Tech. - semester 6)
2009
Data Structure in C
Roll No.
Total No. of Questions : 1,01 [Total No. of Pages : 2
B.Tech. VI tli Semester (Main/Back) Examination - 2009t
Electrical Engineering Data Structures in C 6E3113
Time : 3 Hours Maximum Marks : 80
Min. Passing Marks : 24
Instructions to Candidates:
Attemjit overall Five Questions selecting one question from each unit. All questions cany equal marks. (Schematic diagrams must be shown wherever necessary. Any data you feci missing may suitably be assumed and slated clearly Units of quantities used; calculated must be stated clearly.)
UNIT-I
1. a) What do you mean by space complexity? Write an algorithm to insert a
new element in a circular linked list.
tyf What do you mean by theta notation? Write an algorithm to delete an item from doubly linked list. .
2. a) Explain row major ordering of a 2 dimensional array. Give the significance
of omega notation. '
b) Write an algorithm to delete an element from a circular linked list. Why do tw
you use header in a linked list?
UNIT-II
3. a) Explain the array implementation of sparse matrix.
b) Explain the transpose of a matrix with 'a suitable example.
4 jx) What do you understand by tridiagonal and triangular matrices? Explain with examples.
fcr) Explain the column major ordering of an array. What do you understand by irregular 2D array?
UNIT-III
5. a) Write an algorithm to delete an item from a circular queue/
b) Explain the problem of paranthesis matching. How do you solve it with
)
I
6. ; Write an algorithm to insert an item in a queue f
F:\plain the problem of tower of Hanoi. How do you solve it with stack?
7. Fxplain the post order traversal of a binary tree with a suitable example.
I seit the following in AVL tree :
27, 3, \% 03, 23, 49, 7. 603, 28, 10'
8. a) What do you understand by B tree? Explain with a suitable example, b) Prim the values after pre order traversal of the following binary tree.
L
/
K p
UNIT - V
1L fa) What do you understand by quick sort? Apply it on the following -
>C?
23, 49, 17, 453, 64,. 18, 2, 29, 400, 95.
Write an algorithm for single source shortest path problem.
10. a) Explain merge sort. How is it better with databases?
b) Write and explain BF5 algorithm. State the differences between insertion and selection sort.
(2)
6E3113
|
Attachment: |
| Earning: Approval pending. |
