search
Log In

Web Page

Processes, Threads, Inter‐process communication, Concurrency and synchronization. Deadlock. CPU scheduling. Memory management and Virtual memory. File systems. Disks is also under this

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&2&3&2&2&1&1&1&2&3
\\\hline\textbf{2 Marks Count}&4&3&2&2&4&3&3&3&4
\\\hline\textbf{Total Marks}&10&9&6&6&9&7&\bf{6}&\bf{7.8}&\bf{10}\\\hline
\end{array}}}$$

Questions without answers in Operating System

0 votes
0 answers
1
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
asked Nov 20, 2020 in Operating System jothee 64 views
0 votes
0 answers
2
What is the elapsed time of $P$ if records of $F$ are organized using a blocking factor of $2$(i.e. each block on $D$ contains two records of $F$) and $P$ uses one buffer? $12$ sec. $14$ sec. $17$ sec. $21$ sec.
asked Mar 31, 2020 in Operating System Lakshman Patel RJIT 295 views
0 votes
0 answers
3
A computer uses $46-bit$ virtual address, $32-bit$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table ($T1$), which occupies exactly one page. Each entry of $T1$ stores the base ... needed to guarantee that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 182 views
0 votes
0 answers
4
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: if(i%2==0){ if(i<n) request Ri; if(i+2<n) request Ri+2; } else{ if(i<n) request Rn−i; if(i+2<n) ... ; } In which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 177 views
0 votes
0 answers
5
The aging algorithm with a = $0.5$ is used to predict run times. The previous four runs from oldest to most recent are $40, 20, 20,$ and $15$ msec. The prediction for the next time will be : $15$ msec. $25$ msec. $39$ msec. $40$ msec.
asked Mar 28, 2020 in Operating System jothee 82 views
0 votes
0 answers
6
Which statements is not correct about “init” process in Unix? It is generally the parent of the login shell. It has PID $1$. It is the first process in the system. Init forks and execs a ‘getty’ process at every port connected to a terminal.
asked Mar 24, 2020 in Operating System jothee 118 views
0 votes
0 answers
7
Names of some of the Operating Systems are given below: MS-DOS XENIX OS/$2$ In the above list, following operating systems didn’t provide multiuser facility. (a) only (a) and (b)only (b) and (c) only (a),(b) and (c)
asked Mar 24, 2020 in Operating System jothee 57 views
1 vote
0 answers
8
0 votes
0 answers
9
Write a program that detects if there is a deadlock in the system by using a resource allocation graph. Your program should read from a file the following inputs: the number of processes and the number of resources. For each process if should read four numbers: the ... is a deadlock in the system. In case there is, the program should print out the identities of all processes that are deadlocked.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 272 views
0 votes
0 answers
10
Write a program to implement the deadlock detection algorithm with multiple resources of each type. Your program should read from a file the following inputs: the number of processes, the number of resource types, the number of resources of each type in existence ... a deadlock in the system. In case there is, the program should print out the identities of all processes that are deadlocked.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 90 views
0 votes
0 answers
12
Repeat the previous problem, but now avoid starvation. When a baboon that wants to cross to the east arrives at the rope and finds baboons crossing to the west, he waits until the rope is empty, but no more westward-moving baboons are allowed to start until at least one baboon has crossed the other way.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 83 views
0 votes
0 answers
13
A student majoring in anthropology and minoring in computer science has embarked on a research project to see if African baboons can be taught about deadlocks. He locates a deep canyon and fastens a rope across it, so the baboons can cross hand-overhand ... semaphores that avoids deadlock. Do not worry about a series of eastward-moving baboons holding up the westward-moving baboons indefinitely.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 154 views
0 votes
0 answers
14
Cinderella and the Prince are getting divorced. To divide their property, they have agreed on the following algorithm. Every morning, each one may send a letter to the other's lawyer requesting one item of property. Since it takes a day for letters to ... When they come back from vacation, the computers are still negotiating. Why? Is deadlock possible? Is starvation possible? Discuss your answer.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 148 views
0 votes
0 answers
15
A program contains an error in the order of cooperation and competition mechanisms, resulting in a consumer process locking a mutex (mutual exclusion semaphore) before it blocks on an empty buffer. The producer process blocks on the mutex before it can place a ... waiting for a signal from the producer. Is this a resource deadlock or a communication deadlock? Suggest methods for its control.
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 49 views
0 votes
0 answers
16
Local Area Networks utilize a media access method called CSMA/CD, in which stations sharing a bus can sense the medium and detect transmissions as well as collisions. In the Ethernet protocol, stations requesting the shared channel do not transmit frames if they sense ... this a resource deadlock or a livelock? Can you suggest a solution to this anomaly? Can starvation occur with this scenario?
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 51 views
0 votes
0 answers
17
Assume two processes are issuing a seek command to reposition the mechanism to access the disk and enable a read command. Each process is interrupted before executing its read, and discovers that the other has moved the disk arm. Each then reissues the seek ... . This sequence continually repeats. Is this a resource deadlock or a livelock? What methods would you recommend to handle the anomaly?
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 38 views
0 votes
0 answers
18
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these preemption methods were developed to handle resource deadlock or for other purposes? How high is their overhead?
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 54 views
0 votes
0 answers
19
A computer science student assigned to work on deadlocks thinks of the following brilliant way to eliminate deadlocks. When a process requests a resource, it specifies a time limit. If the process blocks because the resource is not available, a timer is started. If the ... the process is released and allowed to run again. If you were the professor, what grade would you give this proposal and why?
asked Oct 30, 2019 in Operating System Lakshman Patel RJIT 72 views
2 votes
0 answers
20
0 votes
0 answers
26
0 votes
0 answers
27
0 votes
0 answers
28
Suppose four cars each approach an intersection from four different directions simultaneously. Each corner of the intersection has a stop sign. Assume that traffic regulations require that when two cars approach adjacent stop signs at the same time, the car on the left must ... (indefinitely) for the car on the left to proceed. Is this anomaly a communication deadlock? Is it a resource deadlock?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 78 views
0 votes
0 answers
29
City streets are vulnerable to a circular blocking condition called gridlock, in which intersections are blocked by cars that then block cars behind them that then block the cars that are trying to enter the previous intersection, etc. All intersections ... the intersection is also available. Which prevention algorithm is this? Can you provide any other prevention algorithms for gridlock?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 67 views
0 votes
0 answers
30
To see more, click for the full list of questions or popular tags.
...