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{2024-1} & \textbf{2024-2}  & \textbf{2023}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2&2&2&1&2&3&1&2&3
\\\hline\textbf{2 Marks Count} & 2&2&2&2&2&2&2&2&2
\\\hline\textbf{Total Marks} & 6&6&6&5&6&7&\bf{5}&\bf{6}&\bf{7}\\\hline
\end{array}}}$$

Filter

Recent questions in Digital Logic

1 votes
1 answer
2341
Test by Bikram | Digital Logic | Test 2 | Question: 15
The number of control lines for $16$ to $1$ multiplexer is ___. $2$ $4$ $3$ $5$
The number of control lines for $16$ to $1$ multiplexer is ___.$2$$4$$3$$5$
User Avatar
2 votes
4 answers
2342
Test by Bikram | Digital Logic | Test 2 | Question: 16
Karnaugh map is used for the purpose of: Reducing the electronic circuits used. Mapping the given Boolean logic function. Minimizing the terms in a Boolean expression. Maximizing the terms of a given a Boolean expression.
Karnaugh map is used for the purpose of:Reducing the electronic circuits used.Mapping the given Boolean logic function.Minimizing the terms in a Boolean expression.Maximi...
User Avatar
1 votes
1 answer
2343
Test by Bikram | Digital Logic | Test 2 | Question: 17
The device which changes from serial data to parallel data is: COUNTER MULTIPLEXER DEMULTIPLEXER FLIP-FLOP
The device which changes from serial data to parallel data is:COUNTERMULTIPLEXERDEMULTIPLEXERFLIP-FLOP
User Avatar
1 votes
2 answers
2344
Test by Bikram | Digital Logic | Test 2 | Question: 18
How many flip flops are required to construct a decade counter? $10$ $3$ $4$ $2$
How many flip flops are required to construct a decade counter?$10$$3$$4$$2$
User Avatar
17 votes
2 answers
2345
Test by Bikram | Digital Logic | Test 2 | Question: 10
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ? $2, 2$ $4, 2$ $3, 2$ $2, 3$
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ?$2, 2$$4, 2$$3, 2$$2, 3$
User Avatar
1 votes
1 answer
2346
Test by Bikram | Digital Logic | Test 2 | Question: 11
In a JK Flip-Flop, “toggle” means: Set $Q = 1$ and $Q = 0$. Set $Q = 0$ and $Q = 1$. Change the output to the opposite state. No change in output.
In a JK Flip-Flop, “toggle” means:Set $Q = 1$ and $Q = 0$.Set $Q = 0$ and $Q = 1$.Change the output to the opposite state.No change in output.
User Avatar
2 votes
1 answer
2347
Test by Bikram | Digital Logic | Test 2 | Question: 12
The decimal equivalent of hex number $1A53$ is: $6793$ $6739$ $6973$ $6379$
The decimal equivalent of hex number $1A53$ is:$6793$$6739$$6973$$6379$
User Avatar
1 votes
1 answer
2348
Test by Bikram | Digital Logic | Test 2 | Question: 13
Which of the following combinations is sufficient to build a half adder? EX-OR gate and NOR gate. EX-OR gate and OR gate. EX-OR gate and AND gate. Four NAND gates.
Which of the following combinations is sufficient to build a half adder?EX-OR gate and NOR gate.EX-OR gate and OR gate.EX-OR gate and AND gate.Four NAND gates.
User Avatar
2 votes
1 answer
2349
Test by Bikram | Digital Logic | Test 2 | Question: 14
DeMorgan’s first theorem shows the equivalence of: OR gate and Exclusive OR gate. NOR gate and Bubbled AND gate. NOR gate and NAND gate. NAND gate and NOT gate
DeMorgan’s first theorem shows the equivalence of:OR gate and Exclusive OR gate.NOR gate and Bubbled AND gate.NOR gate and NAND gate.NAND gate and NOT gate
User Avatar
2 votes
1 answer
2350
Test by Bikram | Digital Logic | Test 2 | Question: 6
When simplified with Boolean Algebra, $(x + y)(x + z)$ simplifies to: $x$ $x + x(y + z)$ $x(1 + yz)$ $x + yz$
When simplified with Boolean Algebra, $(x + y)(x + z)$ simplifies to:$x$$x + x(y + z)$$x(1 + yz)$$x + yz$
User Avatar
1 votes
1 answer
2352
Test by Bikram | Digital Logic | Test 2 | Question: 8
Shifting a register content to left by one bit position is equivalent to: Division by two. Addition by two. Multiplication by two. Subtraction by two.
Shifting a register content to left by one bit position is equivalent to:Division by two.Addition by two.Multiplication by two.Subtraction by two.
User Avatar
1 votes
3 answers
2353
Test by Bikram | Digital Logic | Test 2 | Question: 9
A 4-bit synchronous counter uses flip-flops with propagation delay times of $15$ ns each. The maximum possible time required for change of state will be _____. $15$ ns $30$ ns $45$ ns $60$ ns
A 4-bit synchronous counter uses flip-flops with propagation delay times of $15$ ns each. The maximum possible time required for change of state will be _____.$15$ ns$30$...
User Avatar
1 votes
1 answer
2354
Test by Bikram | Digital Logic | Test 2 | Question: 2
The inputs of a NAND gate are connected together. The resulting circuit is ______. an OR gate an AND gate a NOT gate None of the above
The inputs of a NAND gate are connected together. The resulting circuit is ______.an OR gatean AND gatea NOT gateNone of the above
User Avatar
2 votes
1 answer
2355
Test by Bikram | Digital Logic | Test 2 | Question: 3
What is the binary equivalent of the decimal number $368$? $101110000$ $110110000$ $111010000$ $111100000$
What is the binary equivalent of the decimal number $368$?$101110000$$110110000$$111010000$$111100000$
User Avatar
1 votes
1 answer
2356
Test by Bikram | Digital Logic | Test 2 | Question: 4
How many Flip-Flops are required for mod –$16$ counter? $5$ $6$ $3$ $4$
How many Flip-Flops are required for mod –$16$ counter?$5$$6$$3$$4$
User Avatar
1 votes
1 answer
2357
Test by Bikram | Digital Logic | Test 2 | Question: 5
The Boolean expression $ A \cdot B+ A \cdot B+ A \cdot B$ is equivalent to: $A + B$ $A \cdot B$ $A \oplus B$ $A \cdot B + A' B'$
The Boolean expression $ A \cdot B+ A \cdot B+ A \cdot B$ is equivalent to:$A + B$$A \cdot B$$A \oplus B$$A \cdot B + A' B'$
User Avatar
2 votes
2 answers
2358
Test by Bikram | Digital Logic | Test 2 | Question: 1
A minimum sum-of-products expression of the function $F(w, x, y,z) = \Sigma m ( 0, 2, 5, 8, 10, 13, 14 )$ using Karnaugh map is: $x'z+xy+yxz$ $x'z' + xy'z + wyz'$ $x'z' + xy'z + wyz$ $x'z' + xy'z' + wyz$
A minimum sum-of-products expression of the function $F(w, x, y,z) = \Sigma m ( 0, 2, 5, 8, 10, 13, 14 )$ using Karnaugh map is:$x'z+xy+yxz$$x'z' + xy'z + wyz'$$x'z' + xy...
User Avatar
15 votes
4 answers
2359
ME test
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the maximum frequency of the MOD256 counter ? (in MHz)
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the...
User Avatar
3 votes
1 answer
2360
made easy
For a Mod10 counter, Jhonson counter uses X FF′s, ring counter uses y FF′s, and ripple counter uses Z FF′s. Then X + Y + Z will ________.
For a Mod10counter, Jhonson counter uses X FF′s, ring counter uses y FF′s, andripple counter uses Z FF′s. Then X + Y + Z will ________.
User Avatar
Page: