Search results for made-easy-test-series+operating-system / GATE Overflow for GATE CSE

A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX(A B C)Alloc...

roopkathaaa

1.6k views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

5

daedlocks and threads operating system
Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T. Process P: Process Q: while(1){ while(1){ W: Y: print 0'; print 1'; print 0'; print 1'; X: Z: } Synchronization statements can be inserted only at points W,X,Y,Z. Which of the ... S = T= 1 d. W : P(S) X : V(S) Y : P(T) Z: V(T) and initially S = 1 and T= 0

Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T.Process P: Process Q: while(1){ ...

roopkathaaa

301 views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

6

deadlocks and threads operating system
State true or false. Deadlock detection is possible using the allocation and request matrices alone. A way to recover from deadlock is to take away the resource from one of the processes or to kill the process itself. Banker's algorithm is ... deadlocks by analyzing the unsafe states. True, True, False False, True, True True, False, True False, True, False

State true or false.Deadlock detection is possible using the allocation and request matrices alone.A way to recover from deadlock is to take away the resource from one of...

roopkathaaa

838 views

roopkathaaa asked Sep 2, 2023

1 votes

2 answers

7

#MadeEasy
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How many ordered pairs (a,b) are possible, such that the system is deadlock free?

consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How ma...

Dknights

805 views

Dknights asked Dec 5, 2022

0 votes

1 answer

8

OS
By default the memory address starts with 0. But they have considered from 1. What should I consider when nothing is mentioned?

By default the memory address starts with 0. But they have considered from 1.What should I consider when nothing is mentioned?

DAWID15

487 views

DAWID15 asked Jan 22, 2023

2 votes

1 answer

9

What is the solution?
I think the answer must be 500200ns

I think the answer must be 500200ns

h4kr

324 views

h4kr asked Dec 29, 2022

4 votes

1 answer

10

Multilevel paging
The below question is from made easy test series: Consider a 32 bit virtual address as follows: 10 8 6 8 P1 P2 P3 Offset System uses 3 level paging and the bits for the respective levels are as indicated above. Then the size of page table for a process which requires 256 KB of ... $\frac{2^{8}} {2} $ = 2$^{7}$ pages. I don't know what I am getting wrong. Please correct me.

The below question is from made easy test series:Consider a 32 bit virtual address as follows: 10 8 6 8 P1 P2 P3 ...

Chaitanya Kale

1.4k views

Chaitanya Kale asked Dec 3, 2022

1 votes

1 answer

11

Made Easy Mock -1

TusharKumar

411 views

TusharKumar asked Dec 29, 2022

0 votes

0 answers

12

Made Easy Test Series Question on DeadLock
Q: Consider a system having 22 resources of same type. These resources are shared by 4 processes P,Q,R and S having peak demands of 3, 6, a and b. How many ordered pairs (a,b) are possible such that the system is deadlock free? According to me ... for a process be 0? In that case a-1 or b-1 will become -1 which will impact the inequality. So is this valid?

Q: Consider a system having 22 resources of same type. These resources are shared by 4 processes P,Q,R and S having peak demands of 3, 6, a and b. How many ordered pairs ...

Sunnidhya Roy

516 views

Sunnidhya Roy asked Dec 27, 2022

3 votes

1 answer

13

Made easy test series
Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are possible for a process P with more than one user-level threads in above system? A)P is in running ... than one threads of P are in running state. D)P is in ready state and a thread of P is in running state. .

Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are po...

viral8702

585 views

viral8702 asked Oct 12, 2022

0 votes

0 answers

14

File System, Operating System
In case of Indexed Allocation Technique in File System of OS does the last address of the index file actually points to the address of the next Index file. If so then should we remove 1 from the total number of addresses possible in ... concept where this last address of the Index file is also considered while calculating the File Size. Can someone please clarify?

In case of Indexed Allocation Technique in File System of OS does the last address of the index file actually points to the address of the next Index file. If so then sho...

royS96

342 views

royS96 asked Oct 24, 2022

1 votes

1 answer

15

Made Easy Test Series 2021: Operating System
Consider the following segment: Note : Assume the count = count + 1; will execute in 3' different instructions. Where, m[count] refers to memory value of count variable. Preemption can occur while executing the above instructions. Each of the tally function has a separate ... 15 b) Min = 2, Maximum = 15 c) Min = 1, Maximum = 15 d) Min = 15, Maximum = 15

Consider the following segment:Note : Assume the count = count + 1; will execute in ‘3’ different instructions.Where, m[count] refers to memory value of count variabl...

DebRC

1.1k views

DebRC asked Sep 12, 2022

0 votes

0 answers

16

Operating System
1. Write clearly the dinning philosopher and reader-writer classical problem of process synchronization

1. Write clearly the dinning philosopher and reader-writer classical problem of process synchronization

kidussss

251 views

kidussss asked Sep 1, 2022

1 votes

1 answer

17

Made easy || Operating system
Consider a process P running on a system with non-preemptive Kernel design. Consider following actions by P : (i) A blocking system call. (ii) Servicing a timer interrupt. (iii) Exit system call. (iv) Servicing a disk interrupt, that results in another blocked process being marked as ready. Which of the above actions always result in context-switch of P?

Consider a process P running on a system with non-preemptive Kernel design. Consider following actions by P :(i) A blocking system call.(ii) Servicing a timer interrupt.(...

Shreya2002

1.6k views

Shreya2002 asked Aug 5, 2022

0 votes

2 answers

18

Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt

While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an unsafe state.(c) If a sy...

Shreya2002

1.3k views

Shreya2002 asked Aug 5, 2022

1 votes

1 answer

19

MadeEasy Test Series: Operating System - Process
Q. A process spends 25% of its time waiting for I/O to complete. if 3 process in memory at a time, then the probability of CPU utilized(assume all I/O process are overlapped) is...................... so here 2 solution plz check first one why not correct 1. 1 - [ (3C1 * ... (.75)^2 + (3C2 *(.25)^2* (.75) + (3C3 *(.25)^3* ) 2. 1 - [ (3C3 *(.25)^3* ) ]

Q. A process spends 25% of its time waiting for I/O to complete. if 3 process in memory at a time, then the probability of CPU utilized(assume all I/O process are overlap...

Hradesh patel

647 views

Hradesh patel asked Nov 14, 2016

0 votes

2 answers

20

the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P(S1); P(S2); P(S3); Critical Section V(S3); V(S2); V(S1); Does it satisfy mutual exclusion, progress and bounded waiting?

Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 = 1;P(S1);P(S...

syncronizing

4.9k views

syncronizing asked Jan 6, 2019

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