SPRING 2000
Mathematical Sciences Department
Course Number and Name: Math 114 Finite Mathematics and Calculus -- Second Semester
Credit Hours: 4.0
Instructor: Bruce Bukiet
Room: 518 Cullimore
Phone Number: ( 973 ) 596-8392
e-mail: bukiet@m.njit.edu
Office Hours: Tuesday and Thursday 2:30 - 4:00 PM
Course Description:
Topics include set theory and counting, descriptive statistics and probability, matrices, solving systems of linear equations and linear programming optimization.
Prerequisite: Math 113
Required Textbook:
Mathematics An Applied Approach, by Mizrahi and Sullivan, Sixth Edition. Wiley Publishing, 1996
Exams:
Three exams will be held on following days during class hours. Students are expected to take the exams on these days:
Wednesday, February 9;
Wednesday, March 8;
Wednesday, April 12;
The date, time and place of the final exam will be announced later in the semester.
If you are late for exam, you will not be able to take that exam.
The grade for a single missed exam will be determined by the grade on the final exam.
In most cases, if you miss two exams, you will be assigned a grade of " F "for the course.
Book or other aids are not permitted during the exams. Calculators may be used.
Method of Evaluation:
The final grade will be based on the scores received for the three exams and the final as well as a class participation and homework component. Each exam counts as slightly less than 20% of the final grade and the final exam will count as slightly less than 40%.
Attendance Policy:
Attendance is mandatory. Students' names will be submitted to the Dean of Freshman Studies for withdrawal from the course if they miss more than three classes. Two latenesses will be equivalent to one absence.
The last day to withdraw from the class and receive a "W" grade is ????.
Tutoring:
There is plenty of help available in this class. Your instructor will answer questions related to topics covered in class. The Mathematical Sciences Department runs a tutorial center located in University Hall, Room 100. Students are urged to utilize the center for homework and study as needed.
Homework:
Homework assignments, if any, will be determined by your instructor.
Prepared by Bruce Bukiet Spring 2000
Homework Assignments for Math 114
The material included here is the course content by sections to be covered during the semester. The assignments are correlated to each section in the textbook. These are only recommended assignments; your instructor will determine what exercises you have to complete.
The more exercises you do, whether they are assigned or not, the better prepared you should be.
Section 1.2 Systems of Linear Equations: (Coincident, Parallel and Perpendicular Lines)
HW: Page 22: 1, 3, 4, 5, 12, 18, 31, 34, 38, 39
Section 2.1 Systems of Linear Equations: (Substitution; Elimination)
HW: Page 49: 2, 4, 8, 10, 28, 39, 41, 43, 45, 53, 58
Section 2.2 Systems of Linear Equations: (Matrix Method)
HW: Page 62: 1, 3, 41, 43, 47, 49, 52, 56, 57, 60
Section 2.3: Systems of m Linear Equations Containing n Variables
HW: Page 75: 3, 4, 5, 8, 11, 13, 19, 21, 25, 41
Section 2.4: Matrix Algebra
HW: Page 86: 3, 4, 9, 11, 13, 15, 17, 21, 28, 34, 43, 46
Section 2.5: Multiplication of Matrices
HW: Page 99: 1, 3, 5, 9, 11, 15, 31, 33, 39, 43, 47, 49, 51, 53, 55, 56 (but don't solve it), 59
Section 2.6: Inverse of a Matrix
HW: Page 110: 3, 5, 7, 13, 15, 21, 29, 36, 41, 45
Section 3.1: Linear Inequalities
HW: Page 140: 1, 3, 4, 8, 17, 20, 25, 26, 27, 29, 39
Section 3.2: A Geometric Approach to Linear Programming Problems
HW: Page 156: 3, 7, 9, 13, 17, 21, 24, 27, 29 ,43, 47
Section 4.1: The Simplex Tableau; Pivoting
HW: Page 176: 1, 3, 10, 11, 17, 25, 29
Section 4.2: The Simplex Method: Solving Maximum Problems in Standard Form
HW: Page 194: 1, 3, 7, 15, 21
Section 4.3: Solving Minimum Problems in Standard Form; The Duality Principle
HW: Page 205: 1, 5, 7, 9, 13, 15, 17
Section 4.4: The Simplex Method with Mixed Constraints: Phase I / Phase II
HW: Page 217: 1, 3, 5, 7, 11
Section 6.1: Sets
HW: Page 278: 1, 3, 7, 8, 12, 14, 23 e-f, 24 b-f-h, 25 b-c, 27 a-g-h, 28 b-c-d, 37, 39, 41, 42, 49-58, 60, 61, 63
Section 6.2: The Multiplication Principle
HW: Page 284: 1, 3, 5, 7, 8, 13, 15, 17, 21 ,24, 30
Section 6.3: Permutations
HW: Page 290: 1, 5, 7, 9, 11, 13, 15, 17, 19, 22, 25, 29, 31, 32, 33
Section 6.4: Combinations
HW: Page 295: 1, 2, 8, 10, 11, 14, 15, 16, 29, 31, 33, 34, 35
Section 6.5: More Counting Problems
HW: Page 302: 1, 3, 6, 9, 10, 13, 14, 16, 17
Section 6.6: The Binomial Theorem - up to page 306 Example 4
HW: Page 309: 1, 3, 5, 7, 8, 9, 10
Section 7.1: Sample Spaces and Assignment of Probabilities
HW: Page 323: note: some solutions are no unique 1, 3, 8, 12, 17, 20, 21-23, 23, 25, 27, 29, 31, 33, 37, 43, 54
Section 7.2: Properties of the Probability of an Event
HW: Page 332: 1, 3, 5-7, 10, 13, 15, 19, 23, 25, 26, 29, 31, 33, 41-43, 47-49, 53, 54, 56
Section 7.3: Probability Problems Using Counting Techniques
HW: Page 341: 1, 2, 3, 5, 7, 13, 15, 20, 24, 27
Section 7.4: Conditional Probability
HW: Page 349: 3-5, 9, 11, 23, 26, 30, 33, 38, 43, 50, 51, 53, 56
Section 7.5: Independent Events
Section 8.1: 3 Examples using methods already considered
HW: None
Section 9.1: Organization of Data
HW: None
Section 9.2: Pie Charts; Bar Graphs
HW: Page 423: 1, 3, 7
Section 9.3: Measures of Central Tendency
HW: Page 429: 1, 3, 4, 6, 7, 10 , 15
Section 9.4: Measures of Dispersion
HW: Page 436: 5-7, 11, 13, 18, 19
Section 9.5: The Normal Distribution
HW: Page 445: 1, 3, 5, 7 a-b-d-e, 8, 11, 13, 15, 17, 23, 27
Section 10.1: Markov Chains and Transition Matrices
HW: Page 485: 1, 3, 10
Section 10.2: Regular Markov Chains
HW: Page 468: 1, 2, 5, 6,9
Prepared by Bruce Bukiet Spring 2000