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
 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
 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
 No. of Printed Pages : 4 Q.10 LIFO stands for_______. (CO3)
Roll No. .................. 170842/120842
SECTION-B

4th Sem. / Computer Note: Very Short answer type questions. Attempt any
ten questions out of twelve questions. (10x2=20)
Subject : Name: Data Structures using C
Q.11 Differentiate between variable and constant.
Time : 3 Hrs. M.M. : 100
(CO3)
SECTION-A Q.12 What do you mean by top down design.
Note:Objectives type questions. All questions are (CO2)
compulsory. (10x1=10) Q.13 What is meant by heap. (CO4)
Q.1 Data structure means_______. (CO2) Q.14 Write down two applications of stacks. (CO3)
Q.2 Define data type. (CO3) Q.15 What are circular queues. (CO3)
Q.3 Define the terms siblings. (CO5) Q.16 Give the use of recursion. (CO2)
Q.4 Write the use of pointers. (CO3) Q.17 Write the purpose of avail list in a linked list.
Q.5 Tree is a _______data structure (liner/nonliner). (CO3)
(CO5) Q.18 Define structured programming. (CO2)
Q.6 Define leaf node. (CO5) Q.19 Name any three operations performed on linked
Q.7 An array may be a collection of similar data list. (CO3)
(True/false). (CO3) Q.20 Define path of a tree. (CO5)
Q.8 What is meant by an index of an array.(CO3) Q.21 Name three sorting algorithms. (CO6)
Q.9 Variable that stores the address of another Q.22 Define binary search. (CO6)
variable is called_____. (CO3)
(1) 170842/120842 (2) 170842/120842

www.hsbteonline.com
 SECTION-C SECTION-D
Note:Short answer type questions. Attempt any eight Note:Long answer type questions. Attempt any three
questions out of ten questions. (8x5=40) questions out of four questions. (3x10=30)
Q.23 Write the applications of linked list. (CO3) Q.33 Explain in detail various operations associated
with linked list. (CO3)
Q.24 Explain in brief various types of arrays. (CO3)
Q.34 Write a program in C for multiplication of two
Q.25 Differentiate between stack and queue. (CO3)
matrices. (CO1)
Q.26 Differentiate between prefix and postfix
Q.35 Discuss the quick sort algorithm with an
expression. (CO3)
example. (CO6)
Q.27 Write an algorithm to PUSH an element into the
Q.36 Write short note on the following: (CO3)
stack. (CO1)
(a) Doubly linked list.
Q.28 Write a program to print factorial of a number
using recursion. (CO2) (b) Application of queues.
Q.29 When does underflow condition comes in data
structure. (CO3)
Q.30 What is meant by complete binary tree. (CO5)
Q.31 Differentiate between linked list and
array.(CO3)
Q.32 Write an algorithm to delete an element from
array. (CO1)

(3) 170842/120842 (1980) (4) 170842/120842

www.hsbteonline.com
 No. of Printed Pages : 4 Q.9 Give the post fix notation of the given infix
Roll No. .................. 170842/120842/30833 notation. A +B / C - D (CO-4)
Q.10 Each node of a binary tree can have at most
4th Sem. / Trade : Computer Engg. ______________ children. (CO-5)
Subject : Data Structure using C SECTION-B
Note: Very Short answer type questions. Attempt any
Time : 3 Hrs. M.M. : 100 ten parts 10x2=20
SECTION-A Q.11 Define Algorithm (CO-1)
Note:Objectives questions. All questions are Q.12 Name any four linear data Structures (CO-1)
compulsory (10x1=10) Q.13 Define linked list. (CO-3)
Q.1 The identifier whose value does not change Q.14 What are the various operations that can be
during execution of program is called ________ performed on an Array. (CO-2)
(CO-1)
Q.15 Give the formula for calculating the address of
Q.2 For a linear array A [15, 16, 27, ..............., 25], an element in column Major form
Find the total number of elements. (CO-2) representation of array. (CO-2)
Q.3 When the function calls itself it is called Q.16 Give the node structure of a linked list. (CO-3)
____________ (CO-4)
Q.17 Define Queue. (CO-4)
Q.4 Linked list is a ___________ data Structure.
(CO-3) Q.18 Give two applications of a stack. (CO-4)
Q.5 Node of a linked list contains _________ and Q.19 Define Complete Binary Tree. (CO-5)
____________ parts. (CO-3)
Q.20 Define Degree of a Tree (CO-5)
Q.6 Expand the term LIFO __________ (CO-4)
Q.21 What is the precondition for performing binary
Q.7 Deletion operation in a Stack is called search operation on a given list of elements.
_______________ (CO-4) (CO-6)
Q.8 Give an example of sorting method which uses Q.22 What are the advantages of Doubly Linked List.
partitioning. (CO-6) (CO-3)
(1) 170842/120842/30833 (2) 170842/120842/30833

