Recent questions and answers in Operating System

0 votes

2 answers

1

Disk scheduling
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135,55 and 195. The ... that will be traversed by the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is _____ ? Answer - 64.

answered 5 hours ago in Operating System by shubham6596 (195 points) | 56 views

0 votes

0 answers

2

self doubt os
Assume we are dealing with multilevel page table here Page Size is 4KB, Page table entry is 4B and the outer page table size is 256B then if the no of levels is 1 so Virtual Address is= 256 KB. but when there are 2 levels of paging then please check my procedure to ... but how to get offset?? here 6 is no of bit in outer table of second split and 10 is the no of bit in first split.

asked 6 hours ago in Operating System by Divyanshum29 Junior (547 points) | 9 views

0 votes

1 answer

3

operating system scheduling
Suppose the following jobs are to be executed in a uniprocessor system. Process ArrivalTime BurstTime P1 0 4 P2 1 8 P3 3 2 P4 10 6 P5 12 5 assume overhead of context switching time is one time unit. Find the average process turnaround time,normalized turnaround time for P2, and the processor efficiency using FCFS please solve it.

answered 16 hours ago in Operating System by jat.gaurav (81 points) | 9 views

0 votes

0 answers

4

the operating systems by galvin
What all chapters do I need to read from the operating systems by Galvin

asked 16 hours ago in Operating System by divyak (7 points) | 7 views

0 votes

0 answers

5

Process synchronisation
In Peterson's solution if P0 sets it's interested and then preempt or terminate the P1 will keep waiting at while loop for indefinite time then how progress is guaranteed

asked 20 hours ago in Operating System by Shiv Gaur Active (1.4k points) | 9 views

0 votes

1 answer

6

Made Easy
A translational look aside buffer is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference takes 500 nanoseconds; TLB (Translation Look aside Buffer) reference takes 40 ... 80%. The speed-up (in %) we gained using TLB technique compared to the pure paging with no TLB ________.

answered 1 day ago in Operating System by Smishra95 Active (1.2k points) | 11 views

0 votes

1 answer

7

Multilevel paging
Doubt In multi level paging Is it required that all the pages of the page table should be in main memory like inner page table and outer page table should be in main memory or either by loading only outer page table we can run the process if any inner page table page required it generate a trap(page fault )and that inner page will put into the main memory by os ?

answered 1 day ago in Operating System by Smishra95 Active (1.2k points) | 12 views

+24 votes

5 answers

8

GATE2009-30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely ... any deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock

answered 1 day ago in Operating System by sutanay3 Active (2.9k points) | 5.6k views

0 votes

0 answers

9

Os memory management
Can page fault occur in tlb miss plz explain.

asked 1 day ago in Operating System by Shiv Gaur Active (1.4k points) | 30 views

0 votes

1 answer

10

MEtest_OS
The answer to above comes to be 20?

answered 2 days ago in Operating System by jat.gaurav (81 points) | 62 views

0 votes

0 answers

11

MeTest_OS2
Doubt1: Is question properly framed? Doubt2: Assuming Doubt1 says yes, Say there are 5 processes $P_1,P_2,P_3,P_4,P_5$ and say all have total execution time of 10 units. Now out of this 10 units, 3 units will be for I/O of each process, but since I/O can proceed ... arrived at t=0, then only first 3 units of time CPU will be idle and hence CPU Utilisation is (35/38)*100.Is this correct?

asked 2 days ago in Operating System by Ayush Upadhyaya Boss (13.8k points) | 14 views

0 votes

1 answer

12

self doubt
I have a doubt regarding the no of context switches needed in any scheduling algorithm. assume we have 5 processes, which require 4, 6, 7,5 and 1 time units and arrive at times 0, 1, 2,3, and 5 respectively. How many context switches are needed if the ... 4 I wanted to ask how SRTF work internally (as i know it will check firstly for next process arrival time then it will go ahed)

answered 2 days ago in Operating System by arya_stark (365 points) | 27 views

0 votes

0 answers

13

Acebook
On a system using demand paging, it takes 200 ns to satisfy a memory request if the page is in memory.If the page is not in memory, the request takes 7 ms if a free frame is available or the page to be replaced is not modified. It takes 15 ms if the replaced page ... and 60% of the time the page to be replaced has been modified? a)600.19us (us= micro seconds) b)590.19us c)790.19us d)None

asked 3 days ago in Operating System by abhishek1995_cse (91 points) | 9 views

0 votes

0 answers

14

Operating System: pagging: PTE

asked 3 days ago in Operating System by chauhansunil20th (463 points) | 17 views

0 votes

0 answers

15

Acebook
For a page size of 200 words, what is the page number and offset for a logical address of 1142. a)5,142 b)2,142 c)6,142 d)7,140

asked 3 days ago in Operating System by abhishek1995_cse (91 points) | 9 views

0 votes

0 answers

16

Acebook
Consider the machine with 64MB physical memory a, the approximate sizes of conventional & inverted page table sizes are: a) 4M, 4K b)4K, 4M c)4M, 16K d) 16K, 4M

asked 3 days ago in Operating System by abhishek1995_cse (91 points) | 6 views

0 votes

1 answer

17

#Interrupts #OS Doubt.
When an interrupt occurs, an operating system can ignore the interrupt? Please tell the answer with reasoning? Thank you!

answered 3 days ago in Operating System by sarathijayaraman (111 points) | 22 views

+1 vote

1 answer

18

berkeley.edu: Operating System: Context Switch

answered 3 days ago in Operating System by Shaik Masthan Boss (31.2k points) | 30 views

0 votes

0 answers

19

BITMAP
Suppose you have 16M bytes of main memory. Using the list method. You have an overhead of eight bytes per memory block. Using the bitmap method, you use an allocation granularity of 128 bytes. How many blocks are there when the space overhead of both methods is the same? What is the average block size for this many blocks?

asked 3 days ago in Operating System by Balaji Jegan Active (2.2k points) | 8 views

0 votes

0 answers

20

PAGING
Assume that we have a paging system with page table stored in memory a. If a memory reference takes 200 nanoseconds how long does a paged memory reference take b. If we add associative registers and 75% of all page table references are found in the associative ... memory reference time? Assume that finding a page table entry in the associative registers takes 1 ns, if the entry is there.

asked 3 days ago in Operating System by Balaji Jegan Active (2.2k points) | 11 views

0 votes

0 answers

21

PAGING
Indi-Comp is a new computer system. It has 32 bits address space. The system employs paging with page of 4K size. Suppose the page table is stored in a semiconductor memory that requires 0.01 microseconds to load the page table. Processes are swapped every 10 ... runs - its page table need to be loaded. Compute the percentage of time that gets used in loading a page as an overload.

asked 3 days ago in Operating System by Balaji Jegan Active (2.2k points) | 5 views

0 votes

0 answers

22

PROCESS SCHEDULING
Suppose we have a single processor system, and jobs arrive at a rate of 10 jobs a Seconds, suppose each job takes an average of 50 milli seconds to complete. Assure that both distributions are exponential. What is the expected number of jobs in the system and the average time in the system?

asked 3 days ago in Operating System by Balaji Jegan Active (2.2k points) | 7 views

0 votes

0 answers

23

nptel lecture on cpu scheduling
Why P1 is still running after 2ms, shouldn't P2 get the cpu burst? In the video they said that are are no processes present other than P1 when the timer interrupts after 2 time slices. Isn't the gantt chart wrong. What i am missing here, can anyone explain it right?

asked 3 days ago in Operating System by himanshu6398 (29 points) | 28 views

0 votes

0 answers

24

Operating System: Multiprogramming: CPU Scheduling

asked 3 days ago in Operating System by chauhansunil20th (463 points) | 52 views

