Operators

Question 1

prefix increment (++i)

Answer 1

i is incremented by 1 and then assigned to a value

Question 2

postfix increment (i++)

Answer 2

i is assigned to a value and then incremented by 1

Question 3

prefix decrement (–i)

Answer 3

i is decremented by 1 and then assigned to a value

Question 4

postfix decrement (i–)

Answer 4

i is assigned to value and then decremented by 1

Question 5

addition assignment (a += b)

Answer 5

a = a + b

Question 6

subtraction assignment (a -= b)

Answer 6

a = a - b

Question 7

multiplication assignment (a *= b)

Answer 7

a = a * b

Question 8

division assignment (a /= b)

Answer 8

a = a / b

Question 9

modulo assignment (a %= b)

Answer 9

a = a % b

Question 10

bitwise AND assignment (a &= b)

Answer 10

a = a & b

Question 11

bitwise OR assignment (a |= b)

Answer 11

a = a | b

Question 12

bitwise XOR assignment (a ^= b)

Answer 12

a = a ^ b

Question 13

bitwise left shift assignment (a

Answer 13

a = a

Question 14

bitwise right shift assignment ( a&raquo_space;= b)

Answer 14

a = a&raquo_space; b

Question 15

Java ternary conditional

Answer 15

result = testCondition ? value1 : value2

Question 16

C ternary conditional

Answer 16

if (a > b) {
    result = x;
} else {
    result = y;
}

OR

result = a > b ? x : y;

Question 17

logical left shift assignment (a

Answer 17

a = a

Question 18

logical right shift assignment (a&raquo_space;>= b)

Answer 18

a = a&raquo_space;>b

Question 19

difference between an arithmetic shift and a logical shift?

Answer 19

An arithmetic shift is a bitwise operation that shifts all of the bits of its operand; every bit in the operand is simply moved a given number of bit positions, and the vacant bit-positions are filled in. Instead of being filled with all 0s, as in logical shift, when shifting to the right, the leftmost bit (usually the sign bit in signed integer representations) is replicated to fill in all the vacant positions (this is a kind of sign extension).

Unlike an arithmetic shift, a logical shift does not preserve a number’s sign bit or distinguish a number’s exponent from its mantissa; every bit in the operand is simply moved a given number of bit positions, and the vacant bit-positions are filled in, usually with zeros.

Question 20

Subtract two numbers without using arithmetic operators

Answer 20

int subtract(int x, int y)
{
    // Iterate till there is no carry
    while (y != 0)
    {
        // borrow contains common set bits of y and unset
        // bits of x
        int borrow = (~x) & y;

        // Subtraction of bits of x and y where at least
        // one of the bits is not set
        x = x ^ y;

        // Borrow is shifted by one so that subtracting it from
        // x gives the required sum
        y = borrow