💻

Operating System MCQs

1K+ questions with answers

351

The problem of priority inversion can be solved by ____________

a priority inheritance protocol
b priority inversion protocol
c both priority inheritance and inversion protocol
d none of the mentioned
Medium
View Details →
352

Time required to synchronous switch from the context of one thread to the context of another thread is called?

a threads fly-back time
b jitter
c context switch time
d none of the mentioned
Medium
View Details →
353

Which one of the following is a real time operating system?

a RTLinux
b VxWorks
c Windows CE
d All of the mentioned
Medium
View Details →
354

VxWorks is centered around ____________

a wind microkernel
b linux kernel
c unix kernel
d none of the mentioned
Medium
View Details →
355

What is the disadvantage of real addressing mode?

a there is a lot of cost involved
b time consumption overhead
c absence of memory protection between processes
d restricted access to memory locations by processes
Medium
View Details →
356

Preemptive, priority based scheduling guarantees ____________

a hard real time functionality
b soft real time functionality
c protection of memory
d none of the mentioned
Medium
View Details →
357

Real time systems must have ____________

a preemptive kernels
b non preemptive kernels
c preemptive kernels or non preemptive kernels
d neither preemptive nor non preemptive kernels
Medium
View Details →
358

What is Event latency?

a the amount of time an event takes to occur from when the system started
b the amount of time from the event occurrence till the system stops
c the amount of time from event occurrence till the event crashes
d the amount of time that elapses from when an event occurs to when it is serviced.
Medium
View Details →
359

Interrupt latency refers to the period of time ____________

a from the occurrence of an event to the arrival of an interrupt
b from the occurrence of an event to the servicing of an interrupt
c from arrival of an interrupt to the start of the interrupt service routine
d none of the mentioned
Medium
View Details →
360

Real time systems need to __________ the interrupt latency.

a minimize
b maximize
c not bother about
d none of the mentioned
Medium
View Details →
361

The most effective technique to keep dispatch latency low is to ____________

a provide non preemptive kernels
b provide preemptive kernels
c make it user programmed
d run less number of processes at a time
Medium
View Details →
362

Priority inversion is solved by use of _____________

a priority inheritance protocol
b two phase lock protocol
c time protocol
d all of the mentioned
Medium
View Details →
363

In a real time system the computer results ____________

a must be produced within a specific deadline period
b may be produced at any time
c may be correct
d all of the mentioned
Medium
View Details →
364

In a safety critical system, incorrect operation ____________

a does not affect much
b causes minor problems
c causes major and serious problems
d none of the mentioned
Medium
View Details →
365

Antilock brake systems, flight management systems, pacemakers are examples of ____________

a safety critical system
b hard real time system
c soft real time system
d safety critical system and hard real time system
Medium
View Details →
366

In a ______ real time system, it is guaranteed that critical real time tasks will be completed within their deadlines.

a soft
b hard
c critical
d none of the mentioned
Medium
View Details →
367

Some of the properties of real time systems include ____________

a single purpose
b inexpensively mass produced
c small size
d all of the mentioned
Medium
View Details →
368

The amount of memory in a real time system is generally ____________

a less compared to PCs
b high compared to PCs
c same as in PCs
d they do not have any memory
Medium
View Details →
369

Memory management units ____________

a increase the cost of the system
b increase the power consumption of the system
c increase the time required to complete an operation
d all of the mentioned
Medium
View Details →
370

The technique in which the CPU generates physical addresses directly is known as ____________

a relocation register method
b real addressing
c virtual addressing
d none of the mentioned
Medium
View Details →
371

Earliest deadline first algorithm assigns priorities according to ____________

a periods
b deadlines
c burst times
d none of the mentioned
Medium
View Details →
372

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is ____________

a 0.90
b 0.74
c 0.94
d 0.80
Medium
View Details →
373

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., the priorities of P1 and P2 are?

a remain the same throughout
b keep varying from time to time
c may or may not be change
d none of the mentioned
Medium
View Details →
374

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., can the two processes be scheduled using the EDF algorithm without missing their respective deadlines?

