The Hamiltonian path
Authored by S61620 izzy
Mathematics
1st - 5th Grade
CCSS covered
Used 9+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
20 sec • 5 pts
What is Hamiltonian path?
A Hamiltonian path is a path that visits each vertex of the graph twice.
A Hamiltonian path is a path that visits each vertex of the graph exactly once.
2.
MULTIPLE CHOICE QUESTION
20 sec • 5 pts
Does the graph have hampath?
Yes
No
3.
MULTIPLE CHOICE QUESTION
10 sec • 5 pts
Does hampath is NP complete?
Yes
No
4.
MULTIPLE CHOICE QUESTION
20 sec • 5 pts
Does the graph have hampath?
Yes
No
5.
MULTIPLE CHOICE QUESTION
20 sec • 5 pts
What is c1, c2, c3 and ck represent for?
vertices
clauses
variables
nodes
Tags
CCSS.HSA.CED.A.3
6.
MULTIPLE CHOICE QUESTION
10 sec • 5 pts
How many vertices in the graph?
3
5
4
2
7.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Does the graph TRUE?
Yes
No
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
