WorksheetsData Structures Minor-1
Total questions: 8
Worksheet time: 13mins
Name
Class
Date
1.
The postfix expression for the infix notation is
A+B*(C+D)/F+D*E
a)
AB+CD+FD+DE
b)
ABCD+*F/DE*++
c)
ABCD+*F/+DE*+
d)
ABCD+F*/+DE*
2.
The result for the postfix expression 10 5 + 60 6 / * 8 - is
a)
284
b)
142
c)
71
d)
213
3.
The best data structure to check the athematic expression has balanced parenthesis
a)
Tree
b)
Queue
c)
Stack
d)
List
4.
A Data Structure which perform delete an element from front is
a)
Stack
b)
List
c)
Queue
d)
Tree
5.
f(x)=4n5 + 3n3+6n2+9n+2
g(x)=6n6 If f(x)=O(g(n)), what is the n0 value starts from
a)
1
b)
3
c)
4
d)
2
6.
All data types are belongs to non primitive data types
a)
True
b)
False
7.
The application of the stack is --------------------
a)
Monitoring Traffic Signals
b)
Undo/Redo Operations
c)
Memory Allocation in computer
d)
Process Scheduling
8.
Single linked list has option to reverse traverse
a)
True
b)
False
100 %
