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
961
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 6 (Page No. 81)
Instructions related to accessing I/O devices are typically privileged instructions, that is, they can be executed in kernel mode but not in user mode. Give a reason why these instructions are privileged.
Instructions related to accessing I/O devices are typically privileged instructions, that is, they can be executed in kernel mode but not in user mode. Give a reason why ...
admin
200
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
instruction-format
descriptive
+
–
1
votes
2
answers
962
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 5 (Page No. 81)
On early computers, every byte of data read or written was handled by the CPU (i.e., there was no DMA). What implications does this have for multiprogramming?
On early computers, every byte of data read or written was handled by the CPU (i.e., there was no DMA). What implications does this have for multiprogramming?
admin
1.9k
views
admin
asked
Oct 20, 2019
Operating System
tanenbaum
operating-system
multi-programming
dma
descriptive
+
–
0
votes
2
answers
963
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 4 (Page No. 81)
To use cache memory, main memory is divided into cache lines, typically $32$ or $64$ bytes long. An entire cache line is cached at once. What is the advantage of caching an entire line instead of a single byte or word at a time?
To use cache memory, main memory is divided into cache lines, typically $32$ or $64$ bytes long. An entire cache line is cached at once. What is the advantage of caching ...
admin
1.0k
views
admin
asked
Oct 20, 2019
Operating System
tanenbaum
operating-system
cache-memory
descriptive
+
–
0
votes
1
answer
964
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 3 (Page No. 81)
What is the difference between timesharing and multiprogramming systems?
What is the difference between timesharing and multiprogramming systems?
admin
195
views
admin
asked
Oct 20, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
1
answer
965
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 2 (Page No. 81)
In Section $1.4$, nine different types of operating systems are described. Give a list of applications for each of these systems (one per operating systems type).
In Section $1.4$, nine different types of operating systems are described. Give a list of applications for each of these systems (one per operating systems type).
admin
1.0k
views
admin
asked
Oct 20, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
3
votes
1
answer
966
Self Doubt on Page Fault
To calculate EMAT in case of page fault we used: EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time) My doubt is: In case of NO PAGE FAULT, why we considered only one memory access time . Why ... considered (VA -> PA time) + memory access time. Then why not we consider address translation time in questions involving only pagefault?
To calculate EMAT in case of page fault we used:EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time)My doubt is:In case of NO PAGE ...
tp21
1.1k
views
tp21
asked
Sep 22, 2019
Operating System
operating-system
virtual-memory
page-fault
+
–
1
votes
3
answers
967
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a...
Hirak
1.7k
views
Hirak
asked
Jun 13, 2019
Operating System
memory-management
paging
operating-system
multilevel-paging
self-doubt
+
–
2
votes
2
answers
968
Virtual Gate Test Series: Operating System - Fork-Join Concurrency Structure
Consider the code fragment: count = 3; S1; Fork L1; L1: S3; S2; goto L3; S4; Fork L2; L2: S6; goto L3; S5; L3: join count S7 Which one of the following represents correct precedence graph of the above code fragment? the answer is given but I’m getting where am I wrong?
Consider the code fragment: count = 3;S1;Fork L1; L1: S3; S2; goto L3;S4;Fork L2; L2: S6; goto L3;S5; L3: join countS7...
aditi19
3.9k
views
aditi19
asked
Jun 12, 2019
Operating System
operating-system
precedence-graph
fork-system-call
concurrency
virtual-gate-test-series
+
–
0
votes
1
answer
969
Stallings 6e Exercise-11.12 (page no.-539) I/O Management RAID
Consider a 4-drive, 200GB-per-drive RAID array. What is the available data storage capacity for each of the RAID levels, 0, 1, 3, 4, 5, and 6?
Consider a 4-drive, 200GB-per-drive RAID array. What is the available data storage capacity for each of the RAID levels, 0, 1, 3, 4, 5, and 6?
aditi19
9.1k
views
aditi19
asked
Jun 5, 2019
Operating System
descriptive
operating-system
file-system
disk
raid
+
–
1
votes
2
answers
970
Stallings 6e Exercise-11.10 (page number-539) I/O Management
A 32-bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor channel has two line printers, two card readers, and ten VDT terminals ... reader 1.2 Kbytes/s VDT 1 Kbytes/s Estimate the maximum aggregate I/O transfer rate in this system
A 32-bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor cha...
aditi19
2.0k
views
aditi19
asked
Jun 5, 2019
Operating System
descriptive
operating-system
disk
file-system
co-and-architecture
+
–
2
votes
1
answer
971
IISc CSA Written Test 2019
Given that a computer system has only 3 process.1st process is single threaded, 2nd process is two threaded and 3rd process is 4 threaded.So total how many number of page tables will be managed by the operating system?
Given that a computer system has only 3 process.1st process is single threaded, 2nd process is two threaded and 3rd process is 4 threaded.So total how many number of page...
Sourajit25
657
views
Sourajit25
asked
Jun 4, 2019
Operating System
operating-system
paging
iisc
threads
+
–
1
votes
1
answer
972
Why after improving implementation of semaphores we still have busy waiting time?
Bhaskar Singh
984
views
Bhaskar Singh
asked
May 26, 2019
Operating System
operating-system
semaphore
+
–
1
votes
2
answers
973
Doubt in Reader-Writer Problem's Solution
Why in reader section we are locking(I highlighted the locking) read_count-- and if section? If we don't use locking what problems might arise? I know that we should use locking whenever we access shared variable but in this particular case I don't see any problem if we don't use locking(highlighted). Please explain what I am missing
Why in reader section we are locking(I highlighted the locking) read_count and if section?If we don't use locking what problems might arise?I know that we should use loc...
Bhaskar Singh
1.4k
views
Bhaskar Singh
asked
May 26, 2019
Operating System
process-synchronization
semaphore
operating-system
+
–
0
votes
1
answer
974
Stallings Book Doubt-Process
Which part of the process image forms the logical address space that is used in paging?
Which part of the process image forms the logical address space that is used in paging?
aditi19
508
views
aditi19
asked
May 26, 2019
Operating System
operating-system
process
paging
virtual-memory
+
–
1
votes
2
answers
975
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes.Process Pi While...
srestha
1.5k
views
srestha
asked
May 20, 2019
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
0
votes
0
answers
976
Self Doubt:Operating System-Threads
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads) Can somebody elaborate more on it?? This given answer is wrong I think:https://gateoverflow.in/290648/made_easy_test_series Plz check
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads)Can somebody elaborate more on it??This giv...
srestha
665
views
srestha
asked
May 19, 2019
Operating System
operating-system
threads
+
–
1
votes
2
answers
977
Mode of OS during page table access
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?
!KARAN
584
views
!KARAN
asked
May 18, 2019
Operating System
memory-management
paging
operating-system
+
–
0
votes
1
answer
978
Made Easy Test Series:Operating System-Page Fault
Consider a system using demand paging architecture it takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modified takes $10ms.$ if replaced page is modified. Main Memory access time ... time. The maximum acceptable page fault rate to get effective memory access time not more than $4ms.$ is_________(%)
Consider a system using demand paging architectureit takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modifiedtakes $10...
srestha
698
views
srestha
asked
May 15, 2019
Operating System
operating-system
made-easy-test-series
page-fault
+
–
1
votes
2
answers
979
Made Easy Test Series: Operating System-Memory Mapped I/O
Which of the following best characterize by Memory Mapped -I/O? $A)$ Additional hardware for bus is required to control the IO bus and memory bus. $B)$ Some of the address space is separated from memory space and assigned them to I/ ... is used $D)$ None of these I havenot got this answer to Galvin. Someone plz. give the concept used here .
Which of the following best characterize by Memory Mapped -I/O?$A)$ Additional hardware for bus is required to control the IO bus and memory bus.$B)$ Some of the address ...
srestha
672
views
srestha
asked
May 14, 2019
Operating System
operating-system
made-easy-test-series
+
–
1
votes
2
answers
980
ISI2018-PCB-CS7
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps: Step I:saving the context of $P_{old}$; Step II: running the scheduling algorithm to pick $P_{new}$; Step III: restoring the saved context of $P_{new}$. Suppose Steps ... in the order $P_1, P_2, . . . , P_k;$ each process requires exactly one CPU burst of $20$ms and no I/O burst.
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps:Step I:saving the context of $P_{old}$;Step II: running the scheduling al...
akash.dinkar12
1.2k
views
akash.dinkar12
asked
May 12, 2019
Operating System
isi2018-pcb-cs
operating-system
process-scheduling
descriptive
+
–
1
votes
0
answers
981
NPTEL: OS
Hirak
752
views
Hirak
asked
May 9, 2019
Operating System
operating-system
nptel-quiz
+
–
2
votes
0
answers
982
Vani Question Bank:Operating System
Hirak
258
views
Hirak
asked
May 9, 2019
Operating System
operating-system
page-replacement
page-fault
paging
+
–
0
votes
0
answers
983
Operating system swapping process
Please help me explaining this in simpler words: If we were to swap out process P1 and swap in process P2, the I/O operation might then attempt to use memory that now belongs to process P2. There are two main solutions to this ... system buffers and process memory then occur only when the process is swapped in. Note that this double buffering itself adds overhead.
Please help me explaining this in simpler words:If we were to swap out process P1 and swap in process P2, theI/O operation might then attempt to use memory that now belon...
manisha11
803
views
manisha11
asked
May 9, 2019
Operating System
operating-system
process-scheduling
+
–
0
votes
1
answer
984
Self Doubt : Regarding TLB entry for a page not present in memory
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present. Will this entry be considered for caching in TLB? As I understand from above line in Tanenbaum, The entry should not be present in TLB. Is my understanding right?
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present.Wil...
Mayank0343
560
views
Mayank0343
asked
May 8, 2019
Operating System
self-doubt
operating-system
translation-lookaside-buffer
+
–
0
votes
3
answers
985
Self Doubt CPU
In Multi-processing Operating Systems: (a) Maximum utilization of CPU can be achieved (b) Maximum throughput is achieved (c) Maximum security can be achieved (d) Not suitable for Real time Applications
In Multi-processing Operating Systems:(a) Maximum utilization of CPU can be achieved(b) Maximum throughput is achieved(c) Maximum security can be achieved(d) Not suitable...
manisha11
1.3k
views
manisha11
asked
May 7, 2019
Operating System
process-scheduling
operating-system
+
–
0
votes
1
answer
986
VANI QB OPERATING SYSTEM Q45
The output is ____________________.
The output is ____________________.
Hirak
374
views
Hirak
asked
May 5, 2019
Operating System
operating-system
+
–
0
votes
0
answers
987
Operating System - Galvin - Chapter 3
Galvin, 9th edition on page 146 states that Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls and thus require the more time-consuming task of kernel intervention. In ... that shared memory is bound to be faster, but aren't the mutex and semaphore calls require Kernel intervention?
Galvin, 9th edition on page 146 states that“Shared memory can be faster than message passing, since message-passing systems are typically implemented using system calls...
vinay chauhan
1.2k
views
vinay chauhan
asked
May 5, 2019
Operating System
operating-system
process-synchronization
semaphore
shared-memory
+
–
0
votes
1
answer
988
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 1 (Page No. 81)
What are the two main functions of an operating system$?$
What are the two main functions of an operating system$?$
admin
417
views
admin
asked
Apr 15, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
3
answers
989
self doubt - process concepts
Consider we have a cpu whose processes are scheduled using premptive priority scheduling algorithm, suppose a process of higher priority than the currently running process arrives in the ready queue, according to the algorithm the running process must be prempted, who actually does this job of interrupting the running process?
Consider we have a cpu whose processes are scheduled using premptive priority scheduling algorithm, suppose a process of higher priority than the currently running proces...
Saideepak Bejawada
942
views
Saideepak Bejawada
asked
Apr 9, 2019
Operating System
operating-system
process
process-scheduling
+
–
1
votes
1
answer
990
ISI2017-PCB-CS-5(b)
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Translation Lookaside Buffer (TLB) and $75$ percent of all page-table references are ... memory reference time? Assume that finding a page-table entry in the TLB takes $20$ nanoseconds, if the entry is present.
Consider a paging system with the page table stored in memory. If a memory reference takes $200$ nanoseconds, how long does a paged memory reference take? If we add a Tra...
akash.dinkar12
8.3k
views
akash.dinkar12
asked
Apr 8, 2019
Operating System
isi2017-pcb-cs
operating-system
paging
translation-lookaside-buffer
descriptive
+
–
Page:
« prev
1
...
28
29
30
31
32
33
34
35
36
37
38
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register