A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowe...
 A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
| ||||||||
| A process executes the code fork(); fork(); fork();
| ||||||||
Memory utilization factor shall be computed as follows
| ||||||||
Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is
| ||||||||
Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are there in the physical address ?
| ||||||||
Moving process from main memory to disk is called
| ||||||||
Which of the following is the process by which a user’s access to physical data in the application is limited, based on his privileges ?
| ||||||||
Which of the following statements is not correct with reference to distributed systems ?
| ||||||||
In the blocked state
| ||||||||
| Match the following : (a) Disk scheduling 1. Round-robin (b) Batch processing 2. SCAN (c) Time sharing 3. LIFO (d) Interrupt processing 4. FIFO
| ||||||||
In which of the following page replacement policies Balady’s anomaly occurs?
| ||||||||
The simplest way to break a deadlock is to
| ||||||||
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock- free order of invoking the P operations by the processes?
| ||||||||
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as
| ||||||||
Which of the following topologies consists of multiple CPUs connected by a single communication line running the length of the network?
| ||||||||
An operating system
| ||||||||
The operating system of a computer serves as a software interface between the user and
| ||||||||
In one time password
| ||||||||
Interval between the time of submission and completion of job is called
| ||||||||
In the process management Round-robin method is essentially the pre-emptive version of _________
| ||||||||
System supports two types of file which are
| ||||||||
| ||||||||
In virtual memory systems, Dynamic address translation
| ||||||||
Which of the following is not supported by the operating system?
| ||||||||
Memory on your computer where data is stored temporarily is called __________.
| ||||||||
A process executes the code
fork ();
fork ();
fork ();
fork ();
The total number of child processes created is
| ||||||||
The multiuser operating system, 20 requests are made to use a particular resource per hour, on an average the probability that no request are made in 45 minutes is
| ||||||||
Dijkstra banker algorithm is an operating system to solve the problem of
| ||||||||
Pre-emptive scheduling is the strategy of temporarily suspending a gunning process
| ||||||||
Consider a hard disk with 16 recording surfaces (0 -15) having 16384 cylinders (0 -16383) and each cylinder contains 64 sectors (0 - 63) . Data storage capacity in each sector is 512 bytes. Data are organized cylinder–wise and the addressing format is <cylinder no., sector no.>. A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
| ||||||||
The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is
| ||||||||
A thread
| ||||||||
File attributes are
| ||||||||
Which is built directly on the hardware?
| ||||||||
A solution to the critical section problem must satisfy which requirements?
| ||||||||
______ is used in operating system to separate mechanism from policy
| ||||||||
Worm was made up
| ||||||||
Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order) and processes of 212K, 417K, 112K, and 426K (in order), using the first-fit algorithm in which partition would the process requiring 426K be placed?
| ||||||||
The primary purpose of an operating system is
| ||||||||
Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ?
| ||||||||
A tree structured file directory system
| ||||||||
Security violation due to
| ||||||||
Multiprogramming systems
| ||||||||
The most common approach to authenticating a user identity is
| ||||||||
A starvation-free job-scheduling policy guarantees that no job waits indefinitely for service. Which of the following job-scheduling policies is starvation-free?
| ||||||||
| Which of the following statement is wrong ? I. 2-phase locking protocol suffer from dead lock. II. Time stamp protocol suffer from more aborts. III. A block hole in a DFD is a data store with only inbound flows. IV. Multivalued dependency among attribute is checked at 3 NF level. V. An entity-relationship diagram is a tool to represent event model.
| ||||||||
Remote Computing Service involves the use of time sharing and _______.
| ||||||||
Cascading termination refers to termination of all child processes before the parent terminates
| ||||||||
In round robin CPU scheduling as time quantum is increased the average turn around time
| ||||||||
At intermediate multiprogramming levels, the rate of increase of throughput with multiprogramming levels decreases. This phenomenon is best explained by the fact that as multiprogramming level increases
|
