Best explaination video from like the 10 videos I've seen. You're the only one who precisely explains that you have to write the letters that are redondent in a line/column for the formula. Thank you.
haha me exactly. All the other videos where just grouping stuff and coming out with letters leaving me like, how/why did you select those letters for the final answer?
thank you very much sir, This has helped to fully understand this. My professor didn't explain to us how to do anything and just spoke as he wrote, you pointed out what you were specifically doing with each input, thank you for the clarity.
@kickersXY At time 2:30 in the video, in the group of 4 1s, A =0 in the first row and A=1 in the last row. Hence, A DOES change. Also, this is a 4 variable k-map so if you can create a group of 4, you will be left with only two variables in a grouping.
Thanks. The correction was made a year ago using RU-vid Annotations but realized Annotations are not visible on a Tablet or mobile device. I just added correction to the description.
Correction @ time 4:35 - The correction was made a year ago using RU-vid Annotations but realized Annotations are not visible on a Tablet or mobile device. Here is a correction: There was a mistake writing the expression on this example. The four courners, B=0 and D=0 so the four courners should be B'D' [(NOT B) AND (NOT D)]. The simplified expression should be:Y = [ B AND (NOT C) ] OR [(NOT B) AND (NOT D)] Y=BC'+B'D'
@ENGRTUTOR Oh you are correct, I did not notice that it was a group of 4 within the K-Map. I thought there was only two of them in a group. I have to be more careful next time. For some reason I did not see the other bottom row that were supposed to be in grouped with the top row in 2:30. Okay I understand it now, thanks heaps. Also, looking forward to your videos on SOP & POS canonical expressions, De Morgan's Theorem, and sketching logical input gates based on these expressions. ;-)
I get all of this so thank you for your help, however i have been given a question, and I'm not sure how to tackle it as output on the truth table is not given. The question says i need to 'Design a circuit that can be used to produce the parity bits data for the code in the truth table' however i am unsure how to do this, once i get the output i can do the rest! Please if anyone including yourself knows, help!! lol Cheers
Hello, does anyone know if it is incorrect to NOT group them using the continuous model he used? For example, if I just grouped the two 1's in the first row together, then the two 1's in the last row together and as well as the singular 1's in row 3 and row 4 by themselves. Would that be correct as well?
Hello, thank you but... I have a doubt: At 6:01 , the largest group should be the whole row. You took only two elements. *why* ? If you take the whole row you get: AB.
I have a question. Is it also possible two apply K-Maps if we have lets say 3 input variables and 2 output variables in the truth table? For example, the S-R Latch truth table has 3 inputs and two outputs. If so, can you please do a demonstration on it. ;-)
At 2:30 - A also does not change. So shouldn't the expression be A'B'C ??? A very helpful tutorial, thanks heaps. Btw, could you also please make more tutorial videos on De Morgan's Theorem --> Sum of Product (SOP) and Product of Sum (POS) expressions? Would be really nice if you did. ;-)
6:33 Can't you just do "((a xor b) and (c xnor d)) or ((a xnor b) and (c xor d))" instead of that entire expression? How would you even use xor or xnor in a k-map?
Eromosele ugberase 8 months late but if it is still helpfull... k maps are represented as squares or rectangles to simplify its interpretation, however in reality this map "bends" (kind of like a sphere) and therefore the corners end up side by side.