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{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\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 &4&2&2&2&3&2&2&1&1&1&2.1&4
\\\hline\textbf{2 Marks Count} & 4 &1&3&4&4&3&2&2&4&3&1&3&4
\\\hline\textbf{Total Marks} & 10 &6&8&10&10&9&6&6&9&7&\bf{6}&\bf{8.1}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Operating System

0 votes

1 answer

2731

SRTF with IO doubt.
When we have SRTF with IO, in the question they give BURST-TIME 1, IO, BURST-TIME2 . My doubt is whether to apply SRTF on total burst time (I mean BT1 + BT2) or on part of burst time like consider only BT1 or BT2 at a time ... answers will change depending on the method we choose the process. Someone please tell me the correct method with some reference if possible. Thanks.

When we have SRTF with IO, in the question they give BURST-TIME 1, IO, BURST-TIME2 . My doubt is whether to apply SRTF on total burst time (I mean BT1 + BT2) or on part o...

Rajesh R

933 views

Rajesh R asked Nov 1, 2017

4 votes

2 answers

2732

self doubt
how to decide maximum limit of virtual address space ? is it max disk space available?

how to decide maximum limit of virtual address space ? is it max disk space available?

arch

230 views

arch asked Oct 31, 2017

0 votes

1 answer

2733

File system doubt
Each inode in a file system has 5 direct pointers to disk blocks, 3 single indirect pointers to disk blocks, 2 double in- direct pointer to disc block and nothing else. A disc block is 500 bytes. A pointer to disc block is 10 bytes. The entire disc ... 000 bytes almost. What is the maximum size in bytes of a file in this file system? A)2552500 B)2575000 C)2575000 D)2577500

Each inode in a file system has 5 direct pointers to disk blocks, 3 single indirect pointers to disk blocks, 2 double in- direct pointer to disc block and nothing else. A...

Surya Dhanraj

1.7k views

Surya Dhanraj asked Oct 31, 2017

4 votes

2 answers

2734

Semaphore
mutex a = 1,b = 0; For P(0): while(1) { P(a); print(1); v(b); } For P(1): while(1) { P(b); print(0); v(a); } Now obviously the output printed is 10101010..... But my doubt is if they ask a regular expression for this question, then what would it be? $(10)*$ or $1 + (10)*$ So my question is will the semaphores always wakeup the process? Can I get a single $"1"$ ?

mutex a = 1,b = 0;For P(0):while(1) { P(a); print(1); v(b);}For P(1):while(1) { P(b); print(0); v(a);}Now obviously the output printed...

Neelay Upadhyaya

1.8k views

Neelay Upadhyaya asked Oct 31, 2017

1 votes

1 answer

2735

Online Test series
Ques: Can Round Robin algorithm be non-preemptive ? My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptive Am I right ? Please corret me if am wrong.

Ques: Can Round Robin algorithm be non-preemptive ?My answer: RR with largest Burst Time as Time Quantum is FCFS in nature and its non-preemptiveAm I right ? Please corre...

manu nandhan

455 views

manu nandhan asked Oct 30, 2017

0 votes

0 answers

2736

cascading and cascadeless
1. Only if there is a commit on any schedule there is chances of cascading? for example R1(d) W2(d) commit2 This is cascading because if commit of T2 fails...T1 has read the value so cascading schedule incase R1(d) W2(d) rollbaack2 now this is cascading or cascadeless schedule?

1. Only if there is a commit on any schedule there is chances of cascading? for example R1(d) W2(d) commit2This is cascading because if commit of T2 fails...T1 has r...

A_i_$_h

389 views

A_i_$_h asked Oct 30, 2017

0 votes

0 answers

2737

self doubt
if we have given 64 bit processor. is that means 2^64 physical memory space is available or 2^64 logical address space is available?

if we have given 64 bit processor.is that means 2^64 physical memory space is available or 2^64 logical address space is available?

arch

225 views

arch asked Oct 30, 2017

0 votes

0 answers

2738

self doubt
i have come across this question and i get different answers from different people but my main doubt is now p1 and p2 not in critical section they are executing exist section and p1 and p2 blocked another process p3. then will this be consider as progress doesnot satisfy? please please someone clarify my doubt.

i have come across this question and i get different answers from different people but my main doubt is now p1 and p2 not in critical section they are executing exist sec...

arch

365 views

arch asked Oct 29, 2017

2 votes

1 answer

2739

Deadlock
There are 5 processes and 10 instances of a Resource. If each process needs ‘P’ instances which is the minimum value of ‘P’ for the deadlock to occur? (a) 1 (b) 2 (c) 3 (d) 4

There are 5 processes and 10 instances of a Resource. If each process needs ‘P’ instances which is the minimum value of ‘P’ for the deadlock to occur?(a) 1 ...

NIKU

3.3k views

NIKU asked Oct 29, 2017

0 votes

0 answers

2740

Threads
Threads of a process share (A) global variables but not heap (B) heap but not global variables (C) neither global variables nor heap (D) both heap and global variables My doubt is thread does share code section , data section and files. So global variables it does share bt does it also share heap section?

Threads of a process share(A) global variables but not heap(B) heap but not global variables(C) neither global variables nor heap(D) both heap and global variablesMy doub...

Na462

866 views

Na462 asked Oct 29, 2017

0 votes

3 answers

2741

Process Synchronisation ( binary semaphores)
Consider the below program as two concurrent processes: Semaphore x:= 0; P1: repeat forever P2: repeat forever 1.V(x); 4. P(x); 2.Compute; 5.Compute; 3.P(x); 6.V(x); Consider the following statements about process P1 & P2: (1) ... chance to run , and it wil starve (THIS IS WHAT I THOUGHT THE ANSWER SHOULD BE , PLEASE COMMENT, IF I AM WRONG ANYWHERE)

Consider the below program as two concurrent processes:Semaphore x:= 0;P1: repeat forever P2: repeat forever1.V(x); ...

NIKU

1.0k views

NIKU asked Oct 28, 2017

0 votes

1 answer

2742

Process Synchronisation
11. Consider the following program: Const int n= 10 int Count= 0 Void A( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin A( ); A( ); A( ); A( ); Par end } What is the minimum and maximum possible value of count after the ... 40 (b) 2, 40 (c) 3, 40 (d) 4, 40 NOTE: I am not able to understand what does "par begin" and "par end" indicates

11. Consider the following program:Const int n= 10int Count= 0Void A( ){ int i;for(i= 1 to n)Count= Count + 1;}Main ( ){Par beginA( );A( );A( );A( );Par end}What is the m...

NIKU

607 views

NIKU asked Oct 28, 2017

0 votes

2 answers

2743

Self doubt
How to understand that no. of entries in inverted page table is equal to no of frames in physical address space?

How to understand that no. of entries in inverted page table is equal to no of frames in physical address space?

Anshul Shankar

1.1k views

Anshul Shankar asked Oct 28, 2017

2 votes

1 answer

2744

advantages of segmented paging over pure paging
As we know segmented paging is an improvement over segmentation and paging but I am having some doubts regarding the memory overhead of these three system.It is clear that segmentation need less memory overhead.But about other two system ... of frag mention is much more than pure paging and also extra segmentation table is required in this system?

As we know segmented paging is an improvement over segmentation and paging but I am having some doubts regarding the memory overhead of these three system.It is clear tha...

reena_kandari

1.8k views

reena_kandari asked Oct 28, 2017

5 votes

2 answers

2745

Dynamic loading
Does Dynamic loading require special support from the operating system.

Does Dynamic loading require special support from the operating system.

Shivi rao

3.7k views

Shivi rao asked Oct 28, 2017

1 votes

1 answer

2746

Round robin will always result in better output compared to FCFS. Is this statement TRUE?
Round robin will always result in better output compared to FCFS. Is this statement TRUE? I know statement is FALSE when time quantum of RR is greater than longest CPU burst time of all the process, so isn't its answer will be FALSE because it talking of "always".

Round robin will always result in better output compared to FCFS. Is this statement TRUE?I know statement is FALSE when time quantum of RR is greater than longest CPU bur...

Rohit Gupta 8

1.5k views

Rohit Gupta 8 asked Oct 28, 2017

1 votes

1 answer

2747

Longest remaining time first
Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time doing CPU, the next 60% of doing I/O computation and the last 20% ... ______ unit. [Note: When same burst occurs for multiple process high priority given to lowest process id] (upto one decimal place)

Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time...

shivangi5

1.1k views

shivangi5 asked Oct 27, 2017

3 votes

1 answer

2748

Hard disk
A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and average 64 sectors/track and has a seek time of 5 msec. Consider the following statements : S1:The data transfer rate of the drive is 6400KBPs S2:The time required to read 800 random sectors is 4.13 sec S3:The time required to read 800 successive sectors is 0.0052 sec The number of statements is/are true _______.

A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and average 64 sectors/track and has a seek time of 5 msec. Consider the following statements :S1:The data...

shivangi5

2.4k views

shivangi5 asked Oct 27, 2017

2 votes

1 answer

2749

thread self-doubt
A thread running in critical section may get context switch .Correct or not?

A thread running in critical section may get context switch .Correct or not?

set2018

217 views

set2018 asked Oct 27, 2017

1 votes

0 answers

2750

testbook test series

rohit vishkarma

272 views

rohit vishkarma asked Oct 27, 2017

Page:

« prev
1
...
132
133
134
135
136
137
138
139
140
141
142
...
262
next »

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true