Baxter's Math 103 Website - Summer Style!
This is Andrew Baxter’s website for his section of Math 103. Important announcements and class information will be posted here, as well as links to helpful websites.
Announcements (Last Updated: August 2nd)
- Final Exams are graded. The average grade was an 86%.
- Grades will be submitted Friday, August 3rd. You should be able to check them with my.rutgers.edu by Monday.
- Final Exam Solutions are available for the curious (in Word format)
- Thank you for a fun semester. I hope you found that math classes can be interesting if you study the right material.
- Enjoy your summer.
Office Hours
This last week I will have office hours on:
Tuesday, 10:00-11:00
Wednesday, 10:00-11:00
Office hours will now actually be held in my office, Room 605 in the Hill Center.
Homework
Chapter 1 Comments, Solutions
Chapter 2 Solutions
Chapter 3 Solutions
Chapter 4 Solutions
Chapter 5: 12, 20, 26, 28, 36, 42, 52 Solutions
Chapter 6: 12, 26, 34, 42, 44, 70 Due Monday, July 23.
5th Edition Owners: The exercise section for chapter 6 was overhauled in the change from the 5th to 6th edition. (Thanks to Roaslie for checking this) Click here for the Chapter 6 exercises.
Solutions
Chapter 7: 2, 10, 18, 22, 28, 34, 56 Due Wednesday, July 25. Solutions
5th Edition Owners: Some exercises are different. Exercises 56 in the 6th edition appears as exercise 52 in the 5th edition. Exercises 2 and 18 in the 6th edition do not appear in 5th edition at all. See them reproduced below.
Chapter 8: 12, 18, 30, 34, 40, 52, 62 Due Monday, July 30. (no penalty if you hand it in on Tuesday)
Solutions (I encourage you to check your answers before turning in the assignment)
5th Edition Users: There are some differences in exercises. Exercise 12
in 6th edition is 10 in 5th edition. Exercise 40 in 6th edition is 38 in
5th edition. Exercises 52 and 62 do not appear in 5th edition. See
below.52. Consider 16 independent tasks with processing times
1,2,3,...,15,16.
(a) Schedule these tasks with N=2 processors using the critical-path algorithm.
Show the timeline and calculate the project finishing time.
(b) Find the optimal finishing time for N=2 processors.
(c) Give the relative error ε for the schedule
found in (a), expressed as a percent.
62. Consider the project digraph shown in the
figure below.
(a) Schedule the project with N=2 processors using the critical path algorithm.
Show the timeline and give the project finishing time.
(b) If the tasks were independent, could you do better than the schedule found
in (a)? Explain your answer.
Links