0 votes

0 answers

25

#Threads #OS True/False statements
for kernel-level threads, a system call can block the entire process. User level threads can be scheduled independently. Kernel level threads are transparent to the user level threads. Which of them is True?

asked 3 days ago in Operating System by iarnav Loyal (8.6k points) | 15 views

0 votes

0 answers

26

made esay cpu scheduling

asked 3 days ago in Operating System by amit166 (211 points) | 7 views

0 votes

0 answers

27

made esay systeam call

asked 3 days ago in Operating System by amit166 (211 points) | 11 views

0 votes

0 answers

28

made esay test disk scheduling

asked 3 days ago in Operating System by amit166 (211 points) | 11 views

0 votes

1 answer

29

made esay test

answered 3 days ago in Operating System by amit166 (211 points) | 6 views

0 votes

1 answer

30

Os 1 test

answered 4 days ago in Operating System by Manas Mishra Junior (811 points) | 13 views

0 votes

1 answer

31

Os test

answered 4 days ago in Operating System by Manas Mishra Junior (811 points) | 14 views

0 votes

1 answer

32

Practice Question
How to solve this problem?

answered 4 days ago in Operating System by adarsh_1997 (37 points) | 37 views

+18 votes

4 answers

33

GATE2015-2-30
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. These partitions need to be allotted to four processes of sizes $357$ ... text{KB}$ and $250$ $\text{KB}$ $250$ $\text{KB}$ and $300$ $\text{KB}$ $300$ $\text{KB}$ and $400$ $\text{KB}$

answered 4 days ago in Operating System by rohittulasyan (99 points) | 1.4k views

0 votes

0 answers

34

Test zeal
Please give answer with explanation

asked 4 days ago in Operating System by Prince Sindhiya Active (3.6k points) | 9 views

0 votes

0 answers

35

Test zeal
What should be less time consuming approach for such type of questions

asked 4 days ago in Operating System by Prince Sindhiya Active (3.6k points) | 31 views

0 votes

0 answers

36

Testseries zeal mock
In these question i am getting 48 ,my doubt Is that ,in the question context switching overhead is 1 unit so in Gant chart , i have taken the overhead 1 unit when P2 finishes it's io at 44 unit , please tell me that is it required to consider the context switching time here ?

asked 4 days ago in Operating System by Prince Sindhiya Active (3.6k points) | 11 views

0 votes

0 answers

37

Load Time address binding
I read that in load time binding logical and physical addresses are identical. How is this possible ? In load time binding, we have relocatable code as we don't know where will the process reside in main memory. At load time, the loader binds this relocatable ... will be bound to say "300(base address)+23" = 323 of main memory at load time. How are they same ?

asked 5 days ago in Operating System by garvit_vijai (51 points) | 7 views

0 votes

0 answers

38

segmented paging
Consider a process of 200 KB which has 2 segments each segment size is 256 KB ,Calculate overhead in segmented paging.The page table entry is 4B, segment table entry is 2 B ,Page size is 2KB.

asked 5 days ago in Operating System by eyeamgj Active (5k points) | 15 views

0 votes

0 answers

39

WORKING SET PAGE REPLECEMENT
https://gateoverflow.in/43582/gate1992-12-b HOW IS AVERAGE FRAME IS CALCULATED ,,,,,,,WHY SIZE IS ONLY TAKEN FOR DISTINCT REFERENCE STRING???

asked 5 days ago in Operating System by eyeamgj Active (5k points) | 11 views

0 votes

0 answers

40

self doubt what is correct answer
https://gateoverflow.in/749/gate2001-8 the answer of c par of this question should be 40% according to this https://gateoverflow.in/65890/input-output .................denomenator of c part of 2001 question should not include 0.5????

asked 5 days ago in Operating System by eyeamgj Active (5k points) | 9 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions and answers in Operating System

Recent Posts

Recent Blog Comments