The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by kenzou
User kenzou
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User kenzou
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE19992.10
A multiuser, multiprocessing 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 nonprivileged) Demand paging
answer edited
Dec 2, 2018
in
Operating System

4.2k
views
gate1999
operatingsystem
normal
virtualmemory
3
answers
2
GATE19941.21
Which one of the following statements is true? Macro definitions cannot appear within other macro definitions in assembly language programs Overlaying is used to run a program which is longer than the address space of a computer Virtual memory can be used to ... longer than the address space of a computer It is not possible to write interrupt service routines in a high level language
edited
Dec 2, 2018
in
Operating System

2k
views
gate1994
operatingsystem
normal
virtualmemory
1
answer
3
GATE19901v
Fill in the blanks: 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.
answer edited
Dec 2, 2018
in
Operating System

1.6k
views
gate1990
operatingsystem
virtualmemory
5
answers
4
GATE2016150
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n1}$. In the code, function $\text{pmax}$ returns an integer not smaller than any of its arguments .For all $i,t[i]$ is ... can be in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
edited
Nov 29, 2018
in
Operating System

13.2k
views
gate20161
operatingsystem
resourceallocation
difficult
ambiguous
1
answer
5
GATE19961.19, ISRO200861
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$
edited
Nov 21, 2018
in
Operating System

2.6k
views
gate1996
operatingsystem
processsynchronization
easy
isro2008
3
answers
6
GATE199427
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbeginparend construct only?
edited
Nov 21, 2018
in
Operating System

1.5k
views
gate1994
operatingsystem
processsynchronization
normal
2
answers
7
GATE20134
The smallest integer that can be represented by an $8bit$ number in $2's$ complement form is $256$ $128$ $127$ $0$
answer edited
Nov 8, 2018
in
Digital Logic

2.8k
views
gate2013
digitallogic
numberrepresentation
easy
2
answers
8
GATE2004IT43
The number $(123456)_8$ is equivalent to $(A72E)_{16}$ and $(22130232)_4$ $(A72E)_{16}$ and $(22131122)_4$ $(A73E)_{16}$ and $(22130232)_4$ $(A62E)_{16}$ and $(22120232)_4$
edited
Nov 8, 2018
in
Digital Logic

861
views
gate2004it
digitallogic
numberrepresentation
normal
4
answers
9
GATE20039
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$? $11100111$ $11100100$ $11010111$ $11011011$
answer edited
Nov 8, 2018
in
Digital Logic

2.4k
views
gate2003
digitallogic
numberrepresentation
normal
4
answers
10
GATE20021.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
answer edited
Nov 8, 2018
in
Digital Logic

1.9k
views
gate2002
digitallogic
easy
numberrepresentation
6
answers
11
GATE19952.12, ISRO20159
The number of $1$'s in the binary representation of $(3*4096 + 15*256 + 5*16 + 3)$ are: $8$ $9$ $10$ $12$
edited
Nov 7, 2018
in
Digital Logic

6.8k
views
gate1995
digitallogic
numberrepresentation
normal
isro2015
4
answers
12
GATE199101iii
Consider the number given by the decimal expression: $16^3*9 + 16^2*7 + 16*5+3$ The number of $1’s$ in the unsigned binary representation of the number is ______
answer edited
Nov 7, 2018
in
Digital Logic

1.2k
views
gate1991
digitallogic
numberrepresentation
normal
3
answers
13
GATE201113
Which one of the following circuits is NOT equivalent to a $2$input $XNOR$ (exclusive $NOR$) gate?
answer edited
Nov 6, 2018
in
Digital Logic

1.5k
views
gate2011
digitallogic
normal
digitalcircuits
1
answer
14
GATE2008IT7
The following bit pattern represents a floating point number in IEEE $754$ single precision format $1 \ 10000011 \ 101000000000000000000000$ The value of the number in decimal form is $10$ $13$ $26$ None of the above
edited
Nov 6, 2018
in
Digital Logic

2.5k
views
gate2008it
digitallogic
numberrepresentation
floatingpointrepresentation
ieeerepresentation
normal
4
answers
15
GATE19992.9
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Threeinput gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.
edited
Nov 6, 2018
in
Digital Logic

5.7k
views
gate1999
digitallogic
normal
functionalcompleteness
8
answers
16
GATE201717
The nbit fixedpoint representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = nf$. The range of decimal values for $X$ in this representation is $2^{f}$ to $2^{i}$ $2^{f}$ to $\left ( 2^{i}  2^{f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i}  2^{f} \right )$
answer edited
Nov 4, 2018
in
Digital Logic

