Solving Boolean Logic Expressions with And, Or and Not Gates

  • Thread starter Thread starter intellect
  • Start date Start date
  • Tags Tags
    Logic Logic gates
AI Thread Summary
The discussion revolves around identifying which of three boolean expressions involving two variables, A and B, are identical in their outputs across all combinations of True and False values. The expressions are: 1. (A and (not B)) or (B and (not A)) 2. (A and (not B)) and (B and (not A)) 3. (A or B) and (not (A and B))Participants suggest using truth tables to compare the outputs of the expressions, as this method clearly shows which expressions yield the same results. There is also mention of using boolean algebra to simplify the expressions for comparison. The original poster expresses confusion with using a simulator due to limitations in available gates, but ultimately finds clarity through the suggestions provided. The conversation emphasizes the importance of understanding boolean logic and the utility of truth tables in resolving such problems.
intellect
Messages
9
Reaction score
0
The three equations below represent three different logic expressions using and, or and not gates of two boolean variables A and B. A boolean variable can take only one of two possible values: True or False.

Which of the two expressions are identical, meaning that for any combination of A and B they are both True or both False.

Expression 1: (A and (not B) ) or ( B and (not A))
Expression 2: (A and (not B)) and ( B and ( not A ))
Expression 3: (A or B ) and ( not ((A and B ))

In your answer explain how you figure out which expression is different (in terms of its output given the same combination of A, B and C) from the other two.

I tried to use the simulator to construct these, but since we don't have any combination gates on our program (NOR, NAND, etc.), I'm having a lot of trouble with it. We only have the AND, OR, and NOT gates to work with. Could someone please help me? I am really confused right now. Thank you.
 
Technology news on Phys.org
Homework questions need to be in this forum:

Science Education > Homework & Coursework Questions > Engineering, Comp Sci, & Technology

Expect it to be moved soon.

That aside, you could just construct truth tables and see which end up the same.

Or are you supposed to use boolean algebra to turn one of them into another?
 
I actually just figured this one out. Thank you for the pointer, though!
 
Thread 'Is this public key encryption?'

Thread 'Is this public key encryption?'

I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
View full post »

Similar threads

I Can you calculate the probability of a complex logic expression?
Replies
3
Views
2K
Engineering Write the Boolean expression of a given logic circuit
Replies
2
Views
2K
Designing a NAND Gate Logic Circuit
Replies
2
Views
2K
Logic Gates and CPUs: Basic Design Structure of Computer Processors
Replies
8
Views
12K
Ohmic Resistance and Logic gates
Replies
10
Views
2K
I Axioms of Fuzzy Logic
Replies
7
Views
1K
MHB Is the Complexity of Satisfiable Boolean Expressions in NP?
Replies
1
Views
2K
Logic question (handling inequalities in a BASIC compiler)
Replies
11
Views
2K
Question about the efficiency of using an array or individual variables
5
Replies
235
Views
13K
Comp Sci Digital Logic 8 Bit Full Adder Circuit
Replies
5
Views
3K

Hot Threads

Recent Insights

Back
Top