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 Deepanshu
1
votes
2
answers
41
SELF DOUBT
Consider a paging system with a page table stored in memory where memory reference takes 200 nanoseconds and all pages are in memory. 1) If we add associative registers (TLB), and 75% of all page-table references are found in the associative registers, what ... , where context switching, disk transfer time, etc takes 100 n seconds.) ANYONE PLEASE HELP ME WITH THE CONCEPT OF THIS QUESTION
Consider a paging system with a page table stored in memory where memory reference takes 200 nanoseconds and all pages are in memory.1) If we add associative registers (T...
2.0k
views
asked
Oct 5, 2018
0
votes
0
answers
42
SELF DOUBT
The set of languages accepted by a DPDA by empty stack is a strict subset of the set of languages accepted by a DPDA by final state. PLEASE HELP ME TO PROVE THIS STATEMENT WITH ANY EXAMPLE . I AM NOT GETTING ANY EXAMPLE
The set of languages accepted by a DPDA by empty stack is a strict subset of the set of languages accepted by a DPDA by final state. PLEASE HELP ME TO PROVE THIS STATEMEN...
158
views
asked
Oct 4, 2018
3
votes
0
answers
43
SELF DOUBT
I AM NOT GETTING THE CONCEPT OF DANGLING POINTER HERE . PLEASE EXPLAIN?
I AM NOT GETTING THE CONCEPT OF DANGLING POINTER HERE . PLEASE EXPLAIN?
660
views
asked
Oct 2, 2018
0
votes
2
answers
44
Memory overhead in Multilevel paging with TLB
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits.The page table is divided into 512 pages each of size 1K.The memory access time is 100ns and the TLB access time 15ns .Page table entry size at 1st ... page table along with the page of the second level page table for a process? A)6KB B)4KB C)5KB D)12KB
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits.The page table is divided into 512 pages each of size 1K.The memory acce...
1.7k
views
asked
Oct 1, 2018
Operating System
multilevel-paging
paging
translation-lookaside-buffer
+
–
0
votes
0
answers
45
SELF DOUBT
WHAT IS AN EMBEDDED FUNCTION CALL . PLEASE EXPLAIN WITH EXAMPLE?
WHAT IS AN EMBEDDED FUNCTION CALL . PLEASE EXPLAIN WITH EXAMPLE?
87
views
asked
Oct 1, 2018
0
votes
0
answers
46
SELF DOUBT
https://gateoverflow.in/108113/external-fragmentation is this question answer correct there (USERS WHICH POST SOLUTION AND COMMENTS ARE NOT ACTIVE SO POSTING HERE I THINK EXTERNAL FRAGMENTATION SHOULD BE 0 AS EXTERNAL FRAG GENERALLY MEANS WE HAVE SPACE BUT WE CANT PUT PROCESS IN THAT SPACE DUE TO EITHER NOT CONTINOUS OR LESS SPACE . BUT HERE WE HAVE SPACE . SO I THINK IT SHOULD BE 0
https://gateoverflow.in/108113/external-fragmentationis this question answer correct there(USERS WHICH POST SOLUTION AND COMMENTS ARE NOT ACTIVE SO POSTING HEREI THINK EX...
187
views
asked
Sep 29, 2018
0
votes
0
answers
47
self doubt
Consider a paging system with a page table stored in memory where memory reference takes 200 nanoseconds and all pages are in memory. If we add associative registers (TLB), and 75% of all page-table references are found in the associative registers, what is the ... out to the disk to load the faulted page in memory, where context switching, disk transfer time, etc takes 100 m seconds.)
Consider a paging system with a page table stored in memory where memory reference takes 200 nanoseconds and all pages are in memory.If we add associative registers (TLB)...
251
views
asked
Sep 29, 2018
0
votes
0
answers
48
SELF DOUBT
Consider a simple segmentation system that has the following segment table For each of the following logical addresses, determine the physical address a segment fault occurs? 1. 3, 444 2. 0, 198 3. 2, 156 4. 1, 530
Consider a simple segmentation system that has the following segment tableFor each of the following logical addresses, determine the physical address a segment fault occu...
422
views
asked
Sep 29, 2018
0
votes
0
answers
49
SELF DOUBT
https://gateoverflow.in/43578/gate2003-79 I AM NOT GETTING THIS QUESTION . SO PLEASE HELP.
https://gateoverflow.in/43578/gate2003-79I AM NOT GETTING THIS QUESTION . SO PLEASE HELP.
138
views
asked
Sep 28, 2018
0
votes
0
answers
50
SELF DOUBT
In a THREE-level virtual memory, the memory access time for main memory, T(M)=10 ns, and the memory access time for the secondary memory, T(D)= I ms. What must be the hit ratio, H such that the access efficiency is within 70 percent of its maximum value? PLEASE SOME ONE EXPLAINED THIS IN DETAIL.
In a THREE-level virtual memory, the memory access time for main memory, T(M)=10 ns, and the memory access time for the secondary memory, T(D)= I ms. What must be the hit...
316
views
asked
Sep 27, 2018
0
votes
0
answers
51
SYLLABUS
PLEASE SOMEONE SUGGEST GOOD HANDWRITTEN NOTES FOR TOPIC FILE SYSTEM IN OS .I AM NOT GETTING THIS TOPIC FROM BOOK. (terms they use in book is so difficult ) IF SOMEONE HAVING NOTES OF THIS TOPIC PLEASE UPLOAD .
PLEASE SOMEONE SUGGEST GOOD HANDWRITTEN NOTES FOR TOPIC FILE SYSTEM IN OS .I AM NOT GETTING THIS TOPIC FROM BOOK.(terms they use in book is so difficult )IF SOMEONE HAVI...
347
views
asked
Sep 27, 2018
0
votes
1
answer
52
SELF DOUBT
Consider two processes X and Y with X and Y having P and Q threads with equal time slices respectively. Threads are mixed with user level threads (ULT) and kernel level threads (KLT) and P < Q. Now consider the following statements I) If all threads ... times more CPU time than X. Which of the above statements are TRUE? I AM NOT ABLE TO UNDERSTAND THESE STATEMENTS MEANING PLEASE HELP
Consider two processes X and Y with X and Y having P and Q threads with equal time slices respectively. Threads are mixed with user level threads (ULT) and kernel level t...
542
views
asked
Sep 22, 2018
0
votes
0
answers
53
TEST SERIES
I) CODE 1 guarantees Mutual Exclusion II) CODE 2 guarantees Mutual Exclusion III) CODE 2 leads to Deadlock Which of the above statements are TRUE???? 1. I and II only 2. II and III only 3. I and III only 4. All I,II and II
I) CODE 1 guarantees Mutual ExclusionII) CODE 2 guarantees Mutual ExclusionIII) CODE 2 leads to DeadlockWhich of the above statements are TRUE????1.I and II only 2. II an...
626
views
asked
Sep 21, 2018
0
votes
0
answers
54
TEST SERIES
Consider the following program: const int n = 50; int tally; void total ( ) { int count; for (count= 1; count <= n; count++) { tally++; } } void main ( ) { tally = 0; parbegin (total ( ), total ( ) ); write (tally); } The minimum and maximum value of shared variable tally is 1. 0 ≤ tally ≤ 100 2. 1 ≤ tally ≤ 50 3. 1 ≤ tally ≤ 100 4. 2 ≤ tally ≤ 100
Consider the following program:const int n = 50;int tally;void total ( ){int count;for (count= 1; count <= n; count++) {tally++; }}void main ( ){tally = 0;parbegi...
859
views
asked
Sep 21, 2018
1
votes
0
answers
55
SELF DOUBT
Consider a system consisting of four processes and a single resource. The current state of claim matrix and allocation matrix is given below. The minimum number of available units required for the state to be safe is ...... (A) 1 (B) 0 (C) 2 (D) 3 WHAT IS CLAIM MATRIX?
Consider a system consisting of four processes and a single resource. The current state of claim matrix and allocation matrix is given below. The minimum number of availa...
629
views
asked
Sep 21, 2018
0
votes
0
answers
56
SELF DOUBT
The semaphore variables full, empty and mutex are initialized to 0, n and 1, respectively. Process P1repeatedly adds one item at a time to a buffer of size n, and process P2 repeatedly removes one item at a time from the same buffer using the programs given below. In the programs, X, Y, ... ) P(empty), V(full), P(empty), V(full) P(empty), V(full), P(full), V(empty) WHAT IS THE ANSWER ??
The semaphore variables full, empty and mutex are initialized to 0, n and 1, respectively. Process P1repeatedly adds one item at a time to a buffer of size n, and process...
272
views
asked
Sep 20, 2018
1
votes
2
answers
57
SELF DOUBT
Consider the program segment: x= 0; y=0; Cobegin begin x= 1; y= y + x; end begin y= 2; x= x + 3; end Coend; Which of the following indicates possible values for the variables when the segment finishes execution???? WHAT HAPPENS IF IN PLACE OF ... BEGIN AND PAREND??? PLEASE EXPLAIN THIS IN DETAIL AND I AM NOT ABLE TO FIND THIS TOPIC ALSO HELP IN WHICH TOPIC THESE CONCEPTS ARE INCLUDED
Consider the program segment:x= 0; y=0;Cobeginbeginx= 1;y= y + x;endbeginy= 2;x= x + 3;endCoend;Which of the following indicates possible values for the variables when th...
746
views
asked
Sep 19, 2018
0
votes
0
answers
58
SELF DOUBT
https://gateoverflow.in/2319/gate1993-22 IN THIS QUESTION THEY ASK SOMETHING ABOUT PAREND AND PARBEGIN? WHAT ARE THEY? AND THIS CONCEPT IS OF WHICH TOPIC IN BOOK ??
https://gateoverflow.in/2319/gate1993-22IN THIS QUESTION THEY ASK SOMETHING ABOUT PAREND AND PARBEGIN? WHAT ARE THEY?AND THIS CONCEPT IS OF WHICH TOPIC IN BOOK ??
145
views
asked
Sep 18, 2018
0
votes
0
answers
59
SELF DOUBT
https://gateoverflow.in/765/gate2005-72 IN THIS QUESTION SOLUTION THEY ARE SAYING V=Y. I AM NOT GETTING THIS POINT
https://gateoverflow.in/765/gate2005-72 IN THIS QUESTION SOLUTION THEY ARE SAYING V=Y. I AM NOT GETTING THIS POINT
209
views
asked
Sep 18, 2018
4
votes
1
answer
60
SELF DOUBT
if(fork()||fork()) { fork(); fork(); } printf("ABC") HOW MANY TIMES ABC CALLED?
if(fork()||fork()) { fork(); fork(); } printf("ABC") HOW MANY TIMES ABC CALLED?
1.7k
views
asked
Sep 13, 2018
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