5.6k
views
gate20171
digitallogic
numberrepresentation
fixedpointrepresentation
1
answer
17
GATE2005IT11
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$
edited
Nov 4, 2018
in
Digital Logic

2.1k
views
gate2005it
digitallogic
digitalcounter
normal
1
answer
18
GATE199421
The number of flipflops required to construct a binary modulo $N$ counter is __________
answer edited
Nov 4, 2018
in
Digital Logic

1.7k
views
gate1994
digitallogic
easy
digitalcounter
2
answers
19
GATE19965
A logic network has two data inputs $A$ and $B$, and two control inputs $C_0$ and $C_1$. It implements the function $F$ according to the following table. ${\begin{array}{ccc}\hline \textbf{$C_1$}& \textbf{$ ... one $4$ to $1$ Multiplexer, one $2$input Exclusive OR gate, one $2$input AND gate, one $2$input OR gate and one Inverter.
answer edited
Nov 1, 2018
in
Digital Logic

1k
views
gate1996
digitallogic
normal
digitalcircuits
4
answers
20
GATE20078, ISRO201131
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$
edited
Nov 1, 2018
in
Digital Logic

7k
views
gate2007
digitallogic
normal
isro2011
decoder
5
answers
21
GATE2014345
The above synchronous sequential circuit built using JK flipflops is initialized with $Q_2Q_1Q_0 = 000$. The state sequence for this circuit for the next $3$ clock cycles is $001, 010, 011$ $111, 110, 101$ $100, 110, 111$ $100, 011, 001$
edited
Nov 1, 2018
in
Digital Logic

3.6k
views
gate20143
digitallogic
circuitoutput
normal
5
answers
22
GATE2007IT40
What is the final value stored in the linear feedback shift register if the input is $101101$? $0110$ $1011$ $1101$ $1111$
answer edited
Nov 1, 2018
in
Digital Logic

1.8k
views
gate2007it
digitallogic
circuitoutput
normal
3
answers
23
GATE200735
In a lookahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$ The expressions for the sum bit $S_i$ and the carry bit $C_{i+1}$ of the look ... bit adder with $S_3, S_2, S_1, S_0$ and $C_4$ as its outputs are respectively: $6, 3$ $10, 4$ $6, 4$ $10, 5$
edited
Oct 29, 2018
in
Digital Logic

3.6k
views
gate2007
digitallogic
normal
carrygenerator
adder
2
answers
24
GATE19961.23
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is 101010 ….. 1010 100000 ….. 0001 111111 ….. 1111 011111 ….. 1110
answer edited
Oct 29, 2018
in
Digital Logic

1.8k
views
gate1996
digitallogic
boothsalgorithm
normal
5
answers
25
TIFR2016B1
A Boolean formula is said to be a $tautology$ if it evaluates to TRUE for all assignments to its variables. Which one of the following is NOT a tautology? $(( p \vee q) \wedge (r \vee s)) \Rightarrow (( p \wedge r) \vee q \vee s)$ ... $(( p \vee q ) \wedge ( r \vee s)) \Rightarrow ( p \vee q)$
answer edited
Oct 29, 2018
in
Digital Logic

350
views
tifr2016
booleanalgebra
3
answers
26
GATE198712a
The Boolean expression $A \oplus B \oplus A$ is equivalent to $AB + \bar {A}\bar B$ $\bar{A}B+A\bar{B}$ $B$ $\bar{A}$
answer edited
Oct 26, 2018
in
Digital Logic

787
views
gate1987
digitallogic
booleanalgebra
easy
1
answer
27
Gate 1997
Let * be defined as x*y= x'+y. Let z = x*y. Value of z*x is (a) x +y (b) x (c) 0 (d) 1
answer edited
Oct 26, 2018
in
Digital Logic

1.2k
views
gate1997
digitallogic
booleanalgebra
5
answers
28
GATE20002.10
The simultaneous equations on the Boolean variables $x, y, z$ and $w$, $x + y + z = 1 $ $xy = 0$ $xz + w = 1$ $xy + \bar{z}\bar{w} = 0$ have the following solution for $x, y, z$ and $w,$ respectively: $0 \ 1 \ 0 \ 0$ $1 \ 1 \ 0 \ 1$ $1 \ 0 \ 1 \ 1$ $1 \ 0 \ 0 \ 0$
edited
Oct 26, 2018
in
Digital Logic

2k
views
gate2000
digitallogic
booleanalgebra
easy
3
answers
29
TIFR2010B21
For $x \in \{0,1\}$, let $\lnot x$ denote the negation of $x$, that is $\lnot \, x = \begin{cases}1 & \mbox{iff } x = 0\\ 0 & \mbox{iff } x = 1\end{cases}$. If $x \in \{0,1\}^n$, then $\lnot \, x$ denotes the component wise negation of $x$ ... $g(x) = f(x) \land f(\lnot x)$ $g(x) = f(x) \lor f(\lnot x)$ $g(x) = \lnot f(\lnot x)$ None of the above.
answer edited
Oct 26, 2018
in
Digital Logic

1.2k
views
tifr2010
digitallogic
booleanalgebra
2
answers
30
GATE19992.16
The number of full and halfadders required to add $16$bit numbers is $8$ halfadders, $8$ fulladders $1$ halfadder, $15$ fulladders $16$ halfadders, $0$ fulladders $4$ halfadders, $12$ fulladders
edited
Oct 22, 2018
in
Digital Logic

5.5k
views
gate1999
digitallogic
normal
adder
5
answers
31
GATE19972.5
An Nbit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator). The minimum addition time using the best architecture for this adder is proportional to $N$ proportional to $\log N$ a constant None of the above
edited
Oct 22, 2018
in
Digital Logic

3k
views
gate1997
digitallogic
normal
adder
4
answers
32
GATE2016151
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$ ... deadlockfreedom guarantee neither serializability nor deadlockfreedom guarantee serializability but not deadlockfreedom guarantee deadlockfreedom but not serializability.
answer edited
Oct 22, 2018
in
Databases

6.1k
views
gate20161
databases
transactions
normal
2
answers
33
GATE2016122
Which one of the following is NOT a part of the ACID properties of database transactions? Atomicity Consistency Isolation Deadlockfreedom
answer edited
Oct 22, 2018
in
Databases

1.7k
views
gate20161
databases
transactions
easy
3
answers
34
GATE2014129
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectively. Which one of them is conflict serializable? $r_1(x)$; $r_2(x)$; $w_1(x)$; $r_3(x)$; $w_2(x)$; $r_2(x)$; $r_1(x)$ ... $r_2(x)$; $r_1(x)$; $w_2(x)$; $w_1(x)$; $r_2(x)$; $w_2(x)$; $r_3(x)$; $r_1(x)$; $w_1(x)$;
answer edited
Oct 22, 2018
in
Databases

2.7k
views
gate20141
databases
transactions
normal
8
answers
35
GATE200620, ISRO201517
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 $=1200$ new $=10000$ ... records $2$ and $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
edited
Oct 22, 2018
in
Databases

8.1k
views
gate2006
databases
transactions
normal
isro2015
2
answers
36
GATE2005IT66
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an associated invocation sequence. The ... module $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
edited
Oct 22, 2018
in
IS&Software Engineering

1.5k
views
gate2005it
dataflowdiagram
normal
nongate
3
answers
37
GATE200329, ISRO200973
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an uncommitted ... after it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction
answer edited
Oct 22, 2018
in
Databases

4k
views
gate2003
databases
transactions
easy
isro2009
1
answer
38
GATE19992.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
answer edited
Oct 18, 2018
in
Databases

4k
views
gate1999
databases
sql
easy
1
answer
39
GATE19991.19
The relational algebra expression equivalent to the following tuple calculus expression: $\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\}$ is $\sigma_{(A=10 \lor B=20)} (r)$ $\sigma_{(A=10)} (r) \cup \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r) \cap \sigma_{(B=20)} (r)$ $\sigma_{(A=10)} (r)  \sigma_{(B=20)} (r)$
answer edited
Oct 16, 2018
in
Databases

1.9k
views
gate1999
databases
relationalcalculus
normal
3
answers
40
TIFR2013B19
In a relational database there are three relations: Customers = $C$(CName), Shops = $S$(SName), Buys = $B$(CName, SName). Which of the following relational algebra expressions returns the names of shops that have no customers at all? [Here $\Pi$ is the projection operator.] $\Pi _{S Name}B$ $S  B$ $S  \Pi _{S Name}B$ $S  \Pi _{S Name}((C \times S)  B)$ None of the above
answer edited
Oct 15, 2018
in
Databases

666
views
tifr2013
databases
relationalalgebra
50,645
questions
56,601
answers
195,850
comments
102,208
users