Graphs Essentials Quiz

Test

Parties jouées 0

Créer une copie

À propos de cette activité

Fundamentals of graphs

Créé par

Dhanushree3016 Dhanushree

India

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi

		%
	Anonyme	%
		%
		%

Imprimez votre jeu

Graphs Essentials Quiz


Graphs Essentials QuizVersion en ligne Fundamentals of graphs par Dhanushree3016 Dhanushree 1 What is a simple graph? a A graph with directed edges only b A graph with no loops and no multiple edges c A graph with weighted edges only d A graph with at least one loop 2 In a complete graph K_n, how many edges are there? a n^2 b n(n-1)/2 c 2^(n-1) d n(n-1) 3 What distinguishes a multigraph from a simple graph? a It must be directed b It has no edges at all c It has exactly one edge between any pair of vertices d It may have multiple edges between the same pair of vertices 4 What is a loop in a graph? a An edge with no endpoints b An edge that connects two distinct components c An edge from a vertex to itself d An edge that is not part of any cycle 5 What is the degree of a vertex in a graph with a loop attached? a It counts the loop twice b It counts the loop once c It is zero if only a loop is incident d It is always 1 6 Which graph type allows multiple edges but no restrictions on loops? a Multigraph b Directed acyclic graph c Simple graph d Null graph 7 In an undirected graph, what does the path length count? a Sum of vertex degrees b Number of connected components c Number of vertices visited d Number of edges in the path 8 What is a Hamiltonian path? a A cycle that visits every edge once b A path that visits every vertex exactly once c A path visiting a subset of vertices d A path with maximum degree 2 9 What is a spanning tree of a connected graph? a A cycle that covers every vertex b A subgraph with maximum degree 4 c A subgraph containing all edges d A a subgraph that is a tree including all vertices 10 If a graph has n vertices and is complete, how many edges does it have? a n(n-1) b n^2 c 2n-1 d n(n-1)/2 Feedback 1 A simple graph has at most one edge between any two vertices and no edge from a vertex to itself. 2 K_n has every pair of distinct vertices connected by a unique edge. 3 Multigraphs allow parallel edges; simple graphs do not. 4 A loop starts and ends at the same vertex. 5 A loop contributes 2 to the degree of its vertex. 6 A multigraph permits parallel edges; loops are optional depending on definition. 7 Path length is measured by edges traversed along the route. 8 Hamiltonian path traverses all vertices once without repetition. 9 Spanning tree connects all vertices with no cycles. 10 Complete graphs connect every pair of distinct vertices.

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

Graphs Essentials Quiz

Test

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Test

Practice Quiz - Punnett Square, Variation, and Mutations

Test

UPS 5 Seeing Habits Quiz

Test

Spanish Alphabet Listening

Test

Photosynthesis vs Cellular Respiration - Practice Quiz

Test

Tissues - Practice Quiz

Graphs Essentials QuizVersion en ligne

par Dhanushree3016 Dhanushree

What is a simple graph?

In a complete graph K_n, how many edges are there?

What distinguishes a multigraph from a simple graph?

What is a loop in a graph?

What is the degree of a vertex in a graph with a loop attached?

Which graph type allows multiple edges but no restrictions on loops?

In an undirected graph, what does the path length count?

What is a Hamiltonian path?

What is a spanning tree of a connected graph?

If a graph has n vertices and is complete, how many edges does it have?

Feedback