problem solving

Some Reduction Inferences

How to solve problems by reduction?

Breakup of given addresses into bit form:- $32$ bits are broken up as $10 bits (L2) | 10 bits (L1) |

n = Number Of Leaves in the tree Height of Tree = log(No of Leaves) for a Balanced Tree = logn =>

A computer provides each process with 65,53665,536 bytes of address means 16 pages program has a tex

paging cause longer access time (additional overhead of accessing page table) so overall process tur

101….120 are already loaded in 1…..20...by MRU we would end up replacing 20th frame(120) as this is

I think this is solution...please comment if something is wrong

Option D. 11

Option B. His Son Since the person who is telling has no brother or sister, so his father son is he

Option C. Sister

The prestigious Ramon magsaysay award was conferred upon Ms. Kiran Bedi for her excellent contributi

Field is the lowest level which contains one type of information and combination of fields related t

The tax $= 30\; \text{paise} = Rs.\;0.3.$ The tax is $6\%.$ $Rs.\;0.3$ is $6\%$ of the taxable item.

%d bloggers like this: