Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by BHOJARAM
0
votes
1
GATE CSE 2021 Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$ bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
9.3k
views
answered
Jul 9, 2022
Operating System
gatecse-2021-set1
operating-system
process-scheduling
numerical-answers
1-mark
+
–
–1
votes
2
Made Easy test series
int a = 50, b = 50; a = a+++++b; b = b+++++a; Value of b after executing these . I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify it please.
int a = 50, b = 50;a = a+++++b;b = b+++++a; Value of b after executing these .I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify ...
585
views
answered
Dec 8, 2021
Programming in C
made-easy-test-series
programming-in-c
bad-question
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register