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