Data Structure Set 6
On This Page
This set of Data Structure DS Multiple Choice Questions & Answers (MCQs) focuses on Data Structure Set 6
Q1 | Stack is ____ type of data structure.
- lifo
- fifo
- both a & b
- none of these
Q2 | In stack deletion operation is referred as _____
- push
- pop
- peek
- none of these
Q3 | Queue is _____ type of data structure.
- lifo
- fifo
- both a & b
- none of these
Q4 | Data structre is divided into _____ parts.
- 4
- 3
- 2
- 1
Q5 | In ___ Data Structure data can be processed one by one sequentially
- array
- linked list
- tree
- none of these
Q6 | When we insert an element in Queue, which pointer is increased by one?
- front
- rear
- both a & b
- none of these
Q7 | Which of the following is not the possible operation on stack?
- push
- pop
- display
- enqueue
Q8 | Which of the following is a possible operation on queue?
- push
- pop
- display
- enqueue
Q9 | In stack, to display the lastly inserted element without removing it, which function is used?
- push
- pop
- display
- peek
Q10 | if there are no nodes in linked list then start pointer will point at which value?
- Nothing
- garbage
- 1
- 2
Q11 | Worst space complexity of queue data structure is
- o(n)
- o(log(n))
- o(1)
- n/a
Q12 | Worst space complexity of stack data structure is
- o(log(n))
- o(1)
- n/a
- o(n)
Q13 | Worst space complexity of singly linked list is
- o(n)
- o(1)
- o(log(n))
- n/a