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

Recent questions in Digital Logic

3 votes
1 answer
2541
GATE Overflow | Digital Logic | Test 1 | Question: 27
The number 3 in 2’s complement representation is 00000011 11111101 11111100 01111100
The number 3 in 2’s complement representation is00000011111111011111110001111100
User Avatar
1 votes
2 answers
2542
GATE Overflow | Digital Logic | Test 1 | Question: 26
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
0 votes
1 answer
2544
GATE Overflow | Digital Logic | Test 1 | Question: 24
What is minimum number of NAND gates required to implement a 2 input EX-OR gate without using any other logic gates?
What is minimum number of NAND gates required to implement a 2 input EX-OR gate without using any other logic gates?
User Avatar
0 votes
0 answers
2547
GATE Overflow | Digital Logic | Test 1 | Question: 21
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
0 votes
1 answer
2548
GATE Overflow | Digital Logic | Test 1 | Question: 20
The minimum number of $T$ –gates required to implement the following function is $F(w,x,y,z) = \sum m (0,1,2,4,7,8,9,10,12,15) $
The minimum number of $T$ –gates required to implement the following function is$$F(w,x,y,z) = \sum m (0,1,2,4,7,8,9,10,12,15) $$
User Avatar
1 votes
2 answers
2549
GATE Overflow | Digital Logic | Test 1 | Question: 19
The Min-term expansion of $F(P,Q,R)= PQ+Q\bar R+P\bar R$ is $m_2 + m_4 + m_6 + m_7$ $ m_0 + m_1 + m_6 + m_7$ $m_0 + m_1 + m_3 + m_5$ $m_2 + m_3 + m_4 + m_5$
The Min-term expansion of $F(P,Q,R)= PQ+Q\bar R+P\bar R$ is$m_2 + m_4 + m_6 + m_7$$ m_0 + m_1 + m_6 + m_7$$m_0 + m_1 + m_3 + m_5$$m_2 + m_3 + m_4 + m_5$
User Avatar
0 votes
1 answer
2550
GATE Overflow | Digital Logic | Test 1 | Question: 18
The conversion $(E7C.B)_{16}$ to octal is equal to $( 8483.9)_8$ $(6894.4)_8$ $(8124.5)_8$ $(7174.54)_8$
The conversion $(E7C.B)_{16}$ to octal is equal to$( 8483.9)_8$$(6894.4)_8$$(8124.5)_8$$(7174.54)_8$
User Avatar
0 votes
1 answer
2552
GATE Overflow | Digital Logic | Test 1 | Question: 17
Which of the following is equivalent expression to $A \oplus B \oplus C$ : $(A+B+C)(\bar A+\bar B+\bar C ) $ $( A+B+C) (\bar A +\bar B +C)$ $ABC + \bar A(B \oplus C ) + \bar B (A \oplus C )$ None
Which of the following is equivalent expression to $A \oplus B \oplus C$ :$(A+B+C)(\bar A+\bar B+\bar C ) $$( A+B+C) (\bar A +\bar B +C)$$ABC + \bar A(B \oplus C ) + \bar...
User Avatar
1 votes
1 answer
2553
GATE Overflow | Digital Logic | Test 1 | Question: 16
The output of a gated S-R flip-flop changes only if the: flip-flop is set control input data has changed flip-flop is reset input data has no change
The output of a gated S-R flip-flop changes only if the:flip-flop is setcontrol input data has changedflip-flop is resetinput data has no change
User Avatar
2 votes
1 answer
2554
GATE Overflow | Digital Logic | Test 1 | Question: 15
The addition of 4 bits two 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 bits two complement binary numbers $1101$ and $0100$ results in0001 and an overflow1001 and no overflow0001 and no overflow1001 and an overflow
User Avatar
0 votes
1 answer
2556
GATE Overflow | Digital Logic | Test 1 | Question: 13
$(1217)_8$ is equivalent to $(1217)_{16}$ $(028F)_{16}$ $(2297)_{10}$ $(0B17)_{16}$
$(1217)_8$ is equivalent to$(1217)_{16}$$(028F)_{16}$$(2297)_{10}$$(0B17)_{16}$
User Avatar
0 votes
1 answer
2559
GATE Overflow | Digital Logic | Test 1 | Question: 10
Total number of full and half-adders require to add 32 bit numbers is 16 half adders , 16 full adders 1 half-adders , 31 full-adders 32 half-adders, 0 full-adders 16 half-adders, 31 full-adders
Total number of full and half-adders require to add 32 bit numbers is16 half adders , 16 full adders1 half-adders , 31 full-adders32 half-adders, 0 full-adders16 half-add...
User Avatar
0 votes
3 answers
2560
GATE Overflow | Digital Logic | Test 1 | Question: 9
Reduce this Boolean Expression to one literal $\bar W X( \bar Z +\bar YZ ) + X( W+\bar WYZ)$ $W$ $Z$ $X$ $Y$
Reduce this Boolean Expression to one literal$$\bar W X( \bar Z +\bar YZ ) + X( W+\bar WYZ)$$$W$$Z$$X$$Y$
User Avatar
Page: