1. An example of a hierarchical data structure is

A. array
B. Link list
C. tree
D. ring
E. None of the above


Correct Answer: C. tree

2. Pointers are useful in

A. Locating a particular sector of a magnetic disk
B. Pointing mistakes in input data
C. Traversing a linked list
D. All of the above
E. None of the above


Correct Answer: C. Traversing a linked list

3. On-line data entry is most suitable in the case of

A. updating payroll master
B. entering monthly journal entries
C. Processing payment of cheque in a bank
D. All of the above
E. None of the above


Correct Answer: C. Processing payment of cheque in a bank

4. A Pseudocode is

A. a machine-level code
B. a random number
C. a flow chart
D. Structured English to communicate the logic of a program
E. None of the above


Correct Answer: D. Structured English to communicate the logic of a program

5. Which of the following file types has the least life

A. Master file
B. Program file
C. Transaction file
D. Work file
E. None of the above


Correct Answer: D. Work file

Comments

No comments yet. Why don’t you start the discussion?

Leave a Reply

Your email address will not be published. Required fields are marked *

14 + 12 =