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

#2941
701
views
1 answers
0 votes
Security
The non executable state helps to prevent buffer overflow attack, but the overhead of making a stack as non executable stack is more than that of canaries a. Trueb. False
User Avatar
#2942
855
views
1 answers
1 votes
Security
Suppose a source code has buffer overflow vulnerabilities. Which of the following can cause buffer overflow vulnerabilities a. Scanf("%s",...) b. Strcpy(destination, ... connection Options1. Only a2. b and c3. a and b4.all of the above
User Avatar
#2943
4.7k
views
1 answers
5 votes
Dining philosophers problem
In dining philosophers Algorithm the minimum number of forks or chopsticks to avoid deadlock is (assume there are 5 philosophers)a. 5b. 6c. 10d. None of these
User Avatar
#2944
390
views
0 answers
0 votes
Dining philosophers Algorithem
What is the minimum number of forks required to prevent deadlock in dining philosophers Algorithem a. 5b. 6c. 10d. None of these
User Avatar
#2945
1.4k
views
1 answers
1 votes
Deadlocks and threads
Which one of the following is false about user threads1. User threads can switch fast since it does noy invoke kernel2.user threads are light weight since they do ... of every user threads ie if it is blocking or run able4.none of these
User Avatar
#2946
1.1k
views
1 answers
1 votes
Deadlocks and threads
State true or false A program to compute the sum of first 10000 numbers can be divided into 4 sub parts and executed on 4 CPUs using either forks/threads. ... between the 4 subparts are very similar and need not duplicated. A. TrueB. False
User Avatar
#2947
1.6k
views
0 answers
0 votes
Deadlocks and threads
In a non multi programming os, a deadlock will occur due toa. When two process share the same variable b. Can never happenC. When two process run at the same time, waiting for resources held by each otherD. When an interrupt occurs.
User Avatar
#2948
2.1k
views
2 answers
0 votes
Difference between Dynamic Loading and Demand Paging
In Dynamic Loading:- We load the particular module into the main memory when it is needed.In Demand Paging:- We load the particular page into the main memory when it is needed.Both don't seems to be same??
User Avatar
#2949
461
views
1 answers
1 votes
Page Table is divided into 8K pages and each page contain 2k entries.
Page Table is divided into 8K pages and each page contain 2k entries. Page table entry size is 4 bytes and page size is 1 K wordsQ find outa)Logical addressb)no of pages in LASc)1st level page table sized)2nd level page table size
User Avatar
#2950
2.6k
views
2 answers
1 votes
Process Synchronization
Consider Three binary Semaphore Q = R = 1 , S = 0; Process P1:- P(Q); P(R); /* CRITICAL SECTION */ V(Q); V(R);Process P2:- P(R); P ... into critical section,1. then Bounded Wait is satisfied or not.2. then Starvation is satisfied or not.
User Avatar
#2951
5.9k
views
2 answers
7 votes
TLB and page fault
in a virtual memory system which of the following is not possiblea)TLB miss with no page faultb)TLB miss with page faultc)TLB hit and page faultd) ... ??may be there is something wrong in the concept that i have understoodplease help
User Avatar
#2952
420
views
0 answers
0 votes
synchronisation mechanism
which of the following synchronisation mechanisms is starvation free with respect to bounded waitinga)TSLb)SWAPc)strict alterationd)lock variablealso please explain what is SWAP
User Avatar
#2953
841
views
1 answers
2 votes
Deadlock Prevention
Unable to understand the following text taken from Galvin 9th edition Chapter 7 Deadlock Page 326. Imposing a lock ordering does not guarantee deadlock ... 25);and another might invoketransaction(savings account, checking account, 50);
User Avatar
#2954
859
views
0 answers
1 votes
Doubt Regarding All terminologies Used in UNIX INODE
Explain the following terms with there respective formula (expression)1) Max file size2) Max possible file size3) Max Disk Size4) Total file size5) max possible ... .When to use what please clear this doubt.
User Avatar
#2955
667
views
3 answers
2 votes
operating system
Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what ... Shortest Job Next scheduling algorithm is used?(a) 7.5(b) 6.25(c) 6.5(d) None
User Avatar
#2956
1.6k
views
1 answers
5 votes
CPU scheduling
Which of the following CPU scheduling leads to convey effect?i) SJFii) Priorityiii) FCFSthe answer is all .is it true ?Also , i read somewhere .. ... SJF convoy effect is usually confused with priority inversion .kindly clear this doubt .
User Avatar
#2957
272
views
1 answers
2 votes
self doubt
WHAT HAPPENS WHEN WE WRITE CODE IN THE CRITICAL SECTION IN SUCH A WAY THAT WE CALL THE WAIT() ON THE BINARY SEMAPHORE WE ALREADY CALLED A WAIT() ON ??DEADLOCK WITH A SINGLE PROCESS ???IS THIS POSSIBLE ??
User Avatar
#2958
1.2k
views
1 answers
2 votes
Concurrent Processes
Consider the program segment:x= 0; y=0;Cobeginbeginx= 1;y= y + x;endbeginy= 2;x= x + 3;endCoend;Which of the following indicates possible values for the variables when the segment ... 2 only(c) 1 & 3 only (d) 2 & 3 only(e) 1, 2, 3
User Avatar
#2959
4.9k
views
1 answers
3 votes
Counting Semaphores
2. Assume that C' is a Counting Semaphore initialized to value 10'. Consider the followingprogram segment:P(C); V(C); P(C); P(C); P(C); V(C); V(C)V(C); V(C); V(C); P(C); V(C); ... 8 b)10c)12 d)14
User Avatar
#2960
4.7k
views
1 answers
2 votes
UNIX INODE
the unix i node holds 8 direct disk block address a single indirect and double indirect disk block addresses. if the disk blocks are accessible with 16 bits and disk ... is 12 bits. the maximum file size supported is (IN TERMS OF GB)??
User Avatar
Page: