Stack is ____ type of data structure.

Related Questions

• 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.
• 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.
• 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?
• Worst space complexity of stack data structure is
• 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?
• A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
• Which data structure allows deleting data elements from front and inserting at rear?
• In ___ Data Structure data can be processed one by one sequentially