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

43 votes
6 answers
61
GATE CSE 2009 | Question: 6
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates? $2$ $3$ $4$ $5$
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?$2$$3$$4$$5$
User Avatar
25 votes
6 answers
62
GATE CSE 2009 | Question: 5, ISRO2017-57
$(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
70 votes
6 answers
63
GATE CSE 2006 | Question: 36
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ ...
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ the carry in, the function that represents the carry generate function when these two numbers ...
User Avatar
66 votes
6 answers
64
GATE CSE 2007 | Question: 36
The control signal functions of a $4$-$bit$ binary counter are given below (where $X$ ... through the following sequence: $0, 3, 4$ $0, 3, 4, 5$ $0, 1, 2, 3, 4$ $0, 1, 2, 3, 4, 5$
The control signal functions of a $4$-$bit$ binary counter are given below (where $X$ is “don’t care”):$$\small {\begin{array}{|c|c|c|c|l|}\hline\textbf{Clear}& ...
User Avatar
43 votes
6 answers
65
GATE CSE 2007 | Question: 32
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$? P: $x'y'z' + w'xy' + wy'z + xz$ Q: $w'y'z' + wx'y' + xz$ ... $x'y'z' + wx'y'+ w'y$ P only Q and S R and S S only
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$?P: $x'y'z' + w'xy' + wy'z + xz$Q: $w'y'z' + wx'y...
User Avatar
27 votes
6 answers
67
GATE CSE 2002 | Question: 1.15
The $2's$ complement representation of the decimal value $-15$ is $1111$ $11111$ $111111$ $10001$
The $2's$ complement representation of the decimal value $-15$ is$1111$$11111$$111111$$10001$
User Avatar
26 votes
6 answers
68
GATE CSE 2001 | Question: 10
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer. Give a minimal product-of-sum form of the $b$ output of the following $\text{excess-3}$ to $\text{BCD}$ converter.
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer.Give a minimal product-of-sum form of the $b$ output of the following $\text{e...
User Avatar
35 votes
6 answers
69
GATE CSE 2000 | Question: 2.11
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$$xy + yw$$(w + x) (\bar{w} + y) (\bar{x} + y)$None of t...
User Avatar
4 votes
5 answers
72
NIELIT 2016 DEC Scientist B (IT) - Section B: 45
Which will be the equation of simplification of the given K-map? $AB' + B'CD' + A'B'C'$ $AB' + A'B'D' + A'B'C'$ $B'D' + AB' + B'C'$ $B'D' + A'B'C' + AB'$
Which will be the equation of simplification of the given K-map?$AB' + B'CD' + A'B'C'$$AB' + A'B'D' + A'B'C'$$B'D' + AB' + B'C'$$B'D' + A'B'C' + AB'$
User Avatar
1 votes
5 answers
73
UGC NET CSE | January 2017 | Part 2 | Question: 15
If $X$ is a binary number which is power of $2$, then the value of $X \& (X-1)$ is : $11\dots11$ $00\dots00$ $100\dots0$ $000\dots1$
If $X$ is a binary number which is power of $2$, then the value of $X \& (X-1)$ is :$11\dots11$$00\dots00$$100\dots0$$000\dots1$
User Avatar
1 votes
5 answers
74
Minimization doubt in DIGITAL LOGIC
User Avatar
19 votes
5 answers
75
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
9 votes
5 answers
78
No. of Boolean Function
Constraint Equation is given as : $F(x,y,z) = F(\bar x,y,\bar z) + F(x,\bar y,z)$ How many Boolean functions are possible for 3 variable input function F(x,y,z) such that above condition is satisfied ?
Constraint Equation is given as :$F(x,y,z) = F(\bar x,y,\bar z) + F(x,\bar y,z)$How many Boolean functions are possible for 3 variable input function F(x,y,z) such that a...
User Avatar
2 votes
5 answers
79
UGC NET CSE | December 2014 | Part 2 | Question: 06
The $\text{BCD}$ adder to add two decimal digits needs minimum of $6$ full adders and $2$ half adders $5$ full adders and $3$ half adders $4$ full adders and $3$ half adders $5$ full adders and $2$ half adders
The $\text{BCD}$ adder to add two decimal digits needs minimum of$6$ full adders and $2$ half adders$5$ full adders and $3$ half adders$4$ full adders and $3$ half adders...
User Avatar
9 votes
5 answers
80
ISRO2016-15
The Excess-$3$ code is also called Cyclic Redundancy Code Weighted Code Self-Complementing Code Algebraic Code
The Excess-$3$ code is also calledCyclic Redundancy CodeWeighted CodeSelf-Complementing CodeAlgebraic Code
User Avatar
Page: