OS
closed

thor asked Sep 22, 2016 • closed Sep 22, 2016 by Kapil

195 views

See all

Related questions

1 votes

2 answers

delxbydelt asked Mar 15

321 views

OS, Process Scheduling
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and the context switch takes 0 seconds. At what time the first process will complete the execution? (assume all the variables as integers). A) nkx B) k(nx-1) C) k(nk+n) D) x(nk-n+1)

Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...

delxbydelt

321 views

delxbydelt asked Mar 15

0 votes

1 answer

Apex7D0 asked Feb 17

217 views

Doubt on OS Syllabus (Galvin)
Hi, i'm starting my GATE journey and wanted to verify if these are the topics which should be learnt for GATE. The book is Operating Systems by Avi Silberschatz, Greg Gagne, and Peter Baer Galvin (9th Edition). Also have 10th edition but it seems to have rearranged a lot of topics and chapters.

Hi, i'm starting my GATE journey and wanted to verify if these are the topics which should be learnt for GATE. The book is Operating Systems by Avi Silberschatz, Greg Gag...

Apex7D0

217 views

Apex7D0 asked Feb 17

0 votes

0 answers

roopkathaaa asked Aug 30, 2023

372 views

os linux scheduling
Let the base priority of a system be 130 and the nice value provided is -10. What is the time slice that the process gets in the O(1) scheduling algorithm? if it should be 300 or 400.

Let the base priority of a system be 130 and the nice value provided is -10. What is the time slice that the process gets in the O(1) scheduling algorithm?if it should be...

roopkathaaa

372 views

roopkathaaa asked Aug 30, 2023

0 votes

1 answer

Aniket1710 asked Jul 25, 2023

2,078 views

OS handout
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Each Process spends 20% of its Service time on I/O followed by 70% ... . Assuming Concurrent I/O and negligible Scheduling Overhead. Calculate for FCFS Scheduling (i) Average TAT of Processes (2)% CPU idleness.

Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Eac...

Aniket1710

2.1k views

Aniket1710 asked Jul 25, 2023

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

OS
closed

Please log in or register to add a comment.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0