- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- Pushing an element into stack already ha...

Q. |
## Pushing an element into stack already having five elements and stack size of 5, then stack becomes |

A. | Overflow |

B. | Crash |

C. | Underflow |

D. | User flow |

Answer» A. Overflow |

View all MCQs in:
Data Structures (DS)

- In a stack, if a user tries to remove an element from empty stack it is called
- If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
- Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
- Process of inserting an element in stack is called
- Process of removing an element from stack is called
- Process of inserting an element in stack is called ____________.
- An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
- Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
- What is the space complexity of a linear queue having n elements?
- An array that is first 7-sorted, then 5-sorted becomes

Login to Continue

It will take less than 2 minutes

Report MCQ