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

Most answered questions in Digital Logic

0 votes
6 answers
43
UGC NET CSE | January 2017 | Part 2 | Question: 10
The hexadecimal equivalent of the octal number $2357$ is : $2EE$ $2FF$ $4EF$ $4FE$
The hexadecimal equivalent of the octal number $2357$ is :$2EE$$2FF$$4EF$$4FE$
User Avatar
4 votes
6 answers
44
GATE ECE 2014
Above question modification. This is the actual question Boolean expression$:(x+y)(x+\bar{y})+\overline{{(x\bar{y}+\bar{x})}}$ $(A) x$ $(B)y$ $(C)xy$ $(D)x+y$
Above question modification.This is the actual questionBoolean expression$:(x+y)(x+\bar{y})+\overline{{(x\bar{y}+\bar{x})}}$$(A) x$ $(B)y$ $(C)xy$...
User Avatar
23 votes
6 answers
46
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
15 votes
6 answers
48
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABC A . AB B . B'C C . AB+(A'+AB')C D . AB'+BC+B'C'
Simplified Boolean expression for A'BC+AB'C'+A'B'C'+AB'C+ABCA . ABB . B'CC . AB+(A'+AB')CD . AB'+BC+B'C'
User Avatar
10 votes
6 answers
49
ISRO2015-8
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$ Assume that inputs are available only in true form and Boolean a constant $1$ and $0$ are available. $1$ $2$ $3$ $7$
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$As...
User Avatar
7 votes
6 answers
50
ISRO-2013-17
Two eight bit bytes $1100 0011$ and $0100 1100$ are added. What are the values of the overflow, carry and zero flags respectively, if the arithmetic unit of the CPU uses $2$'s complement form? $0, 1, 1'$ $1, 1, 0$ $1, 0, 1$ $0, 1, 0$
Two eight bit bytes $1100 0011$ and $0100 1100$ are added. What are the values of the overflow, carry and zero flags respectively, if the arithmetic unit of the CPU use...
User Avatar
23 votes
6 answers
54
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
31 votes
6 answers
55
GATE CSE 1995 | Question: 2.12, ISRO2015-9
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are: $8$ $9$ $10$ $12$
The number of $1$'s in the binary representation of $(3\ast4096 + 15\ast256 + 5\ast16 + 3)$ are:$8$$9$$10$$12$
User Avatar
27 votes
6 answers
56
GATE CSE 2011 | Question: 15
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is 9 8 512 258
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is98512258
User Avatar
41 votes
6 answers
59
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$...
User Avatar
24 votes
6 answers
60
GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
User Avatar
Page: