| Math 1200 - College Algebra I | ||||
| Fall 2006 | ||||
| Instructor | Christina Sonnek | |||
| christina.sonnek@anokaramsey.edu | *best way to reach me!! | |||
| Office | Humanities 114 | |||
| Telephone | 763-433-1214 | |||
| Class Website | http://webs.anokaramsey.edu/sonnek | |||
| Office Hours | Monday-Friday 10:00-11:00 | |||
| Class Meetings | Monday, Wednesday, Friday 11:00-11:50 | |||
| Text | College Algebra 4th edition by Blitzer | |||
| Attendance | You are expected to attend all class meetings. If an emergency occurs, it is your responsibility to make up the missed work. | |||
| Content | Chapter 2, parts of Chapters 3, 4, 5, and 8 | |||
| Calculators | Calculators may be allowed on some exams. Instruction will be provided on the TI-83 calculator. | |||
| Assignments | My expectation is that you will spend an average of two hours outside of class per hour in class. There will be some assignments that will be turned in for credit. Late assignments will NOT be accepted. Missing a class period when an assignment is due is NOT an excuse for late assignments. Assignments will be worth a total of 30 points. Other assignments may be given (including quizzes). Do NOT fall behind in your homework. | |||
| Tentative Exams | Exam 1 - Ch 2 & 3 | 6-Oct | 100 pts | |
| Exam 2 - Ch 4 & 5 | 15-Nov | 100 pts | ||
| Final - Ch 8, Ch 2-5 | 18-Dec | 200 pts | ||
| Exams must be taken during the scheduled time. No late exams will be given. In case of emergency, you must contact me before the time of the exam. Noncompliance with this procedure will result in a grade of zero for that exam. Any form of cheating will result in a zero. | ||||
| Grading | 90-100% | A | ||
| 80-89% | B | |||
| 70-79% | C | |||
| 60-69% | D | |||
| below 60% | F | |||
| Pass/No Credit | If you wish to take this course on a pass/no credit basis, you must inform me in writing by the end of the first week. Passing is 70% or better. Be sure to check with your counselor first. | |||
| Incomplete | No incomplete will be considered unless you are earning a C or above, have completed more than half the course, and have missed class because of extreme circumstances. | |||
| Drop/Withdraw | The last day to withdraw from a course is 11-28. See Student Handbook for more details. | |||
| Accomodations for Students with Special Needs | ||||
| Anoka Ramsey
Community College does not discriminate on the basis of race, color, national origin, gender sexual orientation, religion, age or disability in emplooyment or in the provision of our services. Within the first week of class, students with special needs that require accomodations should contact the Director of Access Services to discuss possible support services. |
||||
| Learner Outcomes | At the conclusion of the course, the student should be able to: | |||
| a. Identify, transform, and/or produce the graph for a given function (including constant, linear, polynomial, parabolic, cubic, square root, absolute value, rational, logarithmic, and exponential). | ||||
| b. Identify, transform, and/or produce the graph of a circle. | ||||
| c. Find an equation of a line given sufficient information. | ||||
| d. Translate an applied problem into an equation or inequality and provide a solution through algebraic manipulation. | ||||
| e. Interpret an expression, equation, or inequality by utilizing a graph, table, or diagram. | ||||
| f. Define a function along with its domain and range. | ||||
| g. Combine functions through the operations of addition, subtraction, multiplication, division, and composition. | ||||
| h. Determine the inverse function for a given function. | ||||
| i. Solve any equation of first or second degree. | ||||
| j. Solve an exponential equation. | ||||
| k. Solve a logarithmic equation. | ||||
| l. Solve a system of linear equations in two or three variables. | ||||
| m. Solve a system of inequalities. | ||||
| n. Solve a linear programming problem. | ||||
| o. State the definition of an infinite sequence. | ||||
| p. Find a particular term or sequence of terms for a particular infinite sequence. | ||||
| q. State the definition of an arithmetic sequence and give examples thereof. | ||||
| r. State the definition of a geometric sequence and give examples thereof. | ||||
| s. Work back and forth readily between expanded and closed forms of summation notation. | ||||
| t. Readily expand a binomial raised to natural number power by the Binomial Theorem, as well as being able to give particular term of the expansion without having done the binomial expansion. | ||||
| u. Demonstrate the counting principle by way of a tree diagram. | ||||
| v. Apply the definition of a permutation to such counting problems. | ||||
| w. Apply the definition of a combination to such counting problems. | ||||
| x. Distinguish between permutation and combination problems so as to use the correct one for a given problem, or some combining of the two. | ||||
| y. Apply the concepts of experiment, outcome, and sample space to a given model. | ||||
| z. State the definition of probability of an event for a given sample space and apply such to simple problems. | ||||
| aa. Determine if a mathematical argument is valid using definitions, field properties, and theorems. | ||||
| bb. Create, analyze, and discuss the validity of a mathematical model for a set of data. | ||||
| cc. Use a graphing utility and interpret the results where applicable in the above outcomes. | ||||