Recent questions and answers in Operating System

+3 votes

3 answers

1

Primary difference between process and thread.

answered 5 hours ago in Operating System by iamrahuljain (477 points) | 351 views

0 votes

0 answers

2

ME Test Series
A system has 10 identical resources and N processes competing for them. Each process can request at most 3 resources but by grouping of first 3 processes needs only 6 resources, then the maximum value of N is _______ [closed]

asked 11 hours ago in Operating System by Shadan Karim (381 points) | 21 views

0 votes

0 answers

3

Self Doubt Disk Scheduling
With reference to https://gateoverflow.in/1009/gate2004-12#2576 A single sequential process makes one request at a time. Had this not been sequential', i.e. for a general user process, multiple requests could have been made and ... can the future requests be addressed beforehand? If they can, then Optimal Page Replacement Algorithm should also be practically possible.

asked 13 hours ago in Operating System by Shaijal Tripathi Junior (629 points) | 12 views

0 votes

0 answers

4

Made easy operating system test
An operating system implements a policy in which resources are numbered uniquely and processes are allowed to required for resources only in increasing resource number. I know deadlock will not occur but how starvation may occur. Please give a example . Not able to digest this fact.

asked 16 hours ago in Operating System by Mayank Gupta 3 Junior (505 points) | 13 views

0 votes

0 answers

5

ME test series
Please draw the GANTT CHART

asked 1 day ago in Operating System by nepobose (77 points) | 24 views

0 votes

0 answers

6

operating system
Given the following information for Paged memory allocation: Job size = 3126 bytes Page size = 1024 bytes Define: a. Illustrate the Paged memory allocation without Main memory to store the entire job? b. Compute the total pages and displacement for the entire job c. Compute the initial address are needed to store the entire job "I have Exam and stuck with question" ):

asked 1 day ago in Operating System by jad (7 points) | 13 views

0 votes

0 answers

7

Semaphore
Let S be a binary semaphore variable and value of S=0 what will be the value of S when following operations are executed on semaphore S 2P,4V,5P,2P,8V,3P,2V I’m getting the answer as 0, but it is given 1 Please explain in details

asked 1 day ago in Operating System by nepobose (77 points) | 42 views

0 votes

0 answers

8

Process and Threads
Consider the given statements: S1: kernel level threads can share the code segment. S2: A fork system call will be fail if the previously executed statement is also a fork call. S1 and S2 is false S1 and S2 is true S2 is true only S1 is true only

asked 1 day ago in Operating System by nepobose (77 points) | 25 views

+1 vote

2 answers

9

Test Series : Checking Bounded Waiting
How does option B ensure Bounded Waiting? Process A can keep on entering the CS while process B tries to enter the CS but keeps on spinning over Wait(P). I mean if there is no context switch from A to B then A can keep on visiting the CS as many times as possible(no bound on the no. of times it enters) making B to wait.

answered 1 day ago in Operating System by Deepakk Poonia (Dee) Boss (21k points) | 115 views

+3 votes

2 answers

10

Operating system ..ace academy test series

answered 1 day ago in Operating System by Gurdeep Saini Loyal (5.3k points) | 148 views

0 votes

1 answer

11

ME TEST SERIES
B does not satisfy Bounded wait. Ans should be None of these only. Please verify.

answered 1 day ago in Operating System by Deepakk Poonia (Dee) Boss (21k points) | 219 views

0 votes

0 answers

12

made easy test series
consider a 900KB memory is managed using variable partitions but no compaction it currently has 3 processes occupied partition sizes 212KB 114KB and 100KB respectively which of the following smallest request wil be denied a)475 b)285 c)355 d)none of the above

asked 1 day ago in Operating System by suneetha (385 points) | 30 views

0 votes

0 answers

13

Made-easy-test-series
A process execute the code: Main() { fork(); fork() && fork() || fork(); fork(); printf("hii"); } The number of times " hii " will be printed is- [closed]

asked 1 day ago in Operating System by shweta sah (117 points) | 26 views

0 votes

1 answer

14

Madeeasy Test Series [Effective memory access time]

answered 1 day ago in Operating System by VASU SAHU (99 points) | 43 views

