Register
Filter

Recent activity by Devesh_Kumar

6 answers
2
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
7 answers
3
GATE CSE 2002 | Question: 2.11
The running time of the following algorithm Procedure $A(n)$ If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$; is best described by $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
The running time of the following algorithmProcedure $A(n)$If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$;is best described by$O(n)$$O(\log ...
3 answers
4
GATE CSE 1995 | Question: 1.6
The principle of locality justifies the use of: Interrupts DMA Polling Cache Memory
The principle of locality justifies the use of:InterruptsDMAPollingCache Memory
11 answers
5
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
4 answers
7
GATE CSE 2001 | Question: 2.21
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table? $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{24 MB}$
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table?$\text{16 ...
2 answers
9
GATE CSE 2001 | Question: 21-a
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write a relational algebra using $( \Pi, \sigma, \rho, \times)$ to find the list of names which appear more than once in examinee.
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number.Write a relational algebra using $( \Pi, \sigma, \rho, \times)...
3 answers
15
GATE2011 AG: GA-6
The sum of $n$ terms of the series $4+44+444+ \dots \dots $ is $\frac{4}{81}\left[10^{n+1}-9n-1\right]$ $\frac{4}{81}\left[10^{n-1}-9n-1\right]$ $\frac{4}{81}\left[10^{n+1}-9n-10\right]$ $\frac{4}{81}\left[10^{n}-9n-10\right]$
The sum of $n$ terms of the series $4+44+444+ \dots \dots $ is$\frac{4}{81}\left[10^{n+1}-9n-1\right]$$\frac{4}{81}\left[10^{n-1}-9n-1\right]$$\frac{4}{81}\left[10^{n+1}-...
14 answers
16
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______