True/False (Write the word True or False in the blanks.) Section 5.1 Graphs ____

Question

True/False  (Write the word True or False in the blanks.)

Section 5.1  Graphs

________1.  A connected graph has an arc between any two nodes.

________2.  No matter how a planar graph is drawn, its arcs will intersect only at nodes.

________3.  A directed graph has a direction associated with each arc.

________4.  A directed graph is defined by using a function associating with each arc an unordered pair of nodes.

________5.  A map of airline routes identifying the names of the cities (but not the travel distances) is an example of a weighted graph.

________6.  Logic networks are directed graphs.

________7.  A loop is the same thing as a cycle.

________8.  A loop is a path from some node back to that same node.

________9.  A complete graph is one in which any two distinct nodes are adjacent.

_______10.  A simple graph is one with no cycles.

_______11.  A planar graph contains parallel arcs.

_______12.  A graph is connected if there is a path from any node to any other node.

_______13.  Adjacency matrices and adjacency lists are data structures used for computer representations of graphs.

_______14.  A graph with relatively few arcs can be represented more efficiently by storing only the nonzero entries of the adjacency matrix in an adjacency list.

Section 5.2  Trees

_______15.  A tree is an acyclic connected graph with one node designated as the root of the tree.

_______16.  The height of a tree is the length of the shortest path from the root to any node.

_______17.  A leaf is a node with no children.

_______18.  Binary trees are those where each node has exactly two children.

_______19.  A full binary tree occurs when each node has exactly two children and all the leaves are at the same depth.

_______20.  A tree is a graph.

_______21.  A complete binary tree is an almost-full binary tree.

_______22.  Algebraic expressions involving binary operations can be represented by labeled binary trees.

_______23.  Tree traversal is a systematic mechanism for writing out data values stored at all the nodes.

Explanation / Answer

1-true

2-false

3-true

4-true

5-fasle

6-true

7-false

8-false

9-false

10-true

11-false

12-true

13-true

14-true

15-false

16-true

17-false

18-false

19-true

20-false

21-true

22-true

23-false

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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