317
views
0 answers
0 votes
https://gateoverflow.in/47333/isi2015-cs-6-bI AM NOT GETTING ABOUT ROUND ROBIN HOW IT IS SOLVED ???
252
views
0 answers
0 votes
https://gateoverflow.in/39655/gate2016-1-20WHAT IS UNIFORM RANDOM???
273
views
0 answers
0 votes
HOW CAN WE SOLVE THIS IN LESS TIME ...OR IT IS NECESSARY TO SOLVE FOR EVERY OPTION ...IT IS REALLY TAKING TIME A computer has twenty physical page ... . Least-recently-usedB. First-in-first-outC. Last-in-first-outD. Most-recently-used
152
views
0 answers
0 votes
https://gateoverflow.in/3600/gate2006-it-56THERE ARE MANY SOLUTION GIVEN INCLUDING SOME ASSUMPTIONS ........BUT HOW I DID IS .....FOR PAGING :P1.........THERE ARE 195 ... ,P3,P4 SO OPTION B IS COMING ...IS IT CORRECT WAY TO SOLVE ??????
201
views
0 answers
0 votes
GATE1992-12-b WORKING SET REPLACEMENT ALGORITHM IS IN SYLLABUS OR IF GATE AUTHORITY WILL FRAME THIS QUESTIOn THEY WILL MENTION THE DEFINITION OF WORKING SET????
141
views
0 answers
0 votes
https://gateoverflow.in/3652/gate2004-it-11-isro2011-33 THE QUESTION CONTAIN SOME CONCEPT OF CRT ,SWEEP TIME etc ..........ARE THEY IN SYLLABUS????
188
views
0 answers
0 votes
https://gateoverflow.in/2775/gate1996-23WHAT IS THE CORRECT ANSWER OF 2ND PART
443
views
0 answers
0 votes
https://gateoverflow.in/3694/gate2004-it-51IN THE LAST LINE OF QUESTION"the percentage of memory cycles stolen for transferring one word is" HOW WE ARE GETTING TO KNOW THAT WE NEED TO FIND OUT THE PERCENTAGE OF CPU BLOCK .
154
views
0 answers
0 votes
https://gateoverflow.in/2650/gate1995-14 i have a doubt regarding 2nd part that no where it is mentioned that we need to calculate the data transfer rate for the case of formatting disk ...so why we are subtracting 96 from sector size???
266
views
0 answers
0 votes
https://gateoverflow.in/58752/disk-schedulingin this question suppose we need to consider transfer time ...then in this case also same???
305
views
0 answers
0 votes
https://gateoverflow.in/195902/made-easy-test-series-os THE REASON FOR 2ND ONE FALSE IS THAT...... BECZ CPU TAKES CARE TO SEND SIGNAL TO OS TO LOAD THE REQUIRED PAGE NO NEED OF PROGRAMMER ..????? CORRECT OR NOT???
2.2k
views
1 answers
0 votes
CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE ... IN THE VIRTUAL ADDRESS SPECIFY THE PAGE NUMBER?A)4 bitsb)5 bitsc)16 bitsd)21 bits
508
views
1 answers
0 votes
Q1: SAFE OR NOT??i have doubt with the answer given becz i am getting safe for question 1 and unsafe for question 2 but opposite answer is given in test series/.
1.9k
views
1 answers
0 votes
A) DEADLOCK CAN BE PREVENTED BY NOT ALLOWING ANY PROCESS TO REQUEST FOR RESOURCE WHEN IT ENTERS A CRITICAL SECTION.(TRUE OR FALSE)B) DEADLOCK AVOIDANCE SCHEME ... REQUEST AND USE DURING ITS LIFE TIME(TRUE OR FALSE)ALSO PROVIDE SOME REASON
276
views
0 answers
0 votes
https://gateoverflow.in/765/gate2005-72wwhile answering this question how we are concluding that we need to take logical address part not physical address part????
317
views
0 answers
0 votes
https://gateoverflow.in/75964/doubt in this question first one is done by Short term scheduler (STS)for b) Short term schedulerc)user programd)osi have a doubt that with ... ...i know that it is scheduler to do that but STS is correct????
119
views
0 answers
0 votes
ICMPV6 neighbor discovering protocol is in syllabus ???
1.4k
views
2 answers
0 votes
doubt on complexity of bellman ford how it can be O(V2E)
986
views
0 answers
1 votes
Q: If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?I HAVE A DOUBT THAT IIN SOLUTION ... as i know the space complexity is something equal to number of levels .....
378
views
1 answers
1 votes
TOPICS LIKE P,NP COMPLETE IS IN SYLLABUS????????