0 Up votes0 Down votes

59 views11 pagesHamilton Path or Circuit.

Mar 08, 2015

© © All Rights Reserved

DOCX, PDF, TXT or read online from Scribd

Hamilton Path or Circuit.

© All Rights Reserved

59 views

Hamilton Path or Circuit.

© All Rights Reserved

- A Course in Combinatorics
- A Divide-And-Conquer Approach for Minimum Spanning Tree-Based Clustering
- BCS 042 Notes
- 20 DTA_Road (TR2005)
- A Course in Combinatorics.vilsonVanlint
- A Course in Combinatorics Lint, Wilson
- adhoc
- kruskal
- Graph Isomorphism as Hsp
- Edexcel D1 Revision Sheets
- 4O03_assin1
- Micheli +Synthesis+and+Optimization+of+Digital+Circuits+(Converted).Page003
- graph lecture
- Col 180308
- Hamilton Cycles
- On realizing all simple graphs with a given.pdf
- sli06
- AN APPLICATION OF Gd-METRIC SPACES AND METRIC DIMENSION OF GRAPHS
- Slides2 - Copy
- DAA 5

You are on page 1of 11

or answers the question.

Use the figure below to answer the following question(s).

A) Graph 2 only

B) Graph 1 only

C) Graphs 1 and 3

D) Graph 3 only

E) None of the above

A) Graph 3 only

B) Graphs 1 and 2

C) Graph 2 only

D) Graph 1 only

E) None of the above

An undercover police officer is assigned the job of once a night walking each of

the 48 blocks of a certain section of town described by the street grid shown

below. The walk starts and ends at A. The officer wants to minimize the total

number of blocks he has to walk each night.

3) How many vertices of odd degree are there in the graph representing this problem?

A) 22

B) 20

C) 18

D) 24

E) None of the above

4) An optimal eulerization of the graph representing this problem can be obtained by adding

A) 12 edges.

B) 10 edges.

C) 11 edges.

D) 9 edges

E) None of the above

adding

A) 12 edges.

B) 10 edges.

C) 11 edges.

D) 9 edges

E) None of the above

6) In an optimal trip through the neighborhood, what are the number of streets the officer

will walk down more than once?

A) 9 streets

B) 11 streets

C) 12 streets

D) 10 streets

E) None of the above

7) In the graph we start at vertex A and travel to C. If we are using Fleury's algorithm, which

vertex will we not travel to next?

A) B

B) D

C) E

D) We can travel to either B, D, or E.

E) None of the above

A) 3.

B) 6.

C) 8.

D) 1.

E) None of the above

9) In a complete graph with 12 vertices (A through L), the total number of Hamilton circuits

(including mirror-image circuits) that start at vertex A is

A) 11!.

B) 10!.

C) 12!.

D) 13!.

E) None of the above

A) has several Hamilton circuits, all of which contain the edge AD.

B) has no Hamilton circuit.

C) has a single Hamilton circuit (and its mirror-image circuit).

D) has several Hamilton circuits, none of which contain the edge BC.

E) None of the above

and E). The trip must start and end at A. The graph below shows the distances (in

miles) between locations. We want to minimize the total distance traveled.

11) How many Hamilton circuits would we have to check if we use the repetitive nearest

neighbor algorithm?

A) 12

B) 4

C) 5

D) 30

12) The nearest-neighbor algorithm applied to the graph yields the following solution:

A) A, E, C, D, B, A.

B) A, D, B, E, C, A.

C) A, B, C, D, E, A.

D) A, C, D, B, E, A.

E) None of the above

13) The cheapest-link algorithm applied to the graph yields the following solution:

A) A, C, D, B, E, A.

B) A, D, B, E, C, A.

C) A, E, C, D, B, A.

D) A, B, C, D, E, A.

E) None of the above

14) The brute-force algorithm for solving the Traveling Salesman Problem is

A) an approximate and efficient algorithm.

B) an approximate and inefficient algorithm.

C) an optimal and inefficient algorithm.

D) an optimal and efficient algorithm.

E) None of the above

15) Which of the following four graphs is a tree?

B) Graph 1 and Graph 3

C) Graph 2 and Graph 3

D) Graph 2 and Graph 4

E) None of the above

A) T has no bridges.

B) T has one bridge.

C) T has 20 bridges.

D) T can have any number of bridges.

E) None of the above

17) How many spanning trees does the following graph have?

A) 4

B) 8

C) 3

D) 5

E) None of the above

The question(s) that follow refer to the problem of finding the minimum spanning

tree for the weighted graph shown below.

A) CD

B) AB

C) AC

D) BD

E) None of the above

A) AC

B) CD

C) AB

D) BD

E) None of the above

A) 60.

B) 34.

C) 39.

D) 49.

E) None of the above

MULTIPLE CHOICE. Choose the one alternative that best completes the statement

or answers the question.

1) D

2) D

3) B

4) A

5) A

6) C

7) C

8) B

9) A

10) A

11) C

12) D

13) D

14) C

15) B

16) C

17) A

18) C

19) D

20) C

