Register

Recent questions and answers in Digital Logic

10.9k
views
7 answers
22 votes
GATE CSE 2021 Set 1 | Question: 42
Consider the following Boolean expression.$F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)$Which of the following Boolean expressions is/are equivalent to $\overline F$ ( ...
User Avatar
482
views
2 answers
1 votes
ISI2017-PCB-CS-7-a
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.
User Avatar
15.6k
views
6 answers
38 votes
GATE IT 2005 | Question: 43
Which of the following input sequences will always generate a $1$ at the output $z$ ...
User Avatar
2.2k
views
5 answers
2 votes
UGC NET CSE | October 2020 | Part 2 | Question: 42
Simplified expression/s for following Boolean function$F(A,B,C,D)=\Sigma(0,1,2,3,6,12,13,14,15)$ is/are$A'B'+AB+A'C'D'$A'B'+AB+A'CD'$A'B'+AB+BC'D'$A'B'+AB+BCD ... given below:$(i)$ only$(ii)$ only$(i)$ and $(ii)$ only$(ii)$ and $(iv)$ only
User Avatar
348
views
2 answers
0 votes
k maps
User Avatar
21.7k
views
6 answers
36 votes
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$8$9$10$
User Avatar
8.2k
views
5 answers
21 votes
GATE CSE 1990 | Question: 1-iv-a
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$The range of the exponent is ___________
User Avatar
169
views
1 answers
1 votes
A is the correct answer.Can anyone please explain why statement 2 is false
User Avatar
13.5k
views
9 answers
46 votes
GATE CSE 2015 Set 1 | Question: 37
A positive edge-triggered $D$ flip-flop is connected to a positive edge-triggered $JK$ flip-flop as follows. The $Q$ output of the $D$ ... $0100100\ldots$011101110\ldots$011001100\ldots$
User Avatar
1.4k
views
1 answers
0 votes
From a given tautology, another tautology can be derived by interchanging
From a given tautology, another tautology can be derived by interchanging.A). 0 and 1B) And and ORC) 0 and 1; And and ORD) Impossible to derive
User Avatar
162
views
0 answers
0 votes
Asked in Bihar STET 2023 computer science
What is the simplified expression for the Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14) using the K-map method?(A) A'B'C'D' + A ... BC'D + ABC'D + ABCD(D) A'B'C'D' + A'BC'D' + A'BCD + ABCD
User Avatar
178
views
1 answers
2 votes
Digital Logic
What is the maximum n-bit number in base x ,when represented in decimal(10)?
User Avatar
123
views
1 answers
0 votes
Self Doubt : Number of CLK pulse
I have a 3 bit shift register SISO (serial in and serial out) I took 3 CLK (clock) pulse to insert 1 0 1 and now I need to retrive them serially How ... N-1 CLK pulses but there is no explanation given. Can some one explain me why .Thanks
User Avatar
126
views
1 answers
0 votes
Expression Evaluation
44. Evaluate each of these expressions. a) 1 1000 ∧ (0 1011 ∨ 1 1011) b) (0 1111 ∧ 1 0101) ∨ 0 1000 c) (0 1010 ⊕ 1 1011) ⊕ 0 1000 d) (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011)
User Avatar
5.5k
views
5 answers
26 votes
GATE CSE 1987 | Question: 1-II
The total number of Boolean functions which can be realised with four variables is:$4$17$256$65, 536$
User Avatar
140
views
0 answers
0 votes
Circuit Design
Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.
User Avatar
4.2k
views
6 answers
6 votes
ISRO2014-15
Consider the logic circuit given below:$\text{Q =}$ __________?$\overline{\text{A}} \text{C} + \text{B} \overline{\text{C}} +\text{CD}$\text{ABC} + \overline{\text{C}} ...
User Avatar
5.5k
views
5 answers
24 votes
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
User Avatar
7.3k
views
2 answers
9 votes
ISRO2016-7
The minimum number of $\text{NAND}$ gates required to implement the Boolean function $A + A\overline{B} + A\overline{B}C$ is equal to$0$ (Zero)$1$4$7$
User Avatar
146
views
0 answers
0 votes
Exam
Design a 3-bit code to represent each of the six digits of the base-6 number system. Make the binary code self-complementing so that the 5's complement is obtained by changing 1's to 0's and Os to 1's in all bits of the coded numbers.
User Avatar
3.2k
views
1 answers
2 votes
GATE CSE 2024 | Set 2 | Question: 4
The format of a single-precision floating-point number as per the $\text{IEEE 754}$ standard is:Sign ... $0$11111111$11111111111111111111111$ SignExponentMantissa$0$01111111$00000000000000000000000$
User Avatar
2.8k
views
4 answers
5 votes
GATE CSE 2024 | Set 2 | Question: 20
​​​​For a Boolean variable $x$, which of the following statements is/are FALSE?$x .1=x$x+1=x$x \cdot x=0$x+\bar{x}=1$
User Avatar
2.4k
views
1 answers
3 votes
GATE CSE 2024 | Set 2 | Question: 39
Which of the following is/are EQUAL to $224$ in radix - $5$ (i.e., base - $5$) notation?$64$ in radix -10$100$ in radix -8$50$ in radix -16$121$ in radix -7
User Avatar
2.3k
views
1 answers
4 votes
GATE CSE 2024 | Set 2 | Question: 40
Consider $4$-variable functions $f 1, f 2, f 3, f 4$ ... {Y}=\sum(0,1,2,3,4,5,6,7)$\boldsymbol{Y}=\Pi(8,9,10,11,12,13,14,15)$
User Avatar
4.9k
views
5 answers
5 votes
GATE CSE 2024 | Set 1 | Question: 3
Consider a system that uses $5$ bits for representing signed integers in $2$ 's complement format. In this system, two integers $A$ and $B$ are represented as $A$= ... $A-B$B-A$2 * B$
User Avatar
3.0k
views
1 answers
3 votes
GATE CSE 2024 | Set 1 | Question: 18
Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no ... transient logic Zero after $X$ transitions from logic One to logic Zero
User Avatar
2.5k
views
2 answers
2 votes
GATE CSE 2024 | Set 1 | Question: 37
Consider a Boolean expression given by $\text{F(X, Y, Z)}=\sum(3,5,6,7)$.Which of the following statements is/are CORRECT?$\text{F(X, Y, Z)}=\Pi(0,1,2,4)$ ... $\text{F(X, Y, Z)}$ is independent of input $\text{X}$
User Avatar
2.8k
views
3 answers
3 votes
GATE CSE 2024 | Set 1 | Question: 54
Consider a digital logic circuit consisting of three $2$-to-$1$ multiplexers $\text{M1, M2}$, and $\text{M3}$ as shown below. $\mathrm{X} 1$ ... $\mathbf{Y}=\mathbf{1}$ is ____________.
User Avatar
273
views
1 answers
0 votes
self doubts
how to simplify this boolean function i tend to get confuse on this given problem F(a,b,c)=(AB+AC)'+A'B'C
User Avatar
682
views
1 answers
2 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 28
Consider function $\mathbf{G}(\mathbf{A}, \mathbf{B}, \mathbf{C})=\mathbf{A B}+\mathbf{B C}$. Let $\mathbf{F}(\mathbf{A}, \mathbf{B}, \mathbf{C})$ ... correct implementation of $\mathbf{F}(\mathbf{A}, \mathbf{B}, \mathbf{C})$ is shown in:
User Avatar
627
views
1 answers
5 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 29
The largest positive number in 2's complement format represented with 8-bits is:$(\mathrm{FF})_{16}$(128)_{10}$(777)_8$(01111111)_2$
User Avatar
597
views
1 answers
6 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 30
Consider the function ...
User Avatar
653
views
1 answers
2 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 59
Consider the shift register circuit shown in below figure. Assume that $\mathbf{I}_3 \mathbf{I}_2 \mathbf{I}_1 \mathbf{I}_0=0101$ has been loaded in the 4- ... clock signal we need to keep shift=1 such that zero detect is activated to a 1?
User Avatar
397
views
0 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 60
The logic circuit above is used to compare two unsigned 2-bit numbers, $X_1 X_0=X$ and $Y_1 Y_0=Y$, where $X_0$ and $Y_0$ are the least significant bits. (A small circle on any ... $ have the value 1?$X\gt Y$X\lt Y$X=Y$X \neq Y$
User Avatar
773
views
2 answers
6 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 61
According to the IEEE standard, a 32-bit, single-precision, floating-point number $N$ is defined to be$N=(-1)^S \times 1 . F \times 2^{E-127}$where $S$ is the sign bit, ... \right) * 2^{128}$\left(1+\left(1-2^{-23}\right)\right) * 2^{128}$
User Avatar
429
views
1 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 25
A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its input, and ... $3 - (1/0)$Arrow $4 - (1/0)$Arrow $5 - (1/1)$
User Avatar
445
views
1 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 26
The figure below represents the Karnaugh map for a function $\text{F(A,B,C,D).}$ Note, $\text{ X'}$ stands for don't care.The simplified ... can be converted into a circuit implementation using only NAND gates, which is shown in:abcd
User Avatar
467
views
2 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 27
What statement is correct for $f(A, B)$ in the following circuit?$f(A, B)=\overline{\overline{A \cdot B} \cdot(A+B)}$ when Control $=1$ ... }$ when Control $=1$f(A, B)=\overline{A} \cdot \overline{B}$ when Control $=0$
User Avatar
583
views
1 answers
5 votes
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 29
In two's complement, what is the minimum number of bits needed to represent the numbers $-1$ and the number $1$ respectively?$1$ and $2$2$ and $2$2$ and $1$1$ and $1$
User Avatar
To see more, click for all the questions in this category.