Q.1.

The Memory Buffer Register (MBR)

Q.2.

An algorithm is best described as

Q.3.

Scheduling is

Q.4.

Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

Q.5.

The file structure that redefines its first record at a base of zero uses the term:

Q.6.

In MS-DOS, relocatable object files and load modules have extensions

Q.7.

If you want to execute more than one program at a time, the systems software you are using must be capable of:

Q.8.

In memory systems, boundary registers

Q.9.

Which of the following is not true about the memory management?

Q.10.

The errors that can be pointed out by the compiler are

Q.11.

What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?

Q.12.

If you do not know which version of MS-DOS you are working with, which command will you use after having booted your operating system?

Q.13.

What is the name given to all the programs inside the computer with makes it usable?

Q.14.

The state transition initiated by the user process itself in an operating system is

Q.15.

The practice of "bundling" refers to

Q.16.

Access time is the highest in the case of

Q.17.

What is the name of the operating system that reads and reacts in terms of actual time.

Q.18.

In analyzing the compilation of PL/I program, the description "resolving symbolic address (labels) and generating machine language" is associated with

Q.19.

Which of the following is true for machine language.

Q.20.

Job Control Language (JCL) statements are used to

Q.21.

When a computer is first turned on or restarted, a special type of absolute loader is executed, called a

Q.22.

In an absolute loading scheme, which loader function is accomplished by loader

Q.23.

A partitioned data set is most used for

Q.24.

Page-map table is

Q.25.

Semaphores

Q.26.

Which of the following program is not a utility?

Q.27.

Special software to create a job queue is called a

Q.28.

Which of the following is not a characteristic of a daisy chaining priority control scheme?

Q.29.

An incremental backup

Q.30.

Round-robin scheduling