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

Hot questions in Digital Logic

0 votes
1 answer
2851
number of comparison in A>B , A<B , A=B using digital logic .
User Avatar
0 votes
2 answers
2852
Mux output
User Avatar
0 votes
0 answers
2853
digital logic
pls explain using waveform ..
pls explain using waveform ..
User Avatar
2 votes
2 answers
2854
max negative value value in 8 bit
in 8 bit representation max +ve value is +127 which is understandable as 01111111 but max - ve value is -128 how it can be stored as left most bit will always be 1 and rest 7 bits can only store 111111 i.e max of 127 so how -128 is stored
in 8 bit representation max +ve value is +127 which is understandable as 01111111 but max - ve value is -128 how it can be stored as left most bit will always be 1 a...
User Avatar
1 votes
1 answer
2855
doubt
User Avatar
0 votes
1 answer
2858
explain ??
User Avatar
0 votes
0 answers
2859
output of LED
Explanation to this..?
Explanation to this..?
User Avatar
–2 votes
0 answers
2860
GATE 2010 MULTIPLEXER
User Avatar
0 votes
1 answer
2862
UGC NET CSE | August 2016 | Part 2 | Question: 8
The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is $AB + CD + A\bar{B} + AD$ $AB + AC + AD + BCD$ $AB + AD + BC + ACD$ $AB + AC + BC + BCD$
The Karnaugh map for a Boolean function is given asThe simplified Boolean equation for the above Karnaugh Map is$AB + CD + A\bar{B} + AD$$AB + AC + AD + BCD$ $AB + AD + B...
User Avatar
1 votes
2 answers
2863
Digitial
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately (A) 50 (B) 60 (C) 70 (D) 75
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately(A) 50(B) 60(C) 70(D) 75
User Avatar
0 votes
0 answers
2864
doubt
User Avatar
1 votes
1 answer
2865
Digital doubt:
We can implement every boolean function of $n$ variables using $2^n*1$ MUX or $2^{n-1}*1$ MUX? Which one is correct ? How?
We can implement every boolean function of $n$ variables using $2^n*1$ MUX or $2^{n-1}*1$ MUX?Which one is correct ? How?
User Avatar
0 votes
0 answers
2866
digital logic doubt
User Avatar
0 votes
0 answers
2867
SHIFT REGISTER
any one explain the circuit diagram,what modifications done by AND gate to the i/p??
any one explain the circuit diagram,what modifications done by AND gate to the i/p??
User Avatar
0 votes
1 answer
2868
Ace : here it will b signed or unsigned ?
User Avatar
1 votes
1 answer
2870
Select correct statement about cache
I. Cache memory can be placed in between main memory and secondary storage II. Cache memory can be used as secondary storage also. Select correct statements A. I only B. II only C. I and II D. None
I. Cache memory can be placed in between main memory and secondary storageII. Cache memory can be used as secondary storage also.Select correct statementsA. I only B. II ...
User Avatar
Page: