Recent questions and answers in Operating System

Recent questions and answers in Operating System

0 votes

1 answer

1

Process synchronzation
A particular computation of counting semaphore is 7 Then 20p operation and x. V operation were completed on this semaphore If the final value of X will be 5 then what will be the value of x? Options a) 13 b) 18 C) 22 d) 2

Vaishnavi Gadhe asked in Operating System 3 days ago

by Vaishnavi Gadhe

26 views

0 votes

1 answer

2

Operating System | Process Scheduling | Round Robin
Lets consider one situation where, OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue is also P1 (this case is possible in Round Robin). ... take place in Round Robin scheduling method with quantum=3unit for the given data below. AT=Arrival Time, BT=Burst Time

ajaycs_gate2023 answered in Operating System 4 days ago

by ajaycs_gate2023

128 views

0 votes

1 answer

3

justify the answer
how many child process will be created for the following code.how many hello and welcome will be printed #include <stdio.h> void main() { fork(); fork(); printf("Hello \n"); fork(); printf("welcome\n"); }

Kabir5454 answered in Operating System Jun 27

49 views

0 votes

1 answer

4

Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 18 (Page No. 334)
Consider a file whose size varies between $4\: KB$ and $4\: MB$ during its lifetime. Which of the three allocation schemes (contiguous, linked and table/indexed) will be most appropriate?

DebSujit answered in Operating System Jun 25

158 views

1 vote

3 answers

5

Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 23 (Page No. 334)
Consider a $4-TB$ disk that uses $4-KB$ blocks and the free-list method. How many block addresses can be stored in one block?

DebSujit answered in Operating System Jun 24

817 views

0 votes

3 answers

6

Is priority inversion problem a case of deadlock?
I have read in some notes that priority inversion problem is a case of spin lock, not deadlock because in deadlock the processes are in blocked state, but here the processes are busy waiting and consuming memory. I have also read in a note ... different states. Which one of this is true? Is this problem a case of spin-lock or live lock or deadlock?

Vishnu__ answered in Operating System Jun 24

189 views

57 votes

6 answers

7

GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion

Godlike answered in Operating System Jun 24

14.1k views

0 votes

0 answers

8

In the 'Intersted variable' method for synchronization is there a possiblity of deadlock or spinlock?

JAINchiNMay asked in Operating System Jun 23

34 views

0 votes

1 answer

9

what is the user identification number in process control block?

DebSujit answered in Operating System Jun 23

34 views

3 votes

2 answers

10

GATE CSE 2022 | Question: 28
Which one of the following statements is $\text{FALSE}?$ The $\text{TLB}$ performs an associative search in parallel on all its valid entries using page number of incoming virtual address. If the virtual address of a word given by $\text{CPU}$ has a ... $\text{V2}$ map to the same value while hashing, then the memory access time of these addresses will not be the same.

Abhrajyoti00 answered in Operating System Jun 21

by Abhrajyoti00

1.0k views

4 votes

2 answers

11

GATE CSE 2022 | Question: 16
Which of the following statements is/are $\text{TRUE}$ with respect to deadlocks? Circular wait is a necessary condition for the formation of deadlock. In a system where each resource has more than one instance, a cycle in its wait-for graph ... the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.

Abhrajyoti00 answered in Operating System Jun 17

by Abhrajyoti00

1.0k views

1 vote

1 answer

12

GATE Suitability Test | Test 1 | Question: 2
The set of values printed (in any order) by the following code will be #include<stdio.h> #include<unistd.h> int main() { static int count; if(fork()) { count++; } if(fork() && !count++) count++; printf(“%d \t”, count); } 0 1 1 2 0 0 1 2 0 1 2 2 2 2 2 2

akshaw answered in Operating System Jun 7

by akshaw

72 views

0 votes

1 answer

13

MadeEasy Full Length Test 2019: Operating System - Process Schedule

Himanshu555 answered in Operating System May 29

634 views

47 votes

7 answers

14

GATE CSE 2013 | Question: 16
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c$ and $d$ ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$

NileshB answered in Operating System May 29

11.9k views

0 votes

1 answer

15

MadeEasy Test Series: Operating System - Resource Allocation
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock-free ... Similar to https://gateoverflow.in/220031/deadlock. It seems many answers are possible and no proper explanation is present.

Himanshu555 answered in Operating System May 28

740 views

1 vote

1 answer

16

Applied Test Series
It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mutual exclusion. Initial value of M is 1. The value of M is decremented by any process ... = 1, E = 7, F = 0 Out of the four combinations given above, the total number of combinations which cannot exist is ____

Himanshu555 answered in Operating System May 25

240 views

0 votes

2 answers

17

Is "operating system three easy pieces" Book is enough for gate exam?
Is "operating system three easy pieces" Book is enough for gate exam? Or I read another book especially for GATE exam Please tell I am confused

computerstudy answered in Operating System May 22

by computerstudy

97 views

18 votes

2 answers

18

GATE CSE 2007 | Question: 57
A single processor system has three resource types $X, Y$ and $Z$, which are shared by three processes. There are $5$ units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each ... $P0$ $P1$ $P2$ None of the above, since the system is in a deadlock

jainsahil7 answered in Operating System May 18

7.6k views

0 votes

0 answers

19

Explain why the call to the lock() method in a Java ReentrantLock is not placed in the try clause for exception handling, yet the call to the unlock() method is placed in a finally clause.

kevinkiangs asked in Operating System May 14

29 views

0 votes

0 answers

20

Semaphores
Using semaphores, design a solution to manage clients access to five banking tellers given the following operation scenario: The bank has a space with 15 chairs and a standing area that can accommodate up to 10 clients. Hence, the maximum number of clients allowed to ... ticket, the client needs to enter his ID. When a teller is available, one. help me to answer this question please.

