Register
Filter

Recent activity by paraskk

3 answers
2
GATE CSE 1999 | Question: 2.6
For the schedule given below, which of the following is correct: ... schedule is not serializable but can occur in a scheme using 2PL protocol This schedule is not serializable and cannot occur in a scheme using 2PL protocol
For the schedule given below, which of the following is correct:$$\begin{array}{ll} \text{1} & \text{Read A} & \text{} \\ \text{2} & \text{} & \text{Read B} \\ \text{3...
9 answers
3
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
3 answers
5
GATE CSE 2003 | Question: 48
Consider the following assembly language program for a hypothetical processor $A, B,$ and $C$ are $8-$ ... the program execution will be the number of $0$ bits in $A_0$ the number of $1$ bits in $A_0$ $A_0$ $8$
Consider the following assembly language program for a hypothetical processor $A, B,$ and $C$ are $8-$bit registers. The meanings of various instructions are shown as com...
3 answers
6
GATE CSE 2010 | Question: 56
Choose the most appropriate word from the options given below to complete the following sentence: His rather casual remarks on politics ________ his lack of seriousness about the subject. masked belied betrayed suppressed
Choose the most appropriate word from the options given below to complete the following sentence:His rather casual remarks on politics ________ his lack of seriousness ab...
5 answers
8
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows: ... $1 \leq m \leq l$. Give the value of the hit ratio for $l = 1$.
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
3 answers
15
GATE IT 2008 | Question: 25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$ $\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)}$
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes?$\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$$\frac{(n+(b+r)-1)!}{(n-1)!\...
3 answers
16
GATE CSE 1991 | Question: 14,a
Consider the binary tree in the figure below: What structure is represented by the binary tree?
Consider the binary tree in the figure below:What structure is represented by the binary tree?
4 answers
18
GATE CSE 1992 | Question: 01,viii
The purpose of instruction location counter in an assembler is _______
The purpose of instruction location counter in an assembler is _______
5 answers
19
GATE CSE 1999 | Question: 1.15
The number of articulation points of the following graph is $0$ $1$ $2$ $3$
The number of articulation points of the following graph is$0$$1$$2$$3$
2 answers
24
GATE CSE 2013 | Question: 6
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort? $O(\log n$) $O(n$) $O(n \log n$) $O(n^{2}$)
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort?$O(\log n$)$O(n$)$O(n \log n$...
16 answers
25
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
1 answer
28
self doubt about maths practice
Where can i find only maths PYQ all branches . for practice ?
Where can i find only maths PYQ all branches . for practice ?
8 answers
30
GATE CSE 2005 | Question: 50
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$?$i$$i+1$$2i$$2^i$