- Computer Science Engineering (CSE)
- Data Structure (DS)
- Worst space complexity of stack data str...

Q. |
## Worst space complexity of stack data structure is |

A. | o(log(n)) |

B. | o(1) |

C. | n/a |

D. | o(n) |

Answer» D. o(n) |

View all MCQs in:
Data Structure (DS)

- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
- Worst space complexity of queue data structure is
- 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.
- Worst space complexity of singly linked list is
- Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
- Stack is ____ type of data structure.
- 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?
- Which of the following data structure is not linear data structure?
- Which data structure allows deleting data elements from and inserting at rear?
- Which of the following data structure can’t store the non-homogeneous data elements?

Login to Continue

It will take less than 2 minutes

Report MCQ