merna asked in Operating System May 13

by merna

51 views

0 votes

0 answers

21

Race conditions identification and application of mutex lock
We define a semaphore as follows: typedef struct { int value; struct process *list; } semaphore; Each semaphore has an integer value and a list of processes list. When a process must wait on a semaphore, it is added ... above implementation of wait() and signal(), and illustrate how to resolve the problem using the mutex lock mechanism.

Leo0515 asked in Operating System Apr 16

101 views

1 vote

2 answers

22

Operation system Applied test series 2022
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct? Mutual exclusion satisfied Progress is not satisfied Bounded waiting is not satisfied None of the above Can anyone help me in this A should not be the ans as there is no restriction on atomicity. What about b and c.

manikantsharma answered in Operating System Apr 14

by manikantsharma

288 views

4 votes

4 answers

23

ISRO2020-57
The hardware implementation which provides mutual exclusion is Semaphores Test and set instructions Both options None of the options

manikantsharma answered in Operating System Apr 14

by manikantsharma

3.0k views

3 votes

3 answers

24

GATE CSE 2022 | Question: 9
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\text{S}_{1}, \text{S}_{2},$ and $\text{S}_{3},$ operated upon using standard $\textsf{wait}()$ ... $\text{S}_{1} = 0; \text{S}_{2} = 1; \text{S}_{3} = 1$

manikantsharma answered in Operating System Apr 14

by manikantsharma

1.2k views

79 votes

15 answers

25

GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$

Nitesh_Yadav answered in Operating System Apr 10

by Nitesh_Yadav

16.4k views

1 vote

1 answer

26

Testbook Test Series: Operating System - Process Synchronization
Que- Consider the following statements about the dining philosopher problem. 1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers. 2. If the asymmetric solution is implemented then $1^{st}$ philosopher picks up her right ... above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above

Vaishnavi Gadhe answered in Operating System Apr 9

by Vaishnavi Gadhe

481 views

0 votes

1 answer

27

Self Doubt
Suppose we have priority-based processes. Which scheduler will replace a low priority process which is presently executing when a high priority process arrives in the ready queue? Also which scheduler is responsible for pulling out a process from CPU if it requests I/O?

Aditya_ answered in Operating System Apr 6

112 views

1 vote

1 answer

28

BARC 2022
In Dining philospher problem, there are X number of dinners and Y number of chopsticks. What is the minimum number of chopsticks required to insure that there will be no deadlock? A) X B) Y - X C) Y - X + 1 D) [Y/2] + 1

amitraj123 answered in Operating System Apr 5

102 views

25 votes

7 answers

29

GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked

s_dr_13 answered in Operating System Apr 5

10.1k views

6 votes

5 answers

30

deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above

s_dr_13 answered in Operating System Apr 5

9.1k views

0 votes

2 answers

31

NIELIT 2017 DEC Scientist B - Section B: 21
A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlock Can never occur Has to occur May occur None of the options

s_dr_13 answered in Operating System Mar 30

669 views

0 votes

3 answers

32

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)

skbgp answered in Operating System Mar 23

by skbgp

695 views

0 votes

1 answer

33

Producer Consumer, if buffer is empty in begining(self doubt)?
I am confused in understanding the complete flow of producer-consumer problem in following schenerio. Let currently buffer in empty and there is no data in there,and let some how consumer starts executing and will make F = ... the counting semaphore helping consumer to determine if there is even a single buffer full to consume from it.

amitraj123 answered in Operating System Mar 21

89 views

1 vote

3 answers

34

NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.

33 answered in Operating System Mar 16

by 33

404 views

0 votes

1 answer

35

does the job scheduler only select the process or bring the process from new state to ready state?

33 answered in Operating System Mar 15

by 33

121 views

0 votes

0 answers

36

What will happen when a process terminates?
What will happen when a process terminates? a) It is removed from all queues b) It is removed from all, but the job queue c) Its process control block is de-allocated d) Its process control block is never de-allocated

Anmol1512 asked in Operating System Mar 15

6 views

0 votes

0 answers

37

GATE CS previuos year question but with change :Operating System
Q.1 In round-robin scheduling there are 'n' no. of processes in ready queue and time slice is 'q' units in worst case, the interrupted process will get the CPU again after (a) (n-1)q units (b) nq units (c) (q-1)n units (d) (q + 1)n units (PLEASE Answer with Explanation if possible )

abhinowKatore asked in Operating System Mar 10

by abhinowKatore

129 views

0 votes

1 answer

38

Where is PCB initially present/created?
Is the PCB created and reside in Secondary Memory until Long Term Scheduler picks up a process or It is created in Main Memory?

33 answered in Operating System Mar 6

by 33

172 views

0 votes

0 answers

39

GATE Applied Roots CSE 2022
Consider a file currently consisting of 100 blocks. Assume that the file control block is already in memory. The number of disk I/O operations required for the contiguous allocation case where a block is removed from the middle(51st block) is ________ ... , but there is room to grow in the end. Assume that the block information to be added is stored in memory.

rsansiya111 asked in Operating System Mar 3

124 views

0 votes

1 answer

40

Institute of Technology, GNCTD
If the average page-fault service time of 20 𝑚s, a 𝑀AT of 80 𝑛s and the probability of a page fault is 10 %. An effective access time will be: 2,000,672 𝑛s 2,000,072 𝑛s 2,000,036 𝑛s 2,000,006 𝑛s

Aditya_ answered in Operating System Feb 25

87 views

To see more, click for all the questions in this category.

Follow @gateoverflow

Recent questions and answers in Operating System

Search GATE Overflow for GATE CSE