LOGIC AND TRUTH TABLES - Modesto Junior College



9.3 Hamilton Circuits – visit every vertex, rather than every edgeEx a Suppose you wish to plan a Nebraskan trip, starting in Lincoln, visiting Blair, Fremont, Hastings, and Lexington in any order, returning to Lincoln. Find a route that approximates the shortest distance.Fremont (F)Hastings (H)Lexington (X)Lincoln (L)Blair (B)2415921166Fremont13719053Hastings89101Lexington166Brute force method – precise, takes a long timeNearest Neighbor algorithm – from your starting position, choose the shortest distancesCheapest Link – find the shortest distance possible and use it1. Draw a graph with the 5 cities at the vertices.Label each edge with the distance between.2. How many different trips (circuits) are therestarting & finishing in Lincoln?3. Use the nearest neighbor & cheapest link algorithms to find Hamiltonian circuits.Total DistTotal DistTotal DistTotal DistTotal DistTotal DistTry: Starting in Newman, traveling to Modesto, Turlock, Sonora, and Livermore find a circuit with an approximately minimal distance.TurlockSonoraLivermoreModestoNewman21755824Turlock546414Sonora9151Livermore48Two-way Hamilton Circuits (e.g. airfares) – opposite trips have different valuesEx c Starting in Chicago, you want to visit NY, LA, and Miami. Approximate a minimal price.FromTo:CHINYCLAXMIACHI19429974NYC24319979LAX299119124MIA7479124Homework for Nov. 17, 2015 - Submit your project!For In-Class PresentationsGive your oral presentation in class on Nov. 17, 2015. Submit a sheet with your name, the title of your presentation, and your bibliography in class on Nov. 17, 2015. The bibliography is worth 10 pts.If you miss for documented reasons (illness, car trouble), you must e-mail me by 11:55 pm. on Nov. 17. The “make-up” date for oral presentations is Nov. 24, 2015. Unexcused make-ups will receive a 15% penalty. No presentations will be allowed after Nov. 24.For Written PresentationsBring ONE paper copy of your presentation to class to submit.e-mail me (peterseny@mjc.edu) a copy of the report (.pdf, .doc or .docx) by 6:00 pm Nov. 17, 2015. If either the paper copy OR the e-mail copy are missing at the time due, a 5% penalty will be given. If both are missing at the time due, a 15% late penalty will be given. The last date for late paper collection is Nov. 24 (in class or 11:55 pm for e-mail submission). No late projects will be accepted after that time.For Web-based Presentationse-mail me a link to your presentation, or an attachment containing the media presentation by 6:00 pm, Nov. 17, 2015.Submit a sheet with your name, the title of your presentation, and your bibliography in class on Nov. 17, 2015. The bibliography is worth 10 pts.If the e-mail is missing at the time due, a 15% late penalty will be given. The last date for e-mail submission is Nov. 24, 11:55 pm. No late projects will be accepted after that time. ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download