Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions and answers in Operating System
0
votes
0
answers
1
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory is of 6 and 4 pages, respectively. When the same page trace is operated under the optimal policy, the number of page faults may be: (a) 9 and 7 (b) 7 and 9 (c) 10 and 12 (d) 6 and 7
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when ...
Reetu Chaudhary
10
views
Reetu Chaudhary
asked
8 hours
ago
Operating System
operating-system
demand-paging
page-replacement
least-recently-used
page-fault
+
–
18
votes
6
answers
2
GATE CSE 2019 | Question: 42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk bloc...
Vivek jangir
23.2k
views
Vivek jangir
answered
14 hours
ago
Operating System
gatecse-2019
numerical-answers
operating-system
file-system
2-marks
+
–
45
votes
6
answers
3
GATE CSE 2010 | Question: 23
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables $S1$ and $S2$ ... ? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables...
Vivek jangir
18.1k
views
Vivek jangir
answered
1 day
ago
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
0
votes
0
answers
4
OS | File Management | Made Easy Q105
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes of a file that can be accessed by quadruple pointer is 4TB using the ... Answer: 32bits i'm bit confused in the difference between I-Node disk block size and the given disk block size.
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes...
RahulVerma3
17
views
RahulVerma3
asked
1 day
ago
Operating System
operating-system
file-system
+
–
12
votes
3
answers
5
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.
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 ea...
https_guru
12.7k
views
https_guru
answered
3 days
ago
Operating System
gatecse-2022
operating-system
resource-allocation
multiple-selects
1-mark
+
–
1
votes
2
answers
6
UGC NET CSE | September 2013 | Part 2 | Question: 45
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is _____ 36 ns 140 ns 122 ns 40 ns
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access ...
INDU3504
4.8k
views
INDU3504
answered
5 days
ago
Operating System
ugcnetsep2013ii
operating-system
cache-memory
hit-ratio
+
–
3
votes
3
answers
7
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 24
Consider a job A arrives at time $T=0$ and job length of $500 \mathrm{~ms}$. Job $B$ arrives at time $\mathrm{T}=100 \mathrm{~ms}$ with a length of $100 \mathrm{~ms}$. Considering the Shortest Remaining Time First Scheduler, what does ... for $100 \mathrm{~ms}$, then $B$ runs for $100 \mathrm{~ms}$, then A runs for $300 \mathrm{~ms}$
Consider a job A arrives at time $T=0$ and job length of $500 \mathrm{~ms}$. Job $B$ arrives at time $\mathrm{T}=100 \mathrm{~ms}$ with a length of $100 \mathrm{~ms}$.Con...
shivam7524
488
views
shivam7524
answered
Apr 29
Operating System
goclasses2024-mockgate-14
operating-system
process-scheduling
1-mark
+
–
0
votes
0
answers
8
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
Ovie
64
views
Ovie
asked
Apr 29
0
votes
0
answers
9
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
Ovie
23
views
Ovie
asked
Apr 29
0
votes
1
answer
10
CPU Scheduling
Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to know is there any faster way to get solutions . Please provide any resource if available. Thanks
Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time consuming . So I wanted to kn...
Bhaskar_Saini
88
views
Bhaskar_Saini
answered
Apr 28
Operating System
operating-system
process-scheduling
cpu
scheduling
+
–
0
votes
0
answers
11
Memory management
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 requests 6 KB of memory. Process P3 requests 12 KB of memory. Process P4 requests 4 KB of ... requests 8 KB of memory. The system uses the following memory allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes:• Process P1 requests 10 KB of memory.• Process P2 r...
Sahun
77
views
Sahun
asked
Apr 25
Operating System
memory
memory-management
+
–
0
votes
1
answer
12
Contiguous memory allocation
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 requests 6 KB of memory. Process P3 requests 12 KB of memory. Process P4 requests 4 ... 8 KB of memory. The system uses the following memory allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: • Process P1 requests 10 KB of memory. • Process P2...
SWETHA MURUGANANDHAM
127
views
SWETHA MURUGANANDHAM
asked
Apr 23
Operating System
operating-system
memory-management
numerical-answers
+
–
16
votes
2
answers
13
GATE CSE 2022 | Question: 32
Consider four processes $\text{P, Q, R,}$ and $\text{S}$ scheduled on a $\text{CPU}$ as per round robin algorithm with a time quantum of $4\text{ units.}$ The processes arrive in the order $\text{P, Q, R, S,}$ all at time $\text{t = 0}.$ ... $\text{P = 4, Q = 12, R = 5, S = 4}$ $\text{P = 3, Q = 7, R = 7, S = 3}$
Consider four processes $\text{P, Q, R,}$ and $\text{S}$ scheduled on a $\text{CPU}$ as per round robin algorithm with a time quantum of $4\text{ units.}$ The processes a...
theradash
10.8k
views
theradash
answered
Apr 18
Operating System
gatecse-2022
operating-system
process-scheduling
round-robin-scheduling
2-marks
+
–
1
votes
0
answers
14
Andrew S. Tanenbaum (MOS) Edition 5 Exercise 3 Question 16 (Page No. 252)
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual address space. If memory address space is divided evenly ... virtual address space would be allocated to each process at a minimum, with the maximum number of processes running?
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual address space. If mem...
sofigenr
81
views
sofigenr
asked
Apr 18
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
+
–
1
votes
1
answer
15
fork() system call
Consider the following pieces of codes for fork( ) system call. Solve and explain how many child processes are created upon execution of this program? Snippet 1: void main( ) { fork( ); fork( ); exit( ); } Snippet 2: int main( ) { int i; for (i = 0; i < 4; i++) fork(); return 0; } Learning Outcomes. Understand the working of fork ( ) system call.
Consider the following pieces of codes for fork( ) system call. Solve and explain how many child processes are created upon execution of this program? Snippet 1:void main...
sofigenr
193
views
sofigenr
answered
Apr 18
Operating System
operating-system
fork-system-call
+
–
29
votes
2
answers
16
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
theradash
12.8k
views
theradash
answered
Apr 18
Operating System
gatecse-2011
operating-system
process-scheduling
normal
+
–
92
votes
4
answers
17
GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were crea...
theradash
19.9k
views
theradash
answered
Apr 17
Operating System
gatecse-2003
operating-system
process-scheduling
normal
+
–
48
votes
6
answers
18
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered:$$\begin{arr...
theradash
13.1k
views
theradash
answered
Apr 17
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
12
votes
4
answers
19
GATE CSE 2023 | Question: 13
Which one or more of the following options guarantee that a computer system will transition from user mode to kernel mode? Function Call malloc Call Page Fault System Call
Which one or more of the following options guarantee that a computer system will transition from user mode to kernel mode?Function Callmalloc CallPage FaultSystem Call
theradash
11.8k
views
theradash
answered
Apr 15
Operating System
gatecse-2023
operating-system
fork-system-call
multiple-selects
1-mark
+
–
0
votes
1
answer
20
gate zeal cse pdf
Consider the four mutex locks L1, L2, L3, and L4. Two processes A and B request these four locks. Each process requests them in some (possibly different) pre programmed sequence. There are 24 possible sequences for requesting the locks making for 576 programming possibilities. How many of these can possibly result in a deadlock?
Consider the four mutex locks L1, L2, L3, and L4. Two processes A and B request these four locks. Each process requests them in some (possibly different) pre programmed s...
sayednumairVG
97
views
sayednumairVG
answered
Apr 14
Operating System
process-synchronization
+
–
1
votes
1
answer
21
GATE Overflow | Operating Systems | Test 1 | Question: 5
Two concurrent processes P1 and P2 want to use 2 resources J1 and J2 in a Mutually Exclusive way. Assume that initially J1 and J2 are both free. The programs executed by these two processes are as below : ... deadlock would not occur Mutual Exclusion is guaranteed, deadlock might occur Mutual Exclusion is not guaranteed, deadlock might occur
Two concurrent processes P1 and P2 want to use 2 resources J1 and J2 in a Mutually Exclusive way. Assume that initially J1 and J2 are both free. The programs executed by ...
Nalinj
592
views
Nalinj
answered
Apr 13
Operating System
go-os-1
operating-system
process-synchronization
+
–
1
votes
2
answers
22
OS, Process Scheduling
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and the context switch takes 0 seconds. At what time the first process will complete the execution? (assume all the variables as integers). A) nkx B) k(nx-1) C) k(nk+n) D) x(nk-n+1)
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...
tauseef9580
329
views
tauseef9580
answered
Apr 9
Operating System
process-scheduling
operating-system
round-robin-scheduling
context-switch
process-synchronization
+
–
27
votes
4
answers
23
GATE CSE 1994 | Question: 1.21
Which one of the following statements is true? Macro definitions cannot appear within other macro definitions in assembly language programs Overlaying is used to run a program which is longer than the address space of a computer Virtual memory can ... than the address space of a computer It is not possible to write interrupt service routines in a high level language
Which one of the following statements is true?Macro definitions cannot appear within other macro definitions in assembly language programsOverlaying is used to run a prog...
theradash
8.7k
views
theradash
answered
Apr 9
Operating System
gate1994
operating-system
normal
virtual-memory
+
–
0
votes
0
answers
24
PGEE exam
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None
What Bakery Algorithm improves: (a). throughput (b). latency (c). both (d). None
Himanshu_2211
102
views
Himanshu_2211
asked
Apr 8
Operating System
iiith-pgee
+
–
28
votes
5
answers
25
GATE CSE 1989 | Question: 2-iv
Match the pairs in the following: ...
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Virtual memory} & \text{(p)} & \text{ Temporal Locality} \\\hline \text{(B)} & \text{Sha...
theradash
13.0k
views
theradash
answered
Apr 8
Operating System
match-the-following
gate1989
operating-system
virtual-memory
+
–
69
votes
10
answers
26
GATE CSE 2016 Set 1 | Question: 49
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is_________.
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each ...
theradash
19.3k
views
theradash
answered
Apr 8
Operating System
gatecse-2016-set1
operating-system
page-replacement
normal
numerical-answers
+
–
76
votes
11
answers
27
GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...
theradash
29.1k
views
theradash
answered
Apr 8
Operating System
gatecse-2014-set2
operating-system
page-replacement
ambiguous
+
–
1
votes
2
answers
28
GATE CSE 2024 | Set 1 | Question: 14
Which of the following statements about threads is/are TRUE? Threads can only be implemented in kernel space Each thread has its own file descriptor table for open files All the threads belonging to a process share a common stack Threads belonging to a process are by default not protected from each other
Which of the following statements about threads is/are TRUE?Threads can only be implemented in kernel spaceEach thread has its own file descriptor table for open filesAll...
SarthakShastri
3.2k
views
SarthakShastri
answered
Apr 6
Operating System
gatecse2024-set1
multiple-selects
operating-system
threads
+
–
54
votes
8
answers
29
GATE IT 2007 | Question: 11
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$ ... $J7$ will be completed will be $16$ $19$ $20$ $37$
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a q...
theradash
20.2k
views
theradash
answered
Apr 5
Operating System
gateit-2007
operating-system
memory-management
normal
+
–
31
votes
6
answers
30
GATE IT 2004 | Question: 67
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can ... following is approximately the maximum size of a file in the file system? $512$ MB $2$ GB $8$ GB $16$ GB
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect b...
theradash
9.4k
views
theradash
answered
Apr 4
Operating System
gateit-2004
operating-system
file-system
normal
+
–
1
votes
2
answers
31
#OS-FORK Output
Q23. The following C program is executed on a Unix/Linux system: main() { int i=0; while (i<20) if (i%2==0) fork(); i++; return 0; } Calculate how many number of processes will be created after executing the above program. Options: 1.1023 2.Infinite 3.1024 4.2048
Q23. The following C program is executed on a Unix/Linux system: main(){ int i=0; while (i<20) if (i%2==0) fork(); ...
i_m_sudip
450
views
i_m_sudip
answered
Apr 4
Operating System
operating-system
fork-system-call
gate-preparation
programming-in-c
usermod
+
–
30
votes
3
answers
32
GATE CSE 2022 | Question: 53
Consider two files systems $\text{A}$ and $\text{B}$, that use contiguous allocation and linked allocation, respectively. A file of size $100$ blocks is already stored in $\text{A}$ and also in $\text{B}$. Now, consider inserting a new block in the middle of ... $\text{B}$ are $n_{A}$ and $n_{B}$, respectively, then the value of $n_{A} + n_{B}$ is__________________.
Consider two files systems $\text{A}$ and $\text{B}$, that use contiguous allocation and linked allocation, respectively. A file of size $100$ blocks is already stored in...
theradash
10.1k
views
theradash
answered
Apr 4
Operating System
gatecse-2022
numerical-answers
operating-system
file-system
2-marks
+
–
20
votes
2
answers
33
GATE CSE 2021 Set 1 | Question: 15
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory ... $\textsf{foo}$ Renaming of an existing file in $\textsf{foo}$ Opening of an existing file in $\textsf{foo}$
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file meta...
theradash
8.6k
views
theradash
answered
Apr 4
Operating System
gatecse-2021-set1
multiple-selects
operating-system
file-system
1-mark
+
–
41
votes
3
answers
34
GATE CSE 2017 Set 2 | Question: 08
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? Contiguous Linked Indexed $1$ and $3$ only $2$ only $3$ only $2$ and $3$ only
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?ContiguousLinkedIndexed$1$ and $3$ only$2$ on...
theradash
13.2k
views
theradash
answered
Apr 4
Operating System
gatecse-2017-set2
operating-system
file-system
normal
+
–
56
votes
6
answers
35
GATE CSE 2014 Set 2 | Question: 20
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $4$ bytes in size. Given a $100 \times 10^6$ bytes disk on which the file system is stored and data block size is $10^3$ bytes, the maximum size of a file that can be stored on this disk in units of $10^6$ bytes is _________.
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $4$ bytes in size. Given a $100 \times 10^6$ bytes disk o...
theradash
21.0k
views
theradash
answered
Apr 4
Operating System
gatecse-2014-set2
operating-system
disk
numerical-answers
normal
file-system
+
–
31
votes
6
answers
36
GATE CSE 2002 | Question: 2.22
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on the size of the blocks, and the size of the address of the blocks. the number of blocks used for the index, and the size of the blocks. the size of the blocks, the number of blocks used for the index, and the size of the address of the blocks. None of the above
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends onthe size of the blocks, and the size of the address of the blocks.the ...
theradash
14.7k
views
theradash
answered
Apr 4
Operating System
gatecse-2002
operating-system
normal
file-system
+
–
0
votes
0
answers
37
Operating system concepts 9th edition Abdraham Silberschatz
Write a monitor to solve the consumer-producer problem. The basic program structure is shown as follows. monitor ProducerConsumer { int in, out, count; Item buffer[BUFFER_SIZE]; condition empty, full; // To add anything ... } Process Consumer: while(true) { ProducerConsumer.get(next_consumed); /* consume the item in next_consumed */ }
Write a monitor to solve the consumer-producer problem. Thebasic program structure is shown as follows.monitor ProducerConsumer {int in, out, count;Item buffer[BUFFER_SIZ...
Maxine
68
views
Maxine
asked
Apr 3
Operating System
operating-system
process-synchronization
+
–
51
votes
14
answers
38
GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 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
Each Process $P_i, i = 1\ldots 9$ is coded as followsrepeat P(mutex) {Critical section} V(mutex) foreverThe code for $P_{10}$ is identical except it uses V(mutex) in plac...
nitin-787
25.4k
views
nitin-787
answered
Mar 29
Operating System
gate1997
operating-system
process-synchronization
normal
+
–
94
votes
16
answers
39
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$
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...
HLG_SAGAR
23.5k
views
HLG_SAGAR
answered
Mar 25
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
1
votes
1
answer
40
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...
ADITYARAJ
654
views
ADITYARAJ
answered
Mar 23
Operating System
made-easy-test-series
operating-system
process
probability
+
–
To see more, click for all the
questions in this category
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
