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

#2921
232
views
0 answers
2 votes
Gate2018
User Avatar
#2922
1.4k
views
2 answers
0 votes
UGC NET CSE | December 2009 | Part 2 | Question: 40
The Unix command used to find out the number of characters in a file is(A) nc(B) wc(C) chcnt(D) lc
User Avatar
#2923
4.8k
views
1 answers
1 votes
UGC NET CSE | December 2009 | Part 2 | Question: 39
A program is located in the smallest available hole in the memory is _________(A) best – fit(B) first – bit(C) worst – fit(D) buddy
User Avatar
#2924
1.2k
views
1 answers
1 votes
UGC NET CSE | December 2009 | Part 2 | Question: 38
A semaphore count of negative n means (s = – n) that the queue contains ________ waiting processes.(A) n + 1(B) n(C) n – 1(D) 0
User Avatar
#2925
628
views
1 answers
0 votes
UGC NET CSE | December 2009 | Part 2 | Question: 37
A page fault(A) is an error specific page.(B) is an access to the page not currently in memory.(C) occur when a page program occur in a page memory.(D) page used in the previous page reference
User Avatar
#2926
3.1k
views
1 answers
3 votes
Paging, Segmentation, Virtual Memory, OS
Consider a computer system where the size of logical address space and physical addresses space is respectively 2^16 Bytes , with segmented paging architecture applicable. The virtual address ... frame?(a) 256 B(b) 128B(c) 512 B(d) 1024 B
User Avatar
#2927
2.5k
views
1 answers
0 votes
UGC NET CSE | December 2009 | Part 2 | Question: 36
In the process management Round-robin method is essentially the pre-emptive version of _________(A) FILO(B) FIFO(C) SSF(D) Longest time first
User Avatar
#2928
2.6k
views
1 answers
0 votes
UGC NET CSE | December 2009 | Part 2 | Question: 31
In an absolute loading scheme which loader function is accomplished by assembler ?(A) re-allocation(B) allocation(C) linking(D) loading
User Avatar
#2929
247
views
0 answers
0 votes
swapping in and out a process gives different address
#include<stdio.h> int main() { int a; printf(" %u ",&a); return 0; }When we associate '&' with a variable the address we get is the virtual ... a system with virtual memory. Then why swapping in and out a process gives different address.
User Avatar
#2930
558
views
1 answers
0 votes
Self doubt
What are the reasons behind 'Belady's Anomaly' ?I think FIFO causes belady's anomaly because it's don't replace pages mindfully , while LRU,OPTIMAL do ... taking care of locality.so is Locality of reference reason behind Belady's anomaly ?
User Avatar
#2931
127
views
0 answers
1 votes
Self doubt
I think it's possible if the process is child process and it's parent process is being terminated arbitrary then child process can terminate directly from I ... .cs.cornell.edu/courses/cs4410/2008fa/homework/hw1_soln.pdf where am i wrong?
User Avatar
#2932
1.7k
views
1 answers
1 votes
Operating system -paging
Consider a system using paging with TLB.What hit ratio is required to reduce the effective memory access time from 200 ns to 140 ns , by assuming TLB access time of 20 ns.a)85% b)80% c)90% d)95%
User Avatar
#2933
1.2k
views
0 answers
0 votes
Basic page table question
Consider a system implementing a 2 level page table. Memory access time = 10ns. Hit ratio of page table = 0.3. Page fault access time = 50ns.What is average ... as we need to access 2 page tables first and then access main memory for hit ?
User Avatar
#2934
662
views
1 answers
0 votes
Security
In a mandatory access control, information from top secret object will not flow to secret and vice versaTrueFalse
User Avatar
#2935
550
views
0 answers
0 votes
Context Switching
Where is the PCB and the process saved in the main memory when context switch takes place ?
User Avatar
#2936
294
views
1 answers
0 votes
Security
Match the following a. Secrecy. 1. Limit the resource usage. b Integrity 2. Unauthorized modification c availbility. 3. Unauthorized disclosure
User Avatar
#2937
707
views
1 answers
0 votes
Security
ASLR randomizesa. The size of all arrays, thereby by making it difficult to perform buffer overflowsb. All instructions in the programc. Positions of the stack, heap and librariesd. Position of all variables in the stack
User Avatar
#2938
510
views
1 answers
0 votes
Security
The number of gadgets present in the implementation depends on the number of C3 instruction in the machine codeTrueFalse
User Avatar
#2939
663
views
2 answers
0 votes
Security
User x has found that s source code has a buffer overflow vulnerability caused by strcpy instruction. He then used strncpy in place of strcpy to prevent buffer ... checkc. This will not make any change in the source coded. None of these
User Avatar
#2940
422
views
0 answers
0 votes
Security
Arrange the following, based on the order the parameters are pushed into the stacka. Return address is pushedb. The function call parameters c. Previous frame pointersd. Local variables are ... .b, c, d, a3.b, a, c, d4.a, c, b, d
User Avatar
Page: