Test my Merit My Results Create Exam

Higher Study | Operating Systems

Process and Thread Concurrency and Synchronization Deadlock CPU Scheduling Virtual Memory
Which of the following is not an operating system ?
Which one of the following statements is false?
What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
The primary objective of a time-sharing operating system is to
The Unix operating system is written in
The time elapsed between the submission of a job and obtaining the results is known as 
In a computer, Disk scheduling involves deciding
MS Word is an example of
Let processes are scheduled on a system using round robin scheduling; assume that there is only one process of r time units. Round robin time quantum is q time units and process switch time is s time units. If s < q < r, then process switch over head units are
System calls are usually invoked by using
Consider the following code. int count = 0; void *thfun () { int ctr=0; for (ctr=0; ctr<100; ctr++)      count++; } If thfun is executed by two threads concurrently in a uniprocessor system, what will be the MINIMUM value of count when both threads complete their execution? Assume that count++ is performed using three instructions: (i) read value of count from memory to a CPU register R, (ii) increment R, and (iii) store the value of R in memory. 
What happen when an interrupt occurs in between CPU executing a program?
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. Method used by PI Method used by P2 While (S1 == S2); Critical Section S1 = S2; While (S1 != S2); Critical Section S2 = not (S1);   Which one of the following statements describes the properties achieved?
Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used) 
Let disk request come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38, at the time when the disk driver is reading from cylinder 20. If the seek time is 6 ms per cylinder, then the total seek time for the disk arm scheduling time algorithm (FCFS - First Come First Serve) is:
Ads