- A Course in CombinatoricsUploaded byWalner Mendonça Santos
- A Divide-And-Conquer Approach for Minimum Spanning Tree-Based ClusteringUploaded bySandesh Kumar
- BCS 042 NotesUploaded byharisankarsgm
- 20 DTA_Road (TR2005)Uploaded byguido gentile
- A Course in Combinatorics.vilsonVanlintUploaded byrohanvermaaaaa
- A Course in Combinatorics Lint, WilsonUploaded byStephan Caamano
- adhocUploaded byrajouta19
- kruskalUploaded byGaurav Srivastava
- Graph Isomorphism as HspUploaded byOmar Shehab
- Edexcel D1 Revision SheetsUploaded byrtb101
- 4O03_assin1Uploaded byapex1911
- Micheli +Synthesis+and+Optimization+of+Digital+Circuits+(Converted).Page003Uploaded bySantosh Sanjeev
- graph lectureUploaded byEunice Saur
- Col 180308Uploaded byalexandru_bratu_6
- Hamilton CyclesUploaded byAnamaria Fercu
- On realizing all simple graphs with a given.pdfUploaded byphoeberamos
- sli06Uploaded byAntonio Carlos Salzvedel Furtado
- AN APPLICATION OF Gd-METRIC SPACES AND METRIC DIMENSION OF GRAPHSUploaded byMegan Bell
- Slides2 - CopyUploaded byJuhiRai
- DAA 5Uploaded byRam Prasad Gudiwada
- On Time Versus Space 1977Uploaded byPyotr Gyuyoung Chang
- Implementation of Paper Genealogy in Subgraph MiningUploaded byEditor IJRITCC
- Module 1Uploaded byvidhya_bineesh
- match78n2_307-322Uploaded bydragance106
- CV SUNYANUploaded byHaco Chinedu Obasi
- A System for Visualization of Big Attributed Hierarchical GraphsUploaded byAIRCC - IJCNC
- 174193_Lec07.pdfUploaded byalb3rtnet
- CT Assignment01Uploaded byRavindra Joshi
- minimumUploaded byBinsent Ribera
- 331788042-Anthony-Vidler-s-The-Third-Typology.docxUploaded bySilviaMarina

- Polya's Problem Solving ModelUploaded byElena N.
- My Reflection in Math.pdfUploaded bymorris5254
- Problems for SketchpadUploaded byMorris Centeno
- Business Ethics Chp001Uploaded byMorris Centeno
- VALUES EDUCATION SYLLABUS.Uploaded byMorris Centeno
- Human Resource ManagementUploaded bymarksman77661
- Contemporary Teaching Strategies - Lecture (Complete)Uploaded byMorris Centeno
- Fundamentally Fixing Maths EducationUploaded byMorris Centeno
- Applications of Sets and Venn DiagramsUploaded byMorris Centeno
- Maturation ProcessUploaded byMorris Centeno
- Ict Integration Into ClassroomsUploaded byMorris Centeno
- GeogebraUploaded bySaurabh Gupta
- Hereditary, Maturation and EnvironmentUploaded byMorris Centeno
- Gen PsychoMWF12.00 1.00Uploaded byMorris Centeno

- CompterScienceSyllabus5-8Semesters.pdfUploaded bybinzbinz
- graph_theory_notes.pdfUploaded bysonarika123
- Concept of AlgorithmUploaded byTheSaint Evans-Damoah Benjamin
- Tablenotes GateUploaded bynivi_09
- DISCRETE OPTIMIZATION PROBLEMSUploaded byZaid Hadi
- Graph-- chandan.pptxUploaded bysuraj
- NP-hard Graph Problems on Clique-Width Bounded GraphsUploaded byShreyas Shirwadkar
- The Traveling Salesman Computational Solutions for TSP ApplicationsUploaded byJohn
- Discrete Structure Chapter 7 GraphsUploaded byrockers91
- 6rt7yUploaded bySumit Bide
- HAMITONIAN CIRCUITS (Using Backtracking Method)Uploaded bymanas_kumar_23
- DAA_Questions with answer.docxUploaded byprianka rr
- gtnotes1Uploaded byBrijesh Singh
- Graph theory notesUploaded bymazhar10325
- 5705-105.pdfUploaded byrednri
- project everfi missions 1-10 directionsUploaded byapi-372868175
- MB5014 - Tutorial 3Uploaded bycrazydom
- Spring 2015Uploaded byAnonymous 7d2WetVROe
- GraphsUploaded byRavi Raj
- American Mathematical Society - Sample PaperUploaded bysampleGeek
- Spring 2009 Final term final Mth202Uploaded bycs619finalproject.com
- Logical-Thinking.pdfUploaded byRaghul Muthu
- UNIT - IVUploaded byJit Agg
- Atomic algorithm and the servers' s use to find the Hamiltonian cyclesUploaded byAnonymous 7VPPkWS8O
- Problemas Discreta en 15-16Uploaded byRaulete Olmedo
- Question mte 3104Uploaded byencikseni
- Edge WeightedUploaded bySachin
- r059210502-mathematical-foundation-of-computer-scienceUploaded bySrinivasa Rao G
- Algorithm to ChkUploaded byrajkumar.manju
- TSPUploaded byfoxtrot1992

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.