How do you make a truth table for a 3 to 7 binary to thermometer converter?
Q. This is for a digital circuits class and im stuck on how to do the truth table and find the formula
Asked by abc - Wed Feb 17 17:08:22 2010 - - 1 Answers - 0 Comments
A. I would like to know as well..
Answered by Elizabeth Christensen - Fri Feb 19 10:55:54 2010
Q. This is for a digital circuits class and im stuck on how to do the truth table and find the formula
Asked by abc - Wed Feb 17 17:08:22 2010 - - 1 Answers - 0 Comments
A. I would like to know as well..
Answered by Elizabeth Christensen - Fri Feb 19 10:55:54 2010
Write the truth table and a Boolean expression for the following conditions:?
Q. Write the truth table and a Boolean expression for the following conditions: x is 0 if any two of the three variables are 1. x is 1 for all other conditions.
Asked by Srikant - Tue May 19 10:16:02 2009 - - 2 Answers - 0 Comments
A. A B C | X ___ 0 0 0 | 1 0 0 1 | 1 0 1 0 | 1 0 1 1 | 0 1 0 0 | 1 1 0 1 | 0 1 1 0 | 0 1 1 1 | 1 here is the boolean expression : ( assume A bar = a , B bar = b, C bar = c ) a.b + b.c + c.a + A.B.C.
Answered by prad - Tue May 19 12:16:56 2009
Q. Write the truth table and a Boolean expression for the following conditions: x is 0 if any two of the three variables are 1. x is 1 for all other conditions.
Asked by Srikant - Tue May 19 10:16:02 2009 - - 2 Answers - 0 Comments
A. A B C | X ___ 0 0 0 | 1 0 0 1 | 1 0 1 0 | 1 0 1 1 | 0 1 0 0 | 1 1 0 1 | 0 1 1 0 | 0 1 1 1 | 1 here is the boolean expression : ( assume A bar = a , B bar = b, C bar = c ) a.b + b.c + c.a + A.B.C.
Answered by prad - Tue May 19 12:16:56 2009
How to obtain the truth table of a boolean function?
Q. Given the Boolean function F= xy z + x y z + w xy + wx y + wxy Obtain the truth table of the function and; draw the logic diagram using the original Boolean expression.
Asked by ses - Tue Sep 29 16:17:08 2009 - - 2 Answers - 0 Comments
A. You just pick values for x, y and z, then work out F for each case. Since you have four variables, the values for x, y and z in your table will be as follows: w x y z 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 Now just work out F for each case. It would be helpful to add a few extra coloumns since that's a pretty big equation. Here's how I would do it (notice the titles of the columns. I've worked out the first two for you to help you understand) w | x | y | z | xy'z | x y z | w xy | wx y | wxy | F 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 etc.
Answered by lmf7000 - Tue Sep 29 16:37:58 2009
Q. Given the Boolean function F= xy z + x y z + w xy + wx y + wxy Obtain the truth table of the function and; draw the logic diagram using the original Boolean expression.
Asked by ses - Tue Sep 29 16:17:08 2009 - - 2 Answers - 0 Comments
A. You just pick values for x, y and z, then work out F for each case. Since you have four variables, the values for x, y and z in your table will be as follows: w x y z 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 Now just work out F for each case. It would be helpful to add a few extra coloumns since that's a pretty big equation. Here's how I would do it (notice the titles of the columns. I've worked out the first two for you to help you understand) w | x | y | z | xy'z | x y z | w xy | wx y | wxy | F 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 etc.
Answered by lmf7000 - Tue Sep 29 16:37:58 2009
How do I break down a statement in order to construct a truth table?
Q. The statement in question has no parentheses: pvr>q>~p My thoughts are: pv (r>q) > (~p) I have already complete the p, q, and the r on my truth table, but that is where I get lost.
Asked by 417r - Tue Jan 16 15:03:40 2007 - - 1 Answers - 0 Comments
A. [(p v r) => q] => ~p and [(p v r) AND ~q] v ~p are equivalent. Edit: Evaluate (p v r), then (p v r) =>q and finally, [(p v r) => q] => ~p.
Answered by S. B. - Tue Jan 16 15:45:27 2007
Q. The statement in question has no parentheses: pvr>q>~p My thoughts are: pv (r>q) > (~p) I have already complete the p, q, and the r on my truth table, but that is where I get lost.
Asked by 417r - Tue Jan 16 15:03:40 2007 - - 1 Answers - 0 Comments
A. [(p v r) => q] => ~p and [(p v r) AND ~q] v ~p are equivalent. Edit: Evaluate (p v r), then (p v r) =>q and finally, [(p v r) => q] => ~p.
Answered by S. B. - Tue Jan 16 15:45:27 2007
What is the equivalent of AND logical truth table in terms of OR?
Q. I'm dealing with boolean logical truth tables i need to produce the same result as a logical AND truth table does without using AND operation? Any help, suggestion, idea is most welcome?... i have got the answer...thanx but can u try to explain it a little bit...it'll be really appreciated...
Asked by asimmm mmm - Mon May 18 17:20:14 2009 - - 1 Answers - 0 Comments
A. You must use inveters NOT. A and B = not( (not A) or (not B))
Answered by Alex Smirnoff - Mon May 18 17:27:37 2009
Q. I'm dealing with boolean logical truth tables i need to produce the same result as a logical AND truth table does without using AND operation? Any help, suggestion, idea is most welcome?... i have got the answer...thanx but can u try to explain it a little bit...it'll be really appreciated...
Asked by asimmm mmm - Mon May 18 17:20:14 2009 - - 1 Answers - 0 Comments
A. You must use inveters NOT. A and B = not( (not A) or (not B))
Answered by Alex Smirnoff - Mon May 18 17:27:37 2009
Help with making a truth table for a circuit?
Q. Consider a circuit with three inputs, X, Y, and Z. Construct a truth table for (X and Y) or (X and Z). Construct a circuit using only and and or gates for this function.
Asked by Ryan - Wed Oct 7 20:42:36 2009 - - 1 Answers - 0 Comments
A. See table and Diagram here.
Answered by Bony - Wed Oct 7 22:40:27 2009
Q. Consider a circuit with three inputs, X, Y, and Z. Construct a truth table for (X and Y) or (X and Z). Construct a circuit using only and and or gates for this function.
Asked by Ryan - Wed Oct 7 20:42:36 2009 - - 1 Answers - 0 Comments
A. See table and Diagram here.
Answered by Bony - Wed Oct 7 22:40:27 2009
What can I use to, drawing a logic circuit, constructing a truth table, and for simplifying an expression?
Q. I'm a college student and I have been learing have to draw logic circuits and truth tables for each circuit. Plus I have been using Boolean algebra and De Morgan theorom to simplify an expression. I will like to find a site online to do these things faster and/or download a program. Please help!
Asked by J.Smith - Thu May 20 10:31:51 2010 - - 2 Answers - 0 Comments
A. I found this program which could help you with Karnaugh Map simplification. These sites also seems to have many programs for Boolean Algebra and digital logic Just look for the ones that are $0.00 I hope this helps -Mike
Answered by michael - Thu May 20 10:55:45 2010
Q. I'm a college student and I have been learing have to draw logic circuits and truth tables for each circuit. Plus I have been using Boolean algebra and De Morgan theorom to simplify an expression. I will like to find a site online to do these things faster and/or download a program. Please help!
Asked by J.Smith - Thu May 20 10:31:51 2010 - - 2 Answers - 0 Comments
A. I found this program which could help you with Karnaugh Map simplification. These sites also seems to have many programs for Boolean Algebra and digital logic Just look for the ones that are $0.00 I hope this helps -Mike
Answered by michael - Thu May 20 10:55:45 2010
Real world application for a truth table?
Q. Can anyone give me an example of a real world situation in which a truth table would be beneficial? I understand the concept, but I am having a hard time seeing how I can use it in the real world.
Asked by Athos - Thu Apr 24 16:30:04 2008 - - 5 Answers - 0 Comments
A. easy. just make up a truth table for any set of propositions that involve a logical connector, for example modus ponens. Then replace the variables (p, q, etc) with propositions that you derive from some actual event.
Answered by Theron Q. Ramacharaka Panchadasi - Thu Apr 24 17:14:25 2008
Q. Can anyone give me an example of a real world situation in which a truth table would be beneficial? I understand the concept, but I am having a hard time seeing how I can use it in the real world.
Asked by Athos - Thu Apr 24 16:30:04 2008 - - 5 Answers - 0 Comments
A. easy. just make up a truth table for any set of propositions that involve a logical connector, for example modus ponens. Then replace the variables (p, q, etc) with propositions that you derive from some actual event.
Answered by Theron Q. Ramacharaka Panchadasi - Thu Apr 24 17:14:25 2008
Is there a special way to derive the logical expression from a truth table ?
Q. Is there a special way to derive the logical expression from a truth table or is it just a matter of trials and errors? eg. determine the logical expression of p . x y z p f f f t f f t f f t f f f t t t t f f t t f t t t t f f t t t t please just tell me the general approaches and tips. thanks for the help
Asked by TameMe - Thu Jan 22 22:47:37 2009 - - 3 Answers - 0 Comments
A. We observe that there is nearly a pattern with one exception in the 6th row. If p were F there, it would be simpler. Since it is T in the 6th row, we will could approach it as though it were F and then add another term for that particular combination TFT to patch it up. Variables x, y and z exhibit a repeating pattern. p = NOT (y XOR z) will give us 7/8 of the results that we need, since it's true when y = z, otherwise false. As a prior answer has provided, we only consider x for the unique row - x AND z AND (NOT y). This is connected with OR logic to the first expression.
Answered by Thomas K - Thu Jan 22 23:03:07 2009
Q. Is there a special way to derive the logical expression from a truth table or is it just a matter of trials and errors? eg. determine the logical expression of p . x y z p f f f t f f t f f t f f f t t t t f f t t f t t t t f f t t t t please just tell me the general approaches and tips. thanks for the help
Asked by TameMe - Thu Jan 22 22:47:37 2009 - - 3 Answers - 0 Comments
A. We observe that there is nearly a pattern with one exception in the 6th row. If p were F there, it would be simpler. Since it is T in the 6th row, we will could approach it as though it were F and then add another term for that particular combination TFT to patch it up. Variables x, y and z exhibit a repeating pattern. p = NOT (y XOR z) will give us 7/8 of the results that we need, since it's true when y = z, otherwise false. As a prior answer has provided, we only consider x for the unique row - x AND z AND (NOT y). This is connected with OR logic to the first expression.
Answered by Thomas K - Thu Jan 22 23:03:07 2009
Construct a truth table for the given compound statement?
Q. Construct a truth table for the given compound statement and then choose which of the following is the correct final answer column. (p^ ~q) or (~p^q)
Asked by me. - Sun Jun 3 14:01:10 2007 - - 1 Answers - 0 Comments
A. P ... Q ... (P^~Q)or(~P^Q) 0 ... 0 ... 0 0 ... 1 ... 1 1 ... 0 ... 1 1 ... 1 ... 0 This function is called exclusive OR (XOR).
Answered by Dr. Gene - Mon Jun 4 21:44:35 2007
Q. Construct a truth table for the given compound statement and then choose which of the following is the correct final answer column. (p^ ~q) or (~p^q)
Asked by me. - Sun Jun 3 14:01:10 2007 - - 1 Answers - 0 Comments
A. P ... Q ... (P^~Q)or(~P^Q) 0 ... 0 ... 0 0 ... 1 ... 1 1 ... 0 ... 1 1 ... 1 ... 0 This function is called exclusive OR (XOR).
Answered by Dr. Gene - Mon Jun 4 21:44:35 2007
Truth table for: Come Home Tomorrow Or You Are in Trouble?
Q. Construct a truth table for this claim... Can someone help?
Asked by Krista Yates - Tue Sep 29 18:19:04 2009 - - 1 Answers - 0 Comments
A. Hi 'Come home tomorrow' is an imperative and, as such, lacks truth conditions, meaning that it's neither true nor false. This poses a bit of a problem if we want to try to construct a truth table for 'Come home tomorrow or you're in trouble' :-) In logic, statements of the form 'P v Q' are equivalent to statements of the form '~P > Q'. For example, 'Either Maria has stinky feet or Jessica has a smelly butt' is equivalent to 'If Maria doesn't have stinky feet, then Jessica has a smelly butt'. If 'Maria has stinky feet' is false, but the disjunction 'Either Maria has stinky feet or Jessica has a smelly butt' is true, then 'Jessica has a smelly butt' must be true (a disjunction is true if and only if at least one of its disjuncts is true).… [cont.]
Answered by Melanie - Wed Sep 30 23:41:05 2009
Q. Construct a truth table for this claim... Can someone help?
Asked by Krista Yates - Tue Sep 29 18:19:04 2009 - - 1 Answers - 0 Comments
A. Hi 'Come home tomorrow' is an imperative and, as such, lacks truth conditions, meaning that it's neither true nor false. This poses a bit of a problem if we want to try to construct a truth table for 'Come home tomorrow or you're in trouble' :-) In logic, statements of the form 'P v Q' are equivalent to statements of the form '~P > Q'. For example, 'Either Maria has stinky feet or Jessica has a smelly butt' is equivalent to 'If Maria doesn't have stinky feet, then Jessica has a smelly butt'. If 'Maria has stinky feet' is false, but the disjunction 'Either Maria has stinky feet or Jessica has a smelly butt' is true, then 'Jessica has a smelly butt' must be true (a disjunction is true if and only if at least one of its disjuncts is true).… [cont.]
Answered by Melanie - Wed Sep 30 23:41:05 2009
Can someone help me understand this truth table?
Q. I've got this formula of propositional logic: (H B O), ( B H), H O Can anyone explain to me how to separate the individual premises into a truth table, and then how to actually fill the truth table in to prove if it's valid or not?! Thanks
Asked by IPRA - Sat May 9 06:30:31 2009 - - 2 Answers - 0 Comments
A. Ok. first list each of the premises, the letters H,B,O Next in the column under the first premise write four T's followed by Four F's. In the next column write two T's Followed by two F's and fill down the column. Now under the third premise fil in the column with T, F, T F.. Now build up your premises by the logical operators and determine their value. for example, below H or B is true for the first four rows because either H or B is true. Next build the other premises until you come to the end. Then look for a case when all the premises are true and the conclusion is false. If one is found that is a counter example and the argument is invalid. Fail to find a counter example and you've proved that it is valid. whew! After a… [cont.]
Answered by Gadfly - Sat May 9 09:19:22 2009
Q. I've got this formula of propositional logic: (H B O), ( B H), H O Can anyone explain to me how to separate the individual premises into a truth table, and then how to actually fill the truth table in to prove if it's valid or not?! Thanks
Asked by IPRA - Sat May 9 06:30:31 2009 - - 2 Answers - 0 Comments
A. Ok. first list each of the premises, the letters H,B,O Next in the column under the first premise write four T's followed by Four F's. In the next column write two T's Followed by two F's and fill down the column. Now under the third premise fil in the column with T, F, T F.. Now build up your premises by the logical operators and determine their value. for example, below H or B is true for the first four rows because either H or B is true. Next build the other premises until you come to the end. Then look for a case when all the premises are true and the conclusion is false. If one is found that is a counter example and the argument is invalid. Fail to find a counter example and you've proved that it is valid. whew! After a… [cont.]
Answered by Gadfly - Sat May 9 09:19:22 2009
Please help me i cant understand how to use Truth Table?
Q. Question # 1 Part 1 Show that 1)(A+B+C) ' = A'B'C' by using truth table Question # 1 Part 2 2) (A+B+C')(A'+B'+C)= A (+) B+{A (+) C}' +{B (+) C}' Expand Right hand side first and then show that it is equal to the left side by using the truth table. Please solve these questions for me.
Asked by BraveHeart - Sun Apr 5 09:21:18 2009 - - 1 Answers - 0 Comments
Q. Question # 1 Part 1 Show that 1)(A+B+C) ' = A'B'C' by using truth table Question # 1 Part 2 2) (A+B+C')(A'+B'+C)= A (+) B+{A (+) C}' +{B (+) C}' Expand Right hand side first and then show that it is equal to the left side by using the truth table. Please solve these questions for me.
Asked by BraveHeart - Sun Apr 5 09:21:18 2009 - - 1 Answers - 0 Comments
How do you make a truth table for Boolean algebra?
Q. Inputs 0 through 11 output is logical and the rest are undefined.
Asked by Eddie S - Wed Mar 24 13:51:45 2010 - - 2 Answers - 0 Comments
A. 1 means true 0 means false on Boolean algebra there are four basic Operators : Not (~) it means the negative of the statement And (^) it means 2 statements will be true if all of the statements true Or (v) it means 2 statement will be false if all of the statements false Implication ( --> ) you can see it on the table below Biimplication ( <--> ) you can see it on the table below just say that there are 2 statements "P" and "Q" we can compare remember 1 for "True" and 0 for "False" It will be like this... ___ i p i q i ~P I P^Q I PvQ I P-->Q I P<--->Q I --- I 1 I 1 I 0 I 1 I 1 I 1 I 1 I I 1 I 0 I 0 I 0 I 1 I 0 I 0 I I 0 I 1 I 1 I 0 I 1 I 1 I 0 I I 0 I … [cont.]
Answered by Syam - Wed Mar 24 14:12:38 2010
Q. Inputs 0 through 11 output is logical and the rest are undefined.
Asked by Eddie S - Wed Mar 24 13:51:45 2010 - - 2 Answers - 0 Comments
A. 1 means true 0 means false on Boolean algebra there are four basic Operators : Not (~) it means the negative of the statement And (^) it means 2 statements will be true if all of the statements true Or (v) it means 2 statement will be false if all of the statements false Implication ( --> ) you can see it on the table below Biimplication ( <--> ) you can see it on the table below just say that there are 2 statements "P" and "Q" we can compare remember 1 for "True" and 0 for "False" It will be like this... ___ i p i q i ~P I P^Q I PvQ I P-->Q I P<--->Q I --- I 1 I 1 I 0 I 1 I 1 I 1 I 1 I I 1 I 0 I 0 I 0 I 1 I 0 I 0 I I 0 I 1 I 1 I 0 I 1 I 1 I 0 I I 0 I … [cont.]
Answered by Syam - Wed Mar 24 14:12:38 2010
What does the truth table for it look like?
Q. I'm having a test in digital electronics tommorow and this topic is really messing me up. I am also wondering about the best way to build it.
Asked by jimrocksmysocks - Sun Jun 14 20:12:36 2009 - - 1 Answers - 0 Comments
A. what is "IT"? an AND gate: input 1 .. input 2 .. output ... 0 ... 0 ... 0 ... 0 ... 1 ... 0 ... 1 ... 0 ... 0 ... 1 ... 1 ... 1 or ... L ... L ... L ... L ... H ... L ... H ... L ... L ... H ... H ... H an OR gate: input 1 .. input 2 .. output ... 0 ... 0 ... 0 ... 0 ... 1 ... 1 ... 1 ... 0 ... 1 ... 1 ... 1 ... 1 or ... L ... L ... L ... L ... H ... H ... H ... L ... H ... H ... H ... H a NAND gate: input 1 .. input 2 .. output (low true) ... 0 ... 0 ... 0 ... 0 ... 1 ... 0 ... 1 ... 0 ... 0 ... 1 ... 1 ... 1 or ... L ... L ... H ... L ... H ... H ... H ... L ... H ... H ... H ... L a NOR gate: input 1 .. input 2 .. output (low true) ... 0 ... 0 ... 0 ... 0 ... 1 ... 1 ... 1 ... 0 ... 1 ... 1 ... 1 ... 1 or ... L ... L ... H ... [cont.]
Answered by billrussell42 - Sun Jun 14 20:49:45 2009
Q. I'm having a test in digital electronics tommorow and this topic is really messing me up. I am also wondering about the best way to build it.
Asked by jimrocksmysocks - Sun Jun 14 20:12:36 2009 - - 1 Answers - 0 Comments
A. what is "IT"? an AND gate: input 1 .. input 2 .. output ... 0 ... 0 ... 0 ... 0 ... 1 ... 0 ... 1 ... 0 ... 0 ... 1 ... 1 ... 1 or ... L ... L ... L ... L ... H ... L ... H ... L ... L ... H ... H ... H an OR gate: input 1 .. input 2 .. output ... 0 ... 0 ... 0 ... 0 ... 1 ... 1 ... 1 ... 0 ... 1 ... 1 ... 1 ... 1 or ... L ... L ... L ... L ... H ... H ... H ... L ... H ... H ... H ... H a NAND gate: input 1 .. input 2 .. output (low true) ... 0 ... 0 ... 0 ... 0 ... 1 ... 0 ... 1 ... 0 ... 0 ... 1 ... 1 ... 1 or ... L ... L ... H ... L ... H ... H ... H ... L ... H ... H ... H ... L a NOR gate: input 1 .. input 2 .. output (low true) ... 0 ... 0 ... 0 ... 0 ... 1 ... 1 ... 1 ... 0 ... 1 ... 1 ... 1 ... 1 or ... L ... L ... H ... [cont.]
Answered by billrussell42 - Sun Jun 14 20:49:45 2009
How many rows needed to cunstruct a truth table for 5 statements?
Q. (think p,q,r,s,t) a)5 b) 10 c)25 d)32 e)100
Asked by Lilly - Sun Oct 11 18:32:39 2009 - - 1 Answers - 0 Comments
A. If you have 1 statement, you need 2 rows (T, F). If you have 2 statements, you need 4 rows (TT, TF, FT, FF) If you have 3 statements, you need 8 rows (TTT, TTF, TFT, TFF, FTT, FTF, FFT, FFF) You might have noticed a pattern starting to form. 2 to the power of the number of statements. 2 to the fifth power is 32, so our answer is D.
Answered by Conan - Sun Oct 11 18:40:38 2009
Q. (think p,q,r,s,t) a)5 b) 10 c)25 d)32 e)100
Asked by Lilly - Sun Oct 11 18:32:39 2009 - - 1 Answers - 0 Comments
A. If you have 1 statement, you need 2 rows (T, F). If you have 2 statements, you need 4 rows (TT, TF, FT, FF) If you have 3 statements, you need 8 rows (TTT, TTF, TFT, TFF, FTT, FTF, FFT, FFF) You might have noticed a pattern starting to form. 2 to the power of the number of statements. 2 to the fifth power is 32, so our answer is D.
Answered by Conan - Sun Oct 11 18:40:38 2009
How do I translate this statement into sybolic form and determine if it's right by using a truth table?
Q. Money causes all the world's troubles, or money helps the poor. If money helps the poor, it's not the cause of all the world's troubles. Money is the cause of all the world's troubles. Therefore, money doesn't help the poor.
Asked by Tennell - Tue Nov 24 18:44:26 2009 - - 2 Answers - 0 Comments
A. I can't possibly write out a truth table on here, that'll be left up to you to figure out but I can help you set it up. Lets use letters to stand for certain phrases. Here's the key: A = money is the cause of all the world's troubles B = money helps the poor I don't know what symbols you specifically use and since I can't put in all the normal ones I'll just use ones I can use. And = & Or = V Not = - If = U Now here are the various sentences in terms of the symbols and letters: 1. A V B 2. B U -A 3. A 4. -B <--- This is the conclusion Now if you were to set this up in a table, the first three would go on the left side and be initial premises, and the last one would go on the right and be a conclusion. You're going to have to figure… [cont.]
Answered by permeative pedagogy - Tue Nov 24 18:53:07 2009
Q. Money causes all the world's troubles, or money helps the poor. If money helps the poor, it's not the cause of all the world's troubles. Money is the cause of all the world's troubles. Therefore, money doesn't help the poor.
Asked by Tennell - Tue Nov 24 18:44:26 2009 - - 2 Answers - 0 Comments
A. I can't possibly write out a truth table on here, that'll be left up to you to figure out but I can help you set it up. Lets use letters to stand for certain phrases. Here's the key: A = money is the cause of all the world's troubles B = money helps the poor I don't know what symbols you specifically use and since I can't put in all the normal ones I'll just use ones I can use. And = & Or = V Not = - If = U Now here are the various sentences in terms of the symbols and letters: 1. A V B 2. B U -A 3. A 4. -B <--- This is the conclusion Now if you were to set this up in a table, the first three would go on the left side and be initial premises, and the last one would go on the right and be a conclusion. You're going to have to figure… [cont.]
Answered by permeative pedagogy - Tue Nov 24 18:53:07 2009
How do you simplify this boolean expression and make a truth table and logic diagram for both?
Q. --_---__ xyz + xyz + xyz this is for computer organization and architecture.
Asked by Derek B - Fri Apr 2 00:10:43 2010 - - 1 Answers - 0 Comments
A. Hmm...Is xy z bar + x yz bar + xyz?If that is it... --_---__ xyz + xyz + xyz Take x common out... ---_---__ x(yz + yz + yz) ---_---_--__ Then...Take z common out ox yz + yz --_---_ x(z(y+y) + yz) ---_ Well...y+y = 1 Use that here... --_ x(z (1) + yz) -_ xz + xyz U can make Those truth table and logic circuit with this [:
Answered by LionHeart - Fri Apr 2 05:13:14 2010
Q. --_---__ xyz + xyz + xyz this is for computer organization and architecture.
Asked by Derek B - Fri Apr 2 00:10:43 2010 - - 1 Answers - 0 Comments
A. Hmm...Is xy z bar + x yz bar + xyz?If that is it... --_---__ xyz + xyz + xyz Take x common out... ---_---__ x(yz + yz + yz) ---_---_--__ Then...Take z common out ox yz + yz --_---_ x(z(y+y) + yz) ---_ Well...y+y = 1 Use that here... --_ x(z (1) + yz) -_ xz + xyz U can make Those truth table and logic circuit with this [:
Answered by LionHeart - Fri Apr 2 05:13:14 2010
What is the truth table for a 3input NAND gate?
Q. Also how can you make 3 inputs go through a 2input NAND gate?
Asked by K!NG - Tue Dec 8 18:06:09 2009 - - 2 Answers - 0 Comments
A. See my Truth table at link. Also restating ' Use 2-input NAND gates to make a 3-input NAND' See circuit for this also at my link.
Answered by Bony - Tue Dec 8 18:21:00 2009
Q. Also how can you make 3 inputs go through a 2input NAND gate?
Asked by K!NG - Tue Dec 8 18:06:09 2009 - - 2 Answers - 0 Comments
A. See my Truth table at link. Also restating ' Use 2-input NAND gates to make a 3-input NAND' See circuit for this also at my link.
Answered by Bony - Tue Dec 8 18:21:00 2009
What is the highest number represented by a 9 bit truth table?
Q. What is the highest number represented by a 9 bit truth table?
Asked by Xavier Bright - Fri May 21 20:30:26 2010 - - 1 Answers - 0 Comments
A. 2^9=512
Answered by menotu3169 - Fri May 21 20:32:02 2010
Q. What is the highest number represented by a 9 bit truth table?
Asked by Xavier Bright - Fri May 21 20:30:26 2010 - - 1 Answers - 0 Comments
A. 2^9=512
Answered by menotu3169 - Fri May 21 20:32:02 2010
From Yahoo Answer Search: 'Truth table'
Thu Jul 29 17:56:33 2010 [ refresh local cache ]
[Hide]▼
financialstandard.com.au
Wed, 07 Jul 2010 23:55:00 GMT+00:00
Financial Standard It goes along the lines of "the truth shall set you free." In an emailed statement, the Committee of European Banking Supervisors (CEBS) told lenders that ...
usamyanmar.net
377px x 602px | 14.30kB
[source page]
Symbolic schematic gates Basic understanding of Truth Table is shown below For Monbusho level developers only with brunching factor 2 larger the factor number harder the logic reversely engineer from leaf depths deeper the tree depth longer the path to
marketerssoftware.com
admin
Fri, 23 Jul 2010 16:11:22 GM
Our next SEO myth is the idea that you can't use . tables. inside HTML code. This is another false idea. In . truth. , search engine spiders have never had any difficulty finding HTML . tables. . Search engines can see and recognize . table. code ...
[Hide]▲
