Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged of
0
votes
1
answer
1
Sum of Product and Product of Sum
I have a doubt it may be stupid though. know that if ∑m (1,3,5,6) then its equivalent POS form is = πM (0,2,4,7) But my doubt is say i need to represent 7, in SOP i write ABC in POS i write (A'+B'+C') ∑m (1,3,5,6) = A'B' ... say that SOP is complement of POS and why ∑m (1,3,5,6) != πM(1,3,5,6) ? as according to above they seems to be equal.
I have a doubt it may be stupid though.know that if ∑m (1,3,5,6) then its equivalent POS form is = πM (0,2,4,7)But my doubt is say i need to represent 7, in SOP i w...
Na462
1.0k
views
Na462
asked
Oct 9, 2018
Digital Logic
digital-logic
sum
of
product
+
–
0
votes
0
answers
2
Canonical SOP
Na462
1.5k
views
Na462
asked
Sep 29, 2018
Digital Logic
sum
of
product
digital-logic
minimal
+
–
0
votes
1
answer
3
SOP (Digital)
The sum of product (SOP) form of logic expression is most suitable for designing logic circuit using only A) NAND gate B)NOR gate
The sum of product (SOP) form of logic expression is most suitable for designing logic circuit using onlyA) NAND gateB)NOR gate
srestha
4.6k
views
srestha
asked
Aug 26, 2018
Digital Logic
digital-logic
sum
of
product
minimal
+
–
0
votes
0
answers
4
Minimal Sum Of Product(SOP)
Q) In a K-map it was found out that Essential Prime Implicants are covering all terms except 2 min terms.Those 2 min terms are in turn covered by 3 Non-essential Prime Implicants each. What is the number of minimal Sum Of Product(SOP) expressions?
Q) In a K-map it was found out that Essential Prime Implicants are covering all terms except 2 min terms.Those 2 min terms are in turn covered by 3 Non-essential Prime Im...
Lakshman Bhaiya
487
views
Lakshman Bhaiya
asked
Aug 23, 2018
Digital Logic
digital-logic
minimal
sum
of
product
+
–
1
votes
2
answers
5
Gradup topicwise question doubt
Identify the language generated by the following grammar: $S->AB$ $A->aAb|\epsilon$ $B->bB|b$ (A)$\{a^m b^n|n≥m, m>0\}$ (B)$\{a^m b^n|n≥m, m≥0\}$ (C)$\{a^m b^n|n>m, m>0\}$ (D)$\{a^m b^n|n>m, m≥0\}$ I select option C but it is wrong, correct answer is option D. I could not understand Gradup answer explanation.Please help me to rectify my fault.
Identify the language generated by the following grammar:$S->AB$$A->aAb|\epsilon$$B->bB|b$(A)$\{a^m b^n|n≥m, m>0\}$(B)$\{a^m b^n|n≥m, m≥0\}$(C)$\{a^m b^n|n>m, m>0\}...
Sona Barman
349
views
Sona Barman
asked
May 24, 2018
Theory of Computation
theory-of-computation
language
of
grammar
+
–
2
votes
1
answer
6
GATE Linear Algebra
For what values of $\lambda$ the system of equations will have $2$ linear independent solutions - $x + y + z = 0$ $(\lambda + 1) y + (\lambda + 1) z = 0$ ($\lambda^{2}- 1) z = 0$ ... of matrix will be $1$. Can anyone please explain in simple why the rank of matrix should be $1$ if we need $2$ Linear Independent solution. Thankyou.
For what values of $\lambda$ the system of equations will have $2$ linear independent solutions -$x + y + z = 0$$(\lambda + 1) y + (\lambda + 1) z = 0$($\lambda^{2}- 1) z...
pilluverma123
1.3k
views
pilluverma123
asked
Mar 2, 2018
Linear Algebra
numerical-answers
linear
algebra
system
of
system-of-equations
+
–
3
votes
1
answer
7
Draw DFA
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
all mix
807
views
all mix
asked
Jan 29, 2018
Theory of Computation
of
theory-of-computation
+
–
0
votes
3
answers
8
Linear Homogeneous Equation (Allen 2017)
Consider a system of equations (λ – a)x + 2y +3z = 0, x +2(λ – b) y + 3z = 0, x + 2y + 3(λ – c) z = 0, which has a non-trivial solution. Product of all values of λ for above system is (1) abc + a + b + c + 2 (2) abc + a + b + c – 2 (3) abc – a – b – c – 2 (4) abc – a – b – c + 2 Ans given is Option C. Can anyone explain the complete solution?
Consider a system of equations (λ – a)x + 2y +3z = 0, x +2(λ – b) y + 3z = 0, x + 2y + 3(λ – c) z = 0, which has a non-trivial solution. Product of all values o...
stanchion
728
views
stanchion
asked
Dec 1, 2017
Linear Algebra
system
of
system-of-equations
non-trivial-solution
homogeneous-equation
+
–
2
votes
1
answer
9
regular language
C = {ak | k is multiple of n }. Then how to show that for each n>=1, the language C is regular.
C = {ak | k is multiple of n }. Then how to show that for each n>=1, the language C is regular.
amrendra pal
230
views
amrendra pal
asked
Aug 22, 2017
Theory of Computation
turing-machine
regular-language
of
theory-of-computation
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
