matlab-enhanced Swiki= [View this PageEdit this Page (locked)Uploads to this PageHistory of this PageTop of the SwikiRecent ChangesSearch the SwikiHelp Guide]

Math 2605 C1 and C2,Fall 2008 -- Calc III for CS

Information about dates of tests and emails, grades, etc found in the following:
CourseScheduleM2605Fall2008.pdf

FINAL EXAM is Thursday of exam week, at 2:50PM, in our classroom.
You can have 20 pages of cheat sheets.
HELP SESSION is Wed. 7PM, the night before the exam, in our classroom, assuming we can get in.
HERE is a past final. Please remember that these are more or less randomly chosen problem types, from the many topics covered during the semester. The exam only has a few questions, and there is no guarantee that your final will be the same problems at all. I put this here so you can see that in fact the problems are similar to test problems in the semester (except there is one problem from chapter 6, which was covered after test 3).
Here it is (answer key to be put up later):
Final M2605 fall07.pdf

HERE ARE the tests and quizzes from this semester (there is no quiz 3, because I accidentally gave you quiz 3 from last spring, as you may have noticed).
Quiz1 fall08.pdf
solutions to quiz 1
Test1 fall08.pdf
solutions to test 1
Quiz2 fall08.pdf
solutions to quiz 2
Test2 fall08.pdf
solutions to test 2
Test3 fall08.pdf
solutions to test 3

REMINDER: TEST 3 is Tues, Nov. 25. Coverage is through chapter 5 section 3, from where the last test left off.

LAST COMPUTER PROJECTS are due the last week of class, when you return from holiday. Try to shoot for Monday, but I will take Wednesday.

TEST 2 Thursday, Oct 23. Coverage is what is was for quiz 2 plus the last two sections of chapter 3 (singular value decomposition). Same rules as quiz 1.

QUIZ 2 is on Thursday, Oct. 9. It will be on material going from chapter 1, section 8 (Jacobians, Newton's method), chapter 1 section 9 and chapter 2 (optimization, lagrange method), and from chapter 3 sections 1 through 3 (Jabcobi algorithm, Gershgorin theorems). The rules are the same as for quiz 1.

PROJECT DATES: I will set a tentative due date for projects 2 and 3 at November 7. These projects are on material we have now covered.

COMPUTER PROJECTS
These will be submitted on your webpage; you will email me a link to your webpage where the projects reside.
The following link to Professor Michael Loss's webpage contains the five possible projects, as well as other useful information about the projects, such as java package information:
http://www.math.gatech.edu/~loss/08falltea/2605/projectpage.html
However, our schedule for these projects will not be the same, so ignore any dates stated there.
This page also describes what to submit: source code, something that runs, instructions on how to run it (so that ANYONE could run it without doing anything serious to their standard PC), and a short writeup of what you did and concluded (nothing fancy).
You must do two out of the five projects for your project grade (15% of total), and you MAY do up to two additional projects to replace one test grade (or one additional project to replace half of one test grade).

We are now in (October 3) chapter 3, working on Jacobi algorithm and singular value decomposition. Two of the projects are on material from this chapter, so this is a good time to get started if you haven't yet. (project 1 was from chapter 0 material, and project 2 is from chapter 1 material). I have not set a deadline for these yet, and will give you plenty of time, but you need to get started.

FIRST COMPUTER project will be due Oct. 15. Here it is:
PinballProject.pdf
You can find example c code which shows how you could do the various things like reflecting vectors and finding intersections of lines with circles, in the page for Spring semester 1008. The actual c program there is not doing exactly what your assignment is, but you can lift/refer to the functions as a help. The c code is not exactly java code, but at the low level, it is almost the same, they are both bracketed languages which very similar syntax.

You will be required to do 2 projects out of 5 that will be offered; those two will count 15% of your grade. Another project on ch.1/ch.2 material will be put up soon. Most of the projects are on material after that in the text, from ch. 3 through ch. 6.

TEST 1 is Thursday, Sept. 17. It will cover through section 7 of chapter 1. The rules are the same as for quiz 1.


QUIZ 1 is Tuesday, Sept 9, in recitation. It will cover material up through section 4 in the text (even though Monday I will be talking about section 5, that will not be on Tuesday's quiz). You may not use any books on the quiz, but you can have 4 pages of notes you prepared as "cheat sheets", and a calculator.

Here are some supplements. The material on curves and the chain rule is in the text now (wasn't originally) but you might find my discussion helpful.
The material in the supplement on level surfaces is NOT in the text; I talked about it in class today (Wed, Sept 3), and you are responsible for that.

Curves supplement to chapter1 section3.pdf
LevelSurfaces supplement to chapter1 section4.pdf
ConstrainedOptimization supplement.pdf

Here is text so far:
chap0 JE.pdf
chap1.pdf
chap2.pdf
chap3.pdf

And here is an alternate treatment of something in chapter 0.
DistanceBetweenLines.pdf
Here are some solutions
chap0sol.pdf
chap1s1-2sol.pdf
ch2s1sol.PDF
ch2s2sol.PDF
c3SOLNS.pdf

We are starting chapter 1 on MONDAY, Aug.25
Section 1 will be done quickly since the main thing for us is the material on differentiability starting in section 2. We will not dwell on the technical things in section 1.




You may refer for now to the page on my coweb site for Spring 2008 to see other materials that were used last spring, and old tests and so forth. There may be some revisions to the text as well, I will let you know and put the official versions here when that happens.