How does bitwise xor work?



How does bitwise xor work?..

Answer / Vikash Kumar Ruhela

Bitwise XOR (^) performs a bit-by-bit comparison of the two operands. If the corresponding bits are different, the result is 1; if they are the same, the result is 0.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More C Sharp Interview Questions

How do you prevent a class from being inherited in c#?

1 Answers  


What is using keyword?

1 Answers  


What does console readkey do in c#?

1 Answers  


What is an inheritance ?Give an example in which inheritance is used?

1 Answers   Siebel,


What?s the C# equivalent of C++ catch (?), which was a catch-all statement for any possible exception?

1 Answers  


Can delegates be used as callbacks?

1 Answers  


What is boolean method?

1 Answers  


What is a dbml?

1 Answers  


What is difference between comparable and comparator?

1 Answers  


What is difference between asp net and c# net?

1 Answers  


Why do we use class in c#?

1 Answers  


c# code for how to merge two sorted arrays Input : A = 2,5,8,4 B = 3,9,10,5 Output : 2,3,4,5,5,8,9,10

3 Answers  


Categories