PARK CROSSING HIGH SCHOOL
2016-17
Comprehensive Progress Report
LUCK, ADAM S
Student ID:
S886971
YTD Abs:
4.00
1806 PARKVIEW DR S
MONTGOMERY, AL 36117
Gr:
12
YTD Tdy:
2.00
Home Room:
A211 DARYANANI, JOHNNY
GP Abs:
4.00
GP Tdy:
1.00
* = Withdrawn
Section
N
Qn
9, we . . _
Linear vs. Quadratic vs. Exponential
Linear Equations: y = mx+b where m is the slope and b is the y coordinate of the y-intercept
Quadratic Equations: y= ax2 + bx + C where a is nonzero and is always attached to an x2
(side note: if a is po
20. My sister owns a Sands Drywall. They've recently purchased a new paint sprayer for $8000. The value of the
paint sprayer will decrease by 15.7% each year. Write an equation for the value ofthe sprayer after xyears.
21. Completing graduate work is a co
Example Problems for Final Exam Review
6. Adult lQ scores (as measured by the Wechsler test) are normally distributed with a mean of
100 and a standard deviation of 15.
a. (2 points) Fill in the blanks below the normal curve with the appropriate informati
19. The body mass index (BMI) is a measure of body fat based on height and weight. For Tim's height, a weight of
147 lb results in a BMI of 23.4. A weight of 185 lb would result in a BMI of 29.5. We want to find a linear equation
that relates a weight ofx
itpwmnlaai growth
35!
Li H U = r -.r OD , H . I . i: it: as :v "
Type: \= $92M Ned [Summi- "\L Ws Malic
lnformation: i 133: $9M; Sky. 332 Com 5W2 IQ!) i \rm " 0x
B furpgm Wn\ 53550 Q g CHI Wtd, ;Y \e (5 cfw_m
What is relative change? How do you catcul
Section 6.7
Partitions
Note The book explains about both ordered partitions and unordered
partitions in 6.7. We shall cover only ordered partitions in this section though.
Ex. 1 A group of 15 students is to be divided into three groups to be transported
t
Standard linear programing problem - graphical method.
Question 1
14 / 15 points
Find the minimum and maximum value of z = 10x + 30y, subject to
6x + 9y 120
8x + 2y 60
x 0, y 0
(a) The minimum value of z is _ which happens when (x, y) is _.
(b) The maximu
Section 4.6
What's Happening in the Simplex Method?
The question we seek to answer in section 4.6 is 'Why does the simplex
method work?' (i.e.- 'Why do the rules on pivoting produce a point in the
feasible region which has a maximal z value?').
Recall tha
Question 1 (3 points)
Select the point which is in the feasible region of the system of inequalities.
Question 1 options:
None of these
Question 2 (4 points)
Find the corner points of the feasible region. List the points as ordered pairs seperated by
comm
Section 4.6
What's Happening in the Simplex Method?
The question we seek to answer in section 4.6 is 'Why does the simplex
method work?' (i.e.- 'Why do the rules on pivoting produce a point in the
feasible region which has a maximal z value?').
Recall tha
For problem #35 in section 7.7, there are five states. The particle is on position 1, 2, 3, 4, or 5.
When the particle is on any one state, there is a 1/2 probability it will move clockwise and a 1/2
probability that it will move counterclockwise. For ins
Section 4.2
The Simplex Method
Before we begin, lets introduce a bit of terminology.
If a matrix represents a system of equations, then we say something is
a solution to the matrix if it is a solution to the corresponding system of
equations.
For example:
Section 4.4
Mixed Constraints
So far, we have only been addressing linear programming problems which fall
under the category of 'Standard Maximum Problems.' Recall the definition of a
standard maximum problem:
1. The objective function is to be maximized.
MATH 141: ONLINE FINITE MATH
Wilson
COURSE CALENDAR: SUMMER 2015
All deadlines for online quizzes and exams are at 11:59 p.m. Champaign, IL time. The day that a section is
listed is the day you should complete the section (reading, PowerPoint and most or
Question 1
4 / 4 points
is a sample space with
(a) Find
,
, and
.
.
(b) Find
.
(a) 1-.2-.2-.5=0.1
(b) .2+.5=.7
Question
3 / 4 points
2
A box of chocolate contains five chocolates with cherry centers, four with caramel centers, and
three with nut centers.
Section 4.4
Mixed Constraints
So far, we have only been addressing linear programming problems which fall
under the category of 'Standard Maximum Problems.' Recall the definition of a
standard maximum problem:
1. The objective function is to be maximized.
Section 3.3
Linear Programming:
A Geometric Approach
In this section we will be optimizing (either maximizing or minimizing
depending on the problem) a quantity, but we must meet the requirements of
some given constraints. The quantity we shall be optimiz
Section 3.3
Linear Programming:
A Geometric Approach
In this section we will be optimizing (either maximizing or minimizing
depending on the problem) a quantity, but we must meet the requirements of
some given constraints. The quantity we shall be optimiz
Section 3.2
Solutions of Systems of Inequalities:
A Geometric Picture
How do we draw a graph of a system of inequalities?
Recall a graph is just a plot of all the solutions to the
equation/inequality/whatever is on hand. Also recall that a system of
equat
Chapter 4
The Simplex Method
Section 4.1
Setting Up the Simplex Method
In Chapter 4 we will discover a way to solve linear programming problems without
having to draw any graphs. This method in chapter 4 is called the simplex method,
and instead of using
Chapter 3
Linear Programming
Section 3.1
Linear Inequalities in Two Variables
A quick way to draw a graph of the line 2x + 5y = 30 is to plot the x-intercept and
y-intercept, then connect them.
Note: The graph of a line is every point (xo, yo) that satisf
Section 3.4
Applications
In this section and throughout chapter 4 we will need to apply linear
programming on some problems that, unfortunately, have too many variables
for us to handle. Notice that we would not be able to apply our techniques
from sectio
Section 7.7
Markov Chains
We shall make a matrix out of the following information involving how alumni to
Baldwin State University make contributions.
60% of alumni contributing (C) one year will also contribute the next year.
(Thus 40% of alumni contribu
Section 2.7
Leontief Model in Economics
This section is an application of inverse matrices and matrix multiplication.
You may use your calculator throughout the problems in this section when a
computation is required.
In this section we will be dealing wi
The possible number of solutions to a system of eqs.
Question 1
5 / 5 points
Given a system of linear equations, there are three possibilities for how many solutions are produced.
List these three possibilities.
1. one solution
2. no solution
3. infinite