Register

Web Page

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

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2024-1} & \textbf{2024-2} &\textbf{2023}&  \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &2&2&3& 2 &4&2&2&2.5&4
\\\hline\textbf{2 Marks Count} & 4&4&3&4 &1&3&1&3.16&4
\\\hline\textbf{Total Marks} & 10&10&9&10 &6&8&\bf{6}&\bf{8.83}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Operating System

#3421
1.6k
views
1 answers
3 votes
MadeEasy Subject Test: Operating System - Disks
Consider a typical disk that rotates at 30000 rotations per minute(RPM) and has a transfer rate of 40Mbps.If the average seek time of the disk is twice the ... time+rotational latency+transfer time+controller time=2+1+0.0512+0.4096=3.4608
User Avatar
#3422
516
views
0 answers
0 votes
Cost comparison of mutex, semaphore and monitor
Arrange the following synchronization constructs in increasing order of cost:A. SemaphoreB. MutexC. Monitor
User Avatar
#3423
325
views
1 answers
2 votes
Test by Bikram | Operating Systems | Test 2 | Question: 30
Consider the following 3 processes with 3 binary semaphores with initial values $S_{0}=0, S_{1}=0, S_{2}=1$ ... }$What will be the correct pattern generated by these $3$ processes?$211$200$210$201$
User Avatar
#3424
913
views
1 answers
7 votes
Test by Bikram | Operating Systems | Test 2 | Question: 28
Consider a program to be run on a computer system in round-robin CPU scheduling. The size of the program is $100K$. It is given that the hard disk has a transfer rate ... CPU utilization ?$2.048$ sec$0.216$ sec$0.108$ sec$0.100$ sec
User Avatar
#3425
1.3k
views
3 answers
2 votes
Test by Bikram | Operating Systems | Test 2 | Question: 29
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The average time required to access a page is ________ ns
User Avatar
#3426
418
views
1 answers
0 votes
Test by Bikram | Operating Systems | Test 2 | Question: 26
Consider a paging system with the page table in memory. Each memory reference takes $200$ ns. The TLB has hit ratio of $75 \%$ and the time to look ... $250$150$200$
User Avatar
#3427
247
views
1 answers
1 votes
Test by Bikram | Operating Systems | Test 2 | Question: 27
A counting semaphore is initialized to $10$. The $6$ P(wait) operations and $4$ V(signal) operations were completed in this semaphore. The resulting value of semaphore is:$0$8$10$12$
User Avatar
#3428
588
views
1 answers
0 votes
Test by Bikram | Operating Systems | Test 2 | Question: 23
A moving arm disk-storage device has the following specifications. Number of tracks per recording surface - $200$ Disk - rotation speed - $2400$ rpm Track ... $256$ bytes the average number of sectors possible in each track is __________
User Avatar
#3429
1.5k
views
3 answers
2 votes
Test by Bikram | Operating Systems | Test 2 | Question: 24
Suppose the page table for the process currently executing looks like the following.All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. ... , $5120$-------, $2221$, --------
User Avatar
#3430
698
views
1 answers
3 votes
Test by Bikram | Operating Systems | Test 2 | Question: 25
What will be the output of the following piece of code?Void foo() { int i=1; fork(); i++; printf( %d ,i); fork(); i++; printf( %d ,i); fork(); i++; printf( %d ,i) ... All of above three options are correct
User Avatar
#3431
686
views
1 answers
1 votes
Test by Bikram | Operating Systems | Test 2 | Question: 21
Suppose the disk drive has $200$ cylinders ( numbered $0$ to $199$). The drive is currently serving the request at cylinder $53$. The previous ... current head position. The total distance traveled by the disk arm in SCAN scheme _______
User Avatar
#3432
557
views
1 answers
2 votes
Test by Bikram | Operating Systems | Test 2 | Question: 22
A uniprocessor system has two resources of type A and B shared by four processes. There are $4$ units of each resource type available after allocation. Let current indicate ... $P1$P0$P3$No safe sequence exists
User Avatar
#3433
650
views
1 answers
0 votes
Test by Bikram | Operating Systems | Test 2 | Question: 20
Consider a demand-paging system with the following time-measured utilization: ... multiprogrammingAdd pre paging to the page fetch algorithmsIncrease the page sizenone of the above
User Avatar
#3434
843
views
1 answers
3 votes
Test by Bikram | Operating Systems | Test 2 | Question: 18
Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T0$ is ... $P1, P4, P3, P0, P2$
User Avatar
#3435
928
views
1 answers
0 votes
Test by Bikram | Operating Systems | Test 2 | Question: 19
Assume we have a demand-paged memory. The page table is held in registers. It takes $8$ milliseconds to service a page fault if an empty page is available or the ... for an effective access time of no more than $200$ ns is __________ $\%$
User Avatar
#3436
970
views
1 answers
1 votes
Test by Bikram | Operating Systems | Test 2 | Question: 17
The address sequence generated by tracing a particular program, executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded ... . The page fault rate is _______
User Avatar
#3437
725
views
1 answers
1 votes
Test by Bikram | Operating Systems | Test 2 | Question: 15
There are $5$ processes which require resource instances of same type in quantities $23, \ 35, \ 12, \ 43, \ 15$ respectively. The minimum number of resource instances required for preventing deadlock is _______
User Avatar
#3438
652
views
2 answers
3 votes
Test by Bikram | Operating Systems | Test 2 | Question: 16
Which of the following statements are not true?All unsafe states are deadlocksA deadlock state is unsafe stateA system is in safe state only if there exists a safe sequenceA state is said to ... & $4$ only$2$ & $3$ only$1$, $3$ & $4$ only
User Avatar
#3439
1.0k
views
2 answers
1 votes
Test by Bikram | Operating Systems | Test 2 | Question: 14
Consider the $2$ - process solution to the Critical Section problem (here i refers to the current process and j is the other ... mutual exclusion is satisfiedMutual exclusion is violatedMutual exclusion and progress requirements are met
User Avatar
#3440
1.0k
views
1 answers
0 votes
Test by Bikram | Operating Systems | Test 2 | Question: 12
A certain computer provides its users with a virtual-memory space of $2^{32}$ bytes. The computer has $2^{18}$ bytes of physical memory. The virtual memory is implemented ... $0100 \ 0101 \ 0110$
User Avatar
Page: