Recent questions and answers in Operating System - GATE CSE Doubts

0 votes

0 answers

Self Doubt Disks
when solving questions of disks 10KB is 1024*10B or 1000*10B? different sources are telling different things,even same sources are telling different things at different time.

asked 3 days ago in Operating System by Nitinkumar.097 (13 points) | 13 views

0 votes

0 answers

applied courses test
Are the given Bernstein’s Conditions necessary to be checked?

asked 6 days ago in Operating System by Abhilash Behera (5 points) | 12 views

0 votes

0 answers

operating system-Ace test series

asked Jan 9 in Operating System by val_pro20 (2 points) | 45 views

0 votes

0 answers

OS doubt:TestBook test
A virtual memory with 64 bit virtual address, a 43 bit physical address, a page size 32 KB. TLB with 32 entries. Each TLB entries has TLB tag, physical frame number +3 protection bits. Assume that TLB tag doesnot store any process id. How many bits required for the TLB if TLB is 4 way set associative? Ans given 2464 bits. Is it correct?

asked Jan 6 in Operating System by srestha (1k points) | 56 views

+1 vote

1 answer

Made easy TopicWise Test

answered Jan 5 in Operating System by wander (287 points) | 57 views

0 votes

1 answer

Madeeasy Test series OS Q1
Anyone please clarify.

answered Jan 4 in Operating System by Abhisheksmile94 (193 points) | 46 views

0 votes

1 answer

Madeeasy OS Testseries Q3
Consider the following concurrent program. Int x=0; Int y=0; Parbegin { Begin { x=2; y=y+x; } End Begin { y=5; x=x+5; } End } Parend Which of the following is/are the correct values of x and y that can come after the end of the program? x=2, y=12 x=2, y=7 x=7, y=12 x=6, y=7

answered Jan 4 in Operating System by Abhisheksmile94 (193 points) | 31 views

0 votes

0 answers

Madeeasy Testseries OS Q2

asked Jan 4 in Operating System by Shivateja MST (45 points) | 11 views

0 votes

0 answers

Applied Test Series OS
Consider a system that has four processes, P0, P1, , P3. The process details are mentioned in the table below : Which of the following are correct? Burst Time of P0 is 10 Completion Time of P1 is 15 Completion Time of P2 is 17 Burst time of P3 is ... algo is not given so how they have drawn the gannt chart and said P2 completed before P3 and same is the case for P1 .

asked Jan 4 in Operating System by Nitinkumar.097 (13 points) | 14 views

0 votes

1 answer

Ace Test Series

answered Jan 2 in Operating System by wander (287 points) | 38 views

0 votes

0 answers

IIT Bombay assignment on Process
Please explain the answer. I think both of them should be in ready state.

asked Dec 25, 2020 in Operating System by RasMalai (27 points) | 18 views

0 votes

0 answers

Ace Test Series
Question- Consider a disk with 8 sectors per track and 512 bytes per sector. The disk rotates at 3000rpm and an avg seak time of 15ms. A file has 8 blocks. The max time to access the entire file using index allocation is ____ms Answer is 247.5 but I did not find any explanation..Can i get

asked Dec 22, 2020 in Operating System by vipin.gautam1906 (5 points) | 8 views

0 votes

0 answers

asked Dec 22, 2020 in Operating System by vipin.gautam1906 (5 points) | 9 views

0 votes

0 answers

#operating-system
Consider the following code in which item=0, A and B are shared variables. Pick the correct choice from the given options. 1. The above code ensures mutual exclusion on shared variable item. 2. The above code does not ensure mutual exclusion on shared variable item. 3.The above code ensures bounded waiting. 4.None of the above ans given is 2 .can someone explains why?

asked Dec 20, 2020 in Operating System by 404 found (31 points) | 15 views

0 votes

0 answers

Gate made easy test
can someone explain why the safe sequence is p2,p1,p4 and p3? I keep getting p2,p3,p4 and p1

asked Dec 19, 2020 in Operating System by CheeseCuBES (5 points) | 20 views

0 votes

0 answers

Made easy test series question on deadlock
I am getting option B as the answer but answer given is D. How does the code make mutual exclusion and progress guaranteed??

asked Dec 18, 2020 in Operating System by avian85 (5 points) | 34 views

0 votes

0 answers

