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
0
answers
2101
Paging question
TLB lookup time (th) = 20 ns TLB hit ratio (ht) = 99% Memory access time (ts) = 100 ns Page fault rate (hp) =0.05 Swap page time (in or out) (tp) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 5118.91 ns 51.21 ns 5121ns None of the above Is the answer 5121 ?
TLB lookup time (th) = 20 nsTLB hit ratio (ht) = 99%Memory access time (ts) = 100 nsPage fault rate (hp) =0.05Swap page time (in or out) (tp) = 5000,000 nsWhat is the eff...
Rajesh R
798
views
Rajesh R
asked
Oct 18, 2017
Operating System
operating-system
+
–
2
votes
1
answer
2102
NPTEL
1 point The variable turn can have values 0 or 1 Void Process (i) { while(1) { //Non-critical section While (turn!=i); // Critical section turn = j; } } The above code does not provide 1. Mutual exclusion 2. Progress 3. Bounded wait 4. None of these
1 pointThe variable turn can have values 0 or 1 Void Process (i) { while(1) { //Non-critical section While (turn!=i); //...
gulsanchouhan
733
views
gulsanchouhan
asked
Oct 14, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
4
answers
2103
NPTEL
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ? 1. 0 2. 1 3. 2 4. 4
If the value of a counting semaphore s = 4, then the maximum number of requests for the critical section before it blocks is _____________ ?1. 02. 13. 24. 4
gulsanchouhan
2.0k
views
gulsanchouhan
asked
Oct 14, 2017
Operating System
operating-system
nptel-quiz
+
–
1
votes
3
answers
2104
NPTEL
State True/False Bakery algorithm ensures that no process is starved. 1. True 2. False
State True/False Bakery algorithm ensures that no process is starved.1. True2. False
gulsanchouhan
826
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
1
votes
1
answer
2105
NPTEL
Your friend wants to design synchronization primitives and tells you that he would be better off by strictly ensuring that the processes alternate the critical section. Your response would be: 1. That might not satisfy the “progress” requirement 2. That might not satisfy the “mutual exclusion” requirement 3. That might not satisfy the “bounded wait” requirement 4. I guess that would suffice
Your friend wants to design synchronization primitives and tells you that he would be better off by strictly ensuring that the processes alternate the critical section. Y...
gulsanchouhan
912
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
2106
NPTEL
By using Intel hardware xchg instruction ensures that The critical section is deadlock free Solution is starvation free Process enters CS in FIFO order More than one process enters critical section at same time Which of the above statement is TRUE?
By using Intel hardware xchg instruction ensures thatThe critical section is deadlock freeSolution is starvation freeProcess enters CS in FIFO orderMore than one process ...
gulsanchouhan
764
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
2107
NPTEL
Return value of xchg instruction is_____________ 1. Old value 2. New value 3 . 1 if operation succeeds and 0 if operation fails 4. None of the above
Return value of xchg instruction is_____________1. Old value2. New value3 . 1 if operation succeeds and 0 if operation fails4. None of the above
gulsanchouhan
479
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
nptel-quiz
+
–
0
votes
1
answer
2108
NPTEL
Consider the following statements: i) if(count==0) ii) add %eax,%ebx 1. i is atomic, ii is non-atomic 2. i is non-atomic, ii is non-atomic 3. i is non-atomic, ii is atomic 4. Both are atomic
Consider the following statements:i) if(count==0)ii) add %eax,%ebx1. i is atomic, ii is non-atomic2. i is non-atomic, ii is non-atomic3. i is non-atomic, ii is atomic4...
gulsanchouhan
1.0k
views
gulsanchouhan
asked
Oct 13, 2017
Operating System
operating-system
process-synchronization
+
–
3
votes
1
answer
2109
File System - Unix Inode
Anup patel
840
views
Anup patel
asked
Oct 13, 2017
Operating System
operating-system
inode
unix
file-system
+
–
3
votes
1
answer
2110
IISC Mtech(R) Interview 2017
1)I was asked, what is the approach for selecting optimal time quantum for Round Robin scheduling. 2)What happened in between two time quantum in RR(in detail)? Please provide some answers(maybe with some references/paper link).Thanks.
1)I was asked, what is the approach for selecting optimal time quantum for Round Robin scheduling.2)What happened in between two time quantum in RR(in detail)?Please prov...
Wali
1.3k
views
Wali
asked
Oct 11, 2017
Operating System
iisc
iisc-interview
cds
mtech
admission-gate2017
operating-system
+
–
3
votes
2
answers
2111
Process Synchronization
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?
rishi71662data4
3.4k
views
rishi71662data4
asked
Oct 11, 2017
Operating System
process-synchronization
deadlock-prevention-avoidance-detection
operating-system
+
–
5
votes
2
answers
2112
#Page Faults
The address sequence generated by tracing a particular program executing in a pure demand paging system with 200 records per page with 1 free main memory frame is recorded as follows: 0100, 0139, 0209, 0430, 0237, 0578, 0500, 0730, 0799, 0600 The number of page faults are ________.
The address sequence generated by tracing a particular program executing in a pure demand paging system with 200 records per page with 1 free main memory frame is recorde...
Tuhin Dutta
1.1k
views
Tuhin Dutta
asked
Oct 9, 2017
Operating System
operating-system
page-replacement
demand-paging
+
–
1
votes
1
answer
2113
Disks
A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and 64 sectors/track and has a seek time of 5 msec. Find the time required to read: i. 800 successive sectors? ii. 800 random sectors?
A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and 64 sectors/track and has a seek time of 5 msec. Find the time required to read:i. 800 successive sect...
Tuhin Dutta
1.5k
views
Tuhin Dutta
asked
Oct 8, 2017
Operating System
operating-system
disk
+
–
1
votes
1
answer
2114
Critical Section
There are two threads which try to solve critical section problem using Test-And-Set instruction. Does the above code prevent deadlock? please provide reason to your answer
There are two threads which try to solve critical section problem using Test-And-Set instruction.Does the above code prevent deadlock? please provide reason to your answe...
Tuhin Dutta
998
views
Tuhin Dutta
asked
Oct 8, 2017
Operating System
operating-system
process-synchronization
critical-section
deadlock-prevention-avoidance-detection
test-and-set-instruction
+
–
2
votes
1
answer
2115
Convoy effect.
Is convoy effect possible in SJF and Priority (preemptive and non preemptive) scheduling ? Please explain your answer.
Is convoy effect possible in SJF and Priority (preemptive and non preemptive) scheduling ? Please explain your answer.
Xylene
1.2k
views
Xylene
asked
Oct 8, 2017
Operating System
operating-system
+
–
1
votes
2
answers
2116
MadeEasy Subject Test: Operating System - Process Schedule
I encountered 1 question on context switching in Made Easy test series where it is mentioned: Scheduling policy is preemptive priority. Context switch time is 1 unit. So while preempting one process and loading another should there be a 1-time unit gap or they can be done simultaneously in the gantt chart?
I encountered 1 question on context switching in Made Easy test series where it is mentioned:Scheduling policy is preemptive priority. Context switch time is 1 unit.So wh...
Tuhin Dutta
617
views
Tuhin Dutta
asked
Oct 8, 2017
Operating System
operating-system
made-easy-test-series
context-switch
process-scheduling
+
–
0
votes
1
answer
2117
Doubt in OS: Disk scheduling
In SCAN disk scheduling algorithm, we know that SCAN chooses the request that requires shortest seek distance in a preferred direction. What direction SCAN chooses at the first place before servicing any request? Does it take any random direction or chooses in SSTF manner in the first place? How do SCAN & C-SCAN suffer from indefinite postponement?
In SCAN disk scheduling algorithm, we know that SCAN chooses the request that requires shortest seek distance in a preferred direction.What direction SCAN chooses at the ...
Tuhin Dutta
650
views
Tuhin Dutta
asked
Oct 4, 2017
Operating System
operating-system
disk-scheduling
+
–
3
votes
1
answer
2118
made easy test series
charul
502
views
charul
asked
Oct 2, 2017
Operating System
operating-system
+
–
0
votes
0
answers
2119
MadeEasy Subject Test: Operating System - Process Synchronization
The pic shows the question along with options:
The pic shows the question along with options:
Tuhin Dutta
551
views
Tuhin Dutta
asked
Oct 2, 2017
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
1
votes
2
answers
2120
what does it mean by single instance of each resource type ?
Also what exactly resource type is ? Please help with the terms
Also what exactly resource type is ? Please help with the terms
ejaz
5.9k
views
ejaz
asked
Oct 1, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
2121
MadeEasy Subject Test: Operating System - Resource Allocation
rajoramanoj
855
views
rajoramanoj
asked
Sep 30, 2017
Operating System
made-easy-test-series
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
1
votes
1
answer
2122
MadeEasy Subject Test: Operating System - Process Synchronization
rajoramanoj
553
views
rajoramanoj
asked
Sep 30, 2017
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
0
votes
1
answer
2123
Resource preemption
Which of the following transitions are not possible? (Assume resource preemption is not allowed) A) 2 and 4 B) 3 and 5 C)4 and 5 D)3 and 5 if resource preemption is not allowed then answer should be A) but answer given is D) how it is possible?
Which of the following transitions are not possible? (Assume resource preemption is not allowed)A) 2 and 4B) 3 and 5C)4 and 5D)3 and 5if resource preemption is not allowe...
reena_kandari
2.2k
views
reena_kandari
asked
Sep 29, 2017
Operating System
operating-system
process
+
–
7
votes
1
answer
2124
Livelock and Spinlock
State the difference between livelock and spinlock.
State the difference between livelock and spinlock.
Tuhin Dutta
3.4k
views
Tuhin Dutta
asked
Sep 29, 2017
Operating System
operating-system
process-synchronization
+
–
0
votes
1
answer
2125
Semaphores
s = 0 initially A : down(s) B : down(s) CS CS up(s) up(s) C : down(s) D : up(s) CS CS up(s) down(s) E : up(s) F : up(s) CS CS down(s) down(s) What is the maximum value of s? Doubt : I think max value of s should be 1 as P and V are atomic operations. Also nowhere the value of s is stored in memory here. But the answer given is 3. What concept am I missing?
s = 0 initiallyA : down(s) B : down(s) CS CS up(s) up(s)C : down(s) D : up(s) CS...
just_bhavana
293
views
just_bhavana
asked
Sep 27, 2017
Operating System
operating-system
semaphore
+
–
1
votes
1
answer
2126
Context Switch
Let P1 and P2 are two processes , the Context Switch happens from P1 to P2 . Meaning : Now what happens is CPU saves the state of P1 and loads the state of P2. Who raises interrupt to cause a Context Switch? But where CPU can find all these information ? Is it available in PCB or in Stack?
Let P1 and P2 are two processes , the Context Switch happens from P1 to P2 .Meaning : Now what happens is CPU saves the state of P1 and loads the state of P2.Who raises i...
Anjan
325
views
Anjan
asked
Sep 26, 2017
Operating System
operating-system
context-switch
+
–
0
votes
1
answer
2127
UGC NET CSE | December 2008 | Part 2 | Question: 42
If the executing program size is greater than the existing $RAM$ of a computer, it is still possible to execute the program if the $OS$ supports : multitasking virtual memory paging system none of the above
If the executing program size is greater than the existing $RAM$ of a computer, it is still possible to execute the program if the $OS$ supports :multitasking ...
rishu_darkshadow
2.3k
views
rishu_darkshadow
asked
Sep 26, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
virtual-memory
+
–
0
votes
1
answer
2128
UGC NET CSE | December 2008 | Part 2 | Question: 41
In which of the following, ready to execute processes must be present in $RAM$ ? multiprocessing multiprogramming multitasking all of the above
In which of the following, ready to execute processes must be present in $RAM$ ?multiprocessing multiprogramming multitasking all of the above
rishu_darkshadow
1.3k
views
rishu_darkshadow
asked
Sep 26, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
ram
+
–
1
votes
1
answer
2129
UGC NET CSE | December 2008 | Part 2 | Question: 40
Which of the following $OS$ treats hardware as a file system? $UNIX$ $DOS$ $Windows$ $NT$ None of the above
Which of the following $OS$ treats hardware as a file system?$UNIX$ $DOS$ $Windows$ $NT$ None of the above
rishu_darkshadow
2.0k
views
rishu_darkshadow
asked
Sep 26, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
memory-management
+
–
0
votes
1
answer
2130
UGC NET CSE | December 2008 | Part 2 | Question: 24
An example of distributed OS is: Amoeba UNIX MS-DOS MULTICS
An example of distributed OS is: Amoeba UNIXMS-DOS MULTICS
rishu_darkshadow
2.1k
views
rishu_darkshadow
asked
Sep 25, 2017
Operating System
ugcnetcse-dec2008-paper2
operating-system
distributed-system
+
–
Page:
« prev
1
...
66
67
68
69
70
71
72
73
74
75
76
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register