No. of Printed Pages : 4 Q.
6 Before inserting into stack one most check the
Roll No. .................. 180842/170842/ condition______ (CO3)
120842/30833 a) Overflow b) Underflow
4th Sem./ Computer Engineering c) Maximum elements d) Existing elements
Q.7 A linear list in which the pointer points only to the
Subject : Data Structure Using C successive node is_____ (CO2)
Time : 3 Hrs. M.M. : 100 a) singly linked list b) doubly linked list
SECTION-A c) circular linked list d) None
Note:Multiple choice questions. All questions are Q.8 Operations on a data structure may be (CO1)
compulsory (10x1=10) a) Creation b) Selection
Q.1 _________is the example of non linear data c) Deletion d) All of the above
structure. (CO2) Q.9 Array must be declared before it is used. (CO2)
a) Array b) Stack a) True b) False
c) Queue d) Tree Q.10 The way in which the data items are logically
Q.2 Minimum number of fields in each node of a arranged is called______. (CO3)
doubly linked list is_____ (CO3) a) Data structure b) Data type
a) 1 b) 2 c) Storage Structure d) All of the above
c) 3 d) 4 SECTION-B
Q.3 The smallest element of an array’s index is Note: Objective Completion type questions. All
called its (CO2) questions are compulsory. (10x1=10)
a) extraction b) range Q.11 Define Queue. (CO2)
c) lower bound d) upper bound Q.12 What is Binary Search? (CO6)
Q.4 Deletion operation in stack is known as______ Q.13 The identifier whose value does not remains
a) Push b) Pop (CO2) constant during execution of program is
c) Front d) None called_______ (CO1)
Q.5 Node with no Children is called______ (CO5) Q.14 What is the formula of Length of Array? (CO2)
a) Terminal b) Non Terminal Q.15 What is root node? (CO5)
c) Root d) Sibling Q.16 Define Recursion. (CO5)
(1) 180842/170842/ (2) 180842/170842/
120842/30833 120842/30833
Q.17 Define Linked List. (CO3) Q.30 What do you mean by Data structure? Explain
Q.18 Give postfix notation of A+B-C/D. (CO2) the various data structure operations. (CO1)
Q.19 In a queue, the initial values of front pointer Q.31 Explain terms used in Queue. (CO2)
f rare pointer r should be ____and____ (CO2) Q.32 How can Linked list overcome the limitations of
Q.20 What is two Dimensional Array? (CO1) array? (CO2)
SECTION-C Q.33 Define the terms in binary tree: Path, Sibling,
Note: Short answer type questions. Attempt any twelve Level of a node Height of Tree. (CO5)
questions out of fifteen questions. (12x5=60) Q.34 Explain Bubble Sort. (CO4)
Q.21 What is Singly linked list? Explain with algorithm Q.35 Why Stack is known as LIFO? What is the
and example. (CO3) significance of TOP pointer? (CO2)
Q.22 What is Binary Search Tree? Write down its SECTION-D
properties. (CO5) Note:Long answer type questions. Attempt any two
Q.23 Explain Preorder, Postorder and Inorder questions out of three questions. (2x10=20)
traversal with example. (CO2) Q.36 Convert the following expression into postfix
Q.24 Explain Linear queue with example? What are notation using stack with algorithm (CO2)
its disadvantages? (CO2) (A + B * (C- D)) / E
Q.25 Write algorithm for insertion and deletion of Q.37 What do you mean by Sorting? Explain why it is
element in stack. (CO2) required. Also name some sorting algorithms
Q.26 Explain linear and Non Linear Data Structures. and explain. (CO4)
(CO1) Q.38 What is an array? What are types of array?
Q.27 Write the difference between Static and Explain how elements are stored in memory ?
Dynamic Memory allocation. (CO1) (CO3)
Q.28 Construct a binary tree whose node are as
under (Co5)
Preorder: A B D G H C E F I K J
Inorder : B G H D A E C I K F J
Q.29 Write down algorithm for Linear Search. (CO6)
(3) 180842/170842/ (1040) (4) 180842/170842/
120842/30833 120842/30833
