Final Flashcards
Conventional loan:
Interest rate is fixed for the duration of the loan.
Adjustable-rate loan (variable-rate loan)
Interest rate may change every period, as specified in the loan.
How much are points?
One point is equal to 1% of the loan amount.
What is the maximum monthly house payment the bank thinks you can afford?
28%
How do you find simple mortgage?
Cost of the house minus the down payment
In Chinese numerals, what do you do when you have to write zero?
Put the face character in. One face character can stand for two zeros.
Circuit:
path that begins and ends at the same vertex.
Path:
A sequence of adjacent vertices and the edges connecting them.
bridge
an edge that, if removed from a connected graph, would create a disconnected graph.
Fleury’s Algorithm:
- Use Euler’s theorem to determine whether an Euler path or Euler circuit exists.2. If the graph has no odd vertices (therefore has an Euler circuit) choose any vertex as the starting point. If the graph has exactly two odd vertices (therefore has an Euler path) choose one of the odd vertices as the starting point.3. Begin to trace edges as you move through the graph. Number the edges as you trace them. Since you can’t trace any edges twice, once an edge is traced consider it “invisible.”4. When faced with a choice of edges to trace, if possible, choose an edge that is not a bridge (ie, don’t create a disconnected graph with your choice of edges).5. Continue until each edge of the entire graph has been traced once.
Fleury’s Algorithm:
- Use Euler’s theorem to determine whether an Euler path or Euler circuit exists.
- If the graph has no odd vertices (therefore has an Euler circuit) choose any vertex as the starting point. If the graph has exactly two odd vertices (therefore has an Euler path) choose one of the odd vertices as the starting point.
- Begin to trace edges as you move through the graph. Number the edges as you trace them. Since you can’t trace any edges twice, once an edge is traced consider it “invisible.”
- When faced with a choice of edges to trace, if possible, choose an edge that is not a bridge (ie, don’t create a disconnected graph with your choice of edges).
- Continue until each edge of the entire graph has been traced once.
Nearest Neighbor Algorithm:
. Represent the problem with a complete, weighted graph.
- Identify the starting vertex.
- Of all the edges, attached to the starting vertex, choose the edge that has the smallest weight. This edge is generally either the shortest distance or the lowest cost. Travel along this edge to the second vertex.
- At the second vertex, choose the edge that has the smallest weight that does not lead to a vertex already visited. Travel along this edge to the third vertex.
- Continue this process, each time moving along the edge with the smallest weight until all the vertices are visited.
- Travel back to the original vertex.
Is the set of rational numbers a group under the operation of addition?
YES
Tree=
a connected path where every edge is a bridge
Place-value or Positional-value System:
The value of the symbol depends on its position in the representation of the number. For example, the 2 in the number 20 would represent 2 tens and the 2 in the number 200 represents 2 100’s.
