M

Mr. Dubey • 100.69K Points
Coach

Q. Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph (including loops) of the transitive closure of this relation has

  • (A) 16 arrows
  • (B) 12 arrows
  • (C) 8 arrows
  • (D) 6 arrows
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The time horizon in Data warehouse is usually __________.

Q. The first step in the naïve greedy algorithm is?

Q. The output of an information source is

Q. )*5/9) for x in t]

Q. Which of the following is considered as the top of the stack in the linked list implementation of the stack?

Q. What does an escape code represent?

Q. Which statement is true about neural network and linear regression models?

Q. Identify the feature of co-ordination being highlighted in the given statement: “Coordination is not a one time function, it begins at the plann

Q. DNS can use services of________using the well known port 53

Q. Master slave flip flop is also referred to as?

Question analytics