edited by
9,977 views
42 votes
42 votes

What happens when a bit-string is XORed with itself $n$-times as shown:

$\left[B \oplus (B \oplus ( B \oplus (B \dots n \text{ times}\right]$

  1. complements when $n$ is even

  2. complements when $n$ is odd

  3. divides by $2^n$ always

  4. remains unchanged when $n$ is even

edited by

4 Answers

Best answer
47 votes
47 votes

It should be (D).

Let number of $⊕$ be two (even case):

$B ⊕ B ⊕ B = B ⊕ 0 = B$ (remains unchanged)

Let number of $⊕$ be three (odd case):

$B ⊕ B ⊕ B ⊕ B = B ⊕ B ⊕ 0 = B ⊕ B = 0 ($gives $0)$

edited by
8 votes
8 votes

correct me if i am wrong

4 votes
4 votes
Here " when a bit-string is XORed with itself n-times " means XORed n times not bit string n times

so ans should be D
3 votes
3 votes
The main important thing to be considered is the xor operation is done n times not the b  is repeated n times
Answer:

Related questions

22 votes
22 votes
3 answers
1
Kathleen asked Sep 25, 2014
9,069 views
Which of the following operations is commutative but not associative?ANDORNANDEXOR
31 votes
31 votes
2 answers
2
Kathleen asked Sep 25, 2014
8,099 views
The octal representation of an integer is $(342)_8$. If this were to be treated as an eight-bit integer in an $8085$ based computer, its decimal equivalent is$226$$-98$$7...
23 votes
23 votes
3 answers
3
Kathleen asked Sep 26, 2014
4,968 views
Design a synchronous counter to go through the following states:$$1, 4, 2, 3, 1, 4, 2, 3, 1, 4 \dots $$
31 votes
31 votes
3 answers
4