Boolean Reduction, Using Karnaugh-maps, and Assembly program using NASM
||this is a very short 3 questions task. First is you are given a Boolean expression and you have to reduce it using Boolean laws.(Note this is not very basic so dont bid thinking its an easy version. off course if you are good you can be done in probably five mins or less with this one. The second task is use the same boolean expression in the previous question and solve it using Using Karnaugh-map...
||C Programming, Electrical Engineering, Assembly, x86/x64 Assembler
||Mar 5, 2014
||Mar 5, 2014Ends - 16h 20m