Free Essay

Supppp

In: Computers and Technology

Submitted By DAVIDQUERY
Words 374
Pages 2
Autumn Semester 2013

Math 1126 Midterm #3 (Final Exam) Review
The
exam will be on Friday, December 6 from 2:00 -­‐ 3:45PM. It will involve Text sections 8.6 and 16.1-­‐16.4, part of Packet chapter 3 (Shampoo), and all of Packet chapter 4. The test will also involve Geometric Sequences in 9.5 (pp. 389 – 390) and in our separate document (root beer problem). The exam might also include any of the practice problems as listed below. Study all homework and class discussion notes in addition to the problems suggested below. There will be 5 problems on this exam (1 hour, 45 minutes). ONE of these problems will be about the Geometric Sequences that you are preparing as part of the review. Calculators (but NOT cell phones) are permitted at this exam. However, some problems may restrict the use of the calculator.

Chapter 3 of packet (Shampoo Activity) Make sure that you know: • How to determine if a fraction has a terminating or repeating decimal representation.

• Know how to convert between fraction and decimal notation. • Know why fractions have either a terminating or repeating decimal representation. If it terminates, know how to predict in how many places it will terminate. Make sure that you do: • Practice Problems 3, 4, 6, 7 in Section 3.11 of the packet • Textbook section 8.6 #7

Chapter 4 of packet: Counting and Probability (overlaps Text chapter 16) Make sure that you know: • Different methods of systematic counting (tree diagrams, organized lists, nPk, nCk). • How to explain how we derived the counting formula for nPk and nCk. • How to distinguish which counting method is appropriate for a given problem situation. • How to describe Pascal’s triangle and to explain the patterns we saw (the total of a given row, symmetry in a row, the relationship between rows) in terms of a story context.

• How to argue which outcomes are equally likely in a probability situation. • How to analyze the probability of a complex event through tree diagrams, counting arguments, and/or logic (e.g., complement of an event). Make sure that you do: • Practice problems #1 – 27 (except challenges) in 4.14 in packet. • Textbook 16.1 #5, 16.3 #11, 16.4 #17.

Similar Documents