15-359/659 Probability and Computing (FALL 13), 12 Units

www.cs.cmu.edu/~15359/

CLASS: Tu/Th 10:30 - 12:00 in GHC 4307

RECITATION F 10:30 - 11:30 in GHC 4102

Class calendar and assignments are here: HOMEWORKS + Calendar of Topics

TEXT BOOK: Performance Modeling and Design of Computer Systems (at CMU bookstore)

Probability theory has become indispensable in computer science. In areas such as artificial intelligence and computer science theory, probabilistic methods and ideas based on randomization are central. In areas such as networks and systems, probability is necessary to model variability in the arrival process and service requirements of jobs, so that we can understand how delay increases with increasing load, predict necessary buffer sizes, determine the appropriate number of servers in a data center, and so on. This course gives an introduction to probability as it is used in computer science theory and practice, drawing on applications and current research developments as motivation and context. We will cover basic probability including discrete and continuous random variables, expectations, higher moments, Laplace and z-transforms, and joint distributions. We will also cover many advanced topics including combinatorial probability and random graphs, heavy tail distributions, concentration inequalities, randomized algorithms, sampling random variables and computer simulation, discrete Markov chains and continuous-time Markov chains and their many applications, elementary queueing theory and a look at its use in modeling the web, routers, data centers, and networking protocols.

This class assumes NO PRIOR PROBABILITY/STATS classes, and will satisfy the Computer Science Probability/Statistics requirement. The course will assume that you have taken calculus (and still remember how to integrate and differentiate). The course also assumes that you can do simple double integrals and multiply matrices (we review these at the start of class). The only real prereq is 15-251. This class is ideally taken BEFORE 15-451 and will help you a lot with that class.

TEACHING STAFF:

OFFICE HOURS:

GRADING:

TURNING IN HOMEWORK AND LATENESS POLICY:

Homework will be due each week on Friday at the start of recitation. You can handwrite your homework, although we encourage you to latex at least some of your homeworks. You are required to latex at least 1 of the first 5 homeworks, just to get some practice. A latex templates will be provided soon.

You are allowed a total of 5 late days. No more than 2 late days can be used for each homework. Saturdays and Sundays count as late days. It is your responsibility to deliver the late homework to the TA. Once you have used up your 5 late days, you cannot receive any more late days unless you were in the hospital, so please save these up for illnesses and interviews.

CHEATING POLICY:

If you use an outside source (web site, book, etc.), please cite that source. It is fine to discuss problems with others, but you need to write up the actual homework alone. At the top of your homework sheet, please list all the people with whom you discussed any problem. Crediting help from other classmates will not take away any credit from you, and will prevent us from assuming cheating if your answers look similar to their answers. Note that the person providing answers is just as guilty as the person receiving answers. The above is the standard policy in all of academia.

NO LAPTOPS/CELL PHONES:

No cell phones in class. If you must use a laptop to take notes, please sit in the last row of the room, so that you do not disturb others in the class. If you use your laptop for anything other than taking notes, I reserve the right to remove it.