[LEARN] LOGIC GATES and chance to earn merit.

[Smartvirus]

Next question :

1.AND

A B	10010101 10001001

2.NOT

A B	00110101 10001010

3.XNOR

A B	11001010 11001010

4.NOR

A B	10001010 11001010

5.XNOR

A B	10010101 10100101

I promised to put in my answers in few hours... Well, here it is:
Answers
1. AND - 10000001
2. NOT - (A-11001010)
               (B-01110101)
3. XNOR - 11001010
4. NOR - 00110101
5. XNOR - 10000101

[1714030822]

1714030822

[1714030822]

1714030822

[1714030822]

1714030822

[1714030822]

1714030822

[1714030822]

1714030822

[1714030822]

1714030822

[Maus0728]

Platform used: Tinkercad

Hey guys! Just wanna share that the previous logic circuit that I have made which is the quoted message above can be simplified using "Boolean Algebra" rules in order to reduce the number of IC to be used while maintaining the project cost efficient.



@Peanutswar, I think it would be very good idea to at least give some time creating a lecture with regards to how Boolean Algebra works as well as creating "Karnaugh Map" or "Quine Mc Cluskey" as a means to simplify Logic Circuit canonical forms.

Furthermore, I just want to add another application if you want to create logic circuit diagram. You can use "Logisim" for that.

[Maus0728]

Hey there! Just having fun making discussion here in this thread. I also want to share with you my latest experiment using the 7-seven digital display implemented using TinkerCad.

This is the table solution for a 3 bit input logic circuit using of course 3 variable named as A, B and C.


This is simplification of Boolean Expression using Karnaugh Map or commonly referred as K-Map.


After doing simplifying all the boolean expression using K-map. We are now able to construct the logic diagram using the logisim.


And finally the simulation for the actual digital logic circuit using TinkerCad.


If I can find some leisure time, I might be posting a short lecture on how these K-Map and Logic diagram works. @Peanutswar, you can also give this a shot if I won't be able to make a short lecture apropos to this matter.

[Peanutswar]

~

I will create the same with you @Maus0728 but on my way/process to create with this on K-map.

To the people who does not know what the use of it, it creates a table as a representation with consist of 0's and 1's to create boolean expression. You can visit guys the link below for more information^[1].

[1]

Code:

https://www.geeksforgeeks.org/introduction-of-k-map-karnaugh-map/

I just recently bought a new computer so I can now continue the lesson for this thread, thanks to you @Maus0728  for getting active on this and still support.
Right now I'm working for another example of yours.




Okay for other members we are back to the track.

~

dikobraz123 got the correct answer


5 sMerit left

Next question :

1.AND

A B	10110010 11010010

2.NAND

A B	11101001 10010010

3.NOT

A B	11010010 11001010

4.XNOR

A B	11101001 00010101

5.XOR

A B	00101001 11010010

6.



7. is the LED, ON or OFF?(6 and 7 are connected)

[Maus0728]

I just recently bought a new computer so I can now continue the lesson for this thread, thanks to you @Maus0728  for getting active on this and still support.

No worries! I am just happy to share to everybody what I have learned so far during our online classes. I just happen to fell in love in creating these logic circuit.

If you want to verify your boolean expression and K-map, you can use the links below.
[1] https://www.boolean-algebra.com/
[2] https://getcalc.com/karnaugh-map/4variable-kmap-solver.htm?input=0+1+2+4+8

Just make sure that you know what you doing before using those otherwise it is considered cheating LOL.

[Peanutswar]

Good day member our topic are still up and we are waiting for you to answer the questions, this may help you to earn knowledge and try your luck with the use of basic logic, also we are going to reveal if the light if going to lights on or off according to the given problem.

Im looking forward to your answers.


5 sMerit left

[Debonaire217]

It just takes me back from the day I was busy on our 10th anniversary here on Bitcointalk when I created this quite complex project:

https://bitcointalk.org/index.php?topic=5193860.msg52956146#msg52956146

And this is the diagram

The basics of logic gates helped me to understand how the circuit works, it was just fascinating because other than the application of this to Electronics and IOT, Logic gates are also essential in coding. If we have more time, we can research logical operators and it seems like understanding logic gates will also be a bridge for better opportunities. I hope those who first saw OP's post could appreciate the importance of these symbols and their meaning. Sometimes, it is essential to social life too to completely understanding the usage of "OR" and "And" when making decisions in life.

[Peanutswar]

I think this deserves another up to the people who would like to learn with the logic gates you can use this to the future.

Still giving away  5 sMerit left

It just takes me back from the day I was busy on our 10th anniversary here on Bitcointalk when I created this quite complex project:

https://bitcointalk.org/index.php?topic=5193860.msg52956146#msg52956146

And this is the diagram

.....

I saw your previous project submitted on the anniversary of the bitcointalk and this is so good I'm hoping I try this kind of project too but the problem right now due to this pandemic I cant buy that equipment and tools, I want to try with the use of the RFID too.

[bitcoinermatt]

Is the topic still going? Whats the current question?

[Muenalo]

Wow.. Thanks so much for this write up.
You just remind me of my year one first semester course back then in the polytechnic "Introduction to Computing", But thou, I am not saying I was very good in the course oh, but at least I can still remember few things.

That if a certain condition is true, it turns “ON” and goes “OFF” when the condition is false. And that Logic Gate accepts the input and operates on a required condition.

And that there are seven types of Logic Gates. Which include:

NOT Gate (Inverter)
AND Gate (Multiplication)
OR Gate (Addition)
NAND Gate
NOR Gate
XOR Gate
XNOR Gate

So thank you once again for sharing this.

[fugit00]

1   10010010
2   01111111
3   00101101 00110101
4   00000011 
5   11111011
6   1
7   On

[Peanutswar]

Is the topic still going? Whats the current question?

We have 4 smerit left This is the question https://bitcointalk.org/index.php?topic=5263519.msg55228819#msg55228819

1   10010010
2   01111111
3   00101101 00110101
4   00000011  
5   11111011
6   1
7   On

Congrats fugit00  got the correct answer, thank you for  answering, now we will show the output with the use of tinkercad

1.AND

A B	10010100 11001010

2.NAND

A B	11001010 11001010

3.NOT

A B	110011101 11010010

4.XNOR

A B	11010010 11001010

5.XOR

A B	11010010 11100101

[PhoenixZephyrus]

1 10000000
2 00110101
3 001100010 00101101
4 11100111
5 00110111

I'm actually learning these in my classes right now, so this was a nice way to try out if I could do these on my own! I have also been learning on how to implement logic gates with Python, which is also one of the classes that I take currently, although I am yet to try them out on actual circuit boards, as I havent been able to get my hands on one due to the online classes.

[Peanutswar]

I would like to congratulate PhoenixZephyrus got the correct answer. It's been a long time before I get an update but now we are back on track I encourage newcomers to try these logic gates. 3 smerit left

1.AND

A B	11001001 11001010

2.NAND

A B	11001010 11001011

3.NOT

A B	11111010 11001010

4.XNOR

A B	11001010 11001010

5.XOR

A B	11001010 11001100

Looking forward to your answers. Good luck.

[BevNation]

I would like to congratulate PhoenixZephyrus got the correct answer. It's been a long time before I get an update but now we are back on track I encourage newcomers to try these logic gates. 3 smerit left

1.AND

A B	11001001 11001010

2.NAND

A B	11001010 11001011

3.NOT

A B	11111010 11001010

4.XNOR

A B	11001010 11001010

5.XOR

A B	11001010 11001100

Looking forward to your answers. Good luck.

I remember this exercise from my days in high school. It was really confusing back then. Let me try if I still have some knowledge on it.

1. AND = 11001000
2. NAND = 00110101
3. NOT = A - 00000101
                 B - 00110101
4. XNOR = 11111111
5. XOR = 00000110

How did I do?

[Saucinnn]

I would like to congratulate PhoenixZephyrus got the correct answer. It's been a long time before I get an update but now we are back on track I encourage newcomers to try these logic gates. 3 smerit left

1.AND

A B	11001001 11001010

2.NAND

A B	11001010 11001011

3.NOT

A B	11111010 11001010

4.XNOR

A B	11001010 11001010

5.XOR

A B	11001010 11001100

Looking forward to your answers. Good luck.

For question 1:
11001000
For question 2:
00110101
For question 3:
A-00000101
B-00110101
For question 4:
11111111
For question 5:
00000110

[Peanutswar]

Sorry for taking so long, BevNation got the correct answer

~~

Saucinnn you can try for my next update its better if you made faster to ce

~~

Here we go for another set of question 2 smerit left



1.NAND

A B	11010010 11001001

2.AND

A B	11100110 11010010

3.NOT

A B	11001000 11001001

4.XNOR

A B	11001000 00100010

5.XOR

A B	11100101 11000101

Looking forward for your answers goodluck!.

[soliton]

1. NAND  [If any of two bits false] => true  [if both bits true] => false
00111111

2.AND  [If any of two bits false] => false  [if both true] => true
11000010

3.NOT [If bit is  false] =>true  [if  bit is true] => false

A : 00110111
B: 00110110

4.XNOR [If both bits false] => true  [if both bits true] => true [If one of two bits  false] => false

00010101

5.XOR [If both bits  false] =>false  [if both bits  true] => false [If one of two bits false] => true

00100000

[Kittygalore]

1.NAND

A B	11010010 11001001

2.AND

A B	11100110 11010010

3.NOT

A B	11001000 11001001

4.XNOR

A B	11001000 00100010

5.XOR

A B	11100101 11000101

Looking forward for your answers goodluck!.

1.  00111111
2.  11000010
3.a 00110111
3.b 00110110
4. 00010101
5. 00100000

Tried to do it mentally because I was taught this back in my first year although I did failed the subject.

[soliton]

Is something wrong with my answer? I'm wondering because it’s been four days since the answer, but Peanutswar is  not paying attention. BTW, Kittygalore has posted solutions that coincide with mine which I got following the rules of Boolean algebra for logic operations in question.