Made easy test series question on deadlock
This is a question from made easy test series. Ans given is D. but i got B. Here,initially flag is false therefore flag[j]==false and it will never become true therefore it will never get stuck in while loop and both the processes can be in critical section but how does it guarantee deadlock freedom???

asked Dec 18, 2020 in Operating System by avian85 (5 points) | 7 views

0 votes

1 answer

applied test series
[NAT] A soft real-time system has four periodic events with periods of 50, 100, 200, and 250 msec each. Suppose that the four events required 35, 20, 10, and X msec of CPU time, respectively. The largest value of X for which the system is schedulable is _____________ msec (upto 1 decimal places)

answered Dec 18, 2020 in Operating System by Sahil91 (645 points) | 39 views

0 votes

1 answer

For a uniprocessor system, there will always be ________ number of running process at any given time

answered Dec 16, 2020 in Operating System by SarathBaswa (633 points) | 34 views

0 votes

0 answers

Applied Courses Grand Test 3
Given a total of m =16 resources and n processes in a system, each process needs r resources to complete their execution. Worst case resource allocation requires exactly m resources. And n + r = 9. To guarantee a deadlock-free execution, the number of unique values of n possible are ____

asked Dec 15, 2020 in Operating System by Abhilash Behera (5 points) | 29 views

0 votes

0 answers

Stanford Assignment
Suppose two threads execute the following C code concurrently, accessing sharedvariables a, b, and c: Initialization int a = 4;int b = 0;int c = 0; Thread1 Thread 2 if (a < 0) {c = b-a;} b=10; else {c = b + a;} a=-3 What are the possible values for ... thread is preserved in the code generated by the C compiler. Answer: 4, 7, 13, 14, -3. How -3 can be one of the values of C.

asked Dec 14, 2020 in Operating System by Sahil91 (645 points) | 19 views

0 votes

1 answer

Made Easy Test Series 2021
Answer given is I only.Please anyone explain how it is possible?

answered Dec 14, 2020 in Operating System by Sahil91 (645 points) | 29 views

0 votes

1 answer

#made-easy #operating-systems
FIFO scheduling results in the shortest possible average response time if the jobs arrives in the ready queue with the shortest completion time first(or as a special case, if all jobs have the same completion time). in ans above statement is given ... time quantum equals to 1 unit i will get lesser average response time as compared to FIFO. Is my analysis is correct?

answered Dec 14, 2020 in Operating System by Sahil91 (645 points) | 20 views

0 votes

1 answer

Applied Course Test Series 2021
Consider the following statements S1 and S2: S1 : The disabling interrupts is a busy waiting solution. S2 : If the P() and V() semaphore operations are not executed atomically, then mutual exclusion can be violated. S1 is True and S2 is True S1 is True and S2 is False S1 is False and S2 is True S1 is False and S2 is False

answered Dec 12, 2020 in Operating System by Sahil91 (645 points) | 41 views

0 votes

0 answers

#MadeEasyTestSeries
In a demand paging system with a paging disk that has an average access and transfer time of 45 milliseconds. Address are mapped through a page table in main memory, with an access time of 75 us per memory access. An associative memory (TLB) is added to reduce ... in this question we have consider 2 micro sec for TLBmiss i.e. (1+1) i.e page table acccess+main memory access time

asked Dec 11, 2020 in Operating System by rupesh17 (5 points) | 7 views

0 votes

0 answers

#made-easy #operating-systems
Consider the following information about the processes : Calculate the average response time using RR (time slice=1) scheduling algorithm 1)1.00 2) 0.80 3)0.84 4)0.59 ans is 0.80 can someone explains how?

asked Dec 10, 2020 in Operating System by 404 found (31 points) | 48 views

0 votes

0 answers

Applied Course Test Series 2021
Consider the following program segments for two different processes executing concurrently: Variable X starts at zero and is a shared variable. Variables A and B are not shared variables. If Processes P1 and P2 execute only once at any speed, the largest possible value of X is ____.

asked Dec 10, 2020 in Operating System by Abhishek Malik (5 points) | 16 views

0 votes

0 answers

NET 11 NOV 2020 Question

asked Dec 9, 2020 in Operating System by dishendra (6 points) | 7 views

+1 vote

1 answer

