Data Structure Set 5
On This Page
This set of Data Structure DS Multiple Choice Questions & Answers (MCQs) focuses on Data Structure Set 5
Q1 | Linked list uses
- random memory allocation
- static memory allocation
- fixed memory allocation
- dynamic memory allocation
Q2 | Standard approach for implementation of a list is/are of
- 1 type
- 2 type
- 3 type
- 4 type
Q3 | First link node of list is accessed from a pointer named
- tail
- head
- terminator
- initiator
Q4 | A linked list is made up of a set of objects known as
- nodes
- arrays
- entities
- instances
Q5 | How do you calculate the pointer difference in a memory efficient double linked list?
- head xor tail
- pointer to previous node xor pointer to next node
- pointer to previous node – pointer to next node
- pointer to next node – pointer to previous node
Q6 | A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
- circular queue
- random of queue
- priority
- dequeue
Q7 | Which of the following name does not relate to stacks?
- fifo lists
- lifo list
- piles
- push-down lists
Q8 | A data structure where elements can be added or removed at either end but not in the middle is called …
- arrays
- stacks
- queues
- deque
Q9 | The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
- ab + cd∗e − fg /∗∗
- / ab + cd ∗ e − f ∗∗g /
- ab + cd ∗ e − ∗f ∗ g /
- ab + cde ∗ − ∗ f ∗ g /
Q10 | What is the postfix form of the following prefix expression -A/B*C$DE ?
- abcde$*/-
- a-bcde$*/-
- abc$ed*/-
- a-bcde$*/
Q11 | The data structure required to evaluate a postfix expression is
- queue
- stacks
- array
- linked-list
Q12 | What is the postfix form of the following prefix:*+ab–cd
- ab+cd–*
- abc+*–
- ab+*cd–
- ab+*cd–
Q13 | A queue is a,
- fifo (first in first out) list
- lifo (last in first out) list
- ordered array
- linear tree
Q14 | In stack terminology, the __________operations are known as push and pop operations respectively.
- delete
- insert
- both (a) and (b)
- none of the above
Q15 | A common example of a queue is people waiting in line at a__________.
- bus stop
- movie hall
- shopping mall
- none of the above
Q16 | What is one of the common examples of a stack?
- a pile of books
- bus stop
- a basket of fruits
- a carat of eggs
Q17 | When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
- -1
- 0
- 1
- x
Q18 | What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
- overflow
- underflow
- top
- none of the above
Q19 | The total number of elements in a stack at a given point of time can be calculated from the value of______.
- overflow
- top
- queues
- underflow
Q20 | When the push operation is performed on stack the value of TOS will be ______
- decrement
- increment
- one
- none of these
Q21 | A double linked list contains reference to _____
- previous node
- next node
- current node
- both a & b
Q22 | Data Structure that are created by user as per their requirement are known as
- primitive data structure
- non-primitive data structure
- both a & b
- none of these
Q23 | To insert element at start, the previous pointer of newly added node would point to ______
- Nothing
- next node
- new node
- head node
Q24 | In linked list implementation, a node carries information regarding
- the data
- the link
- both a & b
- none of these
Q25 | Which of the following data structure is linear type?
- strings
- stack
- queue
- all of these