53.True or False A directed graph (or digraph, for short) consists ofVand E wher

Question

53.True or False A directed graph (or digraph, for short) consists ofVand E wherevisa set of objects called vertices. An individual element of V, called a vertex istypically pictured as a dot or a circle labeled with the name of the vertex. Eis a setofdirected edges and is a subsetofvxv 54 True or False The in-degree of a vertex vevisthe number of edges pointing into it. 55. True or False The internet is a digraph 56. True or False A Path is a walk that doesn't repeat a vertex. 57.True or False Transitive closure of digraph G could be called a reachable graph. 62-63 concern graphs, not digraphs 58.True or False Avertex c is a neighborofvertex bifand only if b. c is an edge 59. True or False The degree of a vertex is the number of neighbors it has 60 True or False The total degree of a graph is the productofthe degrees ofallof the vertices 61.True or False Free tree is missing a root, and can have cycles. 62.True or False Let Tbe a tree and let u and v be two vertices in T There is exactly one path between u and v 63. True or False A game tree shows all possible playing strategies of both players in a game. 64. True or False A tree traversal processes the information stored in the vertices by systematically visiting each vertex. 65.True or False An algorithm is a step-by-step method for solving a problem. A description of an algorithm specifies the input to the problem the output to the problem, and the sequence of steps to be followed to obtain the output from the input.Arecipe is an example of an algorithm in which the ingredients are the inputand the finaldish is the output. 66. True or False The choice of algorithm can have a ber dramatic effect on how efficiently the solution is obtained. The amount of a particular resource used by an algorithm is referred to as the algorithm's computationalcomplexity. 67. True or False Big-oh usally refer to time, but it can also refer to s 68. The fastest is Big-Oh is o 69. whose common name is 7o. Factorial, Polynomial, Exponential Using the first letter of the name, Estin ascending order the complexity. Forexample, if you think they already are in order you would write FPE. 71, The Big-oh of x +45x is o 72. It's common name is 73.5 nanoseconds is 74.7 megabytes is 75.4 gigahertz is

Explanation / Answer

53. (True): A diagraph G have a non empty set V(G) and E(G) and each element in E(G) is called as a directed edge or an arc, and connects two vertex in a direction.

54.(True): The in-degree of a vertex is number edges directed toward it.

56.(True): A path from one vertex to other is a walk between two vertex which doesn’t consist of a repeated edges.

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.