what are the uses of each logic gates:or,and,nand,nor,?
79803
you will find everything you want here:\n\nhttp://en.wikipedia.org/wiki/Logic_gates
49715
use bitwise operators. something like:\n\nnum_bits = 0;\nfor(i = 0; i < 32; i++) {\nif number & (1<<i) num_bits++;\n}\n\nnow num_bits holds the number of bits that were set in number. The "<<" operator does bit shifting. So "1<<i" equals a number that's all 0's except for a 1 at position i. If you bitwise and that with something, that tells you if that bit is set in the number. So we do this for each of the bits and add up the results.\n\nThis is assuming 32-bit integers. Adjust accordingly for 64-bit integers.
1090058
I made an OR Gate for my 12th project. The external examiner loved it & gave me full marks.OR Gate is a simple device which is used in variuos appliances.\nOR gate\nThe output Q is true if input A OR input B is true (or both of them are true): Q = A OR B \nAn OR gate can have two or more inputs, its output is true if at least one input is true. \n\n  Input A Input B Output Q \n 0              0            0 \n 0              1            1 \n 1              0           1 \n 1              1           1 \n \n Truth Table \n\nTrust me.I'm giving u the right advise.For more information on GATES u can go to google.com\nAll the best
458677
There's a very explicit algorithm which explains\nhow to handle number, operators (including left\nor right precedence), functions, etc. on the \nWikipedia site for RPN (see reference #1).\n\nMostly, it's very straight-forward.  If it's an operand\n(ie. a number), then push it on the stack.  If it's an\noperator, then pop off as many operands are needed and\nevaluate.\n\nBut do look at the full algorithm for the details.\n\nOh yeah, for a full-blown implementation, see the source\ncode to the Unix "dc" (desk calculator) program.  The\nSolaris source is at reference #2.
335286
7474 D type flip-flop:\n    Note: Use a slide switch to control your inputs (PRESET, CLEAR, D, etc...).\n    a) Start with CLK = 0, D = 0, PRESET = 1, CLEAR = 1.\n    b) Bring the CLEAR input low momentarily in order to start with Q = 0.\n    c) With Clear = 1and CLK = 0, change D. Record values.\n    d) Raise CLK to 1, and record values.\n    e) With CLK = 1, change D. record values.\n    f) Bring CLK back to 0, and record values.\n    g) Repeat the same sequence a) through f) except begin with D = 1 in step a), and use PRESET to make\n\n\nfor more info have a look at this link:\n\nhttp://www.engineering.sdsu.edu/~mansour/labs/flip_flops/flip_flops.htm
811007
Flip-Flop is a digital circuit to store a single bit.\nThey are used for storing digital data (in the form of 0s and 1s)\nThese are basic building blocks of any memory element.\nTo know more...
167194
Look at each segment in the display and determine for which numbers it should be on (logic 1), and which it should be off (logic 0). \n\nMake a truth table for all 4 input lines for each segment.\n\nCreate an expression for each segment using you favourite technique, such as Karnaugh maps.\n\nChange the expression to only use nand gates.\n\nDo happy dance, cuz you're done.
198617
"Gates" are more correctly called logic gates. As the name implies, logic gates perform decision functions in digital electronics, especially in computers. This website has a complete discussion about logic gates, along with associated symbology -->http://www.play-hookey.com/digital/basic_gates.html
246250
A bistable multivibrator is a fancy word for a flip flop.\n\nSo there are several answers possible here. The easiest is to make the 4 transistors into two 2-input NOR or NAND gates and cross couple them (see below). Of course, that assumes by transistor you mean bipolar and not FET, but the ideas are the same either way.
156384
That's a tall order.  If I had a spare 18 hrs I'd love to, however...\n\nThere's a chip that does it.  Its called an Arithmetic Logic Unit (ALU).  Here's some suggestions:\nhttp://www.xs4all.nl/~ganswijk/chipdir/f/alu.htm\n\nNo offense, but its a ton of work, with no assurance I'll get my 10 points.
934231
Can't answer the first question.\n\nThe native state of computer memory is null. That is not the same as blank or zero; it's nothing.
623671
There's both an explanation as well as a diagram\nof a 2 input AND gate built just from transistors at:\n\nhttp://tams-www.informatik.uni-hamburg.de/applets/cmos/cmosdemo.html
124129
The rule is:\n\noutput = input - 3
527482
There are several types of flip flops (or flops as most designers call them). They all start with a basic building block: the SR (set reset) flip flop. To make one, you take two NAND gates (or two NOR gates), each with 2 inputs. One input on each gate becomes an input to the flip flop. The other input connects to the other gate's output. This is easier to draw than describe (look here: http://www.play-hookey.com/digital/rs_nand_latch.html).\n\nOf course, you'll want to add a clock, JK logic, D logic, T logic, but the basic core is always a cross-coupled inverting pair of gates.\n\nSo consider if both inputs are 1 and the inital output from each gate while it "starts up" happens to be 0 (doesn't matter, but just say it is). The top NAND gate sees {1,0} and  outputs a 1. So that means the bottom NAND gate sees {1,1} and outputs a 0. The outputs will always be inverted from each other (Q and Qnot).\n\nSo if we bring the bottom input low for a bit, the bottom NAND gate now sees {1,0} and outputs a 1. This means the top gate now sees {1,1} and outputs a 0. So if the bottom gate is our "Q" output, the bottom input is the set input (S). \n\nDo the same logic with the top input and you will see that it will "reset" the flop so that Q=0 and Qnot=1. Just don't bring both inputs low at once (that's what a JK flip flop is for).
179798
RAM Random Access Memory\n\nROM Read Only Memory\n\nCMOS http://en.wikipedia.org/wiki/CMOS\n\nThe top two are self explanitory. One can be changed, one cant.
142802
They defy logic...\nhave a active low outputs (Digital logic term)
553452
Hyper-Threading.\nit's like a processor pretending to be 2.\ngenerally (depending on the application)\nit actually slows down performance\n\ni forgot the specifics on it, but it queus up instructions and splits them between two arithmetic logic units (ALUs)\nand other parts....\n\ndont take the second part of my answer word-for-word. i really don't remember the specifics