www.hsbteonline.com
 SECTION-C Q.31 Give differences between sequential search
and binary search. (CO-6)
Note:Short answer type questions. Attempt any eight
questions. 8x5=40 Q.32 Sort the following list of elements using bubble
sort. Show result after each step. (CO-6)
Q.23 Explain the various types of data structures.
(CO-1) 6 10 2 9 1 5 7
Q.24 Give five differences between a Array and a SECTION-D
Linked List. (CO-2)
Note:Long answer type questions. Attempt any three
Q.25 Explain linear and non linear data structures. questions. 3x10=30
(CO-1)
Q.33 What are different types of Arrays? Explain how
Q.26 Give algorithm for adding a element in the element of arrays are stored in memory?
beginning of the linked list. (CO-3) (CO-2)
Q.27 Define Array. Give algorithm for traversing an Q.34 Explain Sequential search technique with
array. (CO-2) suitable example? Give algorithm. (CO-6)
Q.28 Give algorithm for deleting an element form the Q.35 Convert the following expressions into postfix
stack. (CO-4) notation using Stack (CO-4)
Q.29 What is the limitation of a linear queue. How is it A + B * C + D / E -F
removed. (CO-4)
Q.36 Write short note on (CO-1)
Q.30 Give inorder, postorder and preorder traversal
of the following tree. (CO-5) a) Structured programming
b) Tower of Hanoi
A

B C

D E F

(3) 170842/120842/30833 (3120) (4) 170842/120842/30833

www.hsbteonline.com
 No. of Printed Pages : 4 j) Write one difference between static and
Roll No. .................. 120842 dynamic memory allocation.
k) Write the purpose of avail list in a linked list.
4th Sem. / Computer
Subject : Data Structure Using C l) What is under flow?
m) What do you mean by searching.
Time : 3 Hrs. M.M. : 100
n) Define complexity of an algorithm
SECTION-A o) Why tree structure is known as a non-linear
Note:Very Short Answer type questions. Attempt any data structure?
15 parts. (15x2=30) p) Give formula to calculate the size of one
Q.1 a) Define primitive data structure. dimensional array.
b) Various that stores the address of another q) What is the significance of top in stacks.
variable is called _____________. r) Define column major order.
c) FIFO stands for ____________.
d) “Two dimensional array has two subscript”. SECTION-B
This statement is true or false.
Note: Short answer type questions. Attempt any ten
e) Deque stands for __________ parts 10x4=40
f) What is root node. Q.2 i) Write short note on:
g) Define height of a tree. a) Top down approach.
h) What is the use of header node. b) Bottom up approach.
i) “The last node of circular linked list contains ii) Distinguish between data structure and
the address of first node”. This statement is data type.
true or false.
(1) 120842 (2) 120842
iii) Give the post order expression of A*B+C/D. SECTION-C
iv) How elements of a queue can be removed . Note:Long answer type questions. Attempt any three
questions. 3x10=30
v) Explain various types of trees.
Q.3 Explain heap sort along with its algorithm.
vi) Differentiate between linear search and
binary search. Q.4 Explain how you will search an element from
binary search tree.
vii) Write down the representation of linked list
in memory. Q.5 What is recursion? Write an algorithm to find
factorial of a no. using recursion.
viii) What do you mean by variable. Explain the
difference between local variable and Q.6 Describe the various operations performed on
global variable. data structure.
ix) Explain dequeue in brief Q.7 Differentiate between the following.
x) What is bubble sort. Write its advantages i) Iteration and recursion
and disadvantages .
ii) Linear data structure and non-linear data
xi) Write down the post order tree traversal structure.
algorithm.
xii) What are binary search trees? Write down
its properties. Also give its advantage.
xiii) How an element is deleted from a doubly
linked list. Explain with an example.
xiv) What is doubly linked linked list. What are
its applications.
xv) How two dimensional array are stored in
memory.
(3) 120842 (2060) (4) 120842