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

68 votes
4 answers
2902
Minimum NAND/NOR Gates - Realization for ExOR,ExNor,Adder,Subtractor
Minimum No of Gates NAND/NOR Ex-OR Ex-Nor Half Adder Half Subtractor Full Adder Full Subtractor NAND ? ? ? ? ? ? NOR ? ? ? ? ? ?
Minimum No of Gates NAND/NOR Ex-OREx-NorHalf AdderHalf SubtractorFull AdderFull SubtractorNAND??????NOR??????
User Avatar
0 votes
1 answer
2903
find the output of the decoder
The boolean expression f (x, y, z) in its canonical form for the decoder circuit shown below is Π M(4, 6) Σ m(0, 1, 2, 3, 5, 7) Σ m(4, 6) Π M(0, 1, 2, 3, 5)
The boolean expression f (x, y, z) in its canonical form for the decoder circuit shown below isΠ M(4, 6)Σ m(0, 1, 2, 3, 5, 7)Σ m(4, 6)Π M(0, 1, 2, 3, 5)...
User Avatar
1 votes
1 answer
2906
Digital Counter Problem
User Avatar
3 votes
1 answer
2908
boolean expressions
The maximum number of boolean expressions that can be formed for the function f(x,y,z) satisfying the relation f(x',y,z')=f(x,y,z) is
The maximum number of boolean expressions that can be formed for the function f(x,y,z) satisfying the relation f(x',y,z')=f(x,y,z) is
User Avatar
10 votes
1 answer
2909
hexadecimal subtraction
Given that $(E0B)_{16}-(ABF)_{16}=Y$. The radix 8’s compliment of Y is ?
Given that $(E0B)_{16}-(ABF)_{16}=Y$.The radix 8’s compliment of Y is ?
User Avatar
1 votes
3 answers
2910
POS and SOP
when we can say POS and SOP are same ?
when we can say POS and SOP are same ?
User Avatar
2 votes
1 answer
2911
How to approach this problem
Given answer: A Please explain
Given answer: APlease explain
User Avatar
8 votes
2 answers
2912
Boolean expression from venn diagram
The Boolean Expression for the shaded area in the venn diagram. $A\bar{C}W + \bar{AB}CW$ $ABC + \bar{A}BW$ $(A+B+C) W$ $AW + \bar{B}W+AB$ I couldn't understand the explaination of the above problem please explain.
The Boolean Expression for the shaded area in the venn diagram.$A\bar{C}W + \bar{AB}CW$$ABC + \bar{A}BW$$(A+B+C) W$$AW + \bar{B}W+AB$I couldn't understand the explainatio...
User Avatar
4 votes
1 answer
2913
Is this question part of syllabus?
Given answer: B
Given answer: B
User Avatar
2 votes
1 answer
2914
What's the best way to approach this question in digital logic?
Given answer: A Please explain
Given answer: APlease explain
User Avatar
2 votes
4 answers
2915
Identifying self dual function
Given answer: D I am not getting how to approach this question.
Given answer: DI am not getting how to approach this question.
User Avatar
1 votes
2 answers
2917
How to approach this question on digital logic?
Given answer: D Please explain
Given answer: DPlease explain
User Avatar
13 votes
1 answer
2918
TIFR CSE 2015 | Part A | Question: 4
The Boolean function obtained by adding an inverter to each and every input of an $\text{AND}$ gate is: $\text{OR}$ $\text{XOR}$ $\text{NAND}$ $\text{NOR}$ None of the above
The Boolean function obtained by adding an inverter to each and every input of an $\text{AND}$ gate is:$\text{OR}$$\text{XOR}$$\text{NAND}$$\text{NOR}$None of the above
User Avatar
1 votes
1 answer
2920
no. of gates
User Avatar
Page: