Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Operating System
Recent questions tagged operating-system
0
votes
1
answer
91
syncronization
Consider two processes P1, P2 that access shared binary semaphore variables – S1, S2, S3. Given below is the concurrent execution of these process – here deadlock is possible or not and why? Assume, initially S1 = 1, S2 = 1 and S3 = 1.
Consider two processes P1, P2 that access shared binary semaphore variables – S1, S2, S3. Given below is the concurrent execution of these process –here deadlock is ...
24aaaa23
577
views
24aaaa23
asked
Oct 1, 2023
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
+
–
3
votes
1
answer
92
fork
Consider the following code segment : int main (void) { for (int i=2; i<=5; i++) { fork( ); } printf (“GOCLASSES”); How many times “GOCLASSES” is printed by the above code?
Consider the following code segment :int main (void) { for (int i=2; i<=5; i++) { fork( ); }printf (“GOCLASSES”);How many times “GOCLASSES” is printed by the ab...
24aaaa23
775
views
24aaaa23
asked
Oct 1, 2023
Operating System
operating-system
fork-system-call
+
–
0
votes
0
answers
93
fork
Consider the following pseudo code that uses fork–join constructs – S1 ; fork(L1); // fork(L) : Creates new process and execution starts from L. S2 ; S4 ;join( ) : Combines all processes able to execute join. fork(L2); L1 : S3 ; L2 join( ); S5 ; Draw correct precedence graph for the above code fragment?
Consider the following pseudo code that uses fork–join constructs –S1 ;fork(L1); // fork(L) : Creates new process and execution starts from L.S2 ;S4 ;join( ) : C...
24aaaa23
405
views
24aaaa23
asked
Oct 1, 2023
Operating System
operating-system
fork-system-call
+
–
0
votes
1
answer
94
Memory Management
Consider a System Using Variable Partition with no Compaction Free holes : 4K; 8K; 20K; 2K Program size: 2K; 14K; 3K; 6K; 10K; 20K; 2K Time for Execution: 4; 10; 2; 1; 4; 1; 8 Using Best Fit Allocation Policy and FCFS CPU Scheduling Technique, Find the Time of Loading & Time of Completion of each program. The Burst Times are in Seconds.
Consider a System Using Variable Partition with no CompactionFree holes : 4K; 8K; 20K; 2KProgram size: 2K; 14K; 3K; 6K; 10K; 20K; 2KTime for Execution: 4; 10; 2; 1; 4; 1...
vedantk
472
views
vedantk
asked
Sep 13, 2023
Operating System
operating-system
memory-management
+
–
0
votes
1
answer
95
process synchronization
How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??
How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??
N3314nch41
360
views
N3314nch41
asked
Sep 10, 2023
Operating System
process-synchronization
operating-system
semaphore
critical-section
self-doubt
+
–
0
votes
1
answer
96
Ace Test Series | Operating System | Paging
A machine supports a 48 bit virtual address and 32 bit physical address. Pages are 8KB. If the page table entry contains besides other information, one V/I bit, 1R, 1M and 2 bits for page protection. What is the page table size in bytes? 86 MB 128 MB 96 MB 512 MB
A machine supports a 48 bit virtual address and 32 bit physical address. Pages are 8KB. If the page table entry contains besides other information, one V/I bit, 1R, 1M an...
none30
295
views
none30
asked
Sep 4, 2023
Operating System
operating-system
ace-test-series
paging
+
–
0
votes
1
answer
97
Can anyone explain , in the concept of segmentation . let the base address of a particular segment is 1900 and the limit of the segment is 400(i.e., size limit). Exactly what does it represent at the address 1900. Is it a page or group of pages or words
Unique_999
295
views
Unique_999
asked
Sep 3, 2023
Operating System
segmentation
operating-system
virtual-memory
paging
+
–
0
votes
2
answers
98
deadlocks and threads operating system
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) Allocated (A B C) P0 7 5 3 0 1 0 P1 3 2 2 2 0 0 P2 9 0 2 3 0 2 P3 2 ... these is a safe sequence in Question 13? P1, P3, P4 , P0, P2 only P2, P4, P3, P1, P0 only Both a and b None are safe sequences
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
Operating System
threads
operating-system
deadlock-prevention-avoidance-detection
minimal-state-automata
made-easy-test-series
+
–
0
votes
1
answer
99
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
831
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
minimal-state-automata
+
–
0
votes
1
answer
100
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
298
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
made-easy-test-series
+
–
0
votes
1
answer
101
deadlocks and threads operating system
Which of the following is false about User threads? User threads can switch fast since it does not involve kernel. User threads are lightweight since they do not require system calls. Kernel is not aware of the behavior of every user threads i.e. if it is blocking or runnable. None of these
Which of the following is false about User threads? User threads can switch fast since it does not involve kernel. User threads are lightweight since they do not require ...
roopkathaaa
265
views
roopkathaaa
asked
Sep 2, 2023
Operating System
operating-system
threads
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
102
Can anyone explain , in the concept of segmentation . Say for a segment limit = 400 and base address = 1900 . Exactly what does it represent at some address say 1900 . Is it a page or group of pages ??
Unique_999
154
views
Unique_999
asked
Aug 30, 2023
Operating System
segmentation
operating-system
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
