Quiz 7

A visually appealing and educational graphic illustrating concepts of data storage, scheduling algorithms, and multiprocessor systems in a modern tech style.

Data Storage and Scheduling Quiz

Test your knowledge on data storage techniques, scheduling processes, and multiprocessor systems with our comprehensive quiz. This quiz covers key concepts including RAID configurations, disk caching, and real-time scheduling algorithms.

21 multiple choice questions
Immediate feedback on answers
Great for students and professionals alike

21 Questions5 MinutesCreated by OptimizingByte24

Which answer is not true about Design issue with multiprocessor scheduling ?

System Bus structure

The assignment of processes to processors.

The use of multiprogramming on individual processors

The actuall dispatching of a process

In ... Information is recorded magnetically on platters.

Magnetic arm

Electrical disks

Assembly

Magnetic Disks

In the algorithm,the disk head moves from one end to the other,servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.

LOOK

SCAN

C-SCAN

C-LOOK

In Least Frequently used algorithm The block that has experienced the fewest references is replaced

True

False

In the algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues.

LOOK

SCAN

C-SCAN

C-LOOK

In the algorithm,the disk arm goes as far as the final request in each direction,then reverses direction immediately without going to the end of the disk.

LOOK

SCAN

C-SCAN

C-LOOK

Which information is not important when processor wants to command DMA?

The address of a i/o device

Read or write control line.

Starting location of the memory

Size of the memory involved

In Thread scheduling which answer true about Load Sharing?

Processors become idle more than dedicate processor assignment.

The number of threads in a process can be altered during the course of execution.

Centralized scheduling is not required.

Not effective with multicore systems.

Correctness of the Real time process depends on …… and ……

Accuracy

Result producement time.

Computational result.

Speed.

Advantage of peer apporach in Multiprocessor scheduling is kernel can execute on any processor.

True

False

Which terms are important for deadline ‘scheduling?

Processing time

Interrupts.

Ready time

Priority

RAID is a set of logical disk drives viewed by the operating system as a single physical drive data?

True

False

Which information is not true about Disk Cache?

Reduces average memory access time.

Contains some data from disk.

Requested data must be on the cashe.

Locality principle is one of the key concern for Disk Cache

Which statement is not true about Multicore thread scheduling?

Cache shared by all cores

Cache shared by all processors

Locality helps to exploit resources better

If two threads share memory resources it is mandatory to assign them same core

While processor is cleaning one buffer, it transfer data to other buffer. This technique is called ….

Double buffering

Multi buffer

Buffer swapping

Circular buffer

Choose best option for Real-time shceduling process?

Preemptive scheduler

Round Robin

Priority driven nonpreemptive scheduler.

Immadiate preemptive scheduler.

Depending on the consequences choose categories deadline categories in real-time system.

Firm

Hard

Soft

Triggering

Quiz 7

Data Storage and Scheduling Quiz

More Surveys