Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

GRAPH

Total questions: 87

Worksheet time: 44mins

Name
Class
Date
1.

Which set represents the vertices of the graph?

a)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

b)

{1, 2, 3, 4, 5, 6,}

c)

{1, 2, 3, 4, 5, 6, 7}

d)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

2.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

3.

Which set represents the vertices of the graph?

a)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

b)

{1, 2, 3, 4, 5, 6,}

c)

{1, 2, 3, 4, 5, 6, 7}

d)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

4.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

5.

Which two vertices are adjacent vertices?

a)

5 is adjacent to 6

b)

3 is adjacent to 6

c)

4 is adjacent to 1

d)

3 is adjacent to 2

6.

The graph represents the following vocabulary term.

a)

Cycle

b)

Path

c)

Complete Graph

d)

Complete Bipartite Graph

7.

What is the weight of the shortest path from A to F?

a)

5

b)

7

c)

9

d)

11

8.

Which vertices are adjacent to E?

a)

B and C

b)

B, C, D, and A

c)

B

d)

A, B, C, D, F, G

9.

Which is an example of a disconnected graph?

a)
b)
c)
d)
e)

None are disconnected graphs

10.

Which of the following is true?

a)

A graph may contain no edges and many vertices

b)

A graph may contain many edges and no vertices

c)

A graph may contain no edges and no vertices

11.

Which of the following is not a style of graph traversal in computing?

a)

Breadth-First

b)

Depth-First

c)

Height-First

12.

Graph traversal is used to find the ______ route to visit all nodes in a network

a)

Shortest

b)

Best

c)

Longest

d)

Most secure

13.

Which method of graph traversal makes use of a stack?

a)

Depth-First

b)

Breadth-First

14.

Which method of graph traversal makes use of a queue?

a)

Depth-First

b)

Breadth-First

15.

Which order of traversal is correct using depth-first?

a)

A B C G D E F

b)

A B D C E C G

16.

Which of the following beginnings to a graph traversal would not be correct for depth-first?

a)

A B C G

b)

A D F

c)

A E D F

d)

A B D C

17.

Which order of traversal is correct using breadth-first?

a)

A B D E C F G

b)

A B C G D E F

18.

A has been visited what happens next

a)

Visit B

b)

Visit D

c)

Visit E

d)

Visit C

19.

With breadth-first traversal, which node will be visited next?

a)

C

b)

F

c)

G

20.

Which set represents the vertices of the graph?

a)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

b)

{1, 2, 3, 4, 5, 6,}

c)

{1, 2, 3, 4, 5, 6, 7}

d)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

21.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

22.

Which two vertices are adjacent vertices?

a)

5 is adjacent to 6

b)

3 is adjacent to 6

c)

4 is adjacent to 1

d)

3 is adjacent to 2

23.

The graph represents the following vocabulary term.

a)

Cycle

b)

Path

c)

Complete Graph

d)

Complete Bipartite Graph

24.

What is the weight of the shortest path from A to F?

a)

5

b)

7

c)

9

d)

11

25.

Which vertices are adjacent to E?

a)

B and C

b)

B, C, D, and A

c)

B

d)

A, B, C, D, F, G

26.

Which is an example of a disconnected graph?

a)
b)
c)
d)
e)

None are disconnected graphs

27.

Which of the following is true?

a)

A graph may contain no edges and many vertices

b)

A graph may contain many edges and no vertices

c)

A graph may contain no edges and no vertices

28.

Which of the following is not a style of graph traversal in computing?

a)

Breadth-First

b)

Depth-First

c)

Height-First

29.

Graph traversal is used to find the ______ route to visit all nodes in a network

a)

Shortest

b)

Best

c)

Longest

d)

Most secure

30.

Which method of graph traversal makes use of a stack?

a)

Depth-First

b)

Breadth-First

31.

Which method of graph traversal makes use of a queue?

a)

Depth-First

b)

Breadth-First

32.

Which order of traversal is correct using depth-first?

a)

A B C G D E F

b)

A B D C E C G

33.

Which of the following beginnings to a graph traversal would not be correct for depth-first?

a)

A B C G

b)

A D F

c)

A E D F

d)

A B D C

34.

Which order of traversal is correct using breadth-first?

a)

A B D E C F G

b)

A B C G D E F

35.

A has been visited what happens next

a)

Visit B

b)

Visit D

c)

Visit E

d)

Visit C

36.

With breadth-first traversal, which node will be visited next?

a)

C

b)

F

c)

G

37.

Which set represents the vertices of the graph?

a)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

b)

{1, 2, 3, 4, 5, 6,}

c)

{1, 2, 3, 4, 5, 6, 7}

d)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

38.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

39.

Which two vertices are adjacent vertices?

a)

5 is adjacent to 6

b)

3 is adjacent to 6

c)

4 is adjacent to 1

d)

3 is adjacent to 2

40.

The graph represents the following vocabulary term.

a)

Cycle

b)

Path

c)

Complete Graph

d)

Complete Bipartite Graph

41.

What is the weight of the shortest path from A to F?

a)

5

b)

7

c)

9

d)

11

42.

Which vertices are adjacent to E?

a)

B and C

b)

B, C, D, and A

c)

B

d)

A, B, C, D, F, G

43.

Which is an example of a disconnected graph?

a)
b)
c)
d)
e)

None are disconnected graphs

44.

Which of the following is true?

a)

A graph may contain no edges and many vertices

b)

A graph may contain many edges and no vertices

c)

A graph may contain no edges and no vertices

45.

Which of the following is not a style of graph traversal in computing?

a)

Breadth-First

b)

Depth-First

c)

Height-First

46.

Graph traversal is used to find the ______ route to visit all nodes in a network

a)

Shortest

b)

Best

c)

Longest

d)

Most secure

47.

Which method of graph traversal makes use of a stack?

a)

Depth-First

b)

Breadth-First

48.

Which method of graph traversal makes use of a queue?

a)

Depth-First

b)

Breadth-First

49.

Which order of traversal is correct using depth-first?

a)

A B C G D E F

b)

A B D C E C G

50.

Which of the following beginnings to a graph traversal would not be correct for depth-first?

a)

A B C G

b)

A D F

c)

A E D F

d)

A B D C

51.

Which order of traversal is correct using breadth-first?

a)

A B D E C F G

b)

A B C G D E F

52.

A has been visited what happens next

a)

Visit B

b)

Visit D

c)

Visit E

d)

Visit C

53.

With breadth-first traversal, which node will be visited next?

a)

C

b)

F

c)

G

54.

Which set represents the vertices of the graph?

a)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

b)

{1, 2, 3, 4, 5, 6,}

c)

{1, 2, 3, 4, 5, 6, 7}

d)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

55.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

56.

Which two vertices are adjacent vertices?

a)

5 is adjacent to 6

b)

3 is adjacent to 6

c)

4 is adjacent to 1

d)

3 is adjacent to 2

57.

The graph represents the following vocabulary term.

a)

Cycle

b)

Path

c)

Complete Graph

d)

Complete Bipartite Graph

58.

What is the weight of the shortest path from A to F?

a)

5

b)

7

c)

9

d)

11

59.

Which vertices are adjacent to E?

a)

B and C

b)

B, C, D, and A

c)

B

d)

A, B, C, D, F, G

60.

Which is an example of a disconnected graph?

a)
b)
c)
d)
e)

None are disconnected graphs

61.

Which of the following is true?

a)

A graph may contain no edges and many vertices

b)

A graph may contain many edges and no vertices

c)

A graph may contain no edges and no vertices

62.

Which of the following is not a style of graph traversal in computing?

a)

Breadth-First

b)

Depth-First

c)

Height-First

63.

Graph traversal is used to find the ______ route to visit all nodes in a network

a)

Shortest

b)

Best

c)

Longest

d)

Most secure

64.

