Recent questions and answers in Operating System

0 votes

1 answer

1

Demand Paging
Consider a system where main memory access time is 10 msec and page fault service time is 200 msec. The TLB is added to improve the performance and the 80% references are found in the TLB and that of the remaining 10% cause page fault. The TLB access time and page table access time are ... . I am evaluating as follows, Where am I doing wrong? EMAT=0.8*(10)+0.2[0.9*10 + 0.1*(10+200)]

answered 1 day ago in Operating System by eyeamgj Active (1.6k points) | 17 views

+2 votes

2 answers

2

ISRO2008-63
Fork is the creation of a new job the dispatching of a task increasing the priority of a task the creation of a new process

answered 1 day ago in Operating System by Komal-V (71 points) | 1k views

+6 votes

2 answers

3

ISRO2008-66, ISRO2009-15
The performance of Round Robin algorithm depends heavily on size of the process the I/O bursts of the process the CPU bursts of the process the size of the time quantum

answered 1 day ago in Operating System by Komal-V (71 points) | 2.4k views

+11 votes

10 answers

4

ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above

answered 1 day ago in Operating System by Vishal Sharma (11 points) | 6.7k views

0 votes

0 answers

5

caching and virtual memory
I am having troble with these following questions. Please I need help

asked 2 days ago in Operating System by Samson Bankole (7 points) | 12 views

0 votes

1 answer

6

Logical Address in Paging
In paging, we know that the no. of bits for page offset is same and depends upon the size of the page size. However, the rest of the bits of the logical address somehow determines the no. of pages of the process and thus the size of ... offset (constant) ) and thus two process of different sizes have different length logical addresses? Is it the scenario where we use PTLR?

answered 3 days ago in Operating System by sonveer tomar 1 Junior (891 points) | 32 views

0 votes

2 answers

7

Operating System Paging ISI
A 32-bit machine has a page/frame size of 1 KB. (i) What is the size of the complete first-level (primary) page table for a process? (ii) If page tables are also stored using paging, how many levels of paging will be required?

answered 4 days ago in Operating System by Poonam Gupta 1 (163 points) | 98 views

0 votes

0 answers

8

Sample test
Consider a process with a single CPU burst of 100 time units and a single disk I/O of 1000 time units at the end. If the timer interval is fifteen time units and the process scheduling algorithm is round-robin, at most how many times would ... before entering the terminated state? Assume that there is a sufficiently large number of processes of similar nature trying to run on the CPU

asked 6 days ago in Operating System by Kiran Karwa Active (1.1k points) | 36 views

0 votes

4 answers

9

made-easy mock test2
Which of the following statement is true related to synchronization mechanism? a) If any solution is satisfying the progress condition, then it will not have any deadlock. b) Race condition occur if mutual exclusion is satisfied. c) Bounded waiting is always satisfied if there are only two processes. d) None.

answered Apr 14 in Operating System by Mkp1104 (15 points) | 339 views

0 votes

0 answers

10

PGEE sample paper question on threads
I think options A, D and E are wrong; B is true. I'm not sure about C. I think it should be true because page table is created for a process and not for its threads so page table should be shared among threads of a same process. [closed]

asked Apr 14 in Operating System by Akhilesh Singla Active (3.1k points) | 95 views

0 votes

2 answers

11

Self doubt
How to understand that no. of entries in inverted page table is equal to no of frames in physical address space?

answered Apr 14 in Operating System by Raj Kumar 7 Junior (837 points) | 87 views

0 votes

1 answer

12

Data Transfer
I have a normal Doubt Consider a Scenario:- 1. Total number of block are = K Total number of records per block = P Size of record = B bytes And we need to transfer all the blocks in memory. Avg rotation latency = R Seek time = S Block transfer rate ... rotation latency and transfer time for every block rt? else in one access i can transfer everything??? Plz correct me if i am wrong?

answered Apr 14 in Operating System by Tesla! Boss (15.4k points) | 19 views

0 votes

1 answer

13

self - doubt
Physical memory are divide into frame. The frame of each size are equal. Is the word size in each frame same or it may possible to different in size ? (I am taking about word size in two different frame in main memory. )

answered Apr 14 in Operating System by Tesla! Boss (15.4k points) | 18 views

0 votes

0 answers

14

Self doubt
Explain Last In First Out (LIFO) and MRU with this example and find a number of a page fault. Question: Let the number of the frame in main memory is 5. Reference String: 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10

asked Apr 13 in Operating System by Raj Kumar 7 Junior (837 points) | 21 views

0 votes

0 answers

15

Gate Previous year
A computer has 20 physical memory frame which contains pages numbered 101, 102, ........., 120. Now a program access the pages numbered 1,2, .........., 100 in that order and repeat the access sequence thrice. How many page faults take place using an optimal algorithm? 1. 260 2. 262 3. 300 4. 400 [closed]

asked Apr 13 in Operating System by Raj Kumar 7 Junior (837 points) | 11 views

+3 votes

3 answers

16

ISRO-2013-62
A particular parallel program computation requires $100$ seconds when executed on a single CPU. If $20$% of this computation is strictly sequential, then theoretically the best possible elapsed times for this program running on $2$ CPUs and $4$ CPUs respectively are $55$ and $45$ seconds $80$ and $20$ seconds $75$ and $25$ seconds $60$ and $40$ seconds

answered Apr 12 in Operating System by Rohit Kumar 2 (207 points) | 1.9k views

0 votes

1 answer

17

Process synchronisation
Is it necessary that if there is no deadlock progess will always be there? Or in case of NO Deadlock progess may or may not be there

answered Apr 12 in Operating System by Deepakk Poonia (Dee) Active (2.9k points) | 28 views

+13 votes

3 answers

18

GATE2004-IT-62
A disk has 200 tracks (numbered 0 through 199). At a given time, it was servicing the request of reading data from track 120, and at the previous request, service was for track 90. The pending requests (in order of their arrival) are for track numbers. 30 70 115 ... scheduling policies SSTF(Shortest Seek Time First) and FCFS (First Come Fist Serve)? 2 and 3 3 and 3 3 and 4 4 and 4

answered Apr 11 in Operating System by Tuhin Dutta Loyal (7.6k points) | 1.7k views

0 votes

0 answers

19

Computing the average turnaround time using the multilevel queues

asked Apr 11 in Operating System by ytr567 (7 points) | 38 views

+7 votes

2 answers

20

ISI2015-CS-6-b
Consider scheduling $n$ processes $P_1, P_2, \dots, P_n$ which are created in this order at almost the same instant. Assume that all processes have exactly one CPU burst of duration $D$ units (and no I/O bursts). Compute the average waiting time and ... switch from one running process to another and $\Delta$ units of time to switch from a terminated process to a running process.

answered Apr 11 in Operating System by Tesla! Boss (15.4k points) | 371 views

0 votes

0 answers

21

Tanenbaum, Gate
How important it is to study the WSClock page replacement algorithm (Given in Tanenbaum OS book) for gate 2019 preparation ? May I leave this topic, and may be later if I get time, should I read it.

asked Apr 10 in Operating System by Harsh Kumar (17 points) | 25 views

+1 vote

0 answers

22

Operating System By Harris
Assume the amount of memory on a system is inversely proportional to page fault rate. Each time when memory doubles the page fault rate is reduced by third. Currently system has 32mb of memory and page fault rate is 2% the main memory access time is ... is 300 μ sec. if the main memory is increased to 128 mb, then what would be the overall effective access time________.

asked Apr 8 in Operating System by satendra (121 points) | 62 views

+1 vote

2 answers

23

DRAM refresh operation
how we will come to know that wt overhead. means here??

answered Apr 8 in Operating System by aakashpreetam (275 points) | 173 views

0 votes

1 answer

24

Made easy booklet - Memory management
Given following data, find average access time. Please explain the solution.

answered Apr 7 in Operating System by Hitesh (369 points) | 236 views

+2 votes

0 answers

25

Does every process have its own TLB?
I know that every process has its own page table and but is it the same with TLB? Does every process have its own TLB or there is a master TLB which is used by all the processes?

asked Apr 6 in Operating System by punkprincess (27 points) | 45 views

+2 votes

1 answer

26

My doubt on TLB and page fault
First read this whole thing what I am writing below: Case 1: If we have to access unit address in memory using TLB and we assume that no page fault occurs then, EMAT=p( T+M )+( 1-p ) (T+M+M) T=TLB access time, M= ... if there page fault occurs then how does the last calculated EMAT here affects the first Estimated memory access time which we have calculated using TLB?

