Network and Graph Theory Quiz

Which of the following is not a type of network?

• router

• printer

• server

• computer

Which of the following is used to represent a graph?

• adjacency matrix or adjacency list or adjacency set

• edge list or vertex list

• breadth-first search or depth-first search

• adjacency matrix or adjacency list

What is the minimum number of edges required for a connected graph with 'n' vertices?

• n

• 2n

• n-1

• n+1

Which algorithm is used to find the minimum spanning tree of a graph?

• Bellman-Ford algorithm

• Kruskal's algorithm

• Dijkstra's algorithm

• Prim's algorithm

A graph is Eulerian if and only if:

• The graph is connected.

• Every vertex has an odd degree.

• Every vertex has an even degree.

• There are no cycles in the graph.

Which of the following is not a type of network?

• router

• computer

• server

• printer

Which of the following is used to represent a graph?

• breadth-first search or depth-first search

• adjacency matrix or adjacency list or adjacency set

• adjacency matrix or adjacency list

• edge list or vertex list

What is the minimum number of edges required for a connected graph with 'n' vertices?

• n

• n+1

• n-1

• 2n

Which algorithm is used to find the minimum spanning tree of a graph?

• Bellman-Ford algorithm

• Prim's algorithm

• Kruskal's algorithm

• Dijkstra's algorithm

A graph is Eulerian if and only if:

• Every vertex has an even degree.

• The graph is connected.

• There are no cycles in the graph.

• Every vertex has an odd degree.