recategorized by
647 views
2 votes
2 votes

A palindrome reads the same forwards and backwards. (For example, $10101$ and $1001$ are palindromes). Suppose you want a machine that takes a number with the four binary digits and outputs a $1$ only if the number is a palindrome.
You can build this with two XOR gates, one NOT gate, and which other extra kind of gate?

  1. AND
  2. OR
  3. XOR
  4. NOT
recategorized by

1 Answer

2 votes
2 votes
Applied Course 2019 Mock1-39
We want to check if A and D are equal, and B and C are equal; if so we have a palindrome.
A $XOR$ D will return $0$ if the inputs are same.
B $XOR$ C will return $0$ if the inputs are same.
Therefore we need to check if both of those expressions are $0$, that is NOT ((A XOR D) OR (B XOR C)).
Answer:

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
1 answer
2
Applied Course asked Jan 16, 2019
506 views
How many number bits are required to represent a $32$ digit decimal number in binary?$6$ bits$32$ bits$106$ bits$107$ bits
1 votes
1 votes
1 answer
3
Applied Course asked Jan 16, 2019
491 views
What is the minimal form of the function of the given $k$-map, where $\phi$ is the don't care term?$a'b+bd+bc'$$a'b+bd+ad+bc'$$a'b+ad+bd$$a'b+bc'+ad$
1 votes
1 votes
1 answer
4
Applied Course asked Jan 16, 2019
705 views
$\begin{array}{l} A = 2000 \\ B = A - 999 \\ C = A + B - 998 \\ D = A + B + C - 997 \\ \vdots \\ \vdots \\ Z = A + B + C + \dots + Y - 975 \end{array}$How much $\frac{Z+1...