Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Operating System
Recent questions tagged operating-system
2
votes
2
answers
2701
GATE Overflow | Operating Systems | Test 1 | Question: 12
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is - $e^-{15}$ $e^{-5}$ $1 - e^{-5}$ $1-e^{-10}$
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is -$e^-...
Bikram
774
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
resource-allocation
+
–
2
votes
1
answer
2702
GATE Overflow | Operating Systems | Test 1 | Question: 11
Aging is keeping track of the cache contents keeping track of what pages are currently residing in the memory keeping track of how many times a given page is referenced increasing the priority of jobs to ensure termination in a finite time
Aging iskeeping track of the cache contentskeeping track of what pages are currently residing in the memorykeeping track of how many times a given page is referencedincre...
Bikram
450
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
page-replacement
+
–
1
votes
1
answer
2703
GATE Overflow | Operating Systems | Test 1 | Question: 10
A computer system has 4 K word cache organized in a block-set associative manner, with 4 blocks per set, 64 words per block. The number of bits in the SET and WORD fields of the main memory address format is 15, 4 6, 4 7, 2 4, 6
A computer system has 4 K word cache organized in a block-set associative manner, with 4 blocks per set, 64 words per block. The number of bits in the SET and WORD fields...
Bikram
335
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
cache-memory
co-and-architecture
+
–
6
votes
5
answers
2704
GATE Overflow | Operating Systems | Test 1 | Question: 9
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) forever The code for $P_{10}$ is identical except that it uses $V$ (mutex) instead of $P$ (mutex) and vice ... number of processes that can be inside the critical section at any moment if initial value of the semaphore is 1? 1 2 3 none
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) foreverThe code for $P_{10}$ is identical except that it uses ...
Bikram
930
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
process-synchronization
mutex
+
–
3
votes
1
answer
2705
GATE Overflow | Operating Systems | Test 1 | Question: 8
Consider a computer with 8 MB of main memory and a 128 KB cache. The cache block size is 4KB and it uses a direct mapping scheme for cache management. Total number of different main memory blocks can map onto a given physical cache block is _______
Consider a computer with 8 MB of main memory and a 128 KB cache. The cache block size is 4KB and it uses a direct mapping scheme for cache management. Total number of dif...
Bikram
1.5k
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
co-and-architecture
cache-memory
numerical-answers
+
–
5
votes
1
answer
2706
GATE Overflow | Operating Systems | Test 1 | Question: 7
Which of the following page replacement schemes is the toughest to implement from a hardware point of view? LRU FIFO MRU All have equal complexity
Which of the following page replacement schemes is the toughest to implement from a hardware point of view?LRUFIFOMRUAll have equal complexity
Bikram
668
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
virtual-memory
operating-system
+
–
6
votes
2
answers
2707
GATE Overflow | Operating Systems | Test 1 | Question: 6
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B and C, which have peak time demands of 3, 4 and 6. The minimum value of 'm' that ensures that ... never occur given that the combined maximum resource requirement of processes B and C at any time is 8 will be ______.
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B and C, which have peak time demands of 3, 4 and 6. The minimum val...
Bikram
1.2k
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
numerical-answers
+
–
1
votes
1
answer
2708
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 ...
Bikram
579
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
process-synchronization
+
–
2
votes
1
answer
2709
GATE Overflow | Operating Systems | Test 1 | Question: 3
Which of the following is true? A re-entrant procedure can only be called a fixed number of times A re-entrant procedure can be called even before the procedure has not returned from it's previous call Re-entrant procedures can not be called recursively none of the above
Which of the following is true? A re-entrant procedure can only be called a fixed number of times A re-entrant procedure can be called even before the proced...
Bikram
593
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
+
–
3
votes
1
answer
2710
GATE Overflow | Operating Systems | Test 1 | Question: 4
The size of the virtual memory in a computer system depends on the size of the data bus main memory address bus RAM
The size of the virtual memory in a computer system depends on the size of the data busmain memoryaddress busRAM
Bikram
497
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
virtual-memory
+
–
4
votes
0
answers
2711
GATE Overflow | Operating Systems | Test 1 | Question: 2
Consider Peterson's algorithm for Mutual Exclusion between two concurrent processes $w$ and $f$. The program executed by the processeses are shown below: Process w Process f repeat flag[w]=true; turn=f; while(P) do no-operation; Enter critical ... and turn = w flag[f]=true and turn=f flag[w]=true and turn=f flag[w]=true and turn=w
Consider Peterson's algorithm for Mutual Exclusion between two concurrent processes $w$ and $f$. The program executed by the processeses are shown below:Process wProcess ...
Bikram
498
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
process-synchronization
peterson-algorithm
+
–
4
votes
1
answer
2712
GATE Overflow | Operating Systems | Test 1 | Question: 1
Overlay is a part of an operating system a specific memory location a single contiguous memory that was used in the olden days for running large programs by swapping overloading the system with many user files
Overlay is a part of an operating system a specific memory location a single contiguous memory that was used in the olden days for running large programs by swappingove...
Bikram
641
views
Bikram
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
memory-management
overlay
+
–
2
votes
0
answers
2713
operating system - stack,heap,text,numerical
a process has 3 sections stack heap and text and if the size of the page table is 2 mb then on average amount of unused page space per process is?
a process has 3 sections stack heap and text and if the size of the page table is 2 mb then on average amount of unused page space per process is?
resilientknight
485
views
resilientknight
asked
Sep 2, 2016
Operating System
operating-system
process
+
–
2
votes
1
answer
2714
true false statment, i-node,FAT
Reading a random location in a big file is faster in i-node based file systems than in FAT file systems. True or False?
Reading a random location in a big file is faster in i-node based file systems than in FAT file systems.True or False?
resilientknight
544
views
resilientknight
asked
Sep 2, 2016
Operating System
operating-system
file-system
+
–
0
votes
1
answer
2715
file system-directory entry
which of the following is not contained in a directory entry of a file? a) file name and extension b) no of free blocks in the disk c) access control d) creation date
which of the following is not contained in a directory entry of a file?a) file name and extensionb) no of free blocks in the diskc) access controld) creation date
resilientknight
831
views
resilientknight
asked
Sep 2, 2016
Operating System
operating-system
file-system
+
–
2
votes
4
answers
2716
operating system cpu utilization
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking on i/o. if s<q<r, then cpu efficiency? a )q/q+s b) q/r+s c) r/r+s d) qr/r+s
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking o...
resilientknight
2.8k
views
resilientknight
asked
Sep 2, 2016
Operating System
operating-system
context-switch
process-scheduling
+
–
2
votes
1
answer
2717
OS - Privileged,non-privileged concept,typical/crucial
can a non privileged instruction be executed in privileged mode?(like when returning from kernel to user mode) or is it necessary to make it a privileged instruction?
can a non privileged instruction be executed in privileged mode?(like when returning from kernel to user mode) or is it necessary to make it a privileged instruction?
resilientknight
1.1k
views
resilientknight
asked
Sep 1, 2016
Operating System
operating-system
+
–
1
votes
2
answers
2718
UGC NET CSE | June 2011 | Part 2 | Question: 39
How many states can a process be in ? $3$ $4$ $2$ $5$
How many states can a process be in ?$3$$4$$2$ $5$
makhdoom ghaya
2.3k
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
process-scheduling
+
–
2
votes
1
answer
2719
UGC NET CSE | June 2011 | Part 2 | Question: 38
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as Semaphore Mutual exclusion Multiprogramming Message passing
A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is kn...
makhdoom ghaya
930
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
process-scheduling
+
–
1
votes
1
answer
2720
UGC NET CSE | June 2011 | Part 2 | Question: 37
A file organization component VSAM file is Relative records data set Keyed sequential data set Entry sequential data set All of the above
A file organization component VSAM file isRelative records data setKeyed sequential data setEntry sequential data setAll of the above
makhdoom ghaya
1.0k
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
file-system
+
–
0
votes
1
answer
2721
UGC NET CSE | June 2011 | Part 2 | Question: 36
Block or Buffer caches are used to Improve disk performance Handle interrupts Increase the capacity of main memory Speed up main memory Read operations
Block or Buffer caches are used toImprove disk performanceHandle interruptsIncrease the capacity of main memorySpeed up main memory Read operations
makhdoom ghaya
862
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
disk
+
–
4
votes
1
answer
2722
UGC NET CSE | June 2011 | Part 2 | Question: 35
Which of the following can be accessed by transfer vector approach of linking ? External data segments External subroutine Data located in other procedure All of the above
Which of the following can be accessed by transfer vector approach of linking ?External data segmentsExternal subroutineData located in other procedureAll of the above
makhdoom ghaya
1.7k
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
linker
+
–
1
votes
2
answers
2723
UGC NET CSE | June 2011 | Part 2 | Question: 32
A special software that is used to create a job queue is called Drive Spooler Interpreter Linkage editor
A special software that is used to create a job queue is calledDriveSpoolerInterpreterLinkage editor
makhdoom ghaya
663
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
job
+
–
1
votes
1
answer
2724
UGC NET CSE | June 2011 | Part 2 | Question: 31
Object modules generated by assembler that contains unresolved external references are resolved for two or more object module by a/an Operating system Loader Linker Compiler
Object modules generated by assembler that contains unresolved external references are resolved for two or more object module by a/anOperating systemLoaderLinkerCompiler
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Aug 30, 2016
Others
ugcnetcse-june2011-paper2
operating-system
linker
+
–
1
votes
1
answer
2725
MadeEasy Test Series: Operating System - File System
A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirect block address, 1 triple indirect block address. Size of each disk block is 256 bytes. And size of each disk block ... in GB) My answer is 0.008 GB In their solution, they say it's 8 GB, which I think is wrong.
A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirect block address, 1 triple indirect block a...
tvkkk
551
views
tvkkk
asked
Aug 29, 2016
Operating System
made-easy-test-series
operating-system
file-system
+
–
1
votes
0
answers
2726
self
If the memory access time (tm), page fault frequency (PFF) and page fault service time (PFST) are given, and effective access time (EAT) is asked, which of the following formula is used? 1. EAT = tm + PFF*PFST + tm 2. EAT = tm + PFF*PFST Also explain why and in which case what formula is used. Also, please tell if we are suppossed to assume single level paging for such questions.
If the memory access time (tm), page fault frequency (PFF) and page fault service time (PFST) are given, and effective access time (EAT) is asked, which of the following ...
bane
509
views
bane
asked
Aug 26, 2016
Operating System
operating-system
+
–
6
votes
3
answers
2727
UGC NET CSE | June 2011 | Part 2 | Question: 23
The number of disk accesses performed by insertion operation in B-tree of height $h$ is $0(1)$ $0(1gh)$ $0(h)$ None of these
The number of disk accesses performed by insertion operation in B-tree of height $h$ is$0(1)$$0(1gh)$$0(h)$None of these
makhdoom ghaya
1.7k
views
makhdoom ghaya
asked
Aug 23, 2016
Others
ugcnetcse-june2011-paper2
operating-system
disk-scheduling
+
–
2
votes
1
answer
2728
Sector Interleaving - MCQs in CS - Timothy Williams
Sector interleaving in disks is done by a) the disk manufacturer b) the disk controller cord c) the os d) none of the above
Sector interleaving in disks is done bya) the disk manufacturerb) the disk controller cordc) the osd) none of the above
Sankaranarayanan P.N
3.5k
views
Sankaranarayanan P.N
asked
Aug 23, 2016
Operating System
operating-system
disk
+
–
2
votes
2
answers
2729
UGC NET CSE | December 2011 | Part 2 | Question: 30
Consider a logical address space of $8$ pages of $1024$ words mapped with memory of $32$ frames. How many bits are there in the physical address ? $9$ bits $11$ bits $13$ bits $15$ bits
Consider a logical address space of $8$ pages of $1024$ words mapped with memory of $32$ frames. How many bits are there in the physical address ?$9$ bits$11$ bits$13$ bi...
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Aug 19, 2016
Operating System
ugcnetcse-dec2011-paper2
operating-system
memory-management
+
–
3
votes
0
answers
2730
UGC NET CSE | December 2011 | Part 2 | Question: 29
The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads) A plate of data A cylinder of data A track of data A block of data
The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads...
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Aug 19, 2016
Operating System
ugcnetcse-dec2011-paper2
operating-system
system
hard-disk-drive
+
–
Page:
« prev
1
...
86
87
88
89
90
91
92
93
94
95
96
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register