quang huong 2

The technique, for sharing the time of a computer among several jobs. Which switches jobs so rapidly such that each job appears to have the computer to itself:

• time out

• . time domain

• time sharing

• FIFO

The address of the next instruction to be executed by the current process is provided by the

• Program counter

• CPU registers

• Process stack

• Pipe

Part of a program where the shared memory is accessed and which should be executed invisibly, is called

• semaphores

• directory

• . critical section

• mutual exclusion

An incremental backup

• should be done each month

• uses more tapes

• c. saves only files that have recently changed

• saves all files

Answer explanation

An incremental backup is a backup type that only copies data that has been changed or created since the previous backup activity was conducted. An incremental backup approach is used when the amount of data that has to be protected is too voluminous to do a full backup of that data every day.

A partitioned data set is most used for

• . storing program data

• b. storing ISAM files

• storing backup information

• . a program or source library

Answer explanation

Phân vùng tập dữ liệu đề cập đến việc phân chia tập dữ liệu dựa trên một hoặc nhiều thứ nguyên. Khi một tập dữ liệu được phân vùng, mỗi đoạn hoặc phân vùng của tập dữ liệu chứa một tập hợp con của dữ liệu và các phân vùng được xây dựng độc lập với nhau.

How can you add Amit, a new user, to your system?

• Using useradd

• . Using adduser

• All of the choices

• Using linuxconf

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of

• parent process

• currently running process

• . init process

• all process

Relocation bits used by relocating loader are specified (generated) by

• Relocating loader itself

• Macro processor

• Assembler or translator

• Linker

One of the disadvantages of the priority scheduling algorithm is that :

• t schedules in a very complex manner

• it can lead to some low priority process waiting indefinitely for the CPU

• its scheduling takes up a lot of time

What is a medium-term scheduler?

• It selects which process to remove from memory by swapping

• It selects which process has to be executed next and allocates CPU

• It selects which process has to be brought into the ready queue