Recent posts tagged pragys-app

1,687
views
remember this as a standard formula .as it always give answer as 0
3,687
views
8 million = 8*2^10*2^10 =2^23So address is 23 bits.Word offset its = 6 (2*6=64)No of bits to identify a Block= 8(2^8 = 256)No of bits to indentify tag= 23 ... Tag memory + Dirty bit memory +Valid bit memory=256*64 +(256*9)/8 + 256/8 + 256/8
1,434
views
i got your point ...but answer is none of these :p :) thank you!
7,534
views
As it is already written that x is a intermediate node so it cann't be the last node. Hence, complexity should be O(1) by the algo that gate_asp have given below. Tell me if i am wrong?
2,961
views
2,994
views
Probability of Urn 3 given the balls are white and green= P(Urn 3 and white + Urn 3 and green)/ P(white and green)= P(Urn 3 and white + Urn 3 and green)/ ... * 15/118= 15/59(2C1 is multiplied because the 2 balls could be drawn in 2C1 ways)
To see more, click for the full list of questions or popular tags.