Please help me for midterm ON GRADE 11 boolen algebra

Click For Summary
SUMMARY

This discussion focuses on verifying answers related to Boolean algebra problems for a Grade 11 midterm exam. The user presents several Boolean expressions and their derived answers, seeking confirmation of their correctness. Key concepts discussed include the application of Boolean laws such as Idempotence, Absorption, and Distributivity. The community emphasizes the importance of showing step-by-step work and annotating each step with the corresponding laws used for clarity and understanding.

PREREQUISITES
  • Understanding of Boolean algebra principles
  • Familiarity with Boolean laws such as Idempotence and Absorption
  • Ability to perform simplifications using Karnaugh maps
  • Knowledge of notation differences in Boolean expressions (e.g., ' vs. ")
NEXT STEPS
  • Study the application of Boolean laws in problem-solving
  • Practice using Karnaugh maps for simplifying Boolean expressions
  • Learn to annotate solutions with the specific laws applied at each step
  • Explore truth tables for verifying Boolean expressions
USEFUL FOR

Students preparing for exams in computer science or mathematics, particularly those focusing on Boolean algebra and logic design.

joker_tony
Messages
5
Reaction score
0
i really need someone to me verify my answer. i will be having my exam next week and iam stuck . please iam really stuck on some of this question.

' is not


'' its not, not


1. F = B.(A''. B' . C')

2. F = A. (A''+ B' + C')

3. F = A . (B''.C') + A . (B + C')

4. F = (A'' + B'') + A . B

5. F = A'.B'+C'+A.(B'+C')

6. F= A'. B+ D.(C+D') + A. B' . C' . D

7. F = A. C'.D'+(A''.B'.C') + (A''.B')

8. F = A.B'.C' + A'.B.C.D + A'.B.C'+A.B'C.D


MY ANSWERS

1. F=BA'.BC'
2 F=A.AB.AC'
3. F= AB + AC
4. F=A.B
 
Last edited:
Physics news on Phys.org
joker_tony said:
i really need someone to me verify my answer. i will be having my exam next week and iam stuck . please iam really stuck on some of this question.

1. F = B.(A''. B' . C')

2. F = A. (A''+ B' + C')

3. F = A . (B''.C') + A . (B + C')

4. F = (A'' + B'') + A . B

5. F = A'.B'+C'+A.(B'+C')

6. F= A'. B+ D.(C+D') + A. B' . C' . D

7. F = A. C'.D'+(A''.B'.C') + (A''.B')

8. F = A.B'.C' + A'.B.C.D + A'.B.C'+A.B'C.D


MY ANSWERS

1. F=BA'.BC'
2 F=A.AB.AC'
3. F= AB + AC
4. F=A.B

Could you please explain your notation? What is the difference between ' and " ? Also, could you please explain what techniques you are using to derive your answers? We do not give out answers to homework/coursework questions here on the PF, but we can provide tutorial help so that you can figure out the answers yourself.
 
' is not

'' its not, not


I just need someone to check my answers and i would really apreciated
 
Last edited:
joker_tony said:
' is not

'' its not, not

Um, okay. What would not not always equal?

And we really do need to see what you are doing to derive your answers. What distributive rules are you using, for example? Please show your step-by-step work for each of the answers, so that we can see how you worked them out. Alternately, show the Karnaugh maps you used, if that's how you solved the problems.
 
joker_tony said:
I just need someone to check my answers and i would really apreciated

As I said, we do not give out answers here. We also do not just check answers. That would be cheating. Please show all of your work.
 
step by step solution

1. AB'+BB'+BC'
= AB'+BC'

2. AA.AB.AC'
=A.AB'.AC'

3. AB+AC+AB+AC
=AB+AC

4. (A.B)+A.B
=A.AB.AB.B
=A.B

i don't know if this is right, also iam working on the other answers
 
Last edited:
That's much better, but it would still help us if you could say what rule you are using in each step. Like the "Monotone Laws" listed at wikipedia.org (with v = OR and ∧ = AND):

from http://en.wikipedia.org/wiki/Boolean_algebra_(introduction)

wikipedia said:
Monotone laws
Boolean algebra satisfies many of the same laws as ordinary algebra when we match up ∨ with addition and ∧ with multiplication. In particular the following laws are common to both kinds of algebra.

(Associativity of ∨) x∨(y∨z) = (x∨y)∨z
(Associativity of ∧) x∧(y∧z) = (x∧y)∧z
(Commutativity of ∨) x∨y = y∨x
(Commutativity of ∧) x∧y = y∧x
(Distributivity of ∧ over ∨) x∧(y∨z) = (x∧y)∨(x∧z)
(Identity for ∨) x∨0 = x
(Identity for ∧) x∧1 = x
(Annihilator for ∧) x∧0 = 0

Boolean algebra however obeys some additional laws, in particular the following.

(Idempotence of ∨) x∨x = x
(Idempotence of ∧) x∧x = x
(Absorption 1) x∧(x∨y) = x
(Absorption 2) x∨(x∧y) = x
(Distributivity of ∨ over ∧) x∨(y∧z) = (x∨y)∧(x∨z)
(Annihilator for ∨) x∨1 = 1
 
yes iam using those laws but i don't know if my answers are right or wrong
 
joker_tony said:
yes iam using those laws but i don't know if my answers are right or wrong

Yes the laws are right. They were on wikipedia, after all :rolleyes:

But seriously, what I mean is to annotate each line in your solution with a comment on what law you've used to make that step. Like

1. F = B.(A''. B' . C')
= AB'+BB'+BC' (which law or laws were used in this step?)
= AB'+BC' (what property of BB' did you use?)
 
  • #10
step by step solution

1. AB'+BB'+BC' (use complements laws B.B=0)
= AB'+BC'

2. AA.AB'.AC' ( Use idempotency A.A= A)
=A.AB'.AC'

3. AB+AC+AB+AC(use idempotency A+A=A)
=AB+AC

4. (A.B)+A.B ( i think this one is wrong)
=A.AB.AB.B
=A.B
 
  • #11
Looks like you're getting the hang of it. On #4...

First of all, I've never seen not-not, but whatever. Anything not-not would be itself, I would think. So:

4. F = (A'' + B'') + A . B = (A + B) + A . B

But you can use the Absorption #2 listed from wikipedia, or just truth tables to simplify that further...
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
11K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 17 ·
Replies
17
Views
2K
Replies
15
Views
29K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 25 ·
Replies
25
Views
2K
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K