Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 439 Weeks Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Computer Science Posted 29 Apr 2017 My Price 5.00

Assuming that each tour can be generated

1. a. Assuming that each tour can be generated in constant time, what will be the efficiency class of the exhaustive-search algorithm outlined in the text for the traveling salesman problem?

b. If this algorithm is programmed on a computer that makes ten billion additions per second, estimate the maximum number of cities for which the problem can be solved in

i. 1 hour. ii. 24 hours. iii. 1 year. iv. 1 century.

2. Outline an exhaustive-search algorithm for the Hamiltonian circuit problem.

 

 

Answers

(8)
Status NEW Posted 29 Apr 2017 10:04 AM My Price 5.00

-----------

Attachments

file 1493463145-Answer.docx preview (238 words )
1-----------. a-----------. A-----------ssu-----------min-----------g t-----------hat----------- ea-----------ch -----------tou-----------r c-----------an -----------be -----------gen-----------era-----------ted----------- in----------- co-----------nst-----------ant----------- ti-----------me,----------- wh-----------at -----------wil-----------l b-----------e t-----------he -----------eff-----------ici-----------enc-----------y c-----------las-----------s o-----------f t-----------he -----------exh-----------aus-----------tiv-----------e-s-----------ear-----------ch -----------alg-----------ori-----------thm----------- ou-----------tli-----------ned----------- in----------- th-----------e t-----------ext----------- fo-----------r t-----------he -----------tra-----------vel-----------ing----------- sa-----------les-----------man----------- pr-----------obl-----------em?----------- b-----------. I-----------f t-----------his----------- al-----------gor-----------ith-----------m i-----------s p-----------rog-----------ram-----------med----------- on----------- a -----------com-----------put-----------er -----------tha-----------t m-----------ake-----------s t-----------en -----------bil-----------lio-----------n a-----------ddi-----------tio-----------ns -----------per----------- se-----------con-----------d, -----------est-----------ima-----------te -----------the----------- ma-----------xim-----------um -----------num-----------ber----------- of----------- ci-----------tie-----------s f-----------or -----------whi-----------ch -----------the----------- pr-----------obl-----------em -----------can----------- be----------- so-----------lve-----------d i-----------n -----------i. -----------1 h-----------our-----------. i-----------i. -----------24 -----------hou-----------rs.----------- ii-----------i. -----------1 y-----------ear-----------. i-----------v. -----------1 c-----------ent-----------ury-----------. -----------2. -----------Out-----------lin-----------e a-----------n
Not Rated(0)