Register
Webpage for Digital Logic:

Recent questions tagged digital-logic

2 votes
3 answers
1142
minimization
Let $‘1’$ and $‘0’$ denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$: $F(P, Q) = ( ( 1 \oplus P) \oplus (P \oplus Q) ) \oplus ( (P \oplus Q) \oplus (Q \oplus 0) ) $ The equivalent expression for $F$ is
Let $‘1’$ and $‘0’$ denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$:$F(P, Q) = ( ( 1 \oplus P) \oplu...
User Avatar
0 votes
1 answer
1143
digital logic
can we implement a function of $3$ variable in pos using a decoder of $2 \times 4$ and multiplexer $2 \times 1$??
can we implement a function of $3$ variable in pos using a decoder of $2 \times 4$ and multiplexer $2 \times 1$??
User Avatar
0 votes
1 answer
1144
digital logic,combinational circuit
in Decoders can we implement functions in POS?
in Decoders can we implement functions in POS?
User Avatar
4 votes
1 answer
1145
Number system
Q. Find $r_1$ and $r_2$ without using quadratic equation. $(235)​​​_{r_1}= (565)_{10}=(1065)_{r_2}$ a) $r_1=16$ & $r_2=8$ b) $r_1=10$ & $r_2=16$
Q. Find $r_1$ and $r_2$ without using quadratic equation. $(235)​​​_{r_1}= (565)_{10}=(1065)_{r_2}$a) $r_1=16$ & $r_2=8$b) $r_1=10$ & $r_2=16$
User Avatar
1 votes
2 answers
1147
K MAP
what will be the k Map for- $(P+Q'+R').(P+Q'+R).(P+Q+R')$ and the simplified SOP (Sum of Product) for the above the Boolean expression? Please try to make a k map in this format-
what will be the k Map for-$(P+Q'+R').(P+Q'+R).(P+Q+R')$and the simplified SOP (Sum of Product) for the above the Boolean expression?Please try to make a k map in this fo...
User Avatar
1 votes
3 answers
1148
k map
Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0. what will be the SOP?
Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0. what will be the SOP?
User Avatar
1 votes
2 answers
1149
k map minimization digital logic
What is the minimal $Sum-Of-Products$ of the map? ($X$ is a don't care)
What is the minimal $Sum-Of-Products$ of the map? ($X$ is a don't care)
User Avatar
0 votes
4 answers
1150
Gradeup question doubt
$x(x+x'y)z(x+y+z)$ simplifies to (A)$x+x'y$ (B)$x+y+z$ (C)$xyz$ (D)$xz$ Answer is (D) But I can not obtain $xz$ only. My solutions is as follows: x(x+x'y)z(x+y+z) =(x+y)(xz+yz+z) =xz+xyz+xz+xyz+yz+yz =xz+yz+xyz =xz(1+y)+yz =xz+yz Can anyone tell where I made mistake?
$x(x+x'y)z(x+y+z)$ simplifies to(A)$x+x'y$(B)$x+y+z$(C)$xyz$(D)$xz$Answer is (D)But I can not obtain $xz$ only.My solutions is as follows:x(x+x'y)z(x+y+z)=(x+y)(xz+yz+z)=...
User Avatar
0 votes
2 answers
1151
CIRCUIT OUTUT
I/P TO NAND GATE IS - A,B I/P TO NOT GATE IS - C WHAT WIL BE THE O/P - F?
I/P TO NAND GATE IS - A,B I/P TO NOT GATE IS - C WHAT WIL BE THE O/P - F?
User Avatar
0 votes
3 answers
1152
digital circuit output
$\text{what is the o/p of this circuit ?}$
$\text{what is the o/p of this circuit ?}$
User Avatar
0 votes
0 answers
1153
DEMUX
Suppose a $2$ to $2^{n}$ DEMUX got an input from a n bit Ring counter. The output of the DMUX can be a)a up counter b)a down counter c)a counter
Suppose a $2$ to $2^{n}$ DEMUX got an input from a n bit Ring counter. The output of the DMUX can bea)a up counterb)a down counterc)a counter
User Avatar
0 votes
1 answer
1154
Registers
How it is gray code conversion?....!!! i think output should be 00000000
How it is gray code conversion?....!!!i think output should be 00000000
User Avatar
0 votes
1 answer
1155
Counter
Answer given is 4 but mine is 2
Answer given is 4 but mine is 2
User Avatar
0 votes
1 answer
1156
Flipflop
Answer is TQ'+T'[Q(s+r')+sr']
Answer is TQ'+T'[Q(s+r')+sr']
User Avatar
0 votes
1 answer
1157
Adder
One ripple carry adder is adding two n-bit integers. The time complexity to perform addition using this adder is (We know carry look ahead adder takes time log n. Is it similar for other adders too). Plz also share some good resource about these two adders
One ripple carry adder is adding two n-bit integers. The time complexity to perform addition using this adder is (We know carry look ahead adder takes time log n. Is it s...
User Avatar
1 votes
1 answer
1158
Overflow
1)Why 1's complement number cannot represent an overflow? 2)Is signed bit need to detect overflow? 3)Is Sum bit (not carry bit) participate to detect overflow?
1)Why 1's complement number cannot represent an overflow?2)Is signed bit need to detect overflow?3)Is Sum bit (not carry bit) participate to detect overflow?
User Avatar
0 votes
1 answer
1160
Why only Three Basic Logic Gates are there? can anyone explain the logic behind three basic Gate?
Why only Three Basic Logic Gates are there? can anyone explain the logic behind three basic Gate?
Why only Three Basic Logic Gates are there? can anyone explain the logic behind three basic Gate?
User Avatar
0 votes
0 answers
1161
Doubt
Why self dual functions are required?
Why self dual functions are required?
User Avatar
0 votes
0 answers
1162
Morris Mano-chapter 5. Programmable Logic Array
I just wanted to know whether I may leave the sections 5.8 (Programmable Logic Array) and section 5.9 (Programmable Array Logic) of Morris Mano book for GATE preparation. Are they important with respect to GATE ??
I just wanted to know whether I may leave the sections 5.8 (Programmable Logic Array) and section 5.9 (Programmable Array Logic) of Morris Mano book for GATE preparation....
User Avatar
0 votes
1 answer
1163
logic gates
The inverter OR gate and AND gate are called decision-making elements because they can recognize some input _____ while disregarding others. A gate recognizes a word when its output is _____ (a) words, high (b) bytes, low (c) bytes, high (d) character, low
The inverter OR gate and AND gate are called decision-making elements because they can recognize some input _____ while disregarding others. A gate recognizes a word when...
User Avatar
0 votes
0 answers
1164
Not Gate
We know in case of And we take intersection of Minterms and in case of OR we take union of the minterms what about in case of Not gate. Is it like :- Say F(A,B,C) = (0,1,2,4,6) then not F = (3,5,7) is it right ?
We know in case of And we take intersection of Minterms and in case of OR we take union of the minterms what about in case of Not gate. Is it like :-Say F(A,B,C) = (0,1,2...
User Avatar
1 votes
1 answer
1165
Morris Mano (5th edition) Exercise 3.18
Draw a logic diagram using only two-input NOR gates to implement the following function: $F(A,B,C,D)$ = $\left (A \oplus B \right )^{'} \left ( C \oplus D \right )$
Draw a logic diagram using only two-input NOR gates to implement the following function:$F(A,B,C,D)$ = $\left (A \oplus B \right )^{'} \left ( C \oplus D \right )$
User Avatar
4 votes
3 answers
1168
ISRO2018-19
Given $\sqrt{224_{r}}$= $13$_{r}$ the value of radix $r$ is $10$ $8$ $6$ $5$
Given $\sqrt{224_{r}}$= $13$$_{r}$ the value of radix $r$ is$10$$8$$6$$5$
User Avatar
4 votes
3 answers
1169
ISRO2018-32
A computer uses ternary system instead of the traditional systen, An $n$ bit string in the binary system will occupy $3+n$ ternary digits $2n/3$ ternary digits $n$\log_{2}3$ ternary digits $n$\log_{3}2$ ternary digits
A computer uses ternary system instead of the traditional systen, An $n$ bit string in the binary system will occupy$3+n$ ternary digits$2n/3$ ternary digits$n$$\log_{2}3...
User Avatar
4 votes
2 answers
1170
ISRO2018-62
Any set of Boolean operation that is sufficient to represent all Boolean expression is said to be complete. Which of the following is not complete ? $\text{{AND, OR}}$ $\text{{AND, NOT}}$ $\text{{NOT, OR}}$ $\text{{NOR}}$
Any set of Boolean operation that is sufficient to represent all Boolean expression is said to be complete. Which of the following is not complete ?$\text{{AND, OR}}$$\te...
User Avatar
Page: