59 views

Uploaded by Morris Centeno

Hamilton Path or Circuit.

- coherent incoherent text.pdf
- SUMO_Qualnet_Tutorial
- 11.Graphs
- Re Up a Per
- Graphs and Their Uses
- Optimization Lecture 2
- Lab 8
- Applied Mathematics Question
- 9 - Graphs and The Contraction Algorithm
- bittner_raffel_scholz_areagraph.pdf
- Tute Graph Theory
- UNIT V
- The correlation structure of spatial autoregressions on graphs
- Unsolved Combinatorial Problems
- comp422-2011-Lecture23-GraphAlgorithms
- BChapter_2
- Tutorials Discrete
- 1-s2.0-S0377221799002842-main
- VideoMiningBook_Chapter7.pdf
- 38000

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

- coherent incoherent text.pdfUploaded byHameed Al-zubeiry
- SUMO_Qualnet_TutorialUploaded byskyone2k10
- 11.GraphsUploaded bybharat_wayal
- Re Up a PerUploaded byGokhan
- Graphs and Their UsesUploaded byMichael Calizo Pacis
- Optimization Lecture 2Uploaded byTurtle Cloutier
- Lab 8Uploaded byMankush Jain
- Applied Mathematics QuestionUploaded bySourav Kundu
- 9 - Graphs and The Contraction AlgorithmUploaded byjzegan
- bittner_raffel_scholz_areagraph.pdfUploaded byRicardo Parizotto
- Tute Graph TheoryUploaded byanything12340987
- UNIT VUploaded byprasadbabucst
- The correlation structure of spatial autoregressions on graphsUploaded byRobert Smith
- Unsolved Combinatorial ProblemsUploaded byhaiwentom
- comp422-2011-Lecture23-GraphAlgorithmsUploaded byaskbilladdmicrosoft
- BChapter_2Uploaded bysathiyavijayan
- Tutorials DiscreteUploaded byNeha Mittal
- 1-s2.0-S0377221799002842-mainUploaded byAntonio
- VideoMiningBook_Chapter7.pdfUploaded bySwathi Vishwanath
- 38000Uploaded byms6675223
- DSA Class Test - 2 18042017-AnswersUploaded bypabitra
- cellUploaded bymetamage
- Cs517 FinalUploaded bycsamora
- m2k Opm Lapper1Uploaded byJoanzarzal
- Unit7-CMUploaded byPrateekMandi
- ThesisFinal a Graph Theoretic Approach to CombinatorialUploaded byAdya Arkan Reyhan
- calculator Assigment.docxUploaded byPariyajo Isa
- James I. Lathrop, Jack H. Lutz and Scott M. Summers- Strict Self-Assembly of Discrete Sierpinski TrianglesUploaded byIrokk
- Exponential Ws1Uploaded byAkhil Raj
- Crossover and Mutation in Genetic Algorithms Using Graph-Encoded ChromosomesUploaded byDila Sapri

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

- ArtCAM Tutorijal 10Uploaded byIvan Nikolic
- Compressor Foundation RepairUploaded bydicktracy11
- Candle lighting messageUploaded byliezl Cm
- Lab1Uploaded byAshish Kumar
- 94d86611813aaa076baa4abc1f8ea61b91fdea68.3Uploaded byignaciomarin
- 14 Water BangladeshUploaded byA S M Hefzul Kabir
- Tool to Calculate Project CO2 Emission From Fossil Fuel CombustionUploaded byFrancisco Espinheira Nobre
- the_former_yugoslav_republic_of_macedonia_II.pdfUploaded bydiplomski Diplomsko
- Half RateUploaded byMinto Issac
- 11Text (1).pdfUploaded byCyrene MBolaños
- Karlheinz Stockhausen's New Morphology of Musical TimeUploaded byEverton Maia
- Digital-Logic-formula-notes-final-1.pdfUploaded byHima Sekhar
- jurnall.docxUploaded byFivi Kurniawati
- ASBATANKUploaded byNikos Recantzis
- 11-Care labelling.pdfUploaded byparthabhi
- B GL 332 006 Engineering Insert (2000)Uploaded byJustin
- Windsor Spirit Manual-PartsUploaded byNestor Marquez-Diaz
- Government Schemes 2017 by AffairsCloudUploaded byatultirkey
- horas 19 e 20Uploaded byMaramg
- WÄRTSILÄ 32 - project guideUploaded byDaniel Pérez Palao
- D6352Uploaded byrimi7al
- Marigold Garden by Greenaway, Kate, 1846-1901Uploaded byGutenberg.org
- LeukoplakiaUploaded byKrisna Aditya
- Fuel Conservation - BoeingUploaded byGuilherme Bernabe
- MBC21JOrganometUploaded bytaylor
- IWQ Standards for IndiaUploaded byÇhårū Kêsh
- Bizgram Pricelist May 7tha 2012Uploaded byBizgram Asia
- Review of EN13001Uploaded bywandjawad
- 59160-Feed-TapUploaded byyraju88
- There Are No Incurable DiseasesUploaded byRajesh Kumar