Комментарии:
Thank you sir❤
Ответитьi dont know why but the concepts are not clear might be too much vagueness is there..i have been watching neso for a long time now but only this time i m left with the doubts.
ОтветитьAwesome video and teacher. Thank you so much for these easy-to-understand videos.
There's one thing I haven't understood, isn't 1Kb the same as 1000 bytes, and not 1024 like in your examples? I thought 1Kib was 1024 bytes
Consider a main memory of the size 64 kB with each word being of 8 bits (one byte) only and a direct mapping Cache memory of size 4 kB also having data word size of 8 bits. Find the following :
(i) What is the size of tag and index fields of cache ?
(ii) In what location of Cache, hexadecimal address to main memory (AABB) (if exists in cache) will be located ?
what's answer of this question, can anyone tell..?
Amazing🙏
Ответитьso tag bits represent the log(times the cache would fit in the ram). if ram is 4 times the cache size, then the tag bits are 2. in above case, 2^10 times x cache size = ram size. therefore. cache size is ram size/2^10= 16 x 2^10 x 2^10 x 2^10 bytes. = 16 MB.
ОтветитьScrew it. Im'm going to fail
ОтветитьThanks for the video sir ....
ОтветитьWORD is 1 or 2 Bytes?
ОтветитьThank you, You all are really blessed. Thank you, one thousand times Thank You.
Ответитьexample 3: 10 tag bits..... So 2*34/2^10 = 2^24 =16MB. no need other info i think
ОтветитьI didn't get the concept of tag directory. Can anyone help me out?
ОтветитьThanks for covering every kind of questions 🙂🙂🙂🙂❤️❤️❤️❤️🙂🙂🙂🙂
ОтветитьBow down 🙇🏻♂️ to him ❤
ОтветитьMM size = 4GB =2^2*2^30Bytes=2^32bytes=2^32*2^3bits=2^35 bits right?
ОтветитьYou're too quick, slow down
Ответитьdisliked because of cringe voice. taking lecture at 3 in night for exam at 8 and this boy sound so cheerful
ОтветитьVery informative and amazing lecture. Can you please suggest a good book also for computer architecture and to solve more numerical based problems like this
Ответитьwhere can i find your course ppt or pdf ? can you share it? thanks
ОтветитьYou saved me, LOVE YOU ❤️
ОтветитьWow, this is an amazing lecture... far better than the three 1h 30m lectures that my professor gives. Once I start my career, I can't wait to donate to this channel. It's been SUCH a lifesaver for me!
Ответитьhates off
Ответитьfabulous!! very clearly understood in less time!! thank you neso!!
ОтветитьHey! I noticed one thing that size of cache is equal to the no. of blocks in MM. Is this true for every computer?
ОтветитьThis playlist is progressing too slow.If possible please fast a little bit.
ОтветитьGreat explanation in just 10mins.
keep it up.
I recommended this lecture series to my children's XD
👍
ОтветитьPlease complete lecture video on Compiler design plsss sir really need
Ответить❤️
ОтветитьRight on time for my exams
ОтветитьFirst viewer.. 👍🏾
Ответить