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
2361
made easy
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 thefunction f(x, y, z) satisfying the relation f(~x,y,~z) = f(x,y,z) is ___________.
User Avatar
3 votes
2 answers
2362
Made Easy
In the circuit shown below, the propagation delay of each NOT gate is 2 nsec (2 nano sec), then the time period of generated square wave is – How to solve these kind of question ?
In the circuit shown below, the propagation delay of each NOT gate is 2 nsec (2nano sec), then the time period of generated square wave is –How to solve these kind of q...
User Avatar
5 votes
1 answer
2363
GATE CSE 1990 | Question: 8b
State the Booth's algorithm for multiplication of two numbers. Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two $8$-bit signed numbers.
State the Booth's algorithm for multiplication of two numbers. Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two $8$...
User Avatar
23 votes
6 answers
2365
GATE CSE 1990 | Question: 5-b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.
Show with the help of a block diagram how the Boolean function :$f=AB+BC+CA$can be realised using only a $4:1$ multiplexer.
User Avatar
19 votes
3 answers
2366
GATE CSE 1990 | Question: 5-a
Find the minimum product of sums of the following expression $f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$
Find the minimum product of sums of the following expression$f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$
User Avatar
10 votes
1 answer
2367
GATE CSE 1990 | Question: 4-i
State whether the following statements are TRUE or FALSE with reason: RAM is a combinational circuit and PLA is a sequential circuit.
State whether the following statements are TRUE or FALSE with reason:RAM is a combinational circuit and PLA is a sequential circuit.
User Avatar
1 votes
2 answers
2368
Digital
2's complement of $-(96.75)_{10}$?
2's complement of $-(96.75)_{10}$?
User Avatar
0 votes
1 answer
2370
digitals
How many minimum number of 2:1 multiplexer required to implement half substractor??
How many minimum number of 2:1 multiplexer required to implement half substractor??
User Avatar
0 votes
2 answers
2371
Digital Logic , IES 2005
What is the minimized logic expression corresponding to the fiven K-map?
What is the minimized logic expression corresponding to the fiven K-map?
User Avatar
1 votes
2 answers
2373
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
1 votes
1 answer
2374
Digitial
Minimum number of NAND gates required to realize full adder circuit if the variables are present in prime and unprimed form is?Explain through figure?
Minimum number of NAND gates required to realize full adder circuit if the variables are present in prime and unprimed form is?Explain through figure?
User Avatar
0 votes
2 answers
2375
Lookahead aader
Which of the following statements is/are true? S1: Carry lookahead adder is faster compared to a ripple carry adder. S2: The cost is higher for a carry lookahead adder compared to a ripple carry adder. (A) S1 only (B) S2 only (C) Both (D) None of these
Which of the following statements is/are true?S1: Carry lookahead adder is faster compared to a ripple carry adder.S2: The cost is higher for a carry lookahead adder comp...
User Avatar
1 votes
2 answers
2376
Digitial
In which of the following situations, x ⊕ x ⊕ x ⊕ ... = 1? (A) When number of x are even and x = 1 (B) When number of x are odd and x = 1 (C) When number of x are odd and x = 0 (D) Never Explain how?
In which of the following situations, x ⊕ x ⊕ x ⊕ ... = 1?(A) When number of x are even and x = 1(B) When number of x are odd and x = 1(C) When number of x are odd ...
User Avatar
1 votes
1 answer
2377
gate 1999
RAM is combinational circuit and PLA is Sequential circuit ?
RAM is combinational circuit and PLA is Sequential circuit ?
User Avatar
2 votes
1 answer
2378
Digital Logic
Sorry for Alignment Its always Somehow coming Rotated. Please help me for Solution
Sorry for Alignment Its always Somehow coming Rotated. Please help me for Solution
User Avatar
1 votes
1 answer
2379
digitals
plz someone draw its circuit,how it work....
plz someone draw its circuit,how it work....
User Avatar
Page: