MCQ | Data Structure Part 6

Data Structure - PART 6

« Previous Next »

1. We can say that Garbage collection is

A. when some programme runs out of space
B. when two program run out of space
C. when three program run out of space
D. None of these

  [NET]

Answer: A - when some programme runs out of space

---

2. Fragmentation means

A. splitting
B. sampling
C. spotting
D. None of these

  [NET]

Answer: A - splitting

---

3. The open end of stack is called

A. bottom of the stack
B. top of the stack
C. head of the stack
D. None of these

  [NET]

Answer: B - top of the stack

---

4. The insertion and deletion operation for a stack is called

A. push and pop respectively
B. pop and push respectively
C. head and tail respectively
D. None of these

  [NET]

Answer: A - push and pop respectively

---

5. The simplest way to represent a stack is by using

A. one dimension array
B. two dimension array
C. multi dimension array
D. None of these

  [NET]

Answer: A - one dimension array

---

6. The another approach for implementing queues is by using the

A. dynamic storage allocation through the use of pointers
B. sequential storage allocation through the use of stacks
C. tree
D. None of these

  [NET]

Answer: A - dynamic storage allocation through the use of pointers

---

7. In queue items are managed by

A. front and rare 
B. top and bottom
C. middle of queue
D. None of these

  [NET]

Answer: A - front and rare

---

8. A set of tree is known as

A. nodes
B. graph
C. forest
D. None of these

  [NET]

Answer: C - forest

---

9. sometimes nonterminal nodes are refered to as

A. internal nodes
B. external nodes
C. both (A) and (B)
D. None of these

  [NET]

Answer: A - internal nodes

---

10. Sometimes terminal nodes are referred as

A. internal nodes
B. external nodes
C. internal and external nodes
D. None of these

  [NET]

Answer: B - external nodes

---

« Previous Next »