MCQ | Data Structure Part 7

Data Structure - PART 7

« Previous Next »

1. Trees are useful in computer science such as

A. compiler construction
B. database design window
C. operating system programs etc
D. All the above

  [NET]

Answer: D - All the above

---

2. A special case of binary tree is called a 2-tree or a

A. ordinary binary tree
B. specially binary tree
C. strictly binary tree
D. None of these

  [NET]

Answer: C - strictly binary tre

---

3. We use graphs as models of practical situations involving

A. routers
B. electric circuit
C. transportation
D. All the above

  [NET]

Answer: D - All the above

---

4. Queues are employed in many situations such as

A. car waiting at the service station
B. vehicle waiting at a crossing
C. customers in a check-out line at a departmental store
D. All the above

  [NET]

Answer: D - All the above

---

5. The term node is used to designate

A. a unit of storage space
B. data
C. an item
D. address

  [NET]

Answer: A - a unit of storage space

---

6. Small nodes improve

A. much space is not waste
B. flexibility
C. Both (A) and (B)
D. No effect

  [NET]

Answer: B - flexibility

---

7. List of several data structure

A.    cannot share same place 
B. can share same place
C. do not provide flexibility and sharing of same place
D. None of these

  [NET]

Answer: B - can share same place

---

8. List like arrays are used to store

A. ordered data
B. input data
C. current data
D. processed data

  [NET]

Answer: A - ordered data

---

9. A list can be implemented static or dynamic using

A. pointers
B. an array index
C. Both (A) and (B) respectively
D. None of these

  [NET]

Answer: A - pointers

---

10. An algorithm choose an execution path depending

A. on the set of data values (Input)
B. on the set of data values (output)
C. Both (A) and (B) 
D. None of these

  [NET]

Answer: A -  on the set of data values (Input)

---

« Previous Next »