Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Bikram
2
votes
1
answer
801
GATE Overflow | Operating Systems | Test 1 | Question: 30
Match these OS abstractions with Hardware components: A. Thread 1. interrupt B. Virtual address space 2. memory C. File system 3. CPU D. Signal 4. Disk A-2 B-4 C-3 D-1 A-1 B-2 C-3 D-4 A-3 B-2 C-4 D-1 A-4 B-1 C-2 D-3
Match these OS abstractions with Hardware components:A. Thread1. interruptB. Virtual address space2. memoryC. File system3. CPUD. Signal4. DiskA-2 B-4 C-3 D-1A-1 B-2 C-3 ...
343
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
+
–
3
votes
1
answer
802
GATE Overflow | Operating Systems | Test 1 | Question: 29
Semaphores are used to solve the problem of resource allocation process synchronization deadlock process communication
Semaphores are used to solve the problem ofresource allocationprocess synchronizationdeadlockprocess communication
386
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
semaphore
+
–
4
votes
1
answer
803
GATE Overflow | Operating Systems | Test 1 | Question: 28
Consider a computer with 64 MB physical memory and 32 bit virtual address space. If the page size is 4KB , then the size of page table in MB is _____________ (Assume 2 bits per page table entry for extra information other than that for addressing)
Consider a computer with 64 MB physical memory and 32 bit virtual address space. If the page size is 4KB , then the size of page table in MB is _____________ (Assume 2...
625
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
virtual-memory
numerical-answers
+
–
2
votes
2
answers
804
GATE Overflow | Operating Systems | Test 1 | Question: 27
Dijkstra's Banker's algorithm in Operating System solves the problem of deadlock avoidance recovery from deadlock mutual exclusion context switching
Dijkstra's Banker's algorithm in Operating System solves the problem ofdeadlock avoidancerecovery from deadlockmutual exclusioncontext switching
425
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
3
votes
1
answer
805
GATE Overflow | Operating Systems | Test 1 | Question: 26
Swap space in the disk is used to _____ save temporary html pages save process data store the super-block store device drivers
Swap space in the disk is used to _____save temporary html pagessave process datastore the super-blockstore device drivers
346
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
virtual-memory
+
–
2
votes
1
answer
806
GATE Overflow | Operating Systems | Test 1 | Question: 25
There is a 4 way set associative cache memory with 8 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in that order: $0,255,1,4,3,8,133,159,216,129,63,8,48,32,73,92,155 $ Which one of the following memory block will not be in cache if LRU replacement policy is used? 159 8 129 48
There is a 4 way set associative cache memory with 8 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in that order:$$0,255,1,4,3...
530
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
co-and-architecture
cache-memory
least-recently-used
+
–
5
votes
2
answers
807
GATE Overflow | Operating Systems | Test 1 | Question: 24
A system with a 2-level paging scheme in which a regular memory access takes 150 nanoseconds(ns) and page faults takes 4 miliseconds(ms). An average instruction takes 100 ns of cpu time and two memory accesses. The TLB hit ... every 100,000 instructions. What is the effective average instruction execution time? 446 ns 1230 ns 830 ns 1050 ns
A system with a 2-level paging scheme in which a regular memory access takes 150 nanoseconds(ns) and page faults takes 4 miliseconds(ms). An average instruction takes 100...
1.0k
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
virtual-memory
+
–
1
votes
2
answers
808
GATE Overflow | Operating Systems | Test 1 | Question: 23
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk main scheduling algorithm used is FCFS. If FCFS is replaced by SSTF claimed by the service provider to give 50% ... results, what is the expected improvement in the I/O performance of user programs? 50% 40% 25% no improvement
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk main scheduling algorithm used is FCFS. If FCFS is repl...
651
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
disk-scheduling
+
–
0
votes
2
answers
809
GATE Overflow | Operating Systems | Test 1 | Question: 22
On a virtual memory system with FIFO page replacement policy, for an arbitrary page access pattern, increasing the number of page frames in main memory will always decrease the number of page faults always increase the number of page faults sometimes increase the number of page faults do not affect the number of page faults
On a virtual memory system with FIFO page replacement policy, for an arbitrary page access pattern, increasing the number of page frames in main memory willalways decreas...
334
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
page-replacement
+
–
0
votes
3
answers
810
GATE Overflow | Operating Systems | Test 1 | Question: 21
Consider $m$ processes sharing the CPU in a round-robin manner. Assume that each process switch takes $p$ seconds. For which value of quantum size $w$, the overhead resulting from process switch is minimized but at the same time each process is guaranteed to get it's ... $w \leq \frac{n- mp}{m+1}$ $w \leq \frac{n- mp}{m+1}$
Consider $m$ processes sharing the CPU in a round-robin manner. Assume that each process switch takes $p$ seconds. For which value of quantum size $w$, the overhead resul...
552
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
process-scheduling
+
–
2
votes
1
answer
811
GATE Overflow | Operating Systems | Test 1 | Question: 20
An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is ____ (assume no other resource requirement)
An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is ____ (assum...
283
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
resource-allocation
numerical-answers
+
–
0
votes
2
answers
812
GATE Overflow | Operating Systems | Test 1 | Question: 19
The E_CS() and L_CS() functions to implement critical section of a process are realized using Test-and-Set instruction as stated below: void E_CS(X) { while(Test-and-Set(X); } void L_CS(X) { X=0; } In above code snippet, X is a ... into CS in FIFO order more than 1 process can enter into CS at same time i only i and ii ii and iii iv only
The E_CS() and L_CS() functions to implement critical section of a process are realized using Test-and-Set instruction as stated below:void E_CS(X) { while(Test-and-Set(X...
506
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
process-synchronization
+
–
2
votes
2
answers
813
GATE Overflow | Operating Systems | Test 1 | Question: 18
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
519
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
+
–
0
votes
1
answer
814
GATE Overflow | Operating Systems | Test 1 | Question: 17
Thrashing reduces page I/O decreases the degree of multiprogramming implies excessive page I/O improves system performance
Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimproves system performance
404
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
thrashing
+
–
1
votes
2
answers
815
GATE Overflow | Operating Systems | Test 1 | Question: 16
Determine the number of page faults when references to pages occur in the sequence -$1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate 3 pages and already has pages 1, 2 with page 1 having been brought earlier than page 2 and LRU being the replacement strategy used.
Determine the number of page faults when references to pages occur in the sequence -$1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate 3 pages and already ha...
513
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
numerical-answers
page-replacement
least-recently-used
+
–
1
votes
2
answers
816
GATE Overflow | Operating Systems | Test 1 | Question: 15
At a particular time of computation, the value of a counting semaphore is $7$ , then $20$ $P$ operations and 'x' $V$ operations were completed on this semaphore. If the final value of the semaphore is $5$, the value of $x$ should be ____
At a particular time of computation, the value of a counting semaphore is $7$ , then $20$ $P$ operations and 'x' $V$ operations were completed on this semaphore. If the f...
308
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
process-synchronization
semaphore
numerical-answers
+
–
1
votes
1
answer
817
GATE Overflow | Operating Systems | Test 1 | Question: 14
Dirty bit is used to show the page with corrupted data wrong page in the memory page that is modified after being loaded into cache memory page that is less frequently accessed
Dirty bit is used to show thepage with corrupted datawrong page in the memorypage that is modified after being loaded into cache memorypage that is less frequently access...
230
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
page-replacement
+
–
2
votes
3
answers
818
GATE Overflow | Operating Systems | Test 1 | Question: 13
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is 100 ns 68.0 ns 68.5 ns 78.5 ns
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 1...
869
views
asked
Sep 3, 2016
Operating System
go-os-1
virtual-memory
paging
+
–
2
votes
2
answers
819
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^-...
784
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
resource-allocation
+
–
2
votes
1
answer
820
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...
456
views
asked
Sep 3, 2016
Operating System
go-os-1
operating-system
page-replacement
+
–
Page:
« prev
1
...
36
37
38
39
40
41
42
43
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register