Name. ……………………………….

Student ID: ……………………….… Printed Pages 02

School of Electrical, Electronics and Communication Engineering
End Term Examination (ETE) , December 2015, Semester: Fall/Odd 2015-16
B. TECH. (Electronics and Communication Engineering) III Semester, IIYear
Course Title: Data Structure Using C Max Marks: 100
Course Code: ECE-211 Time: 03.00 hrs.
Instructions: 1. All questions in Section A, B and D are compulsory.
2. Attempt any four question from section C.
3. Assume missing data suitably, if any.
Section A
1. a) What is the data structures used to perform recursion? 1
(A) QUEUE (B) TREE (C) LINK LIST (D) STACK
b) In a graph if E=(u,v) means ...... 1
(A) u is adjacent to v but v is not adjacent to u (B) e begins at u and ends at v
(C) u is processor and v is successor (D) Both b and c
c) Select the correct statements. 1
If f(n) = 3n2 + 4n +2 then
1) f(n) = O(n2) 2) f(n) = Ω(n2) 3) f(n) = Θ(n2)
(A) 1 & 2 & 3 (B) 2 & 3 (C) 1 & 3 (D) 1 & 2
d) There are 4 different binary trees with 8, 15, 13, 14 nodes respectively. Which of them could 1
have formed a full binary tree?
(A) Tree with 15 node (B) Tree with 13 node (C) Tree with 8 node (D) Tree with 14 node
2. a) Differentiate between Data structure and Data types with example. 3
b) Discuss the advantages and disadvantages of Array and Linked list. 3
Section B
3. a) Consider the following arithmetic expression P, written in postfix notation : 5
P: 12 , 7 , 3 , - , / , 2 , 1 , 5 , + , * , +
Translate P into infix expression (Show the intermediate steps of translation process). Give the
equivalent prefix expression also.
b) What do you mean by Threaded binary tree? What is the use of Threaded binary tree? 5
c) Define following terms with example in context of Graph: 5
(i) Path (ii) Degree of a node (iii) Cycle (iv) Loop (v) Neighbors
d) Write the pseudo code for Insertion sort. 5
Section C
4. a) Write the algorithm to perform PUSH and POP operation on a stack being implemented using array. 5
b) Write the algorithm for converting infix expression to postfix expression. 5
5. a) Consider the 2-dimensional array U (-10:10)(11:20) with Base (U) = 400 . 5
(i) Find the number of elements in array.
(ii)Assuming w = 4 words per memory cell for U. Find the address of U[5][15] in row major order
and column major order.
b) Assuming two 2-dimensional arrays A & B of dimension m*m, write the algorithm for the 5
Addition of matrices A & B and storing the result in matrix C. Draw flow chart also.

Page 1 of 2
6. a) How can a binary tree be represented using an array? Write the array representation for 5
the following tree.

b) Define the following terms with example in context of a General Tree. 5

(i) Sibling (ii) Parent (iii) Depth (iv) Leaf (v) Ancestor
7. a) What is an adjacency matrix? What are the different ways for implementing it? 5
b) Write the Algorithm for Depth First Search Traversal and explain it with suitable example. 5
8. a) Write the algorithm for binary search and explain it with appropriate example. 5
b) Sort the following list using Heap Sort 5
66, 33, 40, 20, 50, 88, 60, 11, 77, 30, 45, 65.
Sections D
9. a) Why do we use asymptotic notation in the study of algorithm? Describe commonly used asymptotic 8
notations and give their significance.
b) Traverse the given tree using In-order, Pre-order and Post-order traversals. 7

10. a) Define following terms with example :- (i)Directed Graph (ii)Bi-Graph (iii)Weighted Graph 6
b) Write a procedure to display and count all the nodes of a singly linked list. 4
c) What is a Priority Queue? What are its types? Explain. 5
*****************

Page 2 of 2