- Computer Science Engineering (CSE)
- Data Structure (DS)
- The total number of elements in a stack ...

Q. |
## The total number of elements in a stack at a given point of time can be calculated from the value of______. |

A. | overflow |

B. | top |

C. | queues |

D. | underflow |

Answer» B. top |

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.
- 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?
- What will be the value of top, if there is a size of stack STACK_SIZE is 5
- When does top value of the stack changes?
- What will be the value of top, if there is a size of stack STACK_SIZE is 5
- When the push operation is performed on stack the value of TOS will be ______
- Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
- Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
- Stack is also called as

Login to Continue

It will take less than 2 minutes

Report MCQ