L-3.7: GATE 2005 Question on Direct Mapping | Cache Mapping Questions | Computer Organisation

This video contains GATE 2005 Question on Direct Mapping.

►Computer Architecture (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
#GATE2005question#DirectMapping#COA

[rohitmahajan]

I have joined coaching for gate but i am getting more clarity in concepts here.Thanks for your teaching.❤

[harishk]

1 million goods aap se achha koi nahi samjha sakta hain aapko koti koti koti naman

[muhammadshahryar]

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.

[aandz]

( @ 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.

[Ritzieworld]

Well explained .. all my doubts are clear now👏thanku

[mohangouda]

Bhai again an extraordinary explanation

[ritikasingh]

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.

[vrishabshetty]

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)

[ShaliniSingh-xcrn]

Yup bit confusing..numericals sir... Hard too... Need to watch again... Thanks for ur efforts sir

[ajaykoppaka]

2:10 I think it is supposed to be LSB where the block offset is stored

[reetirajesh]

Thank you so much sir, please upload c++ topics also....

[abhishekchauhan]

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

[khushipitroda]

sir please upload microprocessor videos also

[KushChoudhary]

sir, I had my CAO exam today. wish you had uploaded a bit earlier. hehe.

[TheMeghaRastogi]

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?

[thesportslightmaker]

sir plzz upload more vedios on previous year questions..
And thnx for this vedio

[GauravPandey-ewcc]

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

[sayantabhattacharjee]

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?

[sukhmanisinghcheema]

Is sir taking one word equivalent to 1 byte here which resulted in 5 bit representation of block Someone help me pls