No. of Printed Pages : 4 Q.

6 When the function calls itself it is called ______

Roll No. .................. 180842/170842/ (CO-3)
120842/30833 a) Self Declaration b) Non-Recursion
4th SEM / Computer Engg. c) Recursion d) None
Subject : Data Structure Using C Q.7 What is the value of top, if there is a size of
Time : 3 Hrs. M.M. : 100 stack, Stack_Size is 5? (CO-2)
SECTION-A a) 5 b) 6
Note:Multiple choice questions. All questions are c) 3 d) 4
compulsory (10x1=10) Q.8 ______ is a pile in which items are added at one
Q.1 Variable that stores address of another end and removed from the other. (CO-3)
variable_____ (CO-3) a) Array b) Stack
a) Pointer b) Array c) Queue d) Tree
c) Function d) Stack Q.9 A doubly linked list has _______ pointers with
Q.2 Array is a _______ data structure. (CO-2) each node. (CO-3)
a) Linear b) Non-Linear a) 1 b) 2
c) Both d) None c) 3 d) 4
Q.3 Binary trees with threads are called as Q.10 Binary Search is applied to the ________ list of
________ (CO-5) elements. (CO-6)
a) Special trees b) Pointer trees a) Sorted b) Unsorted
c) Threaded trees d) None c) Both d) None
Q.4 A linear list in which the last node points to the SECTION-B
first node is _______ (CO-3) Note: Objective type questions. All questions are
a) singly linked list b) doubly linked list compulsory. 10x1=10
c) circular linked list d) None Q.11 What is Bubble Sort? (CO-4)
Q.5 POP operation in empty stack may result in Q.12 What do you mean by Traversing? (CO-2)
overflow. (CO-3) Q.13 What is purpose of Rear in Queue? (CO-3)
a) True b) False Q.14 Define Doubly Linked list. (CO-3)
(1) 180842/170842/ (2) 180842/170842/
120842/30833 120842/30833
Q.15 The operation that combines the element of A Q.28 Differentiate between Array and Linked List with
and B in a single sorted list C is called ________ example. (CO-3)
(CO-4) Q.29 Write short note on Full Binary Trees. Complete
Q.16 Give prefix notation of A+B-C/D (CO-3) Binary Tree and Extended Binary Tree. (CO-5)
Q.17 The identifier whose value remain fixed during Q.30 Explain terms used in Queue. (CO-2)
execution of program is called _______ (CO-1) Q.31 Construct Binary Search Tree of 20, 55, 60, 30,
Q.18 Define Stack. (CO-2) 70, 90, 80, 95. Assume root node 60. (CO-5)
Q.19 What is height of a tree? (CO-5) Q.32 Explain Selection Sort. (CO-4)
Q.20 Give formula to calculate the size of one Q.33 Explain the various data structure operations.
Dimensional Array. (CO-1) (CO-1)
SECTION-C Q.34 What is variable? Difference between local and
global variable. (CO-1)
Note:Short answer type questions. Attempt any
twelve questions out of fifteen questions. Q.35 What is the purpose of avail list and null pointer
12x5=60 in linked list? (CO-3)
Q.21 What is Primitive and Non Primitive Data SECTION-D
structure? Explain any two Non Primitive Data Note:Long answer type questions. Attempt any two
Structures. (CO-1) questions out of three questions. 2x10=20
Q.22 What do you mean by traversal of a Tree? Q.36 List Various Searching Techniques. Compare
Explain in detail with example. (CO-5) them and write algorithm of anyone. (CO-6)
Q.23 Write down algorithm for Binary Search. (CO-6) Q.37 What is Array? What are the different operations
that are performed on Array? Write algorithm of
Q.24 Explain Circular queue with example. (CO-3)
any one operation on Linear Array. (CO-1)
Q.25 What is doubly linked list? Explain with Q.38 Convert the following expression into postfix
algorithm and example. (CO-3) notation using stack with algorithm CO-3)
Q.26 When underflow and overflow condition comes (A + B) * C - (D - E) * (F + G)
in Data structures. (CO-2)
(Note: Course outcome/CO is for office use only)
Q.27 Write algorithm for insertion and deletion of an
element in queue. (CO-3)

(3) 180842/170842/ (3340) (4) 180842/170842/

120842/30833 120842/30833