- Solution 6 is now available below.
- If you would like a few practice questions, see here.
- Even though there are no assignments left, you can still come to an office hour to discuss the material. There will be two office hours on Monday December 5th. Karlming will have an office hour at 3pm and Cosmin will have an office hour at 5pm. No other hours will take place.
- Want to see how to write a proper solution to an assignment? Click here. Thank you C!
- And this is how you take the exam. Thank you S and V!!!
CS/Math 6a introduces several basic combinatorial and algorithmic topics. These include generating functions, graph theory with a focus on graph algorithms, cryptography (including some elementary number theory), and an introduction to algebraic structures.
Still not convinced that Euler is amazing? Watch the first half of this Youtube video. The second half we will study in more detail later in the course.
Is the NSA reading your RSA-encrypted messages? Possibly.
A youtube video about partitions.
HARRY BATEMAN INSTRUCTOR IN MATHEMATICS
Office hours: 4pm Mondays at Sloan 276.
Cosmin Pohoata (head TA), firstname.lastname@example.org, Kellog 307.
Office hours: 4pm and 5pm Mondays at Sloan 153.
Siqi He email@example.com, Sloan 356.
Karlming Chen firstname.lastname@example.org, Sloan 158.
Office hours: 8pm Mondays at Sloan 153.
- Please staple a blank page containing only your name at the front of the assignment.
- You are encouraged to work in groups on the assignments. However, you are required to write your solution on your own and not to look at written solutions of other students.
- You may not rely on any related tools that we did not study in class (such as the DFS algorithm). Using such tools to solve a problem may result in zero points. If you are not sure whether you are allowed to use something, please ask someone from the staff of the course.
- There is no need to formally prove anything, unless the question specifically asks for a proof. However, you do need to explain what you did. The grader needs to see that you did not just write an algorithm/answer without understanding how to get to it or why it works.
- Unless stated otherwise, every given graph is simple.
- There is no need to find the running time of the algorithms that you create in your homework. However, the running times must be polynomial in the size of the input.
- There is no need to write pseudocodes for algorithms - we even prefer a description in words.
- There is no need to reprove anything that was proven in class. On the other hand, you are not allowed to refer to any other sources, including the course's text book (answers of the form "The proof can be found in page X of the book" will receive no points).
- Make sure that you submit your assignments in the LOCKED 6a mailbox, and not in the open box for graded assignments.
Discrete Mathematics / Norman Biggs, 2nd edition, Oxford. ISBN: 978-0-19-850717-8
Introduction to Algorithms / Cormen, Leiserson, Rivest, and Stein. Some of the algorithms are not written in detail in Biggs' book, and then more details can be found in this book. On the other hand, this book is too advanced for us since it includes running time analysis for the various algorithms. Feel free to completely ignore these.
The book covers most of the material but not all of it. Also, some of the relevant sections contain various topics that are not part of the course. Thus, please do not rely only on the book sections stated below. To see what is missing/redundant, compare with the lecture notes. Books sections starting with an "A" refer to the 2nd edition of the book "introduction to algorithms" (see above).
|09/26||Introduction to modern cryptography||8.1, 8.2, 8.4, 8.5, 8.6|
|09/28||Congruences||8.4, 13.1, 13.2, 13.3|
|10/30||The RSA algorithm||10.3, 13.3, A31.7|
|10/03||Primality testing (Class will be given by Cosmin)||A31.8|
|10/05||No class today||This|
|10/10||Basic counting||11.1, 11.2, 11.3|
|10/12||Introduction to graphs and the BFS algorithm||15.1, 15.3, 15.4, 16.5|
|10/14||More BFS||16.5, A22.2|
|10/17||Eulerian cycles||14.5, this webpage|
|10/28||Network flow||18.2,18.3,18.4,A26.1, A26.2|
|11/02||Flows and Bipartite graphs||A26.3,???|
|11/09||Groups||20.1, 20.2, 20.3, 20.4|
|11/11||Group isomorphisms||20.5, 20.6, 20.7|
|11/14||Subgroups, orbits, and stabilizers||20.8 (a bit), 21.1, 21.2, 21.3|
|11/16||Counting with permutations||21.4,21.5|
|11/18||Power series||22.1,22.4,22.5, 25.1|
|11/23||More generating functions||25.5, Sec. 5 of this|
|12/30||More partitions||26.4, 26.5|
|12/02||Shortest paths||16.6, A24.3|
|Due Date||Homework||Solution||TA in charge||---||Example assignment||Example solution||---|
|October 11th||Assignment 1||Solution 1||Siqi|
|October 18th||Assignment 2||Solution 2||Cosmin|
|October 25th||Assignment 3||Solution 3|
|November 8th||Assignment 4||Solution 4||Karlming|
|November 15th||Assignment 5||Solution 5||Cosmin|
|November 29th||Assignment 6||Solution 6||Cosmin|