Computer Science - System Analysis and Design

1. 

An example of a hierarchical data structure is

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

Answer: Option C

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option C

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option C

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option D

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option D

Explanation:

No answer description available for this question. Let us discuss.

1 2 3 4 5 6 7 8 9 10 Next »