answered Apr 5 in Operating System by Akhilesh Singla Active (3.1k points) | 36 views

0 votes

1 answer

27

Virtual Address or Logical Address Mapping into Physical Address in PAGING

answered Apr 4 in Operating System by tanmay jawkhede (29 points) | 51 views

+13 votes

4 answers

28

GATE2007-82
A process, has been allocated 3 page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page references (reference string): 1, 2, 1, 3, 7, 4, 5, 6, 3, 1 If optimal page replacement policy is used, how many page faults occur for the above reference string? 7 8 9 10

answered Apr 4 in Operating System by tanmay jawkhede (29 points) | 1.4k views

+1 vote

1 answer

29

ISI sample paper
[closed]

answered Apr 4 in Operating System by Tesla! Boss (15.4k points) | 62 views

+7 votes

2 answers

30

ISI2011-CS-5c
One of your classmates has suggested the following modified version of a standard scheme for solving the 2-process critical section problem (CSP). shared char want[2] = {0,0}; shared int turn = 0; 1. P_i() 2. { while (1) { 3. turn = ... of instructions executed by two processes $P_0$ and $P_1$. Modify the above scheme so that it becomes a correct solution to the 2-process CSP.

answered Apr 4 in Operating System by ashutoshmahato (15 points) | 243 views

+1 vote

1 answer

31

self doubt
Process P0:- Process P1 while(1) while(1) { { int[0]=True; int[1]=True; while(int[1]==True); while(int[0]=True); //CS// //CS// int[0]=False; int[1]=False; } } Initially, int[0]=int[1]=false; Will this algorithm satisfy progress and why?

answered Apr 3 in Operating System by Prateek Raghuvanshi Junior (899 points) | 54 views

+3 votes

1 answer

32

Self Doubt
It is obvious when a program is allotted memory, there are many segments viz Code Segment,Stack Segment,Heap and Static as well. Therefore does this area remain the same for all the programming languages?I

answered Apr 3 in Operating System by Raj Kumar 7 Junior (837 points) | 83 views

+17 votes

3 answers

33

GATE2015-2-30
Consider 6 memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB, 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process? 200 KB and 300 KB 200 KB and 250 KB 250 KB and 300 KB 300 KB and 400 KB

answered Apr 3 in Operating System by chalam121 Active (2k points) | 1.3k views

+6 votes

6 answers

34

GATE2018-40
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined with respective initial values of 0, N and 1. Semaphore $empty$ denotes the number of available slots in the buffer, for the ... R:full, S:full P: full, Q:empty, R:empty, S:full P: empty, Q:full, R:full, S:empty

answered Apr 3 in Operating System by Utsav09 Active (1.1k points) | 1.3k views

+5 votes

3 answers

35

My doubt of security concern while using Dynamic linking

answered Apr 3 in Operating System by smsubham Loyal (6k points) | 45 views

+14 votes

2 answers

36

GATE1990-2-iii
Match the pairs in the following questions: (a) Critical region (p) Hoare's monitor (b) Wait/Signal (q) Mutual exclusion (c) Working Set (r) Principle of locality (d) Deadlock (s) Circular Wait

answered Apr 2 in Operating System by pankaj_vir Loyal (6.3k points) | 671 views

+14 votes

5 answers

37

GATE1997-6.7
An operating system contains 3 user processes each requiring 2 units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is 3 5 4 6

answered Apr 1 in Operating System by Prasanjeet Ghosh (27 points) | 3.8k views

0 votes

1 answer

38

DMRC AM-IT, Virtual memory
The lookup page table shown below is for a job in a paged virtual storage system with a page size of 1024 locations. Each virtual address is in the form [p,d] where p is page number and d is displacement in the page. Virtual page Actual page 0 3 1 --- 2 4 3 0 A virtual address of [0,514] maps to an actual address of A) 512 B)1538 C)3586 D)4514

answered Apr 1 in Operating System by Ananya Jaiswal 1 Active (1.2k points) | 72 views

+2 votes

0 answers

39

Throughput
In larger block size, how seek time will be less and how eventually it leads to better throughput?

asked Apr 1 in Operating System by srestha Veteran (81.9k points) | 73 views

–1 vote

1 answer

40

ravi sir
1. Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT?

answered Mar 31 in Operating System by Manish kumar 13 (53 points) | 57 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