Get Started with ixamBee
Start learning 50% faster. Sign in now
The number of sets = 128/4 = 32 (as it is 4 way set associative) We have total 64 words then we need 6 bits to identify the word So the line offset is 5 bits and the word offset is 6 bits and the TAG = 20-(5+6) =9 bits so it should be 9,5,6
In which of the following expressions the expression ‘Q ≤ N’ would hold definitely true?
Statements: D < O = Q > U < I ≤ R; K ≥ O = I; R > H ≥ G
Conclusions:
I. R > O
II. K > U
III. H ≥ Q
In which of these expression ‘X ≤ B’ is definitely true?
Statements:
X % Y % Z $ I @ L
Conclusions:
I. Z * X
II. L © Z
III. L * X
Statement:
O ≤ P >K ≤ L; W ≤ X = K > R; Q > L
Conclusion:
I) W < L
II) L = W
Statements : M > J = L > O > I ≤ H < Q = N
Conclusions :
I. I > M
II. N > I
III. L < Q
Statements: Q > U = V ≤ X; R ≥ S ≥ X
Conclusions:
I. U = S
II. V < S
Statements: B ≤ C < E; B ≥ G < H; G > I ≥ L
Conclusions:
I. G ≤ C
II. H ≥ L
III. G > E
In the question, assuming the given statements to be true, find which of the conclusion (s) among given two conclusions is /are definitely true and the...
Statements: P ≥ Q ≥ R = S, Q ≥ T > U ≥ V
Conclusion:
I. P ≥ V
II. P > V
