Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
Q2091: What is the beginning of a list called?
- A: The middle
- B: The tail
- C: The head
- D: The base
View Answer
C
Q2092: What is the end of a list referred to as?
- A: The head
- B: The base
- C: The tail
- D: The middle
View Answer
C
Q2093: In which data structure are entries inserted and removed only at the head?
- A: Queue
- B: List
- C: Stack
- D: Linked list
View Answer
C
Q2094: What is the primary characteristic of a stack?
- A: First-in, first-out (FIFO)
- B: Last-in, first-out (LIFO)
- C: Ordered access
- D: Random access
View Answer
B
Q2095: What term is used to describe adding an entry to the top of a stack?
- A: Popping
- B: Pushing
- C: Queuing
- D: Removing
View Answer
B
Q2096: What term describes the process of removing an entry from the top of a stack?
- A: Pushing
- B: Popping
- C: Queueing
- D: Inserting
View Answer
B
Q2097: A stack is ideal for processes that require retrieval in what order?
- A: First-in, first-out (FIFO)
- B: Random order
- C: Last-in, first-out (LIFO)
- D: Sorted order
View Answer
C
Q2098: What is a common use case for a stack in programming?
- A: Managing function calls in recursion
- B: Handling buffers
- C: Processing lists
- D: Serving queues
View Answer
A
Q2099: What is the primary characteristic of a queue?
- A: Last-in, first-out (LIFO)
- B: Random access
- C: First-in, first-out (FIFO)
- D: Ordered access
View Answer
C
Q2100: In which data structure are entries inserted only at the tail and removed only at the head?
- A: Stack
- B: Queue
- C: List
- D: Array
View Answer
B