Simplify the following Boolean Expression using a KMap!

  1. F=A.B.C’.D + A’.B.C.D + A.B’.C.D + A.B.C.D’ + A.B.C.D + A’.B’.C.D + A’.B.C’.D + A’.B’.C.D + A.B’.C’.D
  2. F=A’.B’.C.D + A.B’.C’.D + A.B.C’.D’ + A.B’.C.D + A’.B’.C’.D + A.B’.C’.D’ + A’.B.C’.D’ + A’.B.C.D + A.B.C.D’
  3. ∏{0,1,3,4,5,14,15} & d{ 2,11,13}
  4. ∑ {0,1,3,4,7,8,11,15} & d{ 4,10,12,13}

Construct Logic Gates and Truth Table!

Hamming code consists of 7 bit (binary digit) that used to check error. 7 bit consist of 4 digit BCD (Binary Coded Decimal) and 3 parity bit!
For Odd Parity, check the following bit using Hamming Code to determine an error bit!

(a) 1100010
(b) 1000001
(c) 1011001
(d) 1101100