The Gate book test series
Consider a system with a 6 bit virtual address space, and 16 byte pages/frames. The mapping from virtual page numbers to physical frame numbers of a process is (0,8), (1,3), (2,11), and (3,1). Note that all addresses are in decimal. Your answer must be in decimal. A) the physical address to which virtual address 20 is mapped?

answered Dec 8, 2020 in Operating System by Sahil91 (645 points) | 32 views

+2 votes

2 answers

UGC NET 2020 CSE
fork(); printf(“1”); fork(); printf(“2”); fork(); printf(“3”); Above question is similar to the UGC NET 2020 question. I have changed the content of printf(“ ”) statements for my better understanding. What will be the output of the above code? Can anyone explain me above code clearly? Original question had all printf(“ ”) statements with hello inside the quotes.

answered Dec 6, 2020 in Operating System by kalin (153 points) | 76 views

0 votes

0 answers

#Threads Who sets the thread priority?
Who is responsible for setting thread priority? Is it the user, and what if priority is not set explicitly, does the compiler give the priority?

asked Dec 6, 2020 in Operating System by sakharam (29 points) | 14 views

0 votes

0 answers

Doubt on ACE test
Please explain how A) could be answer here?

asked Dec 5, 2020 in Operating System by srestha (1k points) | 35 views

0 votes

1 answer

Ace Test Series
A Counting semaphore block queue contains 20 processes at a certain time. Now 10 P operations and x- V operations were completed on this semaphore. The resultant value of the semaphore is 45. The value of “x” is?

answered Dec 4, 2020 in Operating System by _sajalrai_ (563 points) | 46 views

0 votes

1 answer

MADEEASY TEST SERIES 2018
Consider the following problems: STARVATION DEADLOCK INCONSISTENCE DATA PRIORITY INVERSION Which of the above problem may occur due to the use of locking resources? STARVATION,DEADLOCK and INCONSISTENCE DATA is definitely …….but doubt is with priority inversion ?

answered Dec 4, 2020 in Operating System by _sajalrai_ (563 points) | 39 views

0 votes

0 answers

Made easy Subject test OS
Consider the following code: $P_{x}$: while (TRUE) { while (TRUE) { while (x! = i); Critical Section x = J; Remainder Section } } If $P_{x}$ executes the above code where x is the current process and J is another process. Which of the following is Satisfied? (x is shared variable initialized to i) Mutual Exclusion Progress Bounded wait

asked Dec 4, 2020 in Operating System by shashank023 (5 points) | 13 views

0 votes

0 answers

Test Series (Applied GATE)
I'm confused in this question. I used a scenario which violates ME in this code. Please correct me where I am doing wrong. CURRENTLY: Lock = 0. Process Pi just checked the while(key==True) <Pre-empt> then Process Pj came and executed the while ... =1 and lock=0 and it also enters CS. This scenario violates the condition of ME, please help me where I'm doing wrong.

asked Dec 3, 2020 in Operating System by arpit_18 (5 points) | 27 views

0 votes

0 answers

MadeEasy Subject Wise OS
In a demand paging system with a paging disk that has an average access and transfer time of 45 milliseconds. Address are mapped through a page table in main memory, with an access time of 75 micro-seconds per memory access. An associative memory (TLB) is added to reduce ... calculate time for getting page from memory and disk. so here Emat = (1-0.3)*75*10^-3 + 03*45 ms.

asked Dec 3, 2020 in Operating System by shashank023 (5 points) | 16 views

+2 votes

2 answers

GateBook Test Series(Synchronization and Deadlock)

answered Nov 30, 2020 in Operating System by Deepakk Poonia (Dee) (1.5k points) | 82 views

+2 votes

1 answer

Made Easy Subjectwise
can someone tell what can be the minimum value of count variable???

answered Nov 30, 2020 in Operating System by _sajalrai_ (563 points) | 46 views

+1 vote

1 answer

GateBook OS test series
G Suppose a system in which there are two types of processes, type A and type B processes. All processes of type A execute the same code, and all processes of type B execute the same code. The code for each process type is shown below. A Processes B ... of AABAB. S2 : It is possible for processes to finish in the order AABBA. Which of the above statement(s) is/are CORRECT ?

answered Nov 27, 2020 in Operating System by zxy123 (2.9k points) | 44 views

To see more, click for all the questions in this category.

Recent questions and answers in Operating System

8,957 questions

3,118 answers

14,337 comments

95,787 users