Thank you Jenny ma'am , I am watching this a day before my exam and you are explaining this in such an effortless manner making everything so much fun to learn
@Jenny's lectures CS/IT NET&JRF Ma'am please clarify my doubt that if arrival time of any two process is same how to solve that....please clarify this ma'am
@@shilpashreeha5798 we have to give priority for order in which we have written the process.. I. E if P1 and P4 having same A. T we have to give priority for P1 only
Thank you ma'am for your guidance. I have been following your video lectures for DBMS , DSA and OS for the past two months. The video lectures helped me, an ECE student, to grasp the concepts. And the video lectures helped me in securing a job in Persistent Systems.
Well explained Ma'am, big thanks to you, looking forward for more videos like this, especially in these days where pandemic is still present, just like me, a student who is struggling on online classes. Thank you very much Ma'am.
This lady is not just smart but very pretty! I passed my exam thanks to your lectures! Both non preemptive and preemptive videos were great! best wishes
Thank You Mam, all my doubts are cleared primitive and non primitive concept this happened only after watching your videos only once again thank you so much mam
//Primitive-priority scheduling algorithm implementation using c program #include #include int jtime = 0; int counter; int n; int at[20], bt[20], ct[20], pt[20], sts[20]; void process_Ps() { int index = -1; // variable for storing the index of the process with the highest priority int highestPriority = INT_MAX; // set the highest priority to the maximum possible value // Check all incomplete processes for (int i = 0; i < n; i++) { if (at[i] 0) { bt[index]--; jtime++; } // If the process is completed if (bt[index] == 0) { ct[index] = jtime; sts[index] = 1; // Set the status to completed counter--; // Decrement the counter since one process is completed } } else //if an index not gets { jtime++; // Increment jtime if no process is available at the current time } } // Main Function int main() { // Reading the number of processes printf("Enter the number of processes: "); scanf("%d", &n); counter = n; // Setting the counter to n // Reading process details from the user for (int i = 0; i < n; i++) { printf("Process %d: ", i + 1); printf("Arrival time: "); scanf("%d", &at[i]); printf("Burst time: "); scanf("%d", &bt[i]); printf("Priority: "); scanf("%d", &pt[i]); sts[i] = 0; // Setting the status of the process to incomplete ct[i] = 0; // Setting the completion time to zero at the beginning } // Printing the given details printf("Given details: "); printf("AT BT PT "); for (int i = 0; i < n; i++) { printf("%d %d %d ", at[i], bt[i], pt[i]); } // Perform process_Ps() function until the counter becomes zero, indicating that all processes are completed while (counter != 0) { process_Ps(); } // Display the results printf(" Results: "); printf("AT BT PT CT "); for (int i = 0; i < n; i++) { printf("%d %d %d %d ", at[i], bt[i], pt[i], ct[i]); } return 0; }
Mam, response time and waiting time is different in preemptive scheduling. Because response time is the time when first time CPU allocate to a process. Please check this.
Mam, I'm preparing for the net exam.so ur lecturer is very very useful for us.pls pls continue.then can u please suggest the best book that covers all subjects of the net exam for last-minute study?because we have 40 days only.
In case of higher no higher priority, to solve starvation problem, the priority no of that waiting process after some time interval will be increased or decreased? And the time interval for every processes which are in waiting state will be same or not? PLZZZ REPLY
@@SangitaThakur-be7oy If you are telling about response time(RT) Then the first time P5 arrived was at 5 units of time and AT is also 5 So it will be 5-5=0
Last process that is p7 has highest priority but in case if was no higher priority than others in ready queue, will it completely scheduled? Or only for one ms??
Hi mam. Can we apply priority on fcfs?? If arrival time of every process is zero??? In our exam process burst time and priority of each process was given. Arrival time of each process waas zero... In the question it was asked to solve the problem through fcfs, SJF, round robin..... Initially i thought priority is given just to confuse us .. Then I realized that if arrival time of every process is zero how we can consider any of the given process as first process?? On paper we have to write any process first. But practically who comes first?? Every one comes at same time.. Beacuse arrival time is 0... Now in such case we have to choose by default first written process as first process. But but,mam there was also a coloumn of priority then I think we have to decide first process on the basis of priority... And I applied priority in fcfs. Mam my approach is right or wrong.????
Thank you Jenny ma'am , I am watching this a day before my exam and you are explaining this in such an effortless manner making everything so much fun to learn
Pin this Jenny ma'am if you love your fans.
She is exceptional
@@mohdusaid6534 Lmaooo be her student not her fan
See,she is an instructor and teacher,looking in good way is correct...!
Love and respect from karnataka!! ❤✨
✌🏻✌🏻
Vvce, Mysore ❤️
Nie mysore 😂
RMG
such a explanation needs to be highlighted for years.perhaps the best ever explanation available on youtube
The main drawback of Priority Scheduling is "Starvation"
Jenny's lectures CS/IT NET&JRF , right
@Jenny's lectures CS/IT NET&JRF Ma'am please clarify my doubt that if arrival time of any two process is same how to solve that....please clarify this ma'am
@@shilpashreeha5798 we have to give priority for order in which we have written the process.. I. E if P1 and P4 having same A. T we have to give priority for P1 only
Same Priority, Same Arrival Time. Which one should be considered? Earliest process ID or smallest burst time ?
@@bense_tony process id
Thank you ma'am for your guidance. I have been following your video lectures for DBMS , DSA and OS for the past two months. The video lectures helped me, an ECE student, to grasp the concepts. And the video lectures helped me in securing a job in Persistent Systems.
I swear this lady has saved my life in more ways that I can say
Thank you from tamilnadu ❤️ after my 1 hour lectures in college I am still confused about this algorithm but you make me clear in one shot ✨
Thank you mam😊😊..For helping me to get good grade in DSA and now for clearing the concepts of OS also..
Well explained Ma'am, big thanks to you, looking forward for more videos like this, especially in these days where pandemic is still present, just like me, a student who is struggling on online classes. Thank you very much Ma'am.
tomorrow has got my final exam. Today you helped me ma'am. You are ingenious
Thank you Ma'am for explaining it so clearly, you explained it better than my so-called professor
Me gusta tu canal soy Boliviano y aprendo inglés 🇧🇴♥️♥️♥️😁
At the first glance, it looked like she have had a short pixie haircut
Ok bhai... btech ho gyi aapki ?
@@supplymeweedlol
Thik jaga pa focus kya ha
Thanks for ur help mam u r great teacher god bless u i have exam at computing course at engineering faculty ASU and ur lessons helped me a lot thx.
your finishig smile takes the inerest to next level ma'am
This lady is not just smart but very pretty! I passed my exam thanks to your lectures! Both non preemptive and preemptive videos were great! best wishes
Too confusing question of preemptive but you understand in a very simple way. Thanks a lot ma'am.🙏
You just made my exam preparation very easy now m expecting A grade in OS🤩
our lectures are teach this algorithm is very very hard but you are explain very very easy method .THANK YOU MISS
Beauty with brain ,thank you so much mam ❤
Watch the video during class and answer the questions😂 ,you are the best ,no captionnn🔥
On RUclips
Pre-empt, P2 > P1 (Priority) => choose P2
Non pre-empt: P2 > P1(Priority) => choose P1
Mam thank you so much for teaching us on youtube really appreciate your efforts,techniques mam.God bless you mam.
Thanks you. Before I was struggle to solve preemptive problems but after seeing this video I understood how to solve this.
HI mam i am from Ethiopia thanks for Explanations God bless you thanks
Its really happy to say that im clear in many topic due to ur videos....thanks for providing it🤗
Very interesting, watched your clip from Nigeria.
So nice of you I will impress with you your teaching mathod is so good
You are the best thank you from Algeria !!
Thank you ma'am. The video was just amazing .Everything went inside 💖.
Thank You Mam, all my doubts are cleared primitive and non primitive concept this happened only after watching your videos only once again thank you so much mam
Thank you ma'am! My final exam is tommorow and i learned a lot from you and your video lecture!
💯 understanding superb explaind we r lucky to have u mam
Thank u maam
U made it more easier to understand
Thankyou mam for your wonderful explanation I learnt os only your lectures
30 mins for OS exams 🎉
i love your lecture and you your self jenny's uuumphaa long live for you
Thank you very much jenny mam i love your teaching ❤
Very informative and educational video... Thanks for sharing.. keep sharing 👍
//Primitive-priority scheduling algorithm implementation using c program
#include
#include
int jtime = 0;
int counter;
int n;
int at[20], bt[20], ct[20], pt[20], sts[20];
void process_Ps()
{
int index = -1; // variable for storing the index of the process with the highest priority
int highestPriority = INT_MAX; // set the highest priority to the maximum possible value
// Check all incomplete processes
for (int i = 0; i < n; i++)
{
if (at[i] 0)
{
bt[index]--;
jtime++;
}
// If the process is completed
if (bt[index] == 0)
{
ct[index] = jtime;
sts[index] = 1; // Set the status to completed
counter--; // Decrement the counter since one process is completed
}
}
else //if an index not gets
{
jtime++; // Increment jtime if no process is available at the current time
}
}
// Main Function
int main()
{
// Reading the number of processes
printf("Enter the number of processes: ");
scanf("%d", &n);
counter = n; // Setting the counter to n
// Reading process details from the user
for (int i = 0; i < n; i++)
{
printf("Process %d:
", i + 1);
printf("Arrival time: ");
scanf("%d", &at[i]);
printf("Burst time: ");
scanf("%d", &bt[i]);
printf("Priority: ");
scanf("%d", &pt[i]);
sts[i] = 0; // Setting the status of the process to incomplete
ct[i] = 0; // Setting the completion time to zero at the beginning
}
// Printing the given details
printf("Given details:
");
printf("AT BT PT
");
for (int i = 0; i < n; i++)
{
printf("%d %d %d
", at[i], bt[i], pt[i]);
}
// Perform process_Ps() function until the counter becomes zero, indicating that all processes are completed
while (counter != 0)
{
process_Ps();
}
// Display the results
printf("
Results:
");
printf("AT BT PT CT
");
for (int i = 0; i < n; i++)
{
printf("%d %d %d %d
", at[i], bt[i], pt[i], ct[i]);
}
return 0;
}
I totally understand this concept now !!! Thanks ma'am !!
😊
hello mam, how we can use this preemptive version for research per-pus? for example there are n jobs and n machines
thanks
is this the long method of preemptive? i saw a lot of video about this topic and yours is different. but i got this more clearer than anyone.
Really well explained, kudos.
Thank you Ma'am ❤️
Your explanation is so good that I understood it so much 😊.
Your teaching is also same like eyes, because your eyes are sweet.
I got it, thanks dear.
you are my best
What is the need,why we have to learn scheduling algorithm in which place it will be useful for career...?
There isnt any use, that's why colleges teach it
Good job professor👏
you are amazing ma'am💗💗
Very clear Explanation
💥💥💥great explanation
Maam your way of teaching is very easy and language is simple to understand for any student...
Thanks maam for this great explanation..
thanks! your amazing, I undestand it very well!
Its really helpful ,But please make shorter version of this same topic .. It will be very helpfull to see before exams as a quick revision
Well explained
Thank you ma'am
🇿🇼
Thanks,, Explained very well!👍👌
Helpful Thank you ma'm ❤️
Mam, response time and waiting time is different in preemptive scheduling.
Because response time is the time when first time CPU allocate to a process.
Please check this.
Ktu studentss 👍🏻👍🏻
very good lecture thank you
best lecture
Mam, I'm preparing for the net exam.so ur lecturer is very very useful for us.pls pls continue.then can u please suggest the best book that covers all subjects of the net exam for last-minute study?because we have 40 days only.
In case of higher no higher priority, to solve starvation problem, the priority no of that waiting process after some time interval will be increased or decreased? And the time interval for every processes which are in waiting state will be same or not? PLZZZ REPLY
Thnku for giving such a great explanation.....
very good, help me prepare my test!
Thanks mam nice lecture 🙂
Nice teaching
شكرا جزيلا ☺️
watching this video in 2024. night before my exam but no worries because the teacher is jenny mam 😊🥰
How you have taken arrival time in this case and is it possible to program arrival time in operating system can you please explain?
well explained. thanks
Thanks ma'am I like your lesson
I think you used to upload
The new lessan
Great mam
Thank you so much mam ❤...
Mam can you please make video on parsers from compiler construction!your way of teaching is very nice
NICE EXPLANATION..
Theres a mistake in remaing time for P5 it would be 11-5=6
@@SangitaThakur-be7oy If you are telling about response time(RT)
Then the first time P5 arrived was at 5 units of time and AT is also 5
So it will be 5-5=0
Mam! What happened here if the B.T of p5 process is 4?
RUclips crush 😍😍😍😍
Pursuing btech in mechanical, I'm here just bcoz its u mam
Thank you ma'am
Nice work maim
do we only check the priority of previous process or the all processes which are in the ready queue in preemptive priority scheduling plsss reply
Last process that is p7 has highest priority but in case if was no higher priority than others in ready queue, will it completely scheduled? Or only for one ms??
Thank you so much mam
What if the version is not mentioned in question that is preemptive or non preemptive??
If the BT of P5 is changed to 4...then what is need to be done?? The CPU will remain at waiting state till 10nth unit of time??
Understood 🙏🙏🙏🙏🙏🙏
American Student: I learnt nothing at lecture
Indian Tutorial: I got you.
Mam what to do when the arrival time is zero for all processes
Hi mam. Can we apply priority on fcfs?? If arrival time of every process is zero??? In our exam process burst time and priority of each process was given. Arrival time of each process waas zero... In the question it was asked to solve the problem through fcfs, SJF, round robin..... Initially i thought priority is given just to confuse us .. Then I realized that if arrival time of every process is zero how we can consider any of the given process as first process?? On paper we have to write any process first. But practically who comes first?? Every one comes at same time.. Beacuse arrival time is 0...
Now in such case we have to choose by default first written process as first process. But but,mam there was also a coloumn of priority then I think we have to decide first process on the basis of priority... And I applied priority in fcfs. Mam my approach is right or wrong.????
Should we repeat the exercise fr each one?
Like 10 times 1 exercise
Thanks i understand very well but what pls make a tutorial where the priority is higher when the number is higher thanks
Mam when 0 in priority
Mam please reply if highest priority come in p1 then what should we do .....
Thank You Mam!
mam, if arrival time is not given then what should we have to check ??
thankyou so much maam !
Your lecture is solution of my problem But
Your pretty face is problem of my sleep!
life saver