I am starting to get beyond frustrated with gates and breadboards now in general because of this simple circuit (which is literally experiment #1 in my digital logic class).
Using only NAND gates, generate function F= (~A~C)+(~CD)+(ABC). Using only NOR gates, generate G= (~A+B)(A+~B)(~B+C).
I can’t get a consistent Logic level for each binary code value; ie it works except it’s off for 1111, or it works except 0001-0011, etc. I will try to post as many pics of the info I’ve done so far. I cannot get this to work. F worked for a little but I messed around with it and lost it. The teacher is no help; says my designs are fine yet gives confusing vague answers about literal connection junctions and how and why each affects the other based on gate voltages or whatnot and states no resistors at all are needed and that it is irrelevant whether or not empty inputs remain floating or empty etc. based on everything I’ve read my thoughts have become soup. I know how to theoretically do it; I’ve even simulated it out and the functions worked fine. I cannot even count the hours I’ve wasted killing brain cells just literally making every possible combination on the literal breadboard to no avail. Tried different gate sets, even bought an arduino power supply. Sorry for such an idiotic question but I’m literally losing my interest in college based on this kindergarten level issue I can’t tackle.
How does one know where inputs and the final output should be arranged? I.e., whether npn or pnp manufacturing requires specifically pull up or pull down resistors for the LED output, and whether or not you’re able to mix and match High Current models with low Schottkey.