Data Structures Challenge Quiz Quiz

1. Array Indexing

   Which of the following best describes how you access the third element in a zero-indexed array in most programming languages?

   1. array[2]
   2. array[3]
   3. array{2}
   4. array(2)
   5. array.second

2. Stack Operations

   What is the name of the operation used to remove the top element from a stack?

   1. Pop
   2. Peek
   3. Push
   4. Pull
   5. Pick

3. Queue Usage Scenario

   Which data structure is best suited for managing tasks in a printer queue, where the first submitted document should be printed first?

   1. Queue
   2. Stack
   3. Array
   4. Heap
   5. Tree

4. Linked List Traversal

   To visit each node in a singly linked list starting from the head, what operation do you use to move to the next node?

   1. current = current.next
   2. current = current.previous
   3. current = current[1]
   4. current = head.previous
   5. current = tail

5. Stack Usage Example

   Which real-world situation is best modeled using a stack data structure?

   1. Undo feature in text editors
   2. Customer service ticket queue
   3. Playlist shuffle
   4. Train carriages connected in a line
   5. Dictionary of words

6. Queue Methods

   In queue operations, which method is used to add an item to the rear of the queue?

   1. Enqueue
   2. Dequeue
   3. Enqeuue
   4. Push
   5. AppendToFront

7. Array Size Limitation

   What is a primary limitation of standard static arrays compared to linked lists?

   1. They require a fixed size at creation
   2. They allow fast random access
   3. They can be resized easily
   4. They support insertion anywhere in O(1) time
   5. They are always sorted automatically

8. Linked List Insertion

   In a singly linked list, what must be updated to insert a new node between two existing nodes?

   1. The next pointer of the previous node
   2. The head pointer only
   3. Both next and previous pointers
   4. The value of the new node only
   5. The last node’s pointer to null

9. Stack LIFO Principle

   Which principle does a stack follow when managing elements?

   1. Last In, First Out
   2. First In, First Out
   3. Least Recently Used
   4. Random Access
   5. First Come, Last Serve

10. Queue Real-World Example

    Which of these activities best illustrates the FIFO (First-In-First-Out) principle of a queue?

    1. People lining up to buy tickets at a theater
    2. Arranging books on a shelf
    3. Flipping through undo steps
    4. Browsing browser history in reverse
    5. Organizing nested folders