Register

Recent questions tagged go-os-1

373
views
1 answers
2 votes
GATE Overflow | Operating Systems | Test 1 | Question: 30
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 ...
User Avatar
399
views
1 answers
3 votes
GATE Overflow | Operating Systems | Test 1 | Question: 29
Semaphores are used to solve the problem ofresource allocationprocess synchronizationdeadlockprocess communication
User Avatar
645
views
1 answers
4 votes
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...
User Avatar
460
views
2 answers
2 votes
GATE Overflow | Operating Systems | Test 1 | Question: 27
Dijkstra's Banker's algorithm in Operating System solves the problem ofdeadlock avoidancerecovery from deadlockmutual exclusioncontext switching
User Avatar
361
views
1 answers
3 votes
GATE Overflow | Operating Systems | Test 1 | Question: 26
Swap space in the disk is used to _____save temporary html pagessave process datastore the super-blockstore device drivers
User Avatar
543
views
1 answers
2 votes
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...
User Avatar
1.0k
views
2 answers
5 votes
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...
User Avatar
678
views
2 answers
1 votes
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 repl...
User Avatar
353
views
2 answers
0 votes
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 willalways decreas...
User Avatar
576
views
3 answers
0 votes
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 resul...
User Avatar
301
views
1 answers
2 votes
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 ____ (assum...
User Avatar
526
views
2 answers
0 votes
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...
User Avatar
531
views
2 answers
2 votes
GATE Overflow | Operating Systems | Test 1 | Question: 18
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
User Avatar
418
views
1 answers
0 votes
GATE Overflow | Operating Systems | Test 1 | Question: 17
Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimproves system performance
User Avatar
528
views
2 answers
1 votes
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 ha...
User Avatar
318
views
2 answers
1 votes
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 f...
User Avatar
248
views
1 answers
1 votes
GATE Overflow | Operating Systems | Test 1 | Question: 14
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...
User Avatar
895
views
3 answers
2 votes
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 1...
User Avatar
805
views
2 answers
2 votes
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^-...
User Avatar
471
views
1 answers
2 votes
GATE Overflow | Operating Systems | Test 1 | Question: 11
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...
User Avatar
352
views
1 answers
1 votes
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...
User Avatar
1.0k
views
5 answers
6 votes
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) foreverThe code for $P_{10}$ is identical except that it uses ...
User Avatar
1.6k
views
1 answers
3 votes
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 dif...
User Avatar
684
views
1 answers
5 votes
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?LRUFIFOMRUAll have equal complexity
User Avatar
1.3k
views
2 answers
6 votes
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 val...
User Avatar
629
views
1 answers
1 votes
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 ...
User Avatar
626
views
1 answers
2 votes
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 proced...
User Avatar
535
views
1 answers
3 votes
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 busmain memoryaddress busRAM
User Avatar
516
views
0 answers
4 votes
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 wProcess ...
User Avatar
701
views
1 answers
4 votes
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 swappingove...
User Avatar
To see more, click for the full list of questions or popular tags.