Houghton Mifflin Harcourt Algebra 1, 2015
HM
Houghton Mifflin Harcourt Algebra 1, 2015 View details
1. Graphing Relationships
Continue to next subchapter

Exercise 9 Page 90

Review the definition of continuous and discrete graphs.

See solution.

Practice makes perfect

We will explain for which cases we should use a discrete graph and for which cases we use a continuous graph. For this, let's review each kind of graph.

Continuous draphs

A continuous graph is that which can be drawn without interruptions. This happens when the the inputs can take any value between the initial and final one. Every input has a corresponding output value associated. Therefore, when graphing them, they'll form a continuous stroke. An example is a distance vs time graph of a car trip.


In this case the inputs would be the time values. Time can take any in value between the initial and final time. Furthermore, for every moment of time we will have a position associated.

Discrete graph

A discrete graph is made up of distinct, unconnected points. This can happen when the values for the inputs are restricted, or if we have a limited amount of inputs. One example is a profit vs units sold graph.

Selling a product per unit restricts us to use only integer values. Furthermore, we would have limited amount of units as well.