Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
Q2101: How are entries forwarded from a buffer to their final destination in a queue?
- A: In reverse order
- B: In random order
- C: In the order they arrived
- D: In the order they will be used
View Answer
C
Q2102: Fill in the blank: In a stack, the last entry placed is the _____ entry removed.
- A: first
- B: last
- C: only
- D: middle
View Answer
B
Q2103: Fill in the blank: A queue is a _____ structure, meaning that the first entry inserted is the first one removed.
- A: LIFO
- B: FIFO
- C: Ordered
- D: Random
View Answer
B
Q2104: Fill in the blank: Adding an entry to a queue occurs at the _____ of the queue.
- A: head
- B: tail
- C: middle
- D: base
View Answer
B
Q2105: Fill in the blank: Removing an entry from a queue occurs at the _____ of the queue.
- A: head
- B: tail
- C: middle
- D: base
View Answer
A
Q2106: Fill in the blank: The structure of a queue is often used as the underlying structure of a _____ for temporary data placement.
- A: stack
- B: buffer
- C: list
- D: heap
View Answer
B
Q2107: What is the node at the top of a tree called?
- A: Leaf node
- B: Root node
- C: Parent node
- D: Child node
View Answer
B
Q2108: What are the nodes at the extreme ends of a tree called?
- A: Root nodes
- B: Intermediate nodes
- C: Terminal nodes
- D: Parent nodes
View Answer
C
Q2109: In a tree, what is the term for the longest path from the root to a leaf?
- A: Height
- B: Width
- C: Depth
- D: Level
View Answer
C
Q2110: What do we call nodes that have the same parent in a tree?
- A: Siblings
- B: Children
- C: Ancestors
- D: Descendants
View Answer
A