Recent questions and answers in Operating System - GATE Overflow

0 votes

1 answer

1

Galvin Edition 9 Exercise 4 Question 9 (Page No. 192)
Can a multithreaded solution using multiple user-level threads achieve better performance on a multiprocessor system than on a single processor system ? Explain.

answered 17 hours ago in Operating System by Harshitkmr (129 points) | 14 views

0 votes

1 answer

2

Galvin Edition 9 Exercise 4 Question 8 (Page No. 192)
Which of the following components of program state are shared across threads in a multithreaded process ? a. Register values b. Heap memory c. Global variables d. Stack memory

answered 18 hours ago in Operating System by Harshitkmr (129 points) | 14 views

+7 votes

5 answers

3

ISRO2011-10
Below is the precedence graph for a set of tasks to be executed on a parallel processing system $S$. What is the efficiency of this precedence graph on $S$ if each of the tasks $T1, \dots , T8$ takes the same time and the system $S$ has five processors? 25% 40% 50% 90%

answered 20 hours ago in Operating System by JashanArora Active (1.7k points) | 3k views

+5 votes

2 answers

4

ISRO2007-12
Consider a job scheduling problem with 4 jobs $J_1, J_2, J_3$ and $J_4$ with corresponding deadlines: $(d_1, d_2, d_3, d_4) = (4, 2, 4, 2)$. Which of the following is not a feasible schedule without violating any job schedule? $J_2, J_4, J_1, J_3$ $J_4, J_1, J_2, J_3$ $J_4, J_2, J_1, J_3$ $J_4, J_2, J_3, J_1$

answered 1 day ago in Operating System by JashanArora Active (1.7k points) | 2.8k views

+43 votes

6 answers

5

GATE2004-21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size

answered 1 day ago in Operating System by JashanArora Active (1.7k points) | 6.9k views

+4 votes

2 answers

6

Process scheduling
Consider the following preemptive priority-scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue but not running), its priority changes at a rate X when it is ... is the algorithm that results from Y>X>0? a. LIFO b. FCFS c. Round Robin d. None of the above

answered 2 days ago in Operating System by blackcloud (257 points) | 2.1k views

+2 votes

5 answers

7

ISRO2008-60
Overlaying requires use of a loader allows larger programs, but requires more effort is most used on large computers is transparent to the user

answered 2 days ago in Operating System by JashanArora Active (1.7k points) | 1.6k views

+2 votes

2 answers

8

ISRO2008-49
The total time to prepare a disk drive mechanism for a block of data to be read from it is seek time latency latency plus seek time transmission time

answered 2 days ago in Operating System by JashanArora Active (1.7k points) | 1.9k views

+16 votes

6 answers

9

GATE1999-2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)

answered 2 days ago in Operating System by JashanArora Active (1.7k points) | 3.7k views

+5 votes

8 answers

10

ISRO-2013-65
Consider the list of page references in the time line as below: 9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7 What is the working set at the penultimate page reference if ∆ is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}

answered 3 days ago in Operating System by JashanArora Active (1.7k points) | 3.7k views

+3 votes

7 answers

11

GATE2019-39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ can place a request for at most $Y_i$ additional ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$

answered 5 days ago in Operating System by JashanArora Active (1.7k points) | 2.1k views

+14 votes

5 answers

12

GATE2019-33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path has $128$ ... any TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$

answered 5 days ago in Operating System by JashanArora Active (1.7k points) | 2.9k views

0 votes

2 answers

13

Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 38 (Page No. 336)
Given a disk-block size of $4\: KB$ and block-pointer address value of $4$ bytes, what is the largest file size (in bytes) that can be accessed using $10$ direct addresses and one indirect block?

answered 5 days ago in Operating System by Hradesh patel Loyal (6.3k points) | 32 views

+31 votes

7 answers

14

GATE2009-30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely ... any deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock

answered Nov 28 in Operating System by Deepakk Poonia (Dee) Boss (26.3k points) | 8.6k views

+21 votes

3 answers

15

GATE2008-IT-53
The following is a code with two threads, producer and consumer, that can run in parallel. Further, $S$ and $Q$ are binary semaphores quipped with the standard $P$ and $V$ operations. semaphore S = 1, Q = 0; integer x; producer: consumer: while ( ... may be lost Values generated and stored in '$x$' by the producer will always be consumed before the producer can generate a new value

answered Nov 26 in Operating System by JashanArora Active (1.7k points) | 2.8k views

0 votes

1 answer

16

Galvin Edition 9 Exercise 8 Question 28 (Page No. 393)
Consider the following segment table: $Segment$ $Base$ $Length$ $0$ $219$ $600$ $1$ $2300$ $14$ $2$ $90$ $100$ $3$ $1327$ $580$ $4$ $1952$ $96$ What are the physical addresses for the following logical addresses ? $a. 0,430$ $b. 1,10$ $c. 2,500$ $d. 3,400$ $e. 4,112$

answered Nov 22 in Operating System by jyotsnamane1999 (11 points) | 46 views

+54 votes

12 answers

17

GATE2007-IT-83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number $180$. 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$

answered Nov 21 in Operating System by Vimal Patel (137 points) | 6k views

+6 votes

4 answers

18

ISRO-2013-57
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption

answered Nov 20 in Operating System by Shailendra_ Junior (555 points) | 2k views

0 votes

1 answer

19

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 40 (Page No. 177)
Round-robin schedulers normally maintain a list of all runnable processes, with each process occurring exactly once in the list. What would happen if a process occurred twice in the list? Can you think of any reason for allowing this?

answered Nov 16 in Operating System by mahabir10 (177 points) | 11 views

0 votes

1 answer

20

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 42 (Page No. 177)
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.

answered Nov 14 in Operating System by PrakharSrivastava (21 points) | 12 views

0 votes

1 answer

21

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 39 (Page No. 177)
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); } How many child processes are created upon execution of this program?

answered Nov 14 in Operating System by inc0gnito (11 points) | 34 views

+78 votes

5 answers

22

GATE2010-46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ ... In which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$

answered Nov 11 in Operating System by ankitron (257 points) | 8.8k views

+27 votes

5 answers

23

GATE2006-IT-12
In the working-set strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there are enough extra frames. It selects a process to suspend if the sum of the sizes of the working-sets exceeds the total number of available frames. I only II only Neither I nor II Both I and II

answered Nov 11 in Operating System by Shailendra_ Junior (555 points) | 2.7k views

+19 votes

3 answers

24

GATE2002-1.22
Which of the following scheduling algorithms is non-preemptive? Round Robin First-In First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback

answered Nov 11 in Operating System by Shailendra_ Junior (555 points) | 1.4k views

+33 votes

7 answers

25

GATE1997-6.8
Each Process $P_i$, i = $1....9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None

answered Nov 11 in Operating System by prince_sbh (13 points) | 6.3k views

+31 votes

10 answers

26

GATE2009-33
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter_CS(X) { while(test-and-set(X)); } void leave_CS(X) { X = 0; } In the above solution, $X$ is a memory location associated with ... at the same time Which of the above statements are TRUE? (I) only (I) and (II) (II) and (III) (IV) only

answered Nov 10 in Operating System by Madhab Active (5.1k points) | 7k views

0 votes

2 answers

27

MadeEasy Workbook: Operating System - Resource Allocation

answered Nov 10 in Operating System by arya_stark Active (1.7k points) | 145 views

+27 votes

5 answers

28

GATE2007-IT-11
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$ ... $J7$ will be completed will be $16$ $19$ $20$ $37$

answered Nov 9 in Operating System by Madhab Active (5.1k points) | 5.1k views

+14 votes

3 answers

29

GATE2007-83
A process, has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page references (reference string): $1, 2, 1, 3, 7, 4, 5, 6, 3, 1$ Least ... the above reference string, how many more page faults occur with LRU than with the optimal page replacement policy? $0$ $1$ $2$ $3$

answered Nov 9 in Operating System by Chirag Shilwant (103 points) | 1.5k views

+1 vote

2 answers

30

Operating Systems concepts(Galvin)
Hello I am reading chapters from Galvin and attempting its back exercises. However, there is nothing to compare my answers to, I mean there are no answers given anywhere. Do you guys have any idea of any answer key thank you

answered Nov 8 in Operating System by shivam001 Junior (611 points) | 525 views

+3 votes

3 answers

31

GATE2002-18-b
The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C function int TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: return y; } Complete the following C functions for implementing code for ... starvation-free? For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic?

answered Nov 6 in Operating System by jlimbasiya (301 points) | 527 views

+23 votes

3 answers

32

GATE1999-2.10
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging

answered Nov 5 in Operating System by Doraemon Junior (729 points) | 4.2k views

0 votes

2 answers

33

Scheduling
Consider a uniprocessor system which has to execute an infinite sequence of processes which arrive periodically at the rate of 6 processes per minute and each process requires an average of 9 seconds of service time. The fraction of time CPU busy is _________ (in sec).

answered Nov 5 in Operating System by mohan123 Active (1.3k points) | 196 views

+4 votes

1 answer

34

test series
Consider the following statements w.r.t. deadlock, 1. An OS implements a policy that requires a process to release all resources before making a request for another resource can lead to starvation but not deadlock. 2. In deadlock prevention, ... decreasing resource number. 4. Deadlock avoidance has less restrictions than deadlock prevention. Which of the above statement is/are false?

answered Nov 5 in Operating System by mohan123 Active (1.3k points) | 71 views

+28 votes

4 answers

35

GATE2015-2-25
A computer system implements a $40-bit$ virtual address, page size of $8$ $\text{kilobytes}$, and a $128-entry$ translation look-aside buffer ($TLB$) organized into $32$ sets each having $4$ ways. Assume that the $TLB$ tag does not store any process id. The minimum length of the $TLB$ tag in bits is ____.

answered Nov 4 in Operating System by shivam001 Junior (611 points) | 5.3k views

+10 votes

2 answers

36

ISRO2016-51
For the real time operating system, which of the following is the most suitable scheduling scheme? Round robin First come first serve Pre-emptive Random scheduling

answered Nov 4 in Operating System by Harshitkmr (129 points) | 4.7k views

0 votes

1 answer

37

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 6 (Page No. 429 - 430)
Suppose that a system uses DMA for data transfer from disk controller to main memory. Further assume that it takes $t_{1}\: nsec$ on average to acquire the bus and $t_{2}\:nsec$ to transfer one word ... acquiring the bus to send one word and acknowledging a transfer also requires acquiring the bus to send one word.

answered Nov 3 in Operating System by `JEET Boss (12.9k points) | 20 views

0 votes

1 answer

38

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 5 (Page No. 429)
A DMA controller has five channels. The controller is capable of requesting a $32$-bit word every $40\: nsec.$ A response takes equally long. How fast does the bus have to be to avoid being a bottleneck?

answered Nov 3 in Operating System by `JEET Boss (12.9k points) | 16 views

+1 vote

1 answer

39

Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 44 (Page No. 470)
In certain countries, when two people meet they bow to each other. The protocol is that one of them bows first and stays down until the other one bows. If they bow at the same time, they will both stay bowed forever. Write a program that does not deadlock.

answered Nov 1 in Operating System by GMPrakhar (23 points) | 71 views

0 votes

1 answer

40

Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 34 (Page No. 468)
Explain the differences between deadlock, livelock, and starvation.

answered Nov 1 in Operating System by `JEET Boss (12.9k points) | 19 views

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

Recent questions and answers in Operating System

50,648 questions

56,422 answers

195,196 comments

99,863 users