Recent questions and answers in Operating System - GATE CSE Doubts

0 votes

0 answers

https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html

asked 13 hours ago in Operating System by Pranavapp (5 points) | 5 views

0 votes

0 answers

https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html

asked 13 hours ago in Operating System by Pranavapp (5 points) | 4 views

0 votes

1 answer

Simple-paging
What happen if page size and frame size are not equal? will it failed to map logical address to physical address.

answered Apr 3 in Operating System by aryavart (5 points) | 19 views

0 votes

0 answers

Gate 2019 Mining Question 19
If the time to failure of a machine component is exponentially distributed, the reliability of the same at Mean Time to Failure (MTTF) is ____

asked Mar 22 in Operating System by kartikb94 (5 points) | 5 views

+2 votes

0 answers

Paging. Self-Doubt
Here I solved this in this way .. Since the virtual address space is 32-bit long and the first 8 bit specifies the first-level index. Next is the Offset of the page which is 12 from the first line. Coincidently, 20 bit are still left here and it ... this might be the answer. For reference, the answer to the solution is given . Thanks in advance. Is my approach wrong or correct?

asked Mar 20 in Operating System by kirtipurohit (15 points) | 10 views

+1 vote

0 answers

Process Synchronization - Test and Set Variable Method

asked Mar 17 in Operating System by nikhil189 (9 points) | 12 views

0 votes

0 answers

Process Synchronization
Does starvation mean that the thread has to keep waiting but it will eventually get executed, or does it mean that it will stop trying to execute after a certain point?

asked Mar 17 in Operating System by nikhil189 (9 points) | 6 views

0 votes

0 answers

#paging #operatingsystem #gateCSE #gateOperatingSystem

asked Feb 21 in Operating System by cheNavya (5 points) | 14 views

+1 vote

0 answers

Gate Applied Course
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of the pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? ... update the TLB, the page table, and the frame table (if needed) is negligible. A 15106 ns B 76000 ns C 15200 ns D 75110 ns

asked Feb 11 in Operating System by GopiChand (9 points) | 44 views

0 votes

1 answer

IIT Bombay website
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). Translate the following virtual addresses to physical addresses. Note ... or binary. (a) 20 (b) 40 Source:https://www.cse.iitb.ac.in/~mythili/os/ps/memory/ps-memory.pdf (Question-19)

answered Feb 6 in Operating System by Parth27 (163 points) | 35 views

0 votes

0 answers

GateBook Full Length Test Series
Suppose an OS using fair share scheduling : that is users are guaranteed to get their fair-share of the CPU time. Consider the following scenario. User 1 has four processes P1, P2, P3 and P4, and user 2 has only 1 process P5. All processes arrive at the same time ( ... waiting time for user 1 ? Process ID Arrival Time Burst Time P1 0 6 P2 0 8 P3 0 7 P4 0 3 P5 0 24

asked Jan 26 in Operating System by Deterministic (31 points) | 15 views

0 votes

0 answers

Applied Mock Test
Find the Effective Time [closed]

asked Jan 26 in Operating System by Sahil91 (683 points) | 19 views

0 votes

1 answer

testbook operating system sub test 1
Consider a variable partitioning technique for allocation of memory to processes. There are currently 4 partitions of size 50 MB, 150 MB, 250 MB, and 350 MB. The smallest partition that could be denied for a total memory of 3500 MB is _____ MB. (answer in integer)

answered Jan 22 in Operating System by Abhisheksmile94 (347 points) | 27 views

+1 vote

0 answers

why pagetables are not present in cache memory?

asked Jan 22 in Operating System by pradeep jagarlamudi (9 points) | 12 views

0 votes

0 answers

Testbook OS subject test 2
In a certain computer, the virtual addresses are 32 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 16 kB and the word size is 2 bytes. The Translation Look-aside Buffer (TLB) in the ... 64 valid entries. Hit ratio of TLB is 100% then maximum number of distinct virtual addresses that can be translated is _____ K.

asked Jan 21 in Operating System by Abhipsa (17 points) | 23 views

0 votes

1 answer

Doubt Operating system
Suppose you know that there will only be 4 processes running at the same time, each with a Resident Set Size (RSS) of 512 MB and a working set size of 256 KB. Assuming the same system with 32 bit Virtual and Physical address space with 4KB page size ... entries that your system would need to support to be able to map/cache the working set size for one process? 64 1024 128 512

answered Jan 20 in Operating System by Pabitra Sahoo (5 points) | 116 views

0 votes

0 answers

Made Easy Test Series
Consider the following program : int main() { for(i=1;i<n;i++) { if(fork()==0) printf("OS"); } printf("Gate"); } No. of times OS and Gate are printed respectively :?

asked Jan 19 in Operating System by Rishav Chetan (9 points) | 14 views

0 votes

0 answers

MadeEasy Test Series
Can someone explain why progress isn’t there ? If thread A execute LineNo 1 and then prempts and thread B execute LineNo1 then deadlock is pretty much possible here, and if thread A doesn”t want to access CS, how come it stop thread B from accessing it, so I think progress is guaranteed… Can somebody explain why?

asked Jan 18 in Operating System by FreddieMercury (9 points) | 11 views

0 votes

0 answers

Advance concept in operating system
Synchronization delay during normal operation is an advantage of Asynchronous checkpoint ? True False

asked Jan 17 in Operating System by Anilcste (5 points) | 9 views

0 votes

0 answers

advance conept of Operating system (MSc Question
Commanding resource is main job of Operating system (OS) True False

asked Jan 17 in Operating System by Anilcste (5 points) | 8 views

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 Jan 14 in Operating System by Nitinkumar.097 (13 points) | 20 views

0 votes

0 answers

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

asked Jan 10 in Operating System by Abhilash Behera (5 points) | 16 views

0 votes

0 answers

operating system-Ace test series

asked Jan 9 in Operating System by val_pro20 (2 points) | 59 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) | 67 views

+1 vote

1 answer

Made easy TopicWise Test

answered Jan 5 in Operating System by wander (301 points) | 71 views

0 votes

1 answer

Madeeasy Test series OS Q1
Anyone please clarify.

answered Jan 4 in Operating System by Abhisheksmile94 (347 points) | 50 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 (347 points) | 49 views

0 votes

0 answers

Madeeasy Testseries OS Q2

asked Jan 4 in Operating System by Shivateja MST (45 points) | 12 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) | 17 views

0 votes

1 answer

Ace Test Series

answered Jan 2 in Operating System by wander (301 points) | 43 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) | 20 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 (9 points) | 11 views

0 votes

0 answers

asked Dec 22, 2020 in Operating System by vipin.gautam1906 (9 points) | 10 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 (37 points) | 27 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) | 21 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) | 48 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) | 8 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 (683 points) | 45 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 (849 points) | 39 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) | 31 views

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

Recent questions and answers in Operating System

9,197 questions

3,182 answers

14,686 comments

96,162 users