Question

Question1: Write an algorithm which returns 1 if number is even and returns 0 if number is odd. Algorithm: Checknum(n) Requires: an integer n Returns: 1 if n is even and o if n is odd. 1. if(n mod 2 ==0)then 2. return 1 3. else 4. return 0 5. endif Question2: Write an algorithm to implement logical operator XOR. Algorithm: XOR(a, b) Requires: two boolean variables a and b. Returns: a boolean value 1. if(a==b)then 2. return false 3. else 4. return true 5. endif

          Question1:
Write an algorithm which returns 1 if number is even and returns 0 if number is
odd.
Algorithm: Checknum(n)
Requires: an integer n
Returns: 1 if n is even and o if n is odd.
1. if(n mod 2 ==0)then
2. return 1
3. else
4. return 0
5. endif
Question2:
Write an algorithm to implement logical operator XOR.
Algorithm: XOR(a, b)
Requires: two boolean variables a and b.
Returns: a boolean value
1. if(a==b)then
2. return false
3. else
4. return true
5. endif

Question1:
Write an algorithm which returns 1 if number is even and returns 0 if number is
odd.
Algorithm: Checknum(n)
Requires: an integer n
Returns: 1 if n is even and o if n is odd.
1. if(n mod 2 ==0)then
2. return 1
3. else
4. return 0
5. endif
Question2:
Write an algorithm to implement logical operator XOR.
Algorithm: XOR(a, b)
Requires: two boolean variables a and b.
Returns: a boolean value
1. if(a==b)then
2. return false
3. else
4. return true
5. endif

Added by Troy B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Md.Daniyal Arshad

Step 1

It does this by checking if the remainder of n divided by 2 is equal to 0. If it is, then the algorithm returns 1, indicating that the number is even. If the remainder is not equal to 0, the algorithm returns 0, indicating that the number is odd. Show more…

Show all steps

Thanks for your feedback!

Question 1: Write an algorithm which returns 1 if the number is even and returns 0 if the number is odd. Algorithm: CheckNum(n) Requires: an integer n Returns: 1 if n is even and 0 if n is odd. 1. if (n mod 2 == 0) then 2. return 1 3. else 4. return 0 5. endif Question 2: Write an algorithm to implement the logical operator XOR. Algorithm: XOR(a, b) Requires: two boolean variables a and b. Returns: a boolean value 1. if (a == b) then 2. return false 3. else 4. return true 5. endif