Which method of graph traversal makes use of a stack?

a)

Depth-First

b)

Breadth-First

65.

Which method of graph traversal makes use of a queue?

a)

Depth-First

b)

Breadth-First

66.

Which order of traversal is correct using depth-first?

a)

A B C G D E F

b)

A B D C E C G

67.

Which of the following beginnings to a graph traversal would not be correct for depth-first?

a)

A B C G

b)

A D F

c)

A E D F

d)

A B D C

68.

Which order of traversal is correct using breadth-first?

a)

A B D E C F G

b)

A B C G D E F

69.

A has been visited what happens next

a)

Visit B

b)

Visit D

c)

Visit E

d)

Visit C

70.

With breadth-first traversal, which node will be visited next?

a)

C

b)

F

c)

G

71.

Which set represents the vertices of the graph?

a)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}

b)

{1, 2, 3, 4, 5, 6,}

c)

{1, 2, 3, 4, 5, 6, 7}

d)

{1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

72.

What is the degree of vertex 4?

a)

3

b)

4

c)

5

d)

7

73.

Which two vertices are adjacent vertices?

a)

5 is adjacent to 6

b)

3 is adjacent to 6

c)

4 is adjacent to 1

d)

3 is adjacent to 2

74.

The graph represents the following vocabulary term.

a)

Cycle

b)

Path

c)

Complete Graph

d)

Complete Bipartite Graph

75.

What is the weight of the shortest path from A to F?

a)

5

b)

7

c)

9

d)

11

76.

Which vertices are adjacent to E?

a)

B and C

b)

B, C, D, and A

c)

B

d)

A, B, C, D, F, G

77.

Which is an example of a disconnected graph?

a)
b)
c)
d)
e)

None are disconnected graphs

78.

Which of the following is true?

a)

A graph may contain no edges and many vertices

b)

A graph may contain many edges and no vertices

c)

A graph may contain no edges and no vertices

79.

Which of the following is not a style of graph traversal in computing?

a)

Breadth-First

b)

Depth-First

c)

Height-First

80.

Graph traversal is used to find the ______ route to visit all nodes in a network

a)

Shortest

b)

Best

c)

Longest

d)

Most secure

81.

Which method of graph traversal makes use of a stack?

a)

Depth-First

b)

Breadth-First

82.

Which method of graph traversal makes use of a queue?

a)

Depth-First

b)

Breadth-First

83.

Which order of traversal is correct using depth-first?

a)

A B C G D E F

b)

A B D C E C G

84.

Which of the following beginnings to a graph traversal would not be correct for depth-first?

a)

A B C G

b)

A D F

c)

A E D F

d)

A B D C

85.

Which order of traversal is correct using breadth-first?

a)

A B D E C F G

b)

A B C G D E F

86.

A has been visited what happens next

a)

Visit B

b)

Visit D

c)

Visit E

d)

Visit C

87.

With breadth-first traversal, which node will be visited next?

a)

C

b)

F

c)

G

Similar Resources on Wayground

PRELIMINARY EXAMINATION [PC4]

90 questions

PRELIMINARY EXAMINATION [PC4]

quiz

Worksheet

•

University

scp test

86 questions

scp test

quiz

Worksheet

•

KG - University

Teste HCIA-AI T1

86 questions

Teste HCIA-AI T1

quiz

Worksheet

•

University

J08 多媒体播放与制作

89 questions

J08 多媒体播放与制作

quiz

Worksheet

•

1st Grade - University

ULANGAN BERSAMA KELAS 10 SEMESTER GANJIL SMAGO

85 questions

ULANGAN BERSAMA KELAS 10 SEMESTER GANJIL SMAGO

quiz

Worksheet

•

10th Grade - University

python

82 questions

python

quiz

Worksheet

•

University

Mega Quiz

85 questions

Mega Quiz

quiz

Worksheet

•

11th Grade - Professi...

Math Revision Quiz

86 questions

Math Revision Quiz

quiz

Worksheet

•

8th Grade - University