No. of Printed Pages : 4 Q.
5 What will be in the output screen if the following sequence
Roll No. .................. 180842/170842/ of operations are executed? (CO-4)
120842/30833 Push (a,s.); Push (b,s.);
Sem. - 4th Pop (); Push (c,s);
Branch : Computer Engg. a. Abc b. b
Subject : Data Structure using C c. ac d. acb
Q.6 Variable that stores the address of another variable is
Time : 3 Hrs. M.M. : 100 called (CO-1)
a. Pointer b. Array
SECTION-A
c. Stack d. Function
Note: Multiple Choice Questions. All questions are Compulsory.
(10x1=10) Q.7 Array is a ____ data structure. (CO-2)
Q.1 Find the postorder traversal of the binary tree shown a. Linear b. Non Linear
below. P (CO-5) c. Both of above d. None of the above
a. P Q R S T U V W X Q.8 PUSH operation in a already full stack may result in (CO-4)
Q R
b. W R S Q P V T U X A. Overflow a. Underflow
c. S W T Q X U V R P
S T U V b. Element will be inserted c. None of these
d. S T W U X V Q R P W X
Q.9 In infix to postfix conversion when an operand is read,
Q.2 To obtain a prefix expression, which of the tree traversals which of the following is done? (CO-5)
is used? (CO-5) a. It is placed on to the output.
a. Level-order traversal b. Pre-order traversal b. It is placed in operator stack
c. Post order traversal d. In-order traversal c. It is ignored
Q.3 Which of the following traversing algorithm is not used to d. Operator stack is emptied.
traverse in a tree? (CO-5) Q.10 Of the following choices, which operator has the lowest
a. Post Order b. Pre Order precedence? (CO-1)
c. All of the above d. Randomized a. ^ b. +
Q.4 When do you use a sparse array? (CO-2) c. / d. #
a. When there are unique elements in the array. SECTION-B
b. When the array has more occurrence to zero Note: Objective type Questions. All Questions are compulsory.
elements. (10x1=10)
c. When the data type elements differ. Q.11 The identifier whose value does not change during
execution of program is called ____ (CO-1)
d. When elements are sorted.
(1) 180842/170842/ (2) 180842/170842/
120842/30833 120842/30833
A
Q.12 For a linear array A(15, 16, 27 ____, 25). Find the total
number of elements. (CO-2) B C
Q.13 When the function calls itself it is called ____ (CO-1) D T E F
Q.14 Linked list is a ___ data Structure. (CO-3) Q.29 Give difference between sequential search and binary
Q.15 Node of a linked list contains ___ and ___ parts. (CO-3) search. (CO-6)
Q.16 Expand the term LIFO____ (CO-4) Q.30 Sort the following list of elements using bubble sort. Show
Q.17 Deletion operations in a Stack is called ___ (CO-4) result after each step. (CO-6)
Q.18 Give an example of sorting method which uses 16 15 12 19 18 50 17
partitioning. (CO-6) Q.31 Define the following terms (CO-5)
Q.19 Give the post fix notation of the given infix notation. A + B / a. Binary Tree
C - D. (CO-5) b. Balanced Binary Tree
Q.20 Each node of a binary tree can have at most ____ children. c. Complete Binary Tree
(CO-5) Q.32 Give the algorithm to insert an element in a array. (CO-2)
SECTION-C Q.33 Discuss the underflow and overflow conditions in Data
Note: Short Answer type Question. Attempt any twelve Structures? (CO-4)
questions out of fifteen Questions. (12x5=60) Q.34 Give the algorithm for evaluation of an expression? (CO-4)
Q.21 Explain the various types of data structures. (CO-1) Q.35 Discuss the following terms associated with a tree (CO-5)
Q.22 Give five differences between a Array and a Linked List. 1. Path 2. Level
(CO-3) 3. Degree of a Node 4. Terminal Node
Q.23 Explain linear and non linear data structures. (CO1) 5. Root Node
Q.24 Give algorithm for adding a element in the beginning of the SECTION-D
linked list. (CO-3)
Note: Long Answer Type Questions. Attempt any Two
Q.25 Define Array. Give algorithm for traversing an array.(CO-2) Questions out of three Questions . (2x10=20)
Q.26 Give algorithm for deleting an element form the stack.
Q.36 What are different types of Arrays? Explain how element
(CO-4)
of arrays are stored in memory? (CO-2)
Q.27 What is the limitation of a linear queue. How is it removed.
Q.37 Explain binary search technique with suitable example?
(CO-4)
Give algorithm. (CO-6)
Q.28 Give inorder, postorder and preorder traversal of the
following tree. (CO-5) Q.38 Convert the following expressions into postfix notation
using Stack. (CO-4)
A+ B * C + D / E - F
(3) 180842/170842/ (4760) (4) 180842/170842/
120842/30833 120842/30833
