Recent questions and answers in Operating System

Recent questions and answers in Operating System

0 votes

1 answer

1

Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1

amitraj123 answered in Operating System 22 hours ago

61 views

0 votes

0 answers

2

Made Easy Test Series
“Consider the following proposed solution to dining philosophers problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1. Which of the following is correct?” In the above question, is the given solution deadlock free? Will removing (iii) and (iv) can make the solution deadlock free?

abuhujair asked in Operating System 1 day ago

26 views

20 votes

5 answers

3

ISRO2007-11, GATE CSE 2001 | Question: 1.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served

thewolf answered in Operating System 3 days ago

8.9k views

0 votes

1 answer

4

#self doubt
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?

aaa 1 answered in Operating System 4 days ago

by aaa 1

53 views

1 vote

0 answers

5

made east test series - synchronization - OS
Consider the following proposed solution to Dining Philosopher's problem to avoid deadlock. The binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. It will work fine. Removing (iii) ... fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.

atulcse asked in Operating System 4 days ago

49 views

1 vote

3 answers

6

Applied Gate Full Length Test
Let S be the binary semaphore variable initialized to zero. If no blocked processes exist in the system then consider the execution of the following signal (V), wait (P) operation. The number of blocked processes at the end are _________. 4 P, 6 V, 9 P, 13 V, 14 P

amitraj123 answered in Operating System 5 days ago

49 views

0 votes

0 answers

7

#CSPC 2019 #OS 3rd edition
Given 1GB USB pen drive which is now formatted using i-node, assuming 32-bit addressing with 1Kbytes blocks with 4 bytes per block pointer. What is maximum file size the file system can store on the disk?

lc1234 asked in Operating System 6 days ago

by lc1234

23 views

0 votes

0 answers

8

Applied Test Series
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple index. If the disk sector is 512 bytes, which is the closest option for maximum file size in this allocation scheme?

Sagar475 asked in Operating System Jan 16

50 views

0 votes

1 answer

9

MadeEasy Subject Test 2019: Operating System - Translation Lookaside Buffer
A TLB 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 ... EMAT using TLB ==> 640ns EMAT wthout TLB ==> 1000ns how to calculate speed Up.?

Sarang answered in Operating System Jan 16

by Sarang

445 views

0 votes

1 answer

10

Gate Applied Test Series
Question: Consider a system using a segmented paging architecture. The segment is divided into 8k pages each of size 2k words . The segment table is divided into 256 k pages each of size 512 words. The page table entry size requires 64 bits . The frame number requires 22 bits ... address (LA). Note: 1 Word = 1 Byte Options Are: A. 51 bits B. 61 bits C. 33 bits D. 64 bits

girish13 answered in Operating System Jan 14

74 views

0 votes

1 answer

11

gate applied mock test -3
Suppose that you wish to design a virtual memory system with the following characteristics: i. The size of a page table entry is 4 bytes. ii. Each page table must fit into a single physical frame. iii. The system must be able to support virtual address ... no more than two levels of page tables. What is the minimum page size that your system must have? 8KB 16KB 32KB none

DAWID15 answered in Operating System Jan 13

277 views

0 votes

1 answer

12

#Self Doubt OS CPU scheduling?
Does non preemptive CPU scheduling needs hardware support. kindly explain.

aaa 1 answered in Operating System Jan 13

by aaa 1

70 views

0 votes

3 answers

13

Applied Test Series
A computer system has a page size of 1024 bytes and maintains the page table for each process in main memory. The overhead required for doing a lookup in the page table is 500 ns. To reduce this overhead, the computer has a TLB that ... frame mappings. A TLB lookup requires 100ns. Which TLB hit-rate will ensure an average virtual address translation time of exactly 200ns?

Kabir5454 answered in Operating System Jan 13

63 views

0 votes

2 answers

14

made easy test series - deadlock - operating systems
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. The minimum value of ‘m’ that will ensure that deadlock will never occur is _____.

girish13 answered in Operating System Jan 12

56 views

0 votes

0 answers

15

Multi-level Paging
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?

ankit3009 asked in Operating System Jan 12

64 views

2 votes

1 answer

16

System Call and Shared Memory
Is SYSTEM CALLS needed to setup the shared memory between two processes ? and what are these system calls and does this system calls have any security concern?

madhes23 answered in Operating System Jan 11

744 views

0 votes

0 answers

17

#unversity exam
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of all these processes in a given round, then the number of preemptions is at least: (A) 2n (B) n (C) 2n–1 (D) n–1

amit166 asked in Operating System Jan 9

31 views

0 votes

1 answer

18

Applied Gate Test Series Question
Consider the following code segments, the total number of processes (including the initial process) is ______.

Isha_99 answered in Operating System Jan 9

50 views

1 vote

2 answers

19

synchronization
does it guarantee mutual exclusion and deadlock prevention?

rish1602 answered in Operating System Jan 8

369 views

2 votes

3 answers

20

MadeEasy Test Series: Operating System - Process Synchronization
P1 terminates but P2 does not P2 terminates but P1 does not Both P1 and P2 terminate Neither P1 nor P2 terminate

rish1602 answered in Operating System Jan 8

1k views

2 votes

2 answers

21

Applied Test Series
The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion (B) Satisfies Progress (C) Satisfies Bounded wait (D) Suffers from deadlock

rish1602 answered in Operating System Jan 8

164 views

2 votes

1 answer

22

GATE CSE 2017 Set 1 | Question: 27 with modification
A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock l, then it cannot ... D) x = 1, y = 1 If non- re entrant was not part of question then it would be OPTION - C?

AngshukN answered in Operating System Jan 5

361 views

1 vote

1 answer

23

Applied Test Series
A disk drive has 5000 cylinders, numbered 0 to 4999. The drive is serving a request at cylinder 143 currently and the previous request was at 125. The disk I/O queue, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 ... the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for SCAN?

_nirbha_ answered in Operating System Jan 3

109 views

47 votes

6 answers

24

GATE CSE 2003 | Question: 81
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ ... $1$ $V(S)$ at $W, V(T)$ at $X, P(S)$ at $Y, P(T)$ at $Z, S$ and $T$ initially $1$

LRU answered in Operating System Jan 1

by LRU

8.9k views

3 votes

2 answers

25

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 5 (Page No. 429)
A DMA controller has five channels. The controller is capable of requesting a $32$-bit word every $40\: nsec.$ A response takes equally long. How fast does the bus have to be to avoid being a bottleneck?

LRU answered in Operating System Dec 29, 2021

by LRU

908 views

1 vote

1 answer

26

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 7 (Page No. 430)
One mode that some DMA controllers use is to have the device controller send the word to the DMA controller, which then issues a second bus request to write to memory. How can this mode be used to perform ... Discuss any advantage or disadvantage of using this method instead of using the CPU to perform memory to memory copy.

LRU answered in Operating System Dec 29, 2021

by LRU

236 views

0 votes

1 answer

27

Made easy test series

Isha_99 answered in Operating System Dec 26, 2021

69 views

1 vote

3 answers

28

Non vectored interrupts
http://superuser.com/questions/414290/when-a-non-vectored-interrupt-occurs-does-the-processor-ever-look-up-the-vector In a non-vectored interrupt, the peripheral itself provides the address of the interrupt service routine directly to the processor. This ... since the address must be retrieved from the interrupting device every time the interrupt is triggered. S ans is B??

manikantsharma answered in Operating System Dec 25, 2021

by manikantsharma

2.6k views

0 votes

0 answers

29

self-doubt operating-system semaphore
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectively I know this implementation is deadlock free just want to ask if it will follow bounded waiting and progress and how both of them are different?

Arbaz__Malik asked in Operating System Dec 25, 2021

by Arbaz__Malik

94 views

1 vote

1 answer

30

Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O of all the processes can proceed in parallel. The absolute difference of CPU utilization (over a long period of time) using FCFS and Round Robin (time quantum 10ms) for this system is _____ %

AngshukN answered in Operating System Dec 25, 2021

74 views

0 votes

1 answer

31

Applied Test Series: Knapsack Problem
The following table givens the frequency of 4 letters in a database of text If Huffman encoding is used to encode the word “aaabca” the number of bits required for it is given by ______. Need help!

LRU answered in Operating System Dec 25, 2021

by LRU

63 views

1 vote

2 answers

32

NIELIT 2016 MAR Scientist B - Section C: 35
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.

Isha_99 answered in Operating System Dec 22, 2021

319 views

0 votes

1 answer

33

test series doubt
hi, C an anyone answer this question? @arjun sir, According to me there is no mutual exclusion and hence deadlock is not created.

ankit3009 answered in Operating System Dec 21, 2021

66 views

1 vote

1 answer

34

Geeksforgeeks mock - 2022
Consider the following C program: #include <stdio.h> #include <stdlib.h> #include <unistd.h> int main (void) { pid_t pid; int x = 2; pid = fork ( ); if (pid = = 0); x = 8; fork( ); printf("%d", x); return 0; } Fork ( ) is a system call creates new ... the program is executed on the unix OS?[MSQ] (a) 8 2 2 8 (b) 8 8 2 2 (c) 2 8 8 2 (d) 2 2 8 8

AngshukN answered in Operating System Dec 20, 2021

147 views

0 votes

1 answer

35

Test Series- Applied:
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ I answered it as 3. Because it asked for maximum which is not correct. Can someone help me in this.

AngshukN answered in Operating System Dec 20, 2021

88 views

0 votes

1 answer

36

Applied Gate All India Mock Test 3 - 2022
Suppose we have virtual memory containing 8 pages with 512 bytes per page and physical memory with 16-page frames. Given the following page table ( where virtual page number gives page number and page frame number gives frame number ), the physical address( in decimal ) corresponding to the virtual address of page number 4, byte 241 is ______ .

manikantsharma answered in Operating System Dec 19, 2021

by manikantsharma

187 views

0 votes

1 answer

37

operating system
what is seek system call? can anyone explain?

aaa 1 answered in Operating System Dec 19, 2021

by aaa 1

63 views

1 vote

1 answer

38

Operation system Applied test series 2022
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct? Mutual exclusion satisfied Progress is not satisfied Bounded waiting is not satisfied None of the above Can anyone help me in this A should not be the ans as there is no restriction on atomicity. What about b and c.

AngshukN answered in Operating System Dec 19, 2021

98 views

3 votes

3 answers

39

MadeEasy Test Series: Operating System - Semaphore
Consider program for P1 and P2: Here, m and n are binary semaphore variables whose values are initially initialized to 1. x and y are shared resources whose values are initialized to 0. Which of the following holds by above processes ... B :-Deadlock and race condition C :-No deadlocks and no race condition D:- Race condition and no deadlock

AngshukN answered in Operating System Dec 19, 2021

1.5k views

1 vote

2 answers

40

Gate Applied course Test series
What is answer for this question and also please explain the approach

DAWID15 answered in Operating System Dec 17, 2021

265 views

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

Follow @gateoverflow

GATE Overflow

Recent questions and answers in Operating System

Search GATE Overflow