M

Mr. Dubey • 100.69K Points
Coach

Q. A directed graph G = (V, E) is said to be finite if its ________.

  • (A) set V of vertices is finite
  • (B) set V of vertices & set E of edges are finite
  • (C) set E of edges are finite
  • (D) no vertices & edges are repeated
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. . Let S={1, 2, 3}. How many subsets does S contain?

Q. In domain relaional calculus “there exist”

Q. Find the value of a4 for the recurrence relation an=2an-1+3, with a0=6.

Q. Single sideband AM systems occupy same bandwidth as of conventional AM systems.

Q. In many classification problems, the target dataset is made up of categorical labels which cannot immediately be processed by any algorithm. An encodi

Q. Mistakes made in the system analysis stage show up in

Q. In a relational database a referential integrity constraint can be specified with the help of

Q. The statement comprising the limitations of FOL is/are ____________

Q. A packet filter firewall filters at

Q. Which of the following expressions is not equivalent to X ' ?

Question analytics