John Lensmire - Math 3C Winter 2012

Math 3C Winter 2012 Sections 1A and 1B

Professor:	Stephen Kwok
Professor's Course Page:	www.math.ucla.edu/~sdkwok/3c.1.12w.html
TA:	John Lensmire
Lecture:	Mon, Wed, Fri 9:00-9:50 AM in Humanities A51
Discussion:	1A: Tues 9:00-9:50 AM in MS 5138 1B: Thur 9:00-9:50 AM in Boelter 5272
Syllabus:	3C Syllabus

Announcements:

Mar. 19: Note I WILL be having office hours (in my office) tomorrow (Tuesday) before the exam.
Mar. 15: Office hours today will be held in MS 5118.
Mar. 8: See here for a summary of some of the results from 12.6. In particular, example 2 is similar to problem 12 on this weeks homework. (Note we will go over this in more detail in next weeks discussion.)
Mar. 8: See here for a summary of the continuous distributions we have learned.
Mar. 1: See here for some quick notes/solutions for the second midterm.
Feb. 23: I will have a review session for Midterm 2 on Saturday Feb. 25 from 3:00-4:30ish in Franz 1178.
Feb. 16: See here for a summary of the discrete distributions we have learned.
Feb. 8: See here for some quick notes/solutions for the first midterm.
Feb. 2: Grades for midterm 1 are entered online, and will hopefully be released by the professor soon. You are welcome to stop by office hours today to pick up your midterm.
Jan. 19: See here for a few examples of independence and Bayes' Theorem.
Jan. 26: Review session: Sunday Jan 29 from 3:00-4:30 PM in MS 4000A in preparation for Mondays exam.
Jan. 19: Hint for 12.1.8: We want to order all possible DNA sequences of a fixed length (where length counts the number of nucleotides.) First count the total number of sequences there are for a fixed length n (i.e. how many DNA sequences you would need to order). Then calculate how much this order would weigh (i.e. find the weight of a single sequence of length n and multiply it by your above answer). Finally, compare this weight (as a function of n), to the weights in the problem.
Jan. 19: See here for a few examples of calculations with Poker hands. EDIT: Fixed some mistakes.
Jan 11: For those of you who want to review some calculus that you will (most likely) need later in this course, sections 4.2-4.7, 5.1-5.2, 5.5, 6.2, 7.1, 7.2, and 7.4 should suffice. I would suggest looking at the following problems: 5.2: 18-20; 5.5: 51, 52, 57; 7.2: 49, 50; 7.4: 5-8. Note that these problems are not in any way mandatory, nor do I guarantee they cover everything we may use later in the course.

Disclaimer:

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by UCLA.