Consider 5 cities of interest, namely

a) reno,
b) san francisco,
c) salt lake city,
d) seattle,
e) las vegas.

use information on the road network and derive the miles from one city to the other. assume a fixed metric of miles per gallon = 40 and derive the cost of each transition in terms of miles. then on that basis, conduct the following: create a graph with each of its vertices corresponding to one of these cities and its edges being weighted by the associated miles for each trip. note that if (and only if) to go from city a to b you must go through c then you must add one edge from a to c and one edge from c to b and there is no need to add an edge directly from a to b. solve the traveling salesman problem such that traveling salesman starts from reno, visits all cities in the above list and returns to list. solve this problem in the brutal force-way, i. e. by identifying all possible paths. submit your solution in terms of a) code, and b) a *.txt all possible paths and the best one selected by the algorithm.

This question involves a class named textfile that represents a text file. public class textfile { private string filename; private string filename; private arraylist words; // constructors not shown // postcondition: returns the number of bytes in this file public int filesize() { } // precondition: 0 < = index < words.size() // postcondition: removes numwords words from the words arraylist beginning at // index. public void deletewords(int index, int numwords) { } // precondition: 0 < = index < = words.size() // postcondition: adds elements from newwords array to words arraylist beginning // at index. pub lic voidaddwords(int index, string[] newwords) { } // other methods not shown } complete the filesize() method. the filesize() is computed in bytes. in a text file, each character in each word counts as one byte. in addition, there is a space in between each word in the words arraylist, and each of those spaces also counts as one byte. for example, suppose the words arraylist stores the following words: { mary had a little lamb; its fleece was white as snow. } the filesize() method would compute 4 + 3 + 1 + 6 + 5 + 4 + 6 + 3 + 5 + 2 + 5 as the sum of the lengths of each string in the arraylist. the value returned would be this sum plus 10, because there would also be 10 spaces in between the 11 words. complete the filesize() method below: // postcondition: returns the number of bytes in this file public int filesize() { }

Anul 2017 tocmai s-a încheiat, suntem trişti deoarece era număr prim, însă avem şi o veste bună, anul 2018 este produs de două numere prime, 2 şi 1009. dorel, un adevărat colecţionar de numere prime, şi-a pus întrebarea: “câte numere dintr-un interval [a,b] se pot scrie ca produs de două numere prime? “.

Aobject is used for displaying the results of a question based on stored data. a. query b. report c. table d. form