adplus-dvertising
frame-decoration

Question

Consider the following two matrices. Find the boolean product AʘB of the two matrices.

a.

1

b.

2

c.

3

d.

4

Answer: (a).1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider the following two matrices. Find the boolean product AʘB of the two matrices.

Similar Questions

Discover Related MCQs

Q. How many distinguishable permutations of the letters in the word BANANA are there?

Q. Let P and Q be two propositions, ⌐(P ↔ Q) is equivalent to:

Q. Negation of the proposition Ǝ x H(x) is:

Q. Consider the following two sequences :

X = <B, C, D, C, A, B, C>
and Y = <C, A, D, B, C, B>

The length of longest common subsequence of X and Y is:

Q. A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:

Q. An undirected graph G (V, E) contains n (n > 2) nodes named v1, v2,...,vn. Two nodes vi and vj are connected if and only if 0 < | i – j | ≤ 2. Each edge (vi, vj) is assigned a weight i+j.
The cost of the minimum spanning tree of such a graph with 10 nodes is :

Q. Which of the following is a valid reason for causing degeneracy in a transportation problem? Here m is no. of rows and n is no. of columns in transportation table.

Q. Consider the following LPP :

Max Z=15x1+10x2
Subject to the constraints
4x1+6x2 ≤ 360
3x1+0x2 ≤ 180
0x1+5x2 ≤ 200
x1, x2 ≥ 0

The solution of the LPP using Graphical solution technique is :

Q. Consider the following LPP :

Min Z=2x1+x2+3x3
Subject to :
x1−2x2+x3 ≥ 4
2x1+x2+x3 ≤ 8
x1−x3 ≥ 0
x1, x2, x3 ≥ 0

The solution of this LPP using Dual Simplex Method is :

Q. Consider a single perceptron with sign activation function. The perceptron is represented by weight vector [0.4 −0.3 0.1]^t and a bias θ=0. If the input vector to the perceptron is X=[0.2 0.6 0.5] then the output of the perceptron is :