1
What is a data structure?
Correct Answer
A way to store and organize data
☑ MCQ PRACTICE
Data Structures Unit 1
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Data Structures - Unit-1
2
Which data structure is used for implementing recursion?
Correct Answer
Stack
3
Which data structure is needed to convert infix notation to postfix notation?
Correct Answer
Stack
4
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
Correct Answer
Stack
5
In linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
Correct Answer
Pointer to node
6
Which of these is not an application of a linked list?
Correct Answer
Random Access of elements
7
Which of the following real world scenarios would you associate with a stack data structure?
Correct Answer
piling up of chairs one above the other
8
What does ‘stack underflow’ refer to?
Correct Answer
removing items from an empty stack
9
Array implementation of Stack is not dynamic, which of the following statements supports this argument?
Correct Answer
space allocation for array is fixed and cannot be changed during run-time
10
In linked list implementation of a queue, where does a new element be inserted?
Correct Answer
At the tail of the link list
11
In a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
Correct Answer
Only rear pointer
12
In a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
Correct Answer
Both front and rear pointer
13
In linked list implementation of a queue, from where is the item deleted?
Correct Answer
At the head of link list
14
In a queue, the important condition for a queue to be empty is?
Correct Answer
FRONT is null
15
The elements of a linked list are stored
Correct Answer
Anywhere the computer has space for them
16
The prefix form of A-B/ (C * D ^ E) is?
Correct Answer
-A/B*C^DE
17
The type of expression in which operator succeeds its operands is?
Correct Answer
Postfix Expression
18
In infix to postfix conversion algorithm, the operators are associated from?
Correct Answer
left to right
Fill in the Blanks
19
__________ form of access is used to add and remove nodes from a queue.
Correct Answer
FIFO, First In First Out
20
New nodes are added to the __________ of the queue
Correct Answer
REAR
21
The term push and pop is related to __________
Correct Answer
Stacks
22
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as __________
Correct Answer
Queue
23
A stack, if implemented using an array of size MAX_SIZE, stack gets full when __________
Correct Answer
TOP = MAX_SIZE – 1
24
Convert the following infix expressions into its equivalent postfix expressions (A + B * D)/(E – F)+G __________
Correct Answer
A B D * + E F – / G +
25
In a stack, if a user tries to remove an element from an empty stack it is called __________
Correct Answer
Underflow
26
What is the value of the postfix expression 6 3 2 4 + – *?
Correct Answer
-18