UTpaper

Free mock tests & test series

Question 4Asked in UGC NET Computer Science, November 2017 (Paper II & III, Selected Questions)

Let A = [1 0 0]

Let A = [1 0 0] [0 1 0] [1 1 0] [0 0 1] and B = [1 1 1 0] [0 1 1 0] [1 0 1 1] Find the Boolean product A ⊙ B of the two matrices.
  1. A[1 1 1 0] [0 1 1 0] [1 1 1 0] [1 0 1 1]
  2. B[1 1 0 1] [0 1 0 1] [1 1 1 0] [1 0 1 1]
  3. C[1 1 1 1] [0 1 1 0] [1 1 1 0] [1 0 1 1]
  4. D[1 1 1 0] [0 1 1 0] [1 0 1 1] [1 0 1 1]
Show answerHide answer

Correct answer: (A) [1 1 1 0] [0 1 1 0] [1 1 1 0] [1 0 1 1]

Explanation

In the Boolean product, multiplication is replaced by logical AND and addition by logical OR. Row i of A ⊙ B is the OR of the rows of B selected by the 1s in row i of A: row 1 = B1 = 1110, row 2 = B2 = 0110, row 3 = B1 ∨ B2 = 1110, row 4 = B3 = 1011. So option (a) is correct.

From UGC NET Computer Science PYQ, November 2017 (Paper II & III, Selected Questions)

This is question 4 of UGC NET Computer Science PYQ, November 2017 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.