# Calculus III

Announcements

 5/1/04 All homeworks etc. have been graded and are in the folder holder outside my office for you.  Pre-final grades should be posted very shortly. 4/15/04 The revised Maple Lab 4 is now posted.  Omit the problems from 16.5 and 16.7 from the challenge problems. 4/5/04 Hour test correction: no. 5.  It should be spherical, not polar, coordinates. 3/24/04 Maple lab 2 revisions are due Wednesday, April 7. 3/23/04 Additional extra credit talks:  You should begin receiving Senior seminar announcements soon by email.  These are usually held Wednesdays from 2:30 to 3:30.  To get credit, attend, and write a 2 or 3 paragraph synopsis of the talk.  The nice thing here is that the speakers are other students so, A) the talks will be more accessible, and B) if not, they live here so you can ask questions easily. 3/23/04 Hour test:  The third hour test will be on Tuesday, March 30, from 4 to 6 in JEM 373 (next door to our usual classroom).  It will cover 15.1 through 15.8 (not 15.9).  Remember that on-line Drills available Here!!  These are from the 5th edition of the book (we have the 4rth), so the chapter numbers may be off.  The content is basically the same.  There is also a triple integral maplet in the In Class Demos that would provide very good practice. The Maple lab and challenge problems will be due Monday, April 5.  Omit 3.5 and 3.6 from the Maple lab, and 15.9 #20 from the challenge problems.  Remember that doing the lab and challenge problems ahead of time will help you prepare for the hour test as well. 3/11/04 EXTRA CREDIT TALK  OVERHEADS: Rectangle Visibility Graphs-   Date: Monday, March 22, 2004            Time: 2:30 - 3:30 p.m.   Location:  Science 111, St. Michaels campus   Title: Rectangle Visibility Graphs:  Characterization,      Construction,  and Compaction   Speaker: Sue Whitesides , department of computer science, McGill University   Abstract: Non-overlapping axis-aligned rectangles in the plane define   visibility graphs in which vertices are associated with   rectangles and edges are associated with visibility in either   the horizontal or vertical direction. The recognition problem   for such graphs is known to be NP-complete.     This talk introduces the notion of a “topological rectangle   visibility graph”.  This notion is designed to capture more   precise visibility information from sets of axis-aligned   rectangles than does the usual notion of a rectangle visibility   graph.  We give a combinatorial characterization of topological   rectangle visibility graphs that are indeed realizable as sets   of axis-aligned rectangles.  Our characterization gives rise to   a polynomial time algorithm for recognizing topological   visibility graphs that are realizable, and in the case of   realizable graphs, for constructing a realizing set of   rectangles on the unit grid.  The bounding box of these   rectangles has optimum length in each dimension.     Our algorithm provides a rectangle compaction tool: given a set   of rectangles, one computes the associated topological   rectangle visibility graph, and then runs the algorithm to get   an optimally compact set of rectangles with the same visibility   properties.
 3/4/04 REMINDER--There will be a graph drawing talk by Sue Whitesides on Monday, March 22 (exact time TBA, but I probably something like 3:30 to 4:30).  This talk is EXTRA-CREDIT. 2/27/04 The second hour test will be on Tuesday, March 2, from 4 to 6 in JEM 373 (next door to our usual classroom).  It will cover 14.1 through 14.7 (no Lagrange multipliers).  Remember that on-line Drills available Here!!  These are from the 5th edition of the book (we have the 4rth), so the chapter numbers may be off.  The content is basically the same. 2/25/04 A revised version of Maple Lab 2 has been posted.  The new due date, for both the Maple Lab and the challenge problems for Chapter 14 is March 12. 2/19/04 Grades to date have been posted.  Please check them for accuracy.  Also, since the rocket project is now extra credit, there is a new grading breakdown: Regular homework --15%, Challenge problems --20%, Maple Labs--20%,   hour test average --25%, final exam--20%. NEW EXAM DATE/TIMES: The next two hour tests will be on Tuesday 3/2 and Tuesday 3/30 at 4:00, in JEM 373 (NOTE this is not our usual room!!). 2/19/04 Here are the Maple intro solutions: calc3/labs/Maple Intro Calc III part 1 ans.mws calc3/labs/Maple Intro Calc III part 2 ans.mws calc3/labs/Maple Intro Calc III part 3 ans.mws calc3/labs/Maple Intro Calc III part 4 ans.mws 2/17/04 I do have to report for Jury Duty tomorrow, so class is canceled Wed, 2/18.  Please check this site in the remote chance that I am selected to serve  on cases scheduled for the 19th or 20th.(Assume there will be class on those dates unless there is an announcement posted here.)  We will discuss options to compensate for this missed class and the one cancelled due to illness on 2/9/04.
 2/8/04 Class is cancelled tomorrow (Monday, 2/9/04).  Please continue to work on your own and with one another on the Maple Intro's below.
 2/6/04 Here is the “crash course” in Maple you asked for.  Please work through these by Feb 16 and turn in the exercises then.  Keep them handy as references for the homework and future labs. Maple Intro Calc III part 4--Vectors 2/5/04 Here are the overheads from Jeff Dinitz' talk: Overheads 2/2/04 Here is the abstract for the Required Talk   Date: Monday, February 9, 2004          Time:  2:30 -3:30 p.m.  Location:  Science 111, St. Michaels campus   Title: Polygonal knot theory and stuck unknots     Speaker: Heather Johnston, department of mathematics, Vassar College   Abstract:   Although knot theory has been studied for over 100 years, polygonal knot theory and its combinatorial approach began in the 1990's.  We fix the length and number of edges of a polygon in three-space and model each configuration as a set of rigid sticks joined by very flexible hinges.   Those configurations that cannot be moved into a convex planar configuration are called stuck.  We are interested in those stuck polygons that are stuck only due to the rigidity of the sticks.  For a stuck unknot the same configuration could be unravelled if it were made of string rather than sticks.  We will prove the existence of stuck unknots and discuss their classification, which is still a work in progress. 2/2/04 The challenge problems from chapter 12 will be due Wed, Feb 4 as originally scheduled.  The challenge problems from chapter 13 will be due Mon, Feb 9. 1/30/04 The first hour test will be on Thursday, February 5.  It will cover 12.1 through 13.3.  Here is a practice test with solutions (it may have one or two questions from 13.4 on it): pg1 , pg2 ,  pg3  pg4. In addition to the practice test, On-line Drills available Here!!