Perform XNOR of two numbers
The problem at hand involves performing an XNOR operation on two given numbers. An XNOR operation (also known as equivalence operation) takes two binary inputs and produces a single binary output. It returns 1 if both inputs are the same (either both 0 or both 1), and 0 if the inputs are different. In this article, we'll explore the problem statement, understand the concept behind the XNOR operation, provide a stepbystep approach to solving the problem, and analyze the time complexity of the solution.
Problem Statement and Description
The task is to perform the XNOR operation on two given integers, x
and y
. The goal is to
compute the result of x ⊙ y
, where ⊙
represents the XNOR operation.
For example, if x
is 12 (binary 1100) and y
is 6 (binary 0110), then:
 The XNOR of the least significant bits is 0 (0 ⊙ 0 = 1).
 The XNOR of the next bits is 1 (1 ⊙ 1 = 1).
 The XNOR of the next bits is 1 (0 ⊙ 0 = 1).
 The XNOR of the most significant bits is 1 (0 ⊙ 0 = 1). So, the result is 0101, which is 5 in decimal.
Another example
7 in binary is 00111 18 in binary is 10010. Now we can perform the XNOR operation on each corresponding bit:
7 00111
18 10010

1 XNOR 0 = 0
1 XNOR 1 = 1
1 XNOR 0 = 0
0 XNOR 0 = 1
0 XNOR 1 = 0
Therefore, the XNOR of 7 and 18 is 01010 in binary, which is 10 in decimal.
Idea to Solve the Problem
To perform the XNOR operation on two numbers x
and y
, we can break down the problem into
XNOR operations on individual bits of the two numbers. We'll compare the corresponding bits of x
and
y
and compute the XNOR for each pair of bits, resulting in the corresponding bits of the final output.
Pseudocode
Here's a highlevel pseudocode for solving the problem:
function setAllBit(num):
n = num
n = n  n >> 1
n = n  n >> 2
n = n  n >> 4
n = n  n >> 8
n = n  n >> 16
return n
function xnor(x, y):
result = 0
if x > y:
result = (setAllBit(x) ^ x) ^ y
else:
result = (setAllBit(y) ^ y) ^ x
return result
function main():
task = create ExclusiveNOR object
task.xnor(12, 6)
task.xnor(7, 18)
task.xnor(45, 32)
Algorithm Explanation

The
setAllBit
function takes an integernum
and activates all the bits after the most significant bit, effectively creating a number with all bits set to 1 up to the position of the most significant bit. 
The
xnor
function takes two integers,x
andy
, and performs the XNOR operation using thesetAllBit
function. 
If
x
is greater thany
, the function computes(setAllBit(x) ^ x) ^ y
.setAllBit(x)
ensures that all bits up to the most significant bit are set to 1. The first XNOR (
^ x
) comparessetAllBit(x)
withx
.  The second XNOR (
^ y
) compares the result of the first XNOR withy
.

If
y
is greater thanx
, the function computes(setAllBit(y) ^ y) ^ x
following a similar logic. 
The
main
function creates anExclusiveNOR
object and calls thexnor
function for three sets of inputs.
Code Solution

1) XNOR of two numbers in java
2) XNOR of two numbers in c
3) XNOR of two numbers in c++
4) XNOR of two numbers in c#
5) XNOR of two numbers in vb.net
6) XNOR of two numbers in php
7) XNOR of two numbers in node js
8) XNOR of two numbers in python
9) XNOR of two numbers in ruby
10) XNOR of two numbers in scala
11) XNOR of two numbers in swift
12) XNOR of two numbers in kotlin
13) XNOR of two numbers in golang
14) XNOR of two numbers in typescript
Time Complexity
The setAllBit
function runs in O(1) time because it operates on a fixed number of bits, regardless of
the input value. The xnor
function has a constant number of operations for each input pair, and its
time complexity is also O(1). The main
function runs the xnor
function three times, so its
time complexity is still O(1).
Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.
New Comment