Register
Filter

Recent activity by kenzou

3 answers
1
GATE CSE 1999 | Question: 2.10
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support Address translation DMA for disk transfer At least two modes of CPU execution (privileged and non-privileged) Demand paging
A multi-user, multi-processing operating system cannot be implemented on hardware that does not supportAddress translationDMA for disk transferAt least two modes of CPU e...
1 answer
2
GATE CSE 1990 | Question: 1-v
Under paged memory management scheme, simple lock and key memory protection arrangement may still be required if the _________ processors do not have address mapping hardware.
Under paged memory management scheme, simple lock and key memory protection arrangement may still be required if the _________ processors do not have address mapping hard...
1 answer
4
GATE CSE 1996 | Question: 1.19, ISRO2008-61
A critical section is a program segment which should run in a certain amount of time which avoids deadlocks where shared resources are accessed which must be enclosed by a pair of semaphore operations, $P$ and $V$
A critical section is a program segmentwhich should run in a certain amount of timewhich avoids deadlockswhere shared resources are accessedwhich must be enclosed by a pa...
5 answers
5
GATE CSE 2003 | Question: 9
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$?$11100111$$11100100$$11010111$$11011011$
4 answers
6
GATE CSE 2002 | Question: 1.16
Sign extension is a step in floating point multiplication signed $16$ bit integer addition arithmetic left shift converting a signed integer from one size to another
Sign extension is a step in floating point multiplicationsigned $16$ bit integer additionarithmetic left shiftconverting a signed integer from one size to another
2 answers
7
GATE CSE 2011 | Question: 13
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
Which one of the following circuits is NOT equivalent to a $2$-input $XNOR$ (exclusive $NOR$) gate?
3 answers
11
GATE IT 2005 | Question: 11
How many pulses are needed to change the contents of a $8$-bit up counter from $10101100$ to $00100111$ (rightmost bit is the LSB)? $134$ $133$ $124$ $123$
How many pulses are needed to change the contents of a $8$-bit up counter from $10101100$ to $00100111$ (rightmost bit is the LSB)?$134$$133$$124$$123$
5 answers
12
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$$8$$9$$10$
6 answers
13
GATE IT 2007 | Question: 40
What is the final value stored in the linear feedback shift register if the input is $101101$? $0110$ $1011$ $1101$ $1111$
What is the final value stored in the linear feedback shift register if the input is $101101$?$0110$$1011$$1101$$1111$
2 answers
14
GATE CSE 1996 | Question: 1.23
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is $101010\ldots1010$ $100000\ldots 0001$ $111111\ldots 1111$ $011111\ldots1110$
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is$101010\ldots1010$$100000\ldots 0001$$111111\ldots 1111$$011111\ldots...
3 answers
16
GATE CSE 1987 | Question: 12-a
The Boolean expression $A \oplus B \oplus A$ is equivalent to $AB + \overline {A}\;\;\overline B$ $\overline{A}\;B+A\;\overline{B}$ $B$ $\overline{A}$
The Boolean expression $A \oplus B \oplus A$ is equivalent to$AB + \overline {A}\;\;\overline B$$\overline{A}\;B+A\;\overline{B}$$B$$\overline{A}$
4 answers
17
GATE CSE 1997 | Question: 2-1
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$ $x$ $0$ $1$
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$$x$$0$$1$
6 answers
19
GATE CSE 1999 | Question: 2.16
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...
2 answers
21
GATE CSE 2016 Set 1 | Question: 22
Which one of the following is NOT a part of the ACID properties of database transactions? Atomicity Consistency Isolation Deadlock-freedom
Which one of the following is NOT a part of the ACID properties of database transactions?AtomicityConsistencyIsolationDeadlock-freedom
2 answers
24
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
Which of the following is/are correct?An SQL query automatically eliminates duplicatesAn SQL query will not work if there are no indexes on the relationsSQL permits attri...
3 answers
26
TIFR CSE 2013 | Part B | Question: 19
In a relational database there are three relations: $Customers = C\textsf{(CName)}$, $Shops = S \textsf{(SName)}$, $Buys = B\textsf{(CName, SName)}$ ... $S - \Pi _{\textsf{SName}}((C \times S) - B)$ None of the above
In a relational database there are three relations:$Customers = C\textsf{(CName)}$,$Shops = S \textsf{(SName)}$,$Buys = B\textsf{(CName, SName)}$.Which of the following r...