syllabus in pdf
Unique Number: 51695
Course web page: http://www.cs.utexas.edu/~diz/378
Office: GDC 4.508
Office Hours: MW 3:30-4:30
Office Hours: TTh 4-5, GDC 1.302, Desk 1
|Who should take this?||Students interested in theory, probability, and algorithms, and who like a challenge. This course is excellent preparation for graduate school.|
|Text:||Mitzenmacher and Upfal, Probability and Computing, 2nd edition|
Randomness is extremely useful in computer science.
Algorithms that make random choices during their execution, known as randomized algorithms, are often faster or simpler than algorithms that don't use randomness.
Examples include Quicksort, primality testing, and Monte Carlo simulations.
However, such randomized algorithms usually come with a small probability of error, so it is important to bound this error probability.
In this undergraduate course, we develop tools and techniques
to design and analyze efficient randomized algorithms.
This course is theoretical and mathematical; there will be no programming
Each section of the course is built around a method, with example
applications to randomized algorithms.
We list the topics below.
|Prerequisites:||Computer Science 331 or 331H. This means that you need the prerequisites and corequisites for CS 331, including Discrete Math (CS 311 or 311H), Probability (SDS 321 or M 362K), and Linear Algebra (SDS 329C, Math 340L, or Math 341).|
50% 2 Exams
|Quiz and Exams:||The tests will be held in class on the following dates: the quiz on Wednesday, February 7, Exam 1 on Monday, March 26, and Exam 2 on Wednesday, May 2. No make-up tests will be given, so plan accordingly. You may bring a single, 8.5x11 inch, handwritten sheet of paper (you may use both sides). No calculators are allowed (they won't be necessary).|
Most weeks a problem set will be assigned.
Collaboration policy: While you should first think about the problems on your own, you are encouraged to discuss the problems with your classmates. Please limit your collaborations on any particular homework to at most three other students. Discussion of homework problems may include brainstorming and verbally walking through possible solutions, but should not include one person telling the others how to solve the problem. In addition, each person must write up their solutions independently, and these write-ups should not be checked against each other or passed around or emailed. You must acknowledge any collaboration by writing your collaborators' names on the front page of the assignment. You don't lose points by having collaborators.
Citation policy: Try to solve the problems without reading any published literature or websites, besides the class text and links off of the class web page. If, however, you do use a solution or part of a solution that you found in the literature or on the web, you must cite it. Furthermore, you must write up the solution in your own words. You will get at most half credit for solutions found in the literature or on the web.
Late policy: No late homeworks will be accepted.
|Participation and Attendance:||Your participation grade is based on the quality and quantity of your participation. While attendance is not required, poor attendance will be reflected in your participation grade.|
|Laptops/Phones:||The use of laptops and mobile devices is generally prohibited; however, I will allow use of tablets if you sit in the first row and use them only for class-related purposes. Other exceptions may be made in unusual circumstances. All phones must be silenced.|
|Canvas:||We will use Canvas, which contains Piazza. Homeworks and grades will be posted on Canvas. We will use Piazza for class discussion. Instead of emailing questions to the teaching staff, please post your questions to Piazza.|
100-second talk on randomness on The Academic Minute.
My essay Can Random Coin Flips Speed Up a Computer?