In this we have to perform bitwise oprations like bitwise OR, bitwise AND, bitwise Ex-OR.
a) 1 1000 ∧ (0 1011 ∨ 1 1011)
0 1011 ∨ 1 1011 = 1 1011
1 1000 $\wedge$ 1 1011 = 1 1000
So, 1 1000 ∧ (0 1011 ∨ 1 1011) = 1 1000
b) (0 1111 ∧ 1 0101) ∨ 0 1000
0 1111 ∧ 1 0101 = 0 0101
0 0101 $\vee$ 0 1000 = 0 1101
So, (0 1111 ∧ 1 0101) ∨ 0 1000 = 0 1101
c) (0 1010 ⊕ 1 1011) ⊕ 0 1000
0 1010 ⊕ 1 1011 = 1 0001
1 0001 ⊕ 0 1000 = 1 1001
So, (0 1010 ⊕ 1 1011) ⊕ 0 1000 = 1 1001
d) (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011)
1 1011 ∨ 0 1010 = 1 1011
1 0001 ∨ 1 1011 = 1 1011
1 1011 $\wedge$ 1 1011 = 1 1011
So, (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011) = 1 1011