Given two permutations, what is the maximum number of swaps it will take to reach one from the other?______
查看答案
For questions 1 and 2, consider our previous problem (permutations of 3 students in a line).When represented as a tree, each node will have how many children?______
Students in a lineSecond graders are lining up to go to their next class, but must be ordered alphabetically before they can leave. The teacher only swaps the positions of two students that are next to each other in line.If we want to represent this situation as a graph, which variables should be represented as edges and vertices?
A) Vertices represent permutations of the students in line. Edges connect two permutations if one can be made into the other by swapping two adjacent students.
B) Vertices represent students. Edges connect two students if they are next to each other in line.
C) Vertices represent permutations of the students, and each edge represents an individual student. An edge connects two vertices if that student is involved in swap between the two permutations.
We often use graphs to simplify optimization problems, as they are easy implement on a computer.The following concepts can be illustrated with a graph. Determine which variables should be represented by edges and vertices in this graph.A school's course catalogSome classes must occur at least one semester before certain other classes (e.g., Calculus I must be taken before Calculus II), but not all classes have prerequisites.If we want to represent the catalog as a graph, which variables should be represented as edges and vertices?
A) Each edge is a class, while different vertices indicate the semester the class is taken.
B) Each vertex is a class, while a directional edge indicates that one class must come before another.
C) Each vertex is a class, while edges between two vertices indicate that the classes may be taken at the same time.
Please help the burglar out! For each of the following metrics, what should be the burglar's first two choices of items? Here's a table of the items from the slides:item $ kg $/kgclock 175 10 17.5picture 90 9 10radio 20 4 5vase 50 2 25book 10 1 10computer 200 20 10For this problem, assume that the maximum weight the burglar can carry is 20.Metric: max valueThe burglar should first pick:
A. clock
B. picture
C. radio
D. vase
E. book
F. computer
G. no more space