Section | Page | Problems |
1.2 Lines | Handout | |
2.1 Linear Systems | 79 | 1, 2, 4, 5, 7, 8, 9, 11 |
3.1 Linear Inequalities | 176 | 3-9 odd, 19-29 odd |
3.2 Linear Programming (set-up) | 185 | 1, 2, 4, 6, 8, 9, 10, 12, 14, 16 |
3.3 Linear Programming (solve) | 197 | 7, 8, 9, 12, 14, 15, 21, 23 |
2.4 Matrices | 117 | 1, 2, 3, 7-14, 16, 21-24, 38, |
2.5 Matrix Multiplication | 132 | 1-4, 7-14, 21, 27, 41, 44, |
2.6 Matrix Inverses | 149 | 1, 2, 5-8, 25, 26 |
Cryptography | Handout | |
Midterm Exam up to here | ||
6.1 Sets | 342 | 5, 6, 9-18 all, 33-36 all, 39-49 odd |
6.2 Venn Diagrams | 350 | 3, 4, 6, 11-13, 16, 17, 21, 31, 33, 34 |
6.3 Multiplication Principle | 357 | 2-5, 7-12, 14-16, 19, 21, 23 |
6.4 Permutations and Combinations | Handout | |
6.4 Permutations and Combinations | 370 | 5-8, 11-14, 16, 18, 23-28, 34-42, 44-48 |
7.1 Experiments, Sample Spaces and Events | 386 | 25-28, 31, 32 |
7.2 Probability | 394 | 9, 13, 19, 21, 23, 25 |
Review and Cumulative Departmental Final Exam |
Back to MTH 1101, | Created: Sept. 16, 2002. Updated: Nov. 5, 2002 |
or back to my Home page. | http://www.math.neu.edu/~suciu/mth1101/1101-f02hwk.html |