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

#3281
663
views
0 answers
0 votes
Made-Easy | Synchronization
How option B would confirm - Bounded waiting.??
User Avatar
#3282
516
views
0 answers
0 votes
CAching
Caching: Assume a computer system employing a cache, where the access time to the main memory is 100 ns, and the access time to the cache is 20ns.Assume the system ... the data in memory is 95%. What is the average time ittakes to load X?
User Avatar
#3283
332
views
0 answers
0 votes
Paging
5. If a process has allocated every 1024th virtual page (e.g. it has allocated virtual pages 0, 1024, 2048, 3072, 4096, 5120 ... 1024000), which one ... . Each of the above page table will use exactly the same amount of memoryPlz explain ?
User Avatar
#3284
4.9k
views
4 answers
9 votes
Demand Paging
Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effective access time (EAT) if we assume the page fault rate is 15% ?
User Avatar
#3285
904
views
2 answers
1 votes
MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problemHow is deadlock possible in this?
User Avatar
#3286
576
views
0 answers
1 votes
Virtual Gate Test Series: Operating System - Page Replacement
Consider the two-dimensional array A$:$int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that ... (int j=0;j<100;j++) for(int i=0;i<100;i++) A[i][j]=0;
User Avatar
#3287
1.9k
views
1 answers
2 votes
Consider a system with the main memory size of 32MB and each process size 4MB
Consider a system with the main memory size of 32MB and each process size 4MB, if each process spends 80% of its time in doing I/O, what is the CPU ... parallel.so at that CPU will be free and therefore its utilisation will be only 20%.
User Avatar
#3288
967
views
1 answers
2 votes
Test by Bikram | Mock GATE | Test 2 | Question: 34
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte ... basic inverted page table, including page numbers and overhead bits is ________ $bytes$.
User Avatar
#3289
353
views
1 answers
0 votes
Please explain how and d is possible
User Avatar
#3290
727
views
1 answers
5 votes
Threading in OS [GateBook]
User Avatar
#3291
769
views
1 answers
0 votes
TestBook TestSeries
TLB lookup time (th) = 20 nsTLB hit ratio (ht) = 99%Memory access time (ts) = 100 nsPage fault rate (hp) =0.05%Swap page time (in or out) (tp) = ... all pages currently in main memory are dirty?5118.91 ns51.21 ns5120.9 nsNone of the above
User Avatar
#3292
1.6k
views
2 answers
1 votes
MadeEasy Subject Test: Operating System - Process Synchronization
Consider the following C' codeAssume P1 and P2 are two concurrent processes and sharing the global variables x, y and z. Assignmentsand tests are atomic. ... Neither P1 nor P2 terminates my answer S1 and S4 but solution is different
User Avatar
#3293
2.9k
views
4 answers
2 votes
made-easy mock test2
Which of the following statement is true related to synchronization mechanism?a) If any solution is satisfying the progress condition, then it will not have any ... waiting is always satisfied if there are only two processes.d) None.
User Avatar
#3294
485
views
1 answers
0 votes
Demand Paging (TestBook Test Series 2)
User Avatar
#3295
10.3k
views
1 answers
4 votes
Demand Paging
Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page ... cause page faults. What is the effective memory access time in milliseconds?
User Avatar
#3296
890
views
1 answers
1 votes
MadeEasy CBT 2017:Operating System - Process Synchronization
User Avatar
#3297
1.8k
views
1 answers
1 votes
Virtual Gate Operating system (Scan Algorithm)
Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was ... that the disk arm moves to satisfy all the pending requests using SCAN schedule?
User Avatar
#3298
890
views
1 answers
1 votes
Is there a relation between overlays and contiguous allocation?
User Avatar
#3299
528
views
1 answers
0 votes
doubt os
User Avatar
#3300
487
views
1 answers
1 votes
Test Book
A process P has three sections namely text, heap and stack and if the size of the page table is 2 MB then on an average, amount of unused page space per process is: (in MB)what does the question even mean?
User Avatar
Page: