One day before the exam ..Thank you mam.. You have saved my marks. You had a good explaining skills

@cybershrajal

5 ай бұрын

Question aaya exam me??

Saved my semester 12mark q.. lol.. Thnx

@yoursxyz250

4 жыл бұрын

I got a KT cuz none of the past paper sums were asked 🥺

@sindhujalingampally6066

3 жыл бұрын

Very well done

@devendullarwar1823

Жыл бұрын

who cares

@muthulakshmimkm4828

Жыл бұрын

​@@yoursxyz250 😮😮😊

@vruthvikyadav7966

9 ай бұрын

Hahahh 😂

thanks madam, Mandela said "Education is the most powerful weapon that we can use to change the world." I am talking to you now in Africa, while l learned your wonderful lesson which helped my lecturer to understand him cheer madam

one Day before Semester

@Ramakrishna-rv9ou

2 ай бұрын

1 Hour before exam

@manojan8313

5 күн бұрын

Last minute before exam

I really like the way Bhanu Priya ma'am teaches in her videos. All her lecture videos were very helpful for me during exams. Thank you ma'am :)

Thanks Miss,, You saved my semester ,, Love from Bangladesh,, Subscribed :-)

Simple and easy understandable explanation. This will safe my exam for sure!

@vighaneshramakantgaund6563

Жыл бұрын

safe safe

Thank you so much sister. I now have better understanding in Optimal Page Replacement Algorithms...... Have a good day !!!

You are a real life-saver, thank you so much!!

1 hr before exam

@nk_creation6566

11 күн бұрын

Fakeee

Thank you so much for ur vedios.. supreb explanation.. I tried qa lot to understand these algorthm I failed.. you are one who cleary explained these algorithms... God Bless you and Thank you so much for ur immense effort... from Sri Lanka 💗💗💗

Same question I found in site but they have solved wrong finally I got what I get after solving. Thanks for the clarification , also Tommorow is my exam 🙂

@cybershrajal

5 ай бұрын

bhai pass hua??

Thanku so much mam..😍😍😍keep doing videos.. Your way of teaching is very easy to understand😍

Thankyou mam... For my last day preparation your videos are very helpful.....

Your Way Explaining Was More Clear mam.....Of course You Saved My Semester In OS xam(lol)....Thank Youuu Chooo Much Mam❣️

thanks ma, great lecture

Best teacher in the whole world ❤️💙😍💙😍😍❤️❤️❤️❤️❤️❤️❤️❤️❤️

Thank you so much.you really help me for my test 2.

Thank u so much ma'am u r teaching very well compare to our lecturer's.

dis chapter not covered in my clg tnq & well explained ..,easily undrstnd

@bryant9309

2 жыл бұрын

welcome

Very nice explained thank you so much mam

U helped me so much.tq 4 ur grt lecture👍

Our faculty will not explain like this mam🎉 Thank you very much 😊

well explained! Thank you so much!

Madam ur classes are help full for me tq

8:53 this condition 2 is used since very long time (opposite of LRU condition)

Awesome video. thanks!

Thank you very much it helped me a lot

Watching at 2:45 pm😂 few hours before exam

Thank you mam it's soo useful. Now I understand it

I think mam is born to make history in operating system ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

Reallyyy superbbbbb mam thankyou so much 😇😇

Thnku so much ma'am 🥹🥹❣️

Best explanation ever 💯💯

Mam I think you so much Because I saw before exam But I attended FIFO, LRU, OPR

@evasion4510

5 жыл бұрын

*thank

Good Lecture, Easly understandable

Simple and easy understandable explanation..

thankk you mam,you saved mine 5+7 marks.

Nice explanation mam and it is helpful to ours

suppose when I check far from right in this time suppose two value did not present current position to the right side then what should I do? 7,0,1,2,0,3,0,4,2,3,0 number of frame =3 plz solve this example

Good explanation. Thank u so much

mam pls could u explain how did you fill 7 in the last column ? how to determine where to fill 7 in last column?

@brahimbenaddi822

5 жыл бұрын

same here, but i think it's doesn"t matter where or we set on LRU processus. idk why 2 exactly.

@brahimbenaddi822

5 жыл бұрын

kzread.info/dash/bejne/p42XuNaEZpixeM4.html

@flakpanzer074

5 жыл бұрын

Use FIFO during the last stages of optimal problems...

@devanggadhiya6759

5 жыл бұрын

Exactly same question mine also...

@ramjikancharla4812

Жыл бұрын

You have to replace mostly repeated page number

Optimal replacement is definitely faster !!

@WesleyDW93

5 жыл бұрын

And impossible to implement

@chan6565

4 жыл бұрын

@@WesleyDW93 why?

Very Nice video well explained, covered some corner cases and it was not super long !!

Thank you so much from Philippines

Both fifo and optimal are easy now on to lru😎

@bryant9309

2 жыл бұрын

hmmm

Great, thank you :)

thank you so much

Thank you ma'am i learn from u

Akkkkkkkkkkkka thank u akkkkka u save my life ...sooooolooooo much akkka

Thank you so much. Great Job.

thank you so much , I'm having OS exam today .

Thank you so much.. 👍

Ma'am if in the last 2 numbers are running as long as then what we replace

Thank u so much...

Understandable mam

Thank you sister so much , wish you a happy life

Watched 3 hour before exam ❤️

At last we r replacing 2 with 7 by which standard

Thank u it was really helpful

how to identify if it is used in future or not how does program get it that which is not used for longest time

@SHUBHAMGI

5 жыл бұрын

This is a theoretical page replacement policy, in real time you cannot predict which page is going to be the longest unused page. Some of the operating system keeps the track of all pages reference by the program, and it uses those data to decide which pages to swap in & out on subsequent runs to achieve near optimal performance. But this can work only if the program's memory reference pattern is relatively consistent each time it runs.

Good class maam keep going with your endeavours.

Please can u make all concepts of optimal technics

1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 how many page faults would occur for the any two replacement alogorithms, assumming frame size is 4,5. I tried and I got the both answer s page faults is 8 for optimal page replacement using 4 frame,LRU using 5 frame is the answer correct or wrong

So at the last "page" (if that's what it's called), it becomes FIFO again, right?

TY mam 😍

What if you find two strings that are not present in the right side?

Superb...

Super mam ,I understand a lot

3:30 to get straight to optimal algorithm explanation

Thanks now im ready for my exam

Tqqq soooooo much sis 😘❤️❤️

very well explained,,very useful

Thank you so much mam

Mam one doubt for this.... suppose 2 values are not in the disk long time .(same time)....which value u can replace first mam? Reply mam tommorow I have aexam

Super 👍 explanation....

Asosome 🎉😊

Thank you so much🤝

Thank you senpai

Very good explanation ma'am

Mam ap na to 4 ko dka to lia agy ni ha na but agy ni be ho na to yahan pa fifo use krna chaye ap na seda 4 sa agy direct 0 laga lia please reply me

i actually love you

Thanks mam saved my time

Anna aa shop maa friend vala Dey akkada collection chala bagundhi

How many bits are there in virtual address and physical address

Thank you mam

Lets say the second row and the last row are the same , is that a hit ??

thanks mam

Better we can check from backside which is arriving first in the memo

Good explanation.

Mam kindly post the video for page buffering algorithm

thanks mam.

Nice explanation 👍

what's the difference between FIFO and LRU

@aie007

2 жыл бұрын

FIFO means First In, First Out. The page that came first will be removed first. This depends on the time. LRU is Least Recently Used. The page which has been not used for the longest time is removed. This depends on the use of page.

Which number we have to repalce if 2 numbers are not there in the list...??

@rathansaidhu9170

5 жыл бұрын

Same doubt bro

Thank you Soo much Miss

Tq for this video

nice thanks mam...

Thank u mam 😊😊

How many bits are there in page number and block number