Set-associative mapping allows that each word that is present in the cache can have two or more words in the main memory for the same index address. Set associative cache mapping combines the best of direct and associative cache mapping techniques.
<em>r = 15 cm</em>
<em>formula</em>
<em>V = πr²×h/3</em>
<em>replace</em>
<em>4950 = 22/7×r²×21/3</em>
<em>4950 = 22/7×r²×7</em>
<em>4950 = 22×r²</em>
<em>r² = 4950/22</em>
<em>r² = 225</em>
<em>r = √225</em>
<em>r = √15²</em>
<em>r = 15 cm</em>
Answer:
Here’s one!
Given [math]R[/math], the radius of the circle.
Let [math]N,D\leftarrow 0[/math]
Repeat until [math]D[/math] is large enough (about 1,000,000)
[math]x,y\leftarrow U[0,1][/math]
If [math]x^2 + y^2\le 1[/math] then [math]N\leftarrow N+1[/math]
[math]D\leftarrow D+1[/math]
[math]P\leftarrow\frac{8NR}{D}[/math]
Return [math]P[/math]
[math]U[0,1][/math] is a uniform random number in the range [math][0,1][/math].
Explanation:
