Register

Web Page

Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point)

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&2&3&2&4&2&3&2&3&3&1&2.5&4
\\\hline\textbf{2 Marks Count} & 2&2&2&1&2&2&0&4&2&0&0&1.7&4
\\\hline\textbf{Total Marks} & 5&6&7&4&8&6&3&10&7&3&\bf{3}&\bf{5.9}&\bf{10}\\\hline
\end{array}}}$$

Filter

Highest voted questions in Digital Logic

23 votes
6 answers
202
GATE CSE 1990 | Question: 5-b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.
Show with the help of a block diagram how the Boolean function :$f=AB+BC+CA$can be realised using only a $4:1$ multiplexer.
User Avatar
23 votes
6 answers
203
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$
User Avatar
23 votes
3 answers
205
GATE CSE 1998 | Question: 16
Design a synchronous counter to go through the following states:$1, 4, 2, 3, 1, 4, 2, 3, 1, 4 \dots $
Design a synchronous counter to go through the following states:$$1, 4, 2, 3, 1, 4, 2, 3, 1, 4 \dots $$
User Avatar
23 votes
2 answers
206
GATE CSE 1998 | Question: 5
The implication gate, shown below has two inputs ($x \text{ and }y)$; the output is 1 except when $x =1 \text{ and } y=0\text{, realize }f=\bar{x}y+x\bar{y}$ using only four implication gates. Show that the implication gate is functionally complete.
The implication gate, shown below has two inputs ($x \text{ and }y)$; the output is 1 except when $x =1 \text{ and } y=0\text{, realize }f=\bar{x}y+x\bar{y}$ using only f...
User Avatar
23 votes
3 answers
207
GATE CSE 2002 | Question: 1.14
The decimal value $0.25$ is equivalent to the binary value $0.1$ is equivalent to the binary value $0.01$ is equivalent to the binary value $0.00111$ cannot be represented precisely in binary
The decimal value $0.25$is equivalent to the binary value $0.1$is equivalent to the binary value $0.01$is equivalent to the binary value $0.00111$cannot be represented pr...
User Avatar
23 votes
2 answers
208
GATE CSE 2002 | Question: 1.12
Minimum sum of product expression for $f(w,x,y,z)$ shown in Karnaugh-map below $xz + y'z$ $xz' + zx'$ $x'y + zx'$ None of the above
Minimum sum of product expression for $f(w,x,y,z)$ shown in Karnaugh-map below $xz + y'z$$xz' + zx'$$x'y + zx'$None of the above
User Avatar
23 votes
5 answers
209
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
User Avatar
22 votes
2 answers
211
GATE CSE 1987 | Question: 1-vii
The exponent of a floating-point number is represented in excess-$\text{N}$ code so that: The dynamic range is large. The precision is high. The smallest number is represented by all zeros. Overflow is avoided.
The exponent of a floating-point number is represented in excess-$\text{N}$ code so that:The dynamic range is large.The precision is high.The smallest number is represent...
User Avatar
22 votes
3 answers
212
GATE IT 2005 | Question: 8
Using Booth's Algorithm for multiplication, the multiplier $-57$ will be recoded as $0$ -$1$ $0$0$ $1$ $0$ $0$ -$1$ $1$ $1$ $0$ $0$ $0$ $1$ $1$ $1$ $0$ -$1$ $0$ $0$ $1$0$ $0$ $0$ $0$ $1$ $0$ $0$ -$1$ $0$ $0$ $1$
Using Booth's Algorithm for multiplication, the multiplier $-57$ will be recoded as$0$ -$1$ $0$$0$ $1$ $0$ $0$ -$1$$1$ $1$ $0$ $0$ $0$ $1$ $1$ $1$$0$ -$1$ $0$ $0$ $1$$0$ ...
User Avatar
22 votes
2 answers
214
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?
User Avatar
22 votes
3 answers
215
GATE CSE 1998 | Question: 2.8
Which of the following operations is commutative but not associative? AND OR NAND EXOR
Which of the following operations is commutative but not associative?ANDORNANDEXOR
User Avatar
22 votes
2 answers
216
GATE CSE 1999 | Question: 2.17
Zero has two representations in Sign-magnitude $2's$ complement $1's$ complement None of the above
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
User Avatar
21 votes
4 answers
219
GATE CSE 2019 | Question: 6
Which one of the following is NOT a valid identity? $(x \oplus y) \oplus z = x \oplus (y \oplus z)$ $(x + y) \oplus z = x \oplus (y+z)$ $x \oplus y = x+y, \text{ if } xy=0$ $x \oplus y = (xy+x’y’)’$
Which one of the following is NOT a valid identity?$(x \oplus y) \oplus z = x \oplus (y \oplus z)$$(x + y) \oplus z = x \oplus (y+z)$$x \oplus y = x+y, \text{ if } xy=0$$...
User Avatar
Page: