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 viewed questions in Digital Logic

33 votes
2 answers
42
GATE CSE 1996 | Question: 1.21
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is $256 \times 16$ $64 K \times 8$ $4 K \times 16$ $64 K \times 16$
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...
User Avatar
70 votes
5 answers
44
GATE CSE 2006 | Question: 8
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following circuits (using clocked D flip-flops) will delay the phase of $f$ by $180°$?
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following...
User Avatar
44 votes
7 answers
47
GATE CSE 2015 Set 3 | Question: 43
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________
User Avatar
31 votes
6 answers
48
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
65 votes
9 answers
49
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...
User Avatar
27 votes
5 answers
50
GATE CSE 2014 Set 3 | Question: 45
The above synchronous sequential circuit built using JK flip-flops 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$
The above synchronous sequential circuit built using JK flip-flops is initialized with $Q_2Q_1Q_0 = 000$. The state sequence for this circuit for the next $3$ clock cycle...
User Avatar
24 votes
6 answers
51
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
53 votes
3 answers
57
GATE CSE 2010 | Question: 8
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is $(C3D8)_{16}$ $(187B)_{16}$ $(F878)_{16}$ $(987B)_{16}$
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is$(C3D8)_{16}$$(187B)_{...
User Avatar
4 votes
3 answers
58
How many different Boolean functions are there for n Boolean variables?
How many different Boolean functions are there for $n$ Boolean variables? A. $n^ n$ B. $2^ {2^ n}$ C. $n^ {n^2}$ D. $2^ {n^2}$
How many different Boolean functions are there for $n$ Boolean variables?A. $n^ n$B. $2^ {2^ n}$ C. $n^ {n^2}$D. $2^ {n^2}$
User Avatar
0 votes
2 answers
59
A switch tail ring counter is made by using a single D FF.
A switch-tail ring counter is made by using a single D FF. The resulting circuit is (a) SR flip-flop (b) JK flip-flop (c) D flip-flop (d) T flip-flop
A switch-tail ring counter is made by using a single D FF. The resulting circuit is (a) SR flip-flop (b) JK flip-flop (c) D flip-flop...
User Avatar
Page: