You, sir, are a fantastic teacher. I just spent 50 minutes in a lecture listening to a professor trying to teach this to a class and I just couldn't wrap my mind around it (not due to a lack of me trying). Then I watch this 8 minute video and I feel like I completely grasp the concept now. Thank you very much, you deserve my like.
Ohh, really, 1st time i got such cool info about how to solve of k-map...my teacher always miss some part while teaching.. but these 8 mins are gonna save me from practical exams... TY mate! :D
Hi Ray, The values for Y are arbitrary in this example, but normally they would come from the truth table, which would come from the output of a particular circuit or design. The part I cover in this video, assumes that you already have the truth table outputs, and that you need to get a simplified Boolean expression. Hope that helps! Cheers, Jim.
Hi Kyle, Thanks for taking the time to comment on the video. I often struggle with the speed to keep it moving at, since I don't want it to drag, but I do want to make sure that as many people as possible will find it useful, and not too fast an explanation. There is really a huge variety in people's prior knowledge, and learning speed, and I try and find the best fit as much as I can. Thanks for the feedback, and the compliment! Cheers, Jim.
Thanks! I appreciate the feedback, and I'm glad you found it useful. I will be preparing some more videos soon ... if there is anything you'd like to see, please let me know!
Well ... there's usually more than one way to get things done when you're dealing with Boolean simplification. Still I hope you found this helpful in some way.
Cool approach. The way I'm being taught is with the variables written above and beside each column but this works well too. What was the original expression from which the values in the truth table came? Thanks!
Hi Manuel, Yes, it can be simplified to y=BC + !D(A+C). I would actually consider either to be fully simplified ... and just off the top of my head, I think either circuit would require five gates, but you are correct ... good eye! :) Cheers, Jim.
Hi, Thanks for the feedback and comment! Basically, the values for Y in this example (and the 3-variable) come from the truth table. Where those values come from, is from the circuit being designed or analysed. The steps I cover in this video assume that you have already got the values you need from a particular circuit or design, and that you now need to simplify them. For this example, they're just values I picked to illustrate the example, Hope that helps! Cheers and thanks again, Jim.
The 1s and 0s get mapped from the truth table. I go more into detail about that on the 3-variable Karnaugh Map tutorial, so check that out, but if you still have questions after watching that, please let me know. Cheers, Jim.
I tried to learn this from a textbook and I just didn't get it. After watching your 3 and 4 term videos I'm finally getting it. Thanks! :) I do have something that I don't quite get though; about the overlapping and what is unique or not (7:03)
Hi Luke, Thanks for the feedback ... glad the videos are making a difference! As for your question, if you have loops of 2 or 4 or 8 terms, many times they will overlap other loops, but it's important that each one of your loops have at least a single "1" that only belongs to that loop. If you have a loop that every single "1" is also in another loop, then it's redundant. Hope that helps. If not email me at eln8303@gmail.com, and I'll make a video answer to your question for you. Cheers, Jim.
Thank you soo much! But I have a question. How do I know if it is a conjunctions or disjunctions at the end for Y? And also, does everytime a proposition variable is only 0 - i have to negate it? Thanks again!
can somebody tell me how to get y? for example is the first line d,c,b,a.. 0,0,0,0 = 0? and so forth.. you can give me a link instead if you feel like it or it is more appropriate..
teacher taught this for like 5 straight classes and i had no idea what was going on and you managed to teach it in under 10 min... amazing
Thanks for the comment and the kind words ... glad you enjoyed the video! Cheers, Jim.
You, sir, are a fantastic teacher. I just spent 50 minutes in a lecture listening to a professor trying to teach this to a class and I just couldn't wrap my mind around it (not due to a lack of me trying). Then I watch this 8 minute video and I feel like I completely grasp the concept now. Thank you very much, you deserve my like.
Thanks DigitalLogic . I'm 52 years old and I find your tutorial extreamly simple and useful.
God bless you. I was searching for an plausible explanation for over an hour now, until I came across this video.
Ohh, really, 1st time i got such cool info about how to solve of k-map...my teacher always miss some part while teaching.. but these 8 mins are gonna save me from practical exams...
TY mate! :D
Thank you for making it click! I could neither understand my professor's lecture nor any other K-Map tutorials.
Thank God for online teachers like you! My professor in digital electronics teaches really fast and she has a really low voice.
Daisy Lopez you are correct even my lecturer to.?
Same
You're Awesome! Now I understand what I couldn't get in the class. Very simple and clear. Thank you soooooo much
I gotta say, excellent video after 6 years this is still explained perfectly! good stuff!
If I pass my exam this time around, it will be thanks to you....
How did it go? :)
how did it go
how did it go?)
Very Helpful, it was the first time I meet the topic and thanks your video it is more easy now.
Thanks for the comment and the kind words! You're welcome, and I'm glad you enjoyed the video and found it helpful! Cheers, Jim.
i love this so much. i have computer architecture final on tuesday and this lecture is much appreciated.
This video gave me one extra point today in my exam. You are the best
This is the best video ever for K-Map !!!!!!!
very exact and explanatory presentation.. You are thankful by lots of brains!!!!!!!!!!!!!!
My professor couldn't teach this as well as you have. No over complication. Thank you.
thanks alot, helped me so much, way better than any teacher
Thanks for explaining things to do for while I was lost on what to do and how my teacher was getting his results. Now, I've got this :D
Thanks ... glad you found it helpful!
thanks a lot , i was looking for a good tuto that teach me the right way to do it ! and i finally found it
Hi Ray,
The values for Y are arbitrary in this example, but normally they would come from the truth table, which would come from the output of a particular circuit or design. The part I cover in this video, assumes that you already have the truth table outputs, and that you need to get a simplified Boolean expression. Hope that helps!
Cheers,
Jim.
You saved my life just in 7 minutes!
Hi Kyle,
Thanks for taking the time to comment on the video.
I often struggle with the speed to keep it moving at, since I don't want it to drag, but I do want to make sure that as many people as possible will find it useful, and not too fast an explanation.
There is really a huge variety in people's prior knowledge, and learning speed, and I try and find the best fit as much as I can.
Thanks for the feedback, and the compliment!
Cheers,
Jim.
Thanks man, I just couldn't understand how the products formed from all the written material I've read. Now it's clear :D
You're welcome! Thanks for the comment and the kind words! Cheers, Jim.
You taught this to me in a quick min. Couldn't figure this out alone just staring at my paper.
Hi Aya,
You're welcome!
I'm glad you found it helpful!
Cheers and thanks for the feedback!
Jim.
Thank you very much! It was really very helpful, as it was nicely explained. May God reward you for it.
Hi Murthy,
You're welcome.
Glad I was able to help!
Cheers and thanks,
Jim.
thank you very much! this video was one of the best videos I have seen on youtube! very efficient.
confirm the same. excellent!
You are an excellent orator.
OMG, THANK YOU SO MUCH!!!! This is way 100x times easier to understand than my stupid textbook
Thanks a lot bro.I wonder, what would be the world without THE UA-cam.
such a great video. Helped me finally understand what the heck is going on! thank you very much!!
Thanks for the feedback ... glad you liked it!
Clear explanation, thanks buddy, helping an aspiring engineer!
Thanks! I appreciate the feedback, and I'm glad you found it useful. I will be preparing some more videos soon ... if there is anything you'd like to see, please let me know!
Thanks. I can boldly face this in the exam hot seat today.
you saved me from failing, thank you
Hey, thanks for the comment and the feedback! Cheers, Jim.
Hi Khang, you're welcome ... glad you found it helpful! Cheers, Jim.
Hi Daniel,
Glad it made it easier ... and you're welcome!
Cheers,
Jim.
Hey lovelybear29!
You are very welcome! Happy you found it useful ... :)
Thanks and regards,
Jim.
You're welcome! I appreciate the feedback ... thanks!
Well ... there's usually more than one way to get things done when you're dealing with Boolean simplification. Still I hope you found this helpful in some way.
Hi Asmaa,
You're welcome! Glad you found it helpful.
Cheers and thanks,
Jim.
very easy to follow explanation, helped me a ton thanks a lot
From the bottom of mu heart .. thank you
Cool approach. The way I'm being taught is with the variables written above and beside each column but this works well too. What was the original expression from which the values in the truth table came? Thanks!
Hi Manuel,
Yes, it can be simplified to y=BC + !D(A+C). I would actually consider either to be fully simplified ... and just off the top of my head, I think either circuit would require five gates, but you are correct ... good eye! :)
Cheers,
Jim.
Hi,
Thanks for the feedback and comment!
Basically, the values for Y in this example (and the 3-variable) come from the truth table. Where those values come from, is from the circuit being designed or analysed. The steps I cover in this video assume that you have already got the values you need from a particular circuit or design, and that you now need to simplify them.
For this example, they're just values I picked to illustrate the example,
Hope that helps!
Cheers and thanks again,
Jim.
Thank you for this, this made things clear.
Do you have any idea how the y result comes from sir?
Thank you for the kind words ... I'm glad you found it helpful.
You're welcome! Glad you enjoyed it.
Thank you, and thanks for the comment.
You're welcome ... thanks for the comment!
I'm sorry, but could you direct me to the video that shows how to get the Y values for SOP and POS? Thanks!
Finally a good tutorial, thank you!
Perfectly understood thank you sir 🙏
Glad to hear it! Thanks for the feedback. Cheers, Jim.
thank you mate... you saved my life
Thanks a lot! Finally understood these
You're welcome!
Why does the video keep freezing at 1:30...
Where did you get zeroes and ones on the truth table, on Y side?
Hi, ! May i ask how you got the value for y? :/ sorry
Hi,
Glad you found it helpful! Thanks for the feedback!
Cheers,
Jim.
very helpful...i liked how you explained it!
The 1s and 0s get mapped from the truth table. I go more into detail about that on the 3-variable Karnaugh Map tutorial, so check that out, but if you still have questions after watching that, please let me know. Cheers, Jim.
Thanks man finally learned the topic
very good tutorial! thank you very much :D I finally undersotod how to do the labeling after circlign the loops! 10000x WAY BETTER THAN MY PROF!
How do you determine where the zeros, and ones go in the boxes of the K-map?
I tried to learn this from a textbook and I just didn't get it. After watching your 3 and 4 term videos I'm finally getting it. Thanks! :)
I do have something that I don't quite get though; about the overlapping and what is unique or not (7:03)
Thanks for posting this video. I can now understand it clearly. :D
but like how would you know which gate truth table to use?
You're welcome!
Cheers,
Jim.
Hi Luke,
Thanks for the feedback ... glad the videos are making a difference!
As for your question, if you have loops of 2 or 4 or 8 terms, many times they will overlap other loops, but it's important that each one of your loops have at least a single "1" that only belongs to that loop. If you have a loop that every single "1" is also in another loop, then it's redundant. Hope that helps. If not email me at eln8303@gmail.com, and I'll make a video answer to your question for you. Cheers, Jim.
Thank you soo much! But I have a question. How do I know if it is a conjunctions or disjunctions at the end for Y? And also, does everytime a proposition variable is only 0 - i have to negate it? Thanks again!
Ops, sorry for the stupid question. Its a disjunction if we cover the 1's and it is a conjunction if we cover the 0's.
Hi,
Thank you!
Glad you liked it.
Cheers,
Jim.
Thank you! Glad you found it useful. Cheers, Jim.
Damn it was soo halping...thankss alot.. i got my confusion clear..
Can we circle a node twice?
can somebody tell me how to get y? for example is the first line d,c,b,a.. 0,0,0,0 = 0? and so forth.. you can give me a link instead if you feel like it or it is more appropriate..
2021 God bless me that I will make this on my the most final exams
how will it work if you do it as boolesk math?
you saved my soul, Thank you
which gate has been used for the output?
Great tutorial, cheers!
Hi,
You're welcome! Glad it helped.
Cheers,
Jim.
Thanks for the feedback! Cheers, Jim.
Great tutorial!
You're welcome! Glad it helped!
Cheers,
Jim.
You're welcome. Glad it was useful! Cheers, Jim.
At the end, can the equation be simplyfied to Y= BC + !D(A+C) ?
You're a lifesaver
why is D = 0 on the truth table but 1 on the map?
Thanks for the explanation.
Are there any requirements in order to put the variables in the particular way DC/BA, for example would it matter if you wrote AB/CD or AD/CA ?
it outputs diffrence result, can anyone help ?
thank god... i found it ... great lesson bro :D
You helped me, a lot! Thank you!