Com. Sci. Fcs: Building Computer Circuits

Front 1

What is the input and what are the condition for each output for Compare-for-equality (CE) circuits?

Back 1

Input: two "unsigned" binary numbers

Output: 1 if inputs are identical;

0 otherwise

Front 2

What circuit does (a • b) + (~a • ~b) represent?

Back 2

Compare-for-equality circuit

Front 3

What is the input and output for a full adder circuit?

Back 3

Input: two "unsigned N-bit" numbers

Output: the sum of the input

Front 4

Within Java, what is an n-bit integer, and what is an unsigned n-bit integer?

Back 4

N-bit integer: a number between -2^(n-1) and 2^(n-1) -1

Unsigned N-bit integer: a number between 0 and 2^n -1

Front 5

What does the Boolean expression (~ai • ~bi • ci) + (~ai • bi • ~ci) + (ai • ~bi • ~ci) + (ai • bi • ci) represent?

Back 5

The sum digit, si

Front 6

What does the Boolean expression (~ai • bi • ci) + (ai • ~bi • ci) + (ai • bi • ~ci) + (ai • bi • ci) represent?

Back 6

The carry digit, c(i + 1)