chapter 6 assessment - Hamilton circuits

The number of edges is K₁₁ is

• 22

• 55

• 45

• 11

The number of vertices in K₁₁ is

• 11

• 55

• 22

• 10

What is the Hamilton circuit using the nearest neighbor algorithm using a starting vertex of A?

• ABCDEFA

• ACDBEFA

• ADFECBA

• AEFCBDA

What is the Hamilton circuit using the cheapest link algorithm using a starting vertex of A?

• ABCDEFA

• ACDBEFA

• ADFECBA

• AEFCBDA

What is the Hamilton circuit using the repetitive nearest neighbor algorithm using a starting vertex of A?

• ABCD

• ABCDA

• ACDBA

• ADBCA

What is the Hamilton circuit using the nearest neighbor algorithm with starting vertex of Memphis?

• Memphis, Atlanta, Denver, Houston, Dallas, Kansas City, Memphis

• Memphis, Atlanta, Houston, Dallas, Kansas City, Denver, Memphis

• Memphis, Dallas, Houston, Denver, Atlanta, Kansas City, Memphis

• Memphis, Atlanta, Denver, Kansas City, Houston, Dallas, Memphis

What is the Hamilton circuit using the cheapest link algorithm with starting vertex of Memphis?

• Memphis, Atlanta, Denver, Houston, Dallas, Kansas City, Memphis

• Memphis, Atlanta, Houston, Dallas, Kansas City, Denver, Memphis

• Memphis, Dallas, Houston, Denver, Atlanta, Kansas City, Memphis

• Memphis, Atlanta, Denver, Kansas City, Houston, Dallas, Memphis

The brute force algorithm for solving a Hamilton circuit is

• optimal and inefficient

• optimal and efficient

• approximate and inefficient

• approximate and efficient

The nearest neighbor algorithm for solving a Hamilton circuit is

• approximate and efficient

• optimal and efficient

• approximate and inefficient

• optimal and inefficient

The cheapest link algorithm for solving a Hamilton circuit is

• approximate and inefficient

• optimal and inefficient

• approximate and efficient

• optimal and efficient