Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions
61
votes
9
answers
261
GATE CSE 2013 | Question: 34
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, increments by one, stores it to memory, and then terminates. Each of the ... initialized to two. What is the maximum possible value of $x$ after all processes complete execution? $-2$ $-1$ $1$ $2$
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, ...
Arjun
23.0k
views
Arjun
asked
Sep 24, 2014
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
113
votes
9
answers
262
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
Arjun
28.5k
views
Arjun
asked
Sep 24, 2014
Algorithms
gatecse-2013
algorithms
sorting
normal
heap-sort
+
–
64
votes
9
answers
263
GATE CSE 2007 | Question: 50
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2n-c$ comparisons, for ... $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is T...
Kathleen
29.7k
views
Kathleen
asked
Sep 21, 2014
Algorithms
gatecse-2007
algorithms
time-complexity
easy
+
–
68
votes
9
answers
264
GATE CSE 2007 | Question: 34
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to $1$ line $2^{n+1}$ line to $1$line $2^{n-1}$ line to $1$line $2^{n-2}$ line to $1$line
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer neede...
Kathleen
31.8k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
normal
multiplexer
+
–
23
votes
9
answers
265
GATE CSE 2005 | Question: 51
Box $P$ has $2$ red balls and $3$ blue balls and box $Q$ has $3$ red balls and $1$ blue ball. A ball is selected as follows: (i) select a box (ii) choose a ball from the selected box such that each ball in the box is equally likely to be chosen. The probabilities ... that it came from the box $P$ is: $\dfrac{4}{19}$ $\dfrac{5}{19}$ $\dfrac{2}{9}$ $\dfrac{19}{30}$
Box $P$ has $2$ red balls and $3$ blue balls and box $Q$ has $3$ red balls and $1$ blue ball. A ball is selected as follows: (i) select a box (ii) choose a ball from the ...
gatecse
6.0k
views
gatecse
asked
Sep 21, 2014
Probability
gatecse-2005
probability
conditional-probability
normal
+
–
61
votes
9
answers
266
GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such th...
gatecse
13.7k
views
gatecse
asked
Sep 21, 2014
Combinatory
gatecse-2005
set-theory&algebra
normal
pigeonhole-principle
+
–
65
votes
9
answers
267
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pa...
Kathleen
16.9k
views
Kathleen
asked
Sep 18, 2014
Combinatory
gatecse-2004
combinatory
+
–
66
votes
9
answers
268
GATE CSE 2004 | Question: 21, ISRO2007-44
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by the instruction set architecture page size number of processes in memory physical memory size
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...
Kathleen
24.1k
views
Kathleen
asked
Sep 18, 2014
Operating System
gatecse-2004
operating-system
virtual-memory
page-replacement
normal
isro2007
+
–
47
votes
9
answers
269
GATE CSE 2004 | Question: 18, ISRO2007-31
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in$Q = 0, Q' = 1$$Q = 1, Q' = 0$$Q = 1, Q' = 1$Inde...
Kathleen
22.5k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
easy
isro2007
flip-flop
+
–
79
votes
9
answers
270
GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...
Rucha Shelke
11.3k
views
Rucha Shelke
asked
Sep 18, 2014
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
functions
+
–
70
votes
9
answers
271
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
Rucha Shelke
28.4k
views
Rucha Shelke
asked
Sep 17, 2014
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
65
votes
9
answers
272
GATE CSE 2003 | Question: 43
The following is a scheme for floating point number representation using $16$ bits. Let $s, e,$ and $m$ ... between two successive real numbers representable in this system? $2^{-40}$ $2^{-9}$ $2^{22}$ $2^{31}$
The following is a scheme for floating point number representation using $16$ bits.Let $s, e,$ and $m$ be the numbers represented in binary in the sign, exponent, and man...
Kathleen
18.2k
views
Kathleen
asked
Sep 17, 2014
Digital Logic
gatecse-2003
digital-logic
number-representation
floating-point-representation
normal
+
–
65
votes
9
answers
273
GATE CSE 2003 | Question: 40
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-d...
Kathleen
15.9k
views
Kathleen
asked
Sep 17, 2014
Graph Theory
gatecse-2003
graph-theory
normal
degree-of-graph
+
–
23
votes
9
answers
274
GATE CSE 2003 | Question: 34
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be placed in the bags if each bag must contain at least $k$ ... $\left( \begin{array}{c} m - kn + n + k - 2 \\ n - k \end{array} \right)$
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be place...
Kathleen
11.4k
views
Kathleen
asked
Sep 16, 2014
Combinatory
gatecse-2003
combinatory
balls-in-bins
normal
+
–
40
votes
9
answers
275
GATE CSE 2009 | Question: 22
For the composition table of a cyclic group shown below: ... $a,b$ are generators $b,c$ are generators $c,d$ are generators $d,a$ are generators
For the composition table of a cyclic group shown below:$$\begin{array}{|c|c|c|c|c|} \hline \textbf{*} & \textbf{a}& \textbf{b} &\textbf{c} & \textbf{d}\\\hline \textbf{a...
gatecse
9.0k
views
gatecse
asked
Sep 15, 2014
Set Theory & Algebra
gatecse-2009
set-theory&algebra
normal
group-theory
+
–
123
votes
9
answers
276
GATE CSE 2005 | Question: 72
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let $u,v$ be the values printed by the parent process and $x,y$ be the values printed by the child ... $u + 10 = x \text{ and } v = y$ $u + 10 = x \text{ and } v != y$
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); }Let $u,v$ be the values pr...
Nishant T-rex
37.8k
views
Nishant T-rex
asked
Sep 14, 2014
Operating System
gatecse-2005
operating-system
fork-system-call
normal
+
–
38
votes
9
answers
277
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
How many $4$-digit even numbers have all $4$ digits distinct?$2240$$2296$$2620$$4536$
Kathleen
12.9k
views
Kathleen
asked
Sep 14, 2014
Combinatory
gatecse-2001
combinatory
normal
+
–
43
votes
9
answers
278
GATE CSE 2000 | Question: 1.16
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable
Aliasing in the context of programming languages refers tomultiple variables having the same memory locationmultiple variables having the same valuemultiple variables hav...
Kathleen
24.9k
views
Kathleen
asked
Sep 14, 2014
Programming in C
gatecse-2000
programming
easy
aliasing
+
–
40
votes
9
answers
279
GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many s...
Kathleen
13.8k
views
Kathleen
asked
Sep 12, 2014
Theory of Computation
gate1991
theory-of-computation
finite-automata
normal
descriptive
+
–
41
votes
9
answers
280
GATE CSE 1991 | Question: 03,xii
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which of the following is true: Both $F_1$ and $F_2$ are tautologies The conjunction $F_1 \land F_2$ is not satisfiable Neither is tautologous Neither is satisfiable None of the above
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which ...
Kathleen
9.2k
views
Kathleen
asked
Sep 12, 2014
Mathematical Logic
gate1991
mathematical-logic
normal
propositional-logic
multiple-selects
+
–
Page:
« prev
1
...
9
10
11
12
13
14
15
16
17
18
19
...
3233
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register