L-3.7: GATE 2005 Question on Direct Mapping | Cache Mapping Questions | Computer Organisation
ฝัง
- เผยแพร่เมื่อ 7 ก.ย. 2024
- 👉Subscribe to our new channel: / @varunainashots
This video contains GATE 2005 Question on Direct Mapping.
Link of Direct Mapping : • L-3.6: Direct Mapping ...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Operating System:
• Operating System (Comp...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on TH-cam: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
#GATE2005question#DirectMapping#COA
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
1 million goods aap se achha koi nahi samjha sakta hain aapko koti koti koti naman
( @ 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
My favorite pink t shirt guy .😂
Well explained .. all my doubts are clear now👏thanku
Nice explanation...... really helpful 💞💞💞
Gurujee shandar jabardast zindabaad
2:05 lsb bits
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
Bhai again an extraordinary explanation
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
Yup bit confusing..numericals sir... Hard too... Need to watch again... Thanks for ur efforts sir
Is sir taking one word equivalent to 1 byte here which resulted in 5 bit representation of block offset????? Someone help me pls
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 sir
Thank you so much sir, please upload c++ topics also....
sir, I had my CAO exam today. wish you had uploaded a bit earlier. hehe.
Tomorrow I have my exam 🙄🙄
@@006-shivashankarpanigrahi4 Good-luck 😉
2:10 I think it is supposed to be LSB where the block offset is stored
Thank you Sir 😊.....
U r the Best 👌👏
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
Good sir 🙏
sir plzz upload more vedios on previous year questions..
And thnx for this vedio
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
Bade bhai thank you so much🙏🏻👌🏻
sir please upload microprocessor videos also
Video starts at 1:18
very nice explanation sir
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
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 thank u very much
😍😍😍😍🌹🇮🇳🇮🇳🇮🇳
can we also say that number of bits require for cache indexing is equal to line bits
i.e in this example 10 bits
what is k and why its value is 2^10 ?
thank you so much sir.
Great work
Thankss sir
congrats sir for 900K
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.
🔥
Thank you so much sir
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
Dhanaywad
Thanks sir g 👍
Thanks sir☂️
Thanks sir but also upload software engineering computer graphics
Ys sr plz Se p video bnao I really need
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??
great
Thanku sir.
Thanks.
Thanku sir
Thnku sir
Sir plz explain how many word in one block in this question
32
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.
Hi sir,
Can you please upload flip flop and gates video
Par 1 group me jitne words hay uske babsis pe hum ofset nikalte hayna
Sir how to find memory location cache address/block direct mapping
mera concept ban gaya .
Cpu generate logical address...na
Sir can u suggest some best books for practicing questions..??
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
🙌🙌🙏🙏
3:26
Can anyone give me practice questions of direct mapping ?!
Punjabi o bhaji tusi! 😄
Top tukker
if you find a subject hard.......sorry you are learning it from wrong teacher
GW
Just 1 like in insufficient here as per me.
hey
feeling sleepy
Sir how is 1k equal to 2^10?
That is 1 k= 1024 therefore 2^10
Thank you Sir
thanku sir🙏
Thank you sir