0 votes

1 answer

15

Os TLB question
How they calculated time for number of levels?

answered 2 days ago in Operating System by Ravi Raja (121 points) | 40 views

0 votes

0 answers

16

disk scheduling [self-doubts]
You have a disk with the following characteristics: Each sector is 512 bytes, it has 1024 sectors per track and 4096 tracks per platter. The disk has total 10 platters(and one head per platter) and it rotates at 24000 RPM. At any ... adjacent tack is 0 milliseconds. The sequential transfer bandwidth (track-to-track seek time is 0), expressed in megabytes/second is

asked 2 days ago in Operating System by altamash (323 points) | 23 views

0 votes

0 answers

17

GATE ZEAL MOCK OS
ANSWER GIVEN IS A) IN THESE QUESTION I GOT THAT IT WILL NOT SATISFIED ME AND BOUNDED WAIT BUT HOW PROGRESS IS SATISFIED I AM NOT GETTING WHAT I UNDERSTOOD THAT IF BOUNDED WAIT IS NOT SATISFIED MEANS ONE PROCESS IS ENTERING IN CS WITHOUT GIVING THE CHANCE ... ENTER BUT IF (BW) NOT SATISFIED THEN HOW PROGRESS CAN BE SATISFIED PLEASE CLEAR THIS POINT AND TELL ME HOW TO APPROACH HERE

asked 2 days ago in Operating System by Prince Sindhiya Loyal (5.4k points) | 41 views

+1 vote

1 answer

18

UGCNET-Jan2017-III-50
Consider a disk queue with I/O requests on the following cylinders in their arriving order : 6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total ... in the disk is 150. The disk head movement using SCAN-scheduling algorithm is : (1) 172 (2) 173 (3) 227 (4) 228

answered 2 days ago in Operating System by saloni pande (11 points) | 237 views

0 votes

1 answer

19

ZEAL MOCK OS
ANSWER IS C) BUT I AM NOT GETTING HOW 2ND IS CORRECT

answered 2 days ago in Operating System by anjali007 Active (3.3k points) | 15 views

0 votes

0 answers

20

Self-doubt
We know that Long Term Scheduler controls the degree of multiprogramming. But can we say that Medium Term Scheduler also controls the degree of multiprogramming. See these lines from galvin book. Some operating systems, such as time-sharing systems, may introduce an ... MTS is said to be reducing the degree of multiprogramming. so reducing is also a way of controlling. isn't it?

asked 2 days ago in Operating System by aambazinga Active (2.2k points) | 22 views

0 votes

1 answer

21

zeal test os
The value of z after the execution of the following program is void f(int x) { staticint z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; } 1.30 2.20 3.40 4. 10

answered 2 days ago in Operating System by Shobhit Joshi Active (1.1k points) | 67 views

0 votes

0 answers

22

Self doubt operating system
What is normalised turn around time for a process ? if we are using any scheduling algorithm

asked 2 days ago in Operating System by Prince Sindhiya Loyal (5.4k points) | 6 views

0 votes

1 answer

23

zeal booklet os
CPU bound jobs will hold CPU until exit or I/O. Long periods where no I/O requests issued, and theCPU is held resulting in poor I/O device utilization. This degradation in performance can be seen inwhich of the following? (A)SJF ( B) RR (C)FCFS (D)SRTF

answered 2 days ago in Operating System by anjali007 Active (3.3k points) | 7 views

0 votes

1 answer

24

zeal booklet os
Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; thisinvolves 1 switching context 2.jumping to the proper location in the user program to restart that program 3 switching to user mode 4. All the above ANSWER IS D I AM NOT GETTING 2 AND 3

answered 2 days ago in Operating System by anjali007 Active (3.3k points) | 32 views

0 votes

0 answers

25

gate zeal booklet
which one of the following is true. 1. round-robin scheduling minimizes average completion time. 2. during periods when the processor spends all of its cycles handling interrupts, the processscheduler is irrelevant to the machine’s performance. 3. priority scheduling minimizes average waiting time 4. srtf could maximize the cpu utilization

asked 2 days ago in Operating System by Prince Sindhiya Loyal (5.4k points) | 30 views

+1 vote

2 answers

26

OS Optimal Page replacement
How the value is 36? im getting 39.

answered 2 days ago in Operating System by Shobhit Joshi Active (1.1k points) | 38 views

+32 votes

11 answers

27

GATE2005-IT-41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ */ $P1$ $P2$ repeat forever $V (X) ;$ Compute ; $P(X) ;$ repeat forever $ P(X) ;$ Compute ; $V(X) ;$ ... I) and (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false

answered 3 days ago in Operating System by Deepakk Poonia (Dee) Boss (21k points) | 4.6k views

0 votes

1 answer

28

doubt
is this preemptive or non-preemptive?

answered 3 days ago in Operating System by Rishabh Agrawal (401 points) | 19 views

0 votes

0 answers

29

Self Doubt [Effective memory access time]

asked 3 days ago in Operating System by jatin khachane 1 Active (3.5k points) | 24 views

0 votes

0 answers

30

multilevel paging

asked 3 days ago in Operating System by Rahul_Rathod_ (403 points) | 33 views

0 votes

0 answers

31

#selfdoubt
are non preemptive kernels free from race condition? If yes then why?

asked 3 days ago in Operating System by anjali007 Active (3.3k points) | 5 views

0 votes

1 answer

32

Self Doubt Disk Scheduling
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6, 38, 2, 40, 20. No of seeks in FCFS SSTF

answered 4 days ago in Operating System by Devvrat Tyagi (83 points) | 37 views

0 votes

0 answers

33

self doubt
I HAVE ONE DOUBT REGARDING THE STARVATION AND BOUNDED WAITING BOUNDED WAITING → ~STARVATION THEN USING THE CONCEPT OF CONTRAPOSITIVE IT CAN BE STARVATION → ~BOUNDED WAITING CAN THIS CONCEPT IS APPLICABLE HERE ?

asked 4 days ago in Operating System by vijju532 Junior (721 points) | 16 views

0 votes

0 answers

34

CPU Utilisation
Consider a program which needs to be run on a Round-Robin CPU scheduling algorithm. Size of program is 200 Kb it has been stated that hard disk has a transfer rate of 2 Mbps. Assume that there are no head seeks and average latency is 10 ms. The acceptable time quantum for effective CPU utilization is __________ msec. [closed]

asked 4 days ago in Operating System by HeadShot Active (3.7k points) | 14 views

0 votes

1 answer

35

Deadlock condition in synchronization
Please describe the Deadlock Condition in synchronization and when will be synchronization possible and condition ..?

answered 4 days ago in Operating System by !KARAN Junior (923 points) | 18 views

0 votes

1 answer

36

synchronization
does it guarantee mutual exclusion and deadlock prevention?

answered 4 days ago in Operating System by Things To Know (Thin Active (1.2k points) | 43 views

+14 votes

4 answers

37

ISRO2007-11, GATE2001-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

answered 4 days ago in Operating System by Suneel Padala (207 points) | 3.7k views

0 votes

0 answers

38

selfsoubt ME OTS
consider a paged virtual memory management system having 32 bit virtual addresses with page size 1 KB .each page table entry required 32 bits.It is desired to limit the page table size into one page .if Suresh uses smaller page size at the first level of page table hierarchy ,then the number of pages needed are _?? answer given as 65793 my answer -16449. please verify

asked 4 days ago in Operating System by Prateek Raghuvanshi Loyal (8.1k points) | 46 views

0 votes

2 answers

39

Disk Scheduling
Suppose a disk has 200 cylinders numbered from 0 to 199. At some time, disk arm is at cylinder 76 and there is a queue of disk access requests for cylinders: 54, 32, 108, 22, 67, 77, 87, 87, 42, 82 The distance that will be travelled by the R/W head when the SCAN (elevator) algorithm used is ________tracks. Assume that SCAN algorithm moves towards 199 when it starts execution.

answered 5 days ago in Operating System by Hira Thakur Boss (13.5k points) | 121 views

0 votes

1 answer

40

Self Doubt regarding C-SCAN
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 ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.

answered 5 days ago in Operating System by Hira Thakur Boss (13.5k points) | 100 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