Register
Filter

Answers by Veerendra V

9 votes
1
GATE CSE 1999 | Question: 1.16
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is $\log_2 n$ $\sqrt n$ $n-1$ $n$
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is$\log_2 n$$\sqrt n$$n-1$$n$
5 votes
2
Multilevel Paging
A computer has a 32 bit virtual address space and 1024 Bytes pages.A page table entry is 4 bytes.A multilevel page table is used because each page must fit in a page.How many levels are required ?Also tell how many bits are required to index page table at each level?
A computer has a 32 bit virtual address space and 1024 Bytes pages.A page table entry is 4 bytes.A multilevel page table is used because each page must fit in a page.How ...
4 votes
3
probability solve
4 votes
5
prepositional logic
when ∀xP(x) --> Q(x) is given does it mean (∀xP(x)) --> Q(x) or it means ∀x(P(x) --> Q(x))? in short precedence of quantifiers is greater or implies is greater?
when ∀xP(x) Q(x) is givendoes it mean (∀xP(x)) Q(x) or it means ∀x(P(x) Q(x))?in short precedence of quantifiers is greater or implies is greater?