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
2
answers
1951
MadeEasy Test Series: Operating System - Virtual Memory
A computer system implements a 36 bit virtual address. Page size of 4 KB and the size of physical memory is 30 bits. The approximate size of page table in the system is ________ MB. I got 36 but given answer is 48.Which is correct?
A computer system implements a 36 bit virtual address. Page size of 4 KB and the size of physical memory is 30 bits. The approximate size of page table in the system is _...
rahul sharma 5
1.3k
views
rahul sharma 5
asked
Dec 18, 2017
Operating System
made-easy-test-series
operating-system
virtual-memory
+
–
1
votes
2
answers
1952
MadeEasy Test Series: Operating System - Disks
Consider linked allocation system, a program has just read the 15th disk block. After some point of time, If it next want to use the 20th block, then how many disk blocks must the program access? a: 5 b: 10 c:15 d:20
Consider linked allocation system, a program has just read the 15th disk block. After some point of time, If it next want to use the 20th block, then how many disk bloc...
rahul sharma 5
1.1k
views
rahul sharma 5
asked
Dec 18, 2017
Operating System
made-easy-test-series
operating-system
disk
+
–
3
votes
3
answers
1953
MadeEasy Test Series: Operating System - Semaphore
Consider program for P1 and P2: Here, m and n are binary semaphore variables whose values are initially initialized to 1. x and y are shared resources whose values are initialized to 0. Which of the following holds by above processes ... B :-Deadlock and race condition C :-No deadlocks and no race condition D:- Race condition and no deadlock
Consider program for P1 and P2:Here, m and n are binary semaphore variables whose values are initially initialized to 1. x and y are shared resources whose values are in...
rahul sharma 5
2.5k
views
rahul sharma 5
asked
Dec 18, 2017
Operating System
made-easy-test-series
operating-system
semaphore
deadlock-prevention-avoidance-detection
mutual-exclusion
+
–
1
votes
1
answer
1954
MadeEasy Test Series: Operating System - Virtual Memory
Consider a machine 32 MB physical memory and 32 bit virtual address space. If the page size is 8 KB, what is the approximate size of the page table in MB? It was in numerical type and i filled .75 as the answer,but given answer is 1. What should be the correct answer?
Consider a machine 32 MB physical memory and 32 bit virtual address space. If the page size is 8 KB, what is the approximate size of the page table in MB?It was in numeri...
rahul sharma 5
1.2k
views
rahul sharma 5
asked
Dec 18, 2017
Operating System
paging
operating-system
made-easy-test-series
virtual-memory
+
–
0
votes
0
answers
1955
Operating System – Processes sanfoundry.com
If a system allows execution of only one process at a time, it is called as (1) Uni-processing Systems (2) Uni-tasking Systems (3) Uni-programming Systems Acc to me, ans is Uni-programming but answer given is Uni- ... -programing not uni-processing. Rather if ques would have mentioned about single processor then i think answer would be uni-processor.
If a system allows execution of only one process at a time, it is called as(1)Uni-processing Systems(2)Uni-tasking Systems(3)Uni-programming SystemsAcc to me, ans is Uni-...
stanchion
995
views
stanchion
asked
Dec 18, 2017
Operating System
operating-system
uni-processing
uni-programming
process
+
–
1
votes
1
answer
1956
CPU bound and IO bound process
just_bhavana
2.7k
views
just_bhavana
asked
Dec 16, 2017
Operating System
process-scheduling
operating-system
+
–
3
votes
1
answer
1957
Deadlock
ankitgupta.1729
420
views
ankitgupta.1729
asked
Dec 15, 2017
Operating System
deadlock-prevention-avoidance-detection
operating-system
+
–
0
votes
1
answer
1958
Thrashing
Which of the following mechanism will helpful to reduce thrashing? a)Decreasing the degree of multiprogramming. b)Increasing the RAM size
Which of the following mechanism will helpful to reduce thrashing?a)Decreasing the degree of multiprogramming.b)Increasing the RAM size
ankitgupta.1729
2.0k
views
ankitgupta.1729
asked
Dec 15, 2017
Operating System
operating-system
thrashing
+
–
0
votes
1
answer
1959
Page Replacement
Consider a page reference string for a process with m frames. The length of the page reference string is p with n distinct page numbers occurring in it. For any page replacement algorithms, What is lower and upper bound on the number of page faults? (A) m, n (B) p, m (C) n, p
Consider a page reference string for a process with m frames. The length of the page reference string is p with n distinct page numbers occurring in it. For any page repl...
ankitgupta.1729
763
views
ankitgupta.1729
asked
Dec 15, 2017
Operating System
operating-system
page-replacement
+
–
1
votes
1
answer
1960
Memory Management
Suppose you have a computer system with a $48-bit$ logical address, page size of $16KB$ and $4 bytes$ per page table entry. If we have a $48MB$ program such that the entire program and all necessary page tables are in memory. How much memory is used by program, including its page tables?
Suppose you have a computer system with a $48-bit$ logical address, page size of $16KB$ and $4 bytes$ per page table entry. If we have a $48MB$ program such that the enti...
ankitgupta.1729
460
views
ankitgupta.1729
asked
Dec 15, 2017
Operating System
operating-system
memory-management
paging
+
–
0
votes
0
answers
1961
Process Synchronisation
Consider the following program: Const int n= 20 int Count= 0 Void GATE( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin GATE( ); GATE( ); GATE( ); Par end } What is the minimum and maximum possible value of count after the completion of the program?
Consider the following program:Const int n= 20int Count= 0Void GATE( ){int i; for(i= 1 to n)Count= Count + 1;}Main ( ){Par beginGATE( );GATE( );GATE( );Par end}What is th...
ankitgupta.1729
659
views
ankitgupta.1729
asked
Dec 14, 2017
Operating System
operating-system
process-synchronization
+
–
2
votes
4
answers
1962
fork()
1)Consider the following pseudo code: for(i=1;i<=4;i++) { fork(); printf("X"); } How many times “X” is printed? 2) Consider the following pseudo code: void main() { fork(); fork(); fork(); fork(); printf("X"); } How many times “X” is printed?
1)Consider the following pseudo code:for(i=1;i<=4;i++){fork();printf("X");}How many times “X” is printed?2) Consider the following pseudo code:void main(){fork();fork...
ankitgupta.1729
1.4k
views
ankitgupta.1729
asked
Dec 14, 2017
Operating System
fork-system-call
operating-system
+
–
1
votes
4
answers
1963
Threads
The primary difference between process and thread ? (A) The number of I/O requests mode. (B) The amount of overhead associated with creation and context switching . (C) The amount of memory allocation (D) The average number of instructions executed
The primary difference between process and thread ?(A) The number of I/O requests mode.(B) The amount of overhead associated with creation and context switching .(C) The ...
ankitgupta.1729
1.8k
views
ankitgupta.1729
asked
Dec 14, 2017
Operating System
threads
operating-system
process
+
–
0
votes
1
answer
1964
Problem regarding mutual exclusion
Process P1 Process P2 P(S1) P(S1) P(S2) P(S2) Critical Section Critical Section V(S2) V(S1) V(S1) V(S2) In one of the Gateoverflow tests, this question was given and it was told that in the above case mutual exclusion is not ... section. As far as the order of unlocking, I dont see a problem there. Can someone please explain why mutual exclusion is not guaranteed?
Process P1Process P2P(S1)P(S1)P(S2)P(S2)Critical SectionCritical SectionV(S2)V(S1)V(S1)V(S2)In one of the Gateoverflow tests, this question was given and it was told that...
humblefool
882
views
humblefool
asked
Dec 13, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
semaphore
critical-section
+
–
1
votes
0
answers
1965
Bounded wait example
Can someone give me an example of a problem which is starvation free but bounded waiting condition is not satisfied?
Can someone give me an example of a problem which is starvation free but bounded waiting condition is not satisfied?
Xylene
616
views
Xylene
asked
Dec 13, 2017
Operating System
operating-system
+
–
0
votes
1
answer
1966
Mutual exclusion doubt
How spooling can help in preventing mutual exclusion?
How spooling can help in preventing mutual exclusion?
Mahendra Singh Kanya
770
views
Mahendra Singh Kanya
asked
Dec 12, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
1967
Previous Year Gate Question OS 2015
Consider a uniprocessor system executing three tasks T1,T2T1,T2 and T3T3 each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of ... beginning of the 1st millisecond and task preemptions are allowed, " is that all processes arrive at 0 ms ?
Consider a uniprocessor system executing three tasks T1,T2T1,T2 and T3T3 each of which is composed of an infinite sequence of jobs (or instances) which arrive periodicall...
hem chandra joshi
927
views
hem chandra joshi
asked
Dec 12, 2017
Operating System
operating-system
+
–
0
votes
1
answer
1968
What is meant by address space same of child and parent process after fork call ?
hem chandra joshi
1.2k
views
hem chandra joshi
asked
Dec 12, 2017
Operating System
operating-system
+
–
0
votes
0
answers
1969
OS TLB
compute system implement a 36-bit virtual address page size of 16KB and a 256-entry translation look aside buffer organized into 64 sets each having four ways.assume that the TLB tag does not store any process id. the minium length of the TLB tag in bits is?
compute system implement a 36-bit virtual address page size of 16KB and a 256-entry translation look aside buffer organized into 64 sets each having four ways.assume that...
Akshay Koli 4
510
views
Akshay Koli 4
asked
Dec 12, 2017
Operating System
translation-lookaside-buffer
operating-system
+
–
0
votes
1
answer
1970
OS Scheduling
Consider 4 processes, arriving at 0, 0, 2, 5, with total execution time of 10, 20, 30 and 40 units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% ... again. The operating system uses a shortest remaining compute time first scheduling algorithm. For what percentage of time does the CPU remain idle?
Consider 4 processes, arriving at 0, 0, 2, 5, with total execution time of 10, 20, 30 and 40 units, respectively. Each process spends the first 20% of execution time doin...
Akshay Koli 4
512
views
Akshay Koli 4
asked
Dec 12, 2017
Operating System
operating-system
process-scheduling
+
–
0
votes
0
answers
1971
madeeasy booklet
while(1) { flag[i]=true; while(flag[j]); <cs> flag[i]=false; } someone please tell bounded wait is satisfying or not???
while(1) {flag[i]=true;while(flag[j]);<cs>flag[i]=false;}someone please tell bounded wait is satisfying or not???
aaru14
332
views
aaru14
asked
Dec 12, 2017
Operating System
operating-system
b-tree
+
–
1
votes
1
answer
1972
Synchronization mechanism doubt
I read that one of the disadvantage of busy waiting solution to synchronization is that PRIORITY INVERSION can occur in it. My doubt is, does the priority inversion problem only occur in busy waiting solution or it can occur in without busy waiting solution too. Please explain. Thanks.
I read that one of the disadvantage of busy waiting solution to synchronization is that PRIORITY INVERSION can occur in it.My doubt is, does the priority inversion proble...
Mahendra Singh Kanya
819
views
Mahendra Singh Kanya
asked
Dec 11, 2017
Operating System
process-synchronization
operating-system
+
–
0
votes
0
answers
1973
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993 how to solve these type of question someone please help?
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993how to solve these type of question someone please help?
aaru14
233
views
aaru14
asked
Dec 11, 2017
Operating System
operating-system
system
+
–
1
votes
1
answer
1974
Testbook Test Series: Operating System - Process Schedule
Beyonder
490
views
Beyonder
asked
Dec 11, 2017
Operating System
operating-system
process-scheduling
testbook-test-series
+
–
0
votes
1
answer
1975
MadeEasy Test Series: Operating System - Virtual Memory
Certain computer with paged virtual memory has 4KB pages, a 32 bit byte addressable virtual address space and 30 bit byte addressable physical address space. The system manages an inverted page table. Where each entry includes page ... plus 12 overhead bits. What is size of basic inverted page table including page number and overhead bits is?
Certain computer with paged virtual memory has 4KB pages, a 32 bit byte addressable virtual address space and 30 bit byte addressable physical address space. The system m...
aaru14
2.3k
views
aaru14
asked
Dec 10, 2017
Operating System
made-easy-test-series
operating-system
inverted-page-table
virtual-memory
+
–
0
votes
1
answer
1976
MadeEasy Test Series: Operating System - Resource Allocation
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572 someone plz help how to detect deadlock in this type of question??
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572someone plz help how to detect deadlock in this type of question??
aaru14
452
views
aaru14
asked
Dec 10, 2017
Operating System
made-easy-test-series
operating-system
resource-allocation
+
–
0
votes
0
answers
1977
madeeasy work book
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames allocated to the process then what is the minimum and maximum number of page faults possible?
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames ...
aaru14
233
views
aaru14
asked
Dec 10, 2017
Operating System
operating-system
+
–
0
votes
0
answers
1978
Process
Shivam Chauhan
460
views
Shivam Chauhan
asked
Dec 9, 2017
Operating System
operating-system
+
–
0
votes
2
answers
1979
option (d) should be correct.How (a) ?
Neha Bansal 1
408
views
Neha Bansal 1
asked
Dec 9, 2017
Operating System
operating-system
bitmap
+
–
0
votes
1
answer
1980
operating system disk scheduling
any shortcut method for this??
any shortcut method for this??
air1ankit
621
views
air1ankit
asked
Dec 9, 2017
Operating System
operating-system
disk-scheduling
disk
+
–
Page:
« prev
1
...
61
62
63
64
65
66
67
68
69
70
71
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register