 |  Stacks & Queues 20 Flashcards |  Start |
 | 1 / 20 What data structure follows the Last-in-First-out (LIFO) principle?
|  |
| 2 / 20 Stack
| |
| 3 / 20 Fill in the blank: The ______ operation adds an element to the top of the stack.
| |
| 4 / 20 PUSH
| |
| 5 / 20 True or False: In a stack, elements can be accessed in any order.
| |
| 6 / 20 False. In a stack, only the top element can be accessed.
| |
| 7 / 20 What is the time complexity of the PUSH operation in a stack implemented using an array?
| |
| 8 / 20 O(1)
| |
| 9 / 20 Riddle: I hold secrets at my top, but only let the last in be the first out. What am I?
| |
| 10 / 20 Stack
| |
|  Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only | |
| 11 / 20 Fill in the blank: The ______ notation has operators placed before their operands.
| |
| 12 / 20 Prefix
| |
| 13 / 20 True or False: A queue follows the First-in-Last-out (FILO) principle.
| |
| 14 / 20 False. A queue follows the First-in-First-out (FIFO) principle.
| |
| 15 / 20 What is the primary operation used to insert an element in a queue?
| |
| 16 / 20 ENQUEUE
| |
| 17 / 20 Fill in the blank: The ______ operation removes an element from the front of the queue.
| |
| 18 / 20 DEQUEUE
| |
| 19 / 20 Which data structure can be implemented using two stacks?
| |
| 20 / 20 Queue
| |
| Session Completed! Keep practicing to master all of them. Take your study prep to 
|  Restart |
