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

24 votes
3 answers
82
GATE IT 2006 | Question: 7, ISRO2009-41
The addition of $4-bit$, two's complement, binary numbers $1101$ and $0100$ results in $0001$ and an overflow $1001$ and no overflow $0001$ and no overflow $1001$ and an overflow
The addition of $4-bit$, two's complement, binary numbers $1101$ and $0100$ results in$0001$ and an overflow$1001$ and no overflow$0001$ and no overflow$1001$ and an over...
User Avatar
19 votes
5 answers
87
GATE CSE 2019 | Question: 8
Consider $Z=X-Y$ where $X, Y$ and Z are all in sign-magnitude form. X and Y are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of: $n$ bits $n-1$ bits $n+1$ bits $n+2$ bits
Consider $Z=X-Y$ where $X, Y$ and Z are all in sign-magnitude form. X and Y are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a...
User Avatar
29 votes
4 answers
91
GATE CSE 1999 | Question: 1.20
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$
Booth's coding in $8$ bits for the decimal number $-57$ is:$0-100+1000$$0-100+100-1$$0-1+100-10+1$$00-10+100-1$
User Avatar
5 votes
3 answers
95
ISRO2007-05
The characteristic equation of an $SR$ flip-flop is given by : $Q_{n+1}=S+RQ_n$ $Q_{n+1}=R\bar{Q}_n + \bar{S}Q_n$ $Q_{n+1}=\bar{S}+RQ_n$ $Q_{n+1}=S+\bar{R}Q_n$
The characteristic equation of an $SR$ flip-flop is given by :$Q_{n+1}=S+RQ_n$$Q_{n+1}=R\bar{Q}_n + \bar{S}Q_n$$Q_{n+1}=\bar{S}+RQ_n$$Q_{n+1}=S+\bar{R}Q_n$
User Avatar
40 votes
5 answers
96
GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$
Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...
User Avatar
38 votes
2 answers
98
GATE CSE 2008 | Question: 4
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds to The normalized value $2^{-127}$ The normalized value $2^{-126}$ The normalized value $+0$ The special value $+0$
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds toThe normalized value $2^{-127}$The normalized value $2^{-126}$The normal...
User Avatar
Page: