Download Exam Info - people.stfx.ca

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Pythagorean theorem wikipedia , lookup

History of geometry wikipedia , lookup

System of polynomial equations wikipedia , lookup

Golden ratio wikipedia , lookup

Analytic geometry wikipedia , lookup

Integer triangle wikipedia , lookup

Multilateration wikipedia , lookup

Euclidean geometry wikipedia , lookup

Rational trigonometry wikipedia , lookup

Line (geometry) wikipedia , lookup

Transcript
Math 102:10 December 2016 Exam Info
Saturday, December 10, 7pm-9:30pm in gym, even
rows 24-30.
The exam is
You may bring a calculator and one half-page-sized formula card (both sides, write as
small as you want). You should also bring your student ID card.
The format of the exam will be written answer questions worth a total of 50 marks.
The material will cover everything we have done. There will be questions that you
haven’t seen before (because an exam is supposed to test how well you have learned
the material, not just how well you can regurgitate), there will be questions that involve
more than one topic (to see that you can make connections), and there will be
straightforward questions that are like ones you have seen before (so that you don’t
totally freak out).
Tara’s office hours during the exam period are TBA (depending on the baby situation!).
You can also go to the math learning centre or try Stephen Finbow (he teaches Math 101,
his email address is [email protected]).
The best way to study is to go over old tests and assignments, try sample exam questions
(though they are different from what yours will be- they are still good for practice), read
through the notes and make sure you know what the key ideas are, do sample problems
(see the sample exercises website for good questions and key ideas).
Here is a summary of the material that the exam will cover:
Chapter 7: Basic Concepts of Algebra (sections 7.1-7.3, 7.5- 7.7)
 linear equations, solving a linear equation for an unknown variable, using
linear equations as a model for a word problem).
 solving a word problem using linear equations.
 ratios and proportions, direct and indirect variation
 golden ratio and Fibonacci sequence (ratios of numbers get closer to
golden ratio)
 properties of exponents
 polynomials (basic terminology, adding, subtracting, expanding)
 quadratic equations, quadratic formula, applications
Chapter 8: Basic Functions and Graphs (sections 8.1-8.5)
 cartesian coordinate system, distance and midpoint.
 linear equations with two variables, intercepts, slopes, vertical and
horizontal lines, perpendicular and parallel lines, average rate of change.
 equations of lines (point-slope form, slope-intercept form), word problems
using linear models
 relation, function, domain, range, graphs, linear functions

quadratic functions and their graphs, intercepts, vertex
Chapter 9: Geometry (sections 9.1-9.4, 9.7-9.8)
 points, lines (rays, segments, parallel, intersecting), angles (acute, right,
obtuse, vertical, straight, complementary, supplementary, relationships
between angles).
 curves (simple, closed), Polygons (regular), triangles (acute, right, obtuse,
equilateral, isosceles, scalene), quadrilaterals (trapezoid, parallelogram,
rectangle, square, rhombus), angle sum in triangles, circles and inscribed
angles
 perimeter (polygons), area (polygons, rectangles, squares, parallelograms,
trapezoids, triangles, circles), circumference of circle
 Pythagorean theorem (proof and uses)
 Euclid's postulates, parallel postulates, non-Euclidean geometry (spherical
and hyperbolic)
 Fractal Geometry (self-similarity, fractal dimension, Sierpinski triangle)
Chapter 10: Counting Methods (sections 10.1-10.4)
We didn’t have much time on this chapter so the questions will be basic. The
main topic is Pascal’s triangle and how to use it to count.
 different ways to make lists: tables, listing labels, etc
 uniformity criterion for multi-part tasks, Fundamental Counting Principle
(FCP), factorial (n!), arrangements of n objects.
 permutations (formula, guidelines for when to use permutations),
combinations (formula and guidelines), how to tell if something requires a
permutation or a combination.
 how the entries of Pascal's triangle relate to combinations
Connections
How do the two images on the outline (the Parthenon and the Sierpinski triangle)
connect? This involves the golden ratio, the Fibonacci numbers, and Pascal’s triangle.