True or False
1. FIG depth-first traversal of the non-recursive algorithms typically queue implementation, the non-first traversal recursive algorithms typically implemented stack. (2 minutes)
Stack is a depth-first, breadth-first is a queue.
2. If there is no need to be twice the breadth-first search of G to access all of its vertices, then there must be G loop. (2 minutes)
3. If there is no need to be twice the breadth-first search graph G to access all of its vertices, then G must have two connected components. (2 minutes)
Multiple Choice
1. The following statement is not correct: (2 points)
The basic algorithm B. traverse in two ways: the depth and breadth traversal of traversal
C. FIG depth traversal is a recursive procedure
D. traversal depth map does not apply to the FIG.
2. In FIG represented by adjacency table has N nodes E of edges, depth-first traversal of the time complexity of the algorithm: (2 minutes)
BO (N + E)
C.O(N 2)
D.O(N 2×E)
3. If the departure from the non-primary vertices to any one of depth-first search can access all vertices, the FIG must: (2 minutes)
B. complete graph
C. There circuit diagram
D. a tree
4. FIG similar breadth first traversal of a binary tree: (1 min)
B. preorder
C. After-order traversal
D. traverse the level
5. FIG depth-first traversal of a binary tree similar to: (1 min)
B. preorder
C. After-order traversal
D. traverse the level
6. Since the point d in FIG starts depth may result obtained first traversal algorithm is: (2 minutes)
B.d,a,e,b,c,f
C.d,e,a,c,f,b
D.d,f,c,e,a,b
7. Given an undirected graph G, starting from a depth-first traversal V0 access to the set of edges is: {(V0, V1), (V0, V4), (V1, V2), (V1, V3), (V4, V5), (V5, V6)}. Which of the following side not appear in G? (3 points)
B.(V0,V6)
C.(V1,V5)
D. (V4, V6)
8. Given a following table to the adjacent graph. From the vertex V1 is traversed in depth-first search method A sequence of vertexes is obtained as: (2 minutes)
B.V1, V3, V4, V5, V2
C.V1, V4, V3, V5, V2
D.V1, V2, V4, V5, V3
9. Known as a graph adjacency matrix, starting from the vertex V1 is traversed in depth-first search method A possible sequence of vertexes is obtained: (2 minutes)
B.V1, V2, V4, V5, V6, V3
C.V1, V3, V5, V2, V4, V6
D.V1, V3, V5, V6, V4, V2
The title may be a bit ambiguous meaning, this question might not necessarily to refer to the adjacency matrix of order depth-first search. Many question here is meant to be strictly in accordance with the order of the adjacency matrix.
10. Given to the adjacent following a table of FIG. From the vertex V1 is traversed in depth-first search method A sequence of vertexes is obtained as: (2 minutes)
B.V1, V5, V4, V7, V6, V3, V2
C.V1, V2, V3, V4, V7, V6, V5
D.V1, V5, V6, V4, V7, V2, V3
11. The following options, rather than the depth-first search sequence diagram is: (2 minutes)
B.V1, V3, V2, V5, V4
C.V1, V2, V5, V4, V3
D.V1, V2, V3, V4, V5
12. If a depth-first search sequence diagram is {V1, V4, V0, V3, V2}, then the following sequence of which FIG impossible to be? (2 minutes)
B.
C.
D.
13.
B.V1V3V2V4
C.V1V2V4V3
D.V1V4V2V3
14. In FIG 
from a start point for depth-first traversal algorithm may result was obtained. (2 minutes)
B.a,c,f,e,b,d
C.a,e,b,c,f,d
D.a,e,d,f,c,b
15. Since the start point a in FIG breadth may result obtained first traversal algorithm is: (2 minutes)
B.a, c, f, e, b, d
C.a, e, b, c, f, d
D.a, b, e, c, d, f
16. Since the start point c in FIG breadth may result obtained first traversal algorithm is: (2 minutes)
B.c,a,f,d,e,b
C.c,f,a,d,e,b
D.c,f,a,b,d,e
17. If there is no need to be twice the breadth-first search of G to access all of its vertices, the following statements is not correct: (2 points)
There must be a circuit BG
FIG communication must not CG
There are two components communicating DG
18. Given to the adjacent following a table of FIG. From the vertex V1 is traversed in breadth-first search method A sequence of vertexes is obtained as: (2 minutes)
B.V1, V2, V3, V5, V4
C.V1, V3, V2, V4, V5
D.V1, V4, V3, V5, V2
19. Known as a graph adjacency matrix, starting from the vertex V1 is traversed in breadth-first search method A possible sequence of vertexes is obtained: (2 minutes)
B.V1, V2, V4, V5, V6, V3
C.V1, V3, V5, V2, V4, V6
D.V1, V3, V5, V6, V4, V2
Note that wide search
20. In FIG breadth first traversal algorithm used in a queue, team up into each vertex ____ times. (2 minutes)
B.2
C.3
D. uncertain