a Yes
b No
c Maybe
d None of the mentioned
Medium
View Details →
375

Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to __________

a the cost of context switching
b interrupt handling
c power consumption
d all of the mentioned
Medium
View Details →
376

T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

a rate monotonic
b proportional share
c earliest deadline first
d none of the mentioned
Medium
View Details →
377

If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. B will have ______ percent of the total processor time.

a 20
b 15
c 50
d none of the mentioned
Medium
View Details →
378

If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. C will have ______ percent of the total processor time.

a 20
b 15
c 50
d none of the mentioned
Medium
View Details →
379

If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. If a new process D requested 30 shares, the admission controller would __________

a allocate 30 shares to it
b deny entry to D in the system
c all of the mentioned
d none of the mentioned
Medium
View Details →
380

To schedule the processes, they are considered _________

a infinitely long
b periodic
c heavy weight
d light weight
Medium
View Details →
381

If the period of a process is ‘p’, then what is the rate of the task?

a p2
b 2*p
c 1/p
d p
Medium
View Details →
382

The scheduler admits a process using __________

a two phase locking protocol
b admission control algorithm
c busy wait polling
d none of the mentioned
Medium
View Details →
383

The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.

a earliest deadline first
b rate monotonic
c first cum first served
d priority
Medium
View Details →
384

Rate monotonic scheduling assumes that the __________

a processing time of a periodic process is same for each CPU burst
b processing time of a periodic process is different for each CPU burst
c periods of all processes is the same
d none of the mentioned
Medium
View Details →
385

In rate monotonic scheduling, a process with a shorter period is assigned __________

a a higher priority
b a lower priority
c higher & lower priority
d none of the mentioned
Medium
View Details →
386

If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then __________

a they can be scheduled by EDF algorithm
b they cannot be scheduled by EDF algorithm
c they cannot be scheduled by any other algorithm
d none of the mentioned
Medium
View Details →
387

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is?

a 0.90
b 0.74
c 0.94
d 0.80
Medium
View Details →
388

A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?

a Yes
b No
c Maybe
d None of the mentioned
Medium
View Details →
389

What is multimedia file?

a is same as any other regular file
b must be accessed at specific rate
c stored on remote server can not be delivered to its client
d none of the mentioned
Medium
View Details →
390

In which type of streaming multimedia file is delivered to the client, but not shared?

a real-time streaming
b progressive download
c compression
d none of the mentioned
Medium
View Details →
391

Which one of the following is the characteristic of a multimedia system?

a high storage
b high data rates
c both high storage and high data rates
d none of the mentioned
Medium
View Details →
392

The delay that occur during the playback of a stream is called ___________

a stream delay
b playback delay
c jitter
d event delay
Medium
View Details →
393

Which algorithm can be optimized to meet the timing deadlines and rate requirements of continuous media?

a Earliest-Deadline-First scheduling
b SCAN-EDF scheduling
c Both Earliest-Deadline-First scheduling & SCAN-EDF scheduling
d None of the mentioned
Medium
View Details →
394

Real time streaming protocol is used ___________

a to control streaming media servers
b for establishing and controlling media sessions between endpoints
c to provide real time control of playback of media files from the server
d all of the mentioned
Medium
View Details →
395

CineBlitz multimedia server supports ___________

a real time clients
b non-real time clients
c both real time & non-real time clients
d none of the mentioned
Medium
View Details →
396

Multimedia system require hard real time scheduling ___________

a to ensure critical tasks will be serviced within timing deadlines
b to deliver the media file to the client
c to minimize the delay
d for security
Medium
View Details →
397

Which one of the following resource is not necessarily required on a file server?

a secondary storage
b processor
c network
d monitor
Medium
View Details →
398

The major difference between a multimedia file and a regular file is ___________

a the size
b the attributes
c the ownership
d the rate at which the file must be accessed
Medium
View Details →
399

Video is represented as a series of images formally known as ___________

a pics
b shots
c frames
d snaps
Medium
View Details →
400

The faster the frames are displayed, ___________

a the rougher the video appears
b the smoother the video appears
c it gets blurry
d none of the mentioned
Medium
View Details →