New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.

Related MCQs

• A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
• 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?
• Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
• ________ is the situation where data-structure is empty.
• Which of the following data structure is not linear data structure?
• Which of the following data structure is linear data structure?
• Worst space complexity of queue data structure is
• Worst space complexity of stack data structure is
• A data structure where elements can be added or removed at either end but not in the middle is called …
• A data structure where elements can be added or removed at either end but not in the middle is called …