Sir I am a student with weak basics but honestly whenever I watch your video I get all the knowledge which I was looking for and could not get from other videos. Love from Pakistan.
( @ 5.00) I think here no. of lines is 1k, which starts from 0 to 999 ( not 1023 ) but the binary representation will be 2^10 by which we can address the lines with 10 bits.( we can address upto 1023) .................. By the Knowledge of this channel.
But we does not able to represent 1000 lines address in bits, we able to represent 1024 lines address in bits(10) that is nearest greater than 1000 , in this question we use only 1000 lines and reserved rest lines for further use
Sir, In ques it is asking for Cache indexing and cache indexing is BO+LO so, there should be 15 bits to represent this. So answer should be option C(15,17). Please clear my doubt.
Sir, thankyou for the video. Just something to ask , it is given in the question that block size is 32 bytes, should we not convert it to bits before calculation?
Sir, 32 bytes ko bits me represent galat kiya h. 32 *8=256bits= 2^8 bits is block size and 2^5 is word size and 2^3 is total no of words in one block so to represent them in bits we have to use 3 bits. ATM answer should be 10,19
Sir I took block size 32×8 means 8 bit requires for block size that's why I did the whole numerical wrong. Can u tell me why we don't take block size 32×8 bit?
Air nice video apke he channel se bs padhta hu sir isbr ke exam k phle computer organization and architecture upload kr dijiye plsss Rooz ek kr diya kriye upload pls sir
Sir the numericals of this topic are quite typical sir can u please refer any book or material with the help of which i would be able to solve numerical of this subject.. i am trying my best but not able to solve the questions of this subject.
Show direct mapping concept of book shelves(consider 16 books and 4 shelves). How does the processor map into cache in this case( consider main memory size is 2^m and number of cache block as 2^r)...can you explain this question?? It's very urgent.. Thank you
1 million goods aap se achha koi nahi samjha sakta hain aapko koti koti koti naman
I have joined coaching for gate but i am getting more clarity in concepts here.Thanks for your teaching.❤
Thank you..Keep learning and sharing..
Paise Barbad!
Gate nikala bhai?
Same Question 😂😂😂
@@harshkumarsingh5815 haan abhi voh iit guwahati mein Mtech kar rha hein, mera classmate tha
Sir I am a student with weak basics but honestly whenever I watch your video I get all the knowledge which I was looking for and could not get from other videos. Love from Pakistan.
gau
My favorite pink t shirt guy .😂
Well explained .. all my doubts are clear now👏thanku
Gurujee shandar jabardast zindabaad
Nice explanation...... really helpful 💞💞💞
( @ 5.00) I think here no. of lines is 1k, which starts from 0 to 999 ( not 1023 ) but the binary representation will be 2^10 by which we can address the lines with 10 bits.( we can address upto 1023)
..................
By the Knowledge of this channel.
thanks
Yes, This was Also my Question... 1k means 1000 so 0 to 999
But we does not able to represent 1000 lines address in bits, we able to represent 1024 lines address in bits(10) that is nearest greater than 1000 , in this question we use only 1000 lines and reserved rest lines for further use
Bhai again an extraordinary explanation
2:05 lsb bits
Good sir 🙏
Thank you Sir 😊.....
U r the Best 👌👏
Video starts at 1:18
Bade bhai thank you so much🙏🏻👌🏻
Yup bit confusing..numericals sir... Hard too... Need to watch again... Thanks for ur efforts sir
Sir, In ques it is asking for Cache indexing and cache indexing is BO+LO so, there should be 15 bits to represent this. So answer should be option C(15,17).
Please clear my doubt.
Yes it's correct
Great work
Thank you so much sir, please upload c++ topics also....
Sir thank u very much
😍😍😍😍🌹🇮🇳🇮🇳🇮🇳
very nice explanation sir
Sir, thankyou for the video. Just something to ask , it is given in the question that block size is 32 bytes, should we not convert it to bits before calculation?
me too same doubt??
you can
Yes same doubt
🔥
Sir I think there is a mistake
The no of lines are 1000
To index 1000 lines in binary we need at least 10 bits = 0-1024 (in decimal)
according to you 32KB/32B = 1000?
@@saurabhbhise9222 1024=2^10
thanks bro , correct answer @@saurabhpandey8020
sir please upload microprocessor videos also
Thanks sir☂️
sir plzz upload more vedios on previous year questions..
And thnx for this vedio
2:10 I think it is supposed to be LSB where the block offset is stored
Sir, 32 bytes ko bits me represent galat kiya h. 32 *8=256bits= 2^8 bits is block size and 2^5 is word size and 2^3 is total no of words in one block so to represent them in bits we have to use 3 bits. ATM answer should be 10,19
Thanks sir g 👍
Thankss sir
thank you so much sir.
Sir I took block size 32×8 means 8 bit requires for block size that's why I did the whole numerical wrong. Can u tell me why we don't take block size 32×8 bit?
Yes Sir same doubt
Thank you so much sir
sir, I had my CAO exam today. wish you had uploaded a bit earlier. hehe.
Tomorrow I have my exam 🙄🙄
@@006-shivashankarpanigrahi4 Good-luck 😉
congrats sir for 900K
great
Thank you sir
Thanku sir
🙌🙌🙏🙏
Dhanaywad
Thnku sir
Thanku sir.
Air nice video apke he channel se bs padhta hu sir isbr ke exam k phle computer organization and architecture upload kr dijiye plsss
Rooz ek kr diya kriye upload pls sir
Is sir taking one word equivalent to 1 byte here which resulted in 5 bit representation of block offset????? Someone help me pls
Thanks.
what is k and why its value is 2^10 ?
Sir the numericals of this topic are quite typical sir can u please refer any book or material with the help of which i would be able to solve numerical of this subject.. i am trying my best but not able to solve the questions of this subject.
Thanks sir but also upload software engineering computer graphics
Ys sr plz Se p video bnao I really need
can we also say that number of bits require for cache indexing is equal to line bits
i.e in this example 10 bits
Show direct mapping concept of book shelves(consider 16 books and 4 shelves). How does the processor map into cache in this case( consider main memory size is 2^m and number of cache block as 2^r)...can you explain this question?? It's very urgent.. Thank you
blog size 32 bytes h mtlb ki ak bite me 32 words honge aur unhe represent krne ke liye 5 bit lagenge.....am i right??
Right 👍
mera concept ban gaya .
Sir why did we not convert the 32 bytes to bit and just take `log` and move forward with 5 bits??
Same, I am also having same question, did you get it?? Please tell if you did.
Sir, According to question block size is 32 bytes so ( 1byte = 8 bits)
We need to represent 32*8 bits
But you i take only 5 bit to represent how ?
32bytes means 32 location of 1byte each .. and for accessing those 32 location 5bits r used
@@abhijitkumar5696 but words are of 2 bytes so 16 locations
@@rohitkumbhar9251 here is not mention the word size So, we take 1 word = 1 byte
Hi sir,
Can you please upload flip flop and gates video
Sir plz explain how many word in one block in this question
32
Par 1 group me jitne words hay uske babsis pe hum ofset nikalte hayna
3:26
Sir how to find memory location cache address/block direct mapping
Punjabi o bhaji tusi! 😄
Sir can u suggest some best books for practicing questions..??
Cpu generate logical address...na
Are bhai par ek group me jitne word hay usko 2^ nikalte hay na par ye kasyse nikala dimak kharab hogaya mera chakragaya may subehse karahahu
Top tukker
Can anyone give me practice questions of direct mapping ?!
if you find a subject hard.......sorry you are learning it from wrong teacher
Sir how is 1k equal to 2^10?
That is 1 k= 1024 therefore 2^10
feeling sleepy
GW
Just 1 like in insufficient here as per me.
hey
Thank you sir
thanku sir🙏
Thank you Sir