Math 160: Study Guide - Final Exam

  1. Compound interest problem. Use the "finance" program.
  2. Present value problem. Use the "finance" program.
  3. Future value problem. Use the "finance" program.
  4. Give the solution to a system of linear equations from an augmented matrix in row echelon form.
  5. Solve a 3x3 system of linear equations. Either use Gauss-Jordan elimination (pivoting) or use the inverse of a matrix.
  6. Leontief input output problem. Use the "leontief" program.
  7. The initial system to a linear programming problem is given. Complete the table of values, determine if the points are feasible or not, and give the optimal solution to the problem.
  8. The preliminary tableau from a non-standard maximization problem is given. Write the maximization problem.
  9. Maximize a standard linear programming problem. Write the initial tableau and final tableau, and give the values of the objective function and decision variables. Use the "simplex" program.
  10. Linear programming problem. A tableau is given. Label the columns as appropriate using x's for the decision variables, s's for the slack variables, z for the objective function, and rhs for the right hand side. Identify which variables are basic and which are non-basic and give their values. Identify the basic variable for each row of the tableau and find the appropriate ratios on the right side. Circle the pivot element. Identify which variable is entering and which is exiting.
  11. Given P(A), P(B) and one more probability, complete a probability distribution and then find several probabilities from the probability distribution. Know how to tell whether two events are independent.
  12. Use a venn diagram to find the number and or probability of events.
  13. Find the number of ways an event can happen. Similar to the "how many three digit license places can be formed if ..." problems in chapter 6.
  14. Binomial probabilities. Use the "binomial" program.
  15. Solve a game matrix, giving the optimal row and column strategies, and the value of the game. Use the "game" program. Then find the strategies and value under non-optimal conditions.
  16. Find some poker probabilities. Use the "hypergeo" program.
  17. Probability problem. Two bags with different types of coins in them. A situation is described and you need to draw a tree diagram and then find some probabilities.
  18. A game (single player, so don't use the "game" program) is described. Find the probabilities of each payoff and then find the expected value. Identify whether the game is fair or not.
  19. Decision Theory. Most of the payoff table has been created for you, but you need to find two entries in the table. Create the opportunistic loss table. Then give the value and optimal action under each criteria.
  20. The final tableau from a zero-sum, two-player game is given. Give the optimal row and column strategies and the value of the game.
  21. Markov chain problem. Write the initial state matrix, the transition matrix. Find the first state matrix, and the steady state matrix.
  22. Absorbing Markov chain problem. Write the transition matrix. Find the fundamental matrix and the the expected number of transient states before leaving the matrix.

Notes

Points per problem

Individual Questions

The individual part of the exam is worth 120 points.

# 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Pts 6 6 6 5 5 6 10 6 12 12 16 5 4 9 12

Group Questions

The group part of the exam is worth 80 points.

# 16 17 18 19 20 21 22
Pts 12 14 10 12 10 12 10