| name | office | office hour | |
|---|---|---|---|
| Andrej Bogdanov instructor |
abogdano@uottawa.ca | SITE 5068 | Mo 3–5 |
| Yanbo Chen corrector |
ychen918@uottawa.ca | SITE 4035 |
Great algorithms are like great works of art. Some are instant hits. Others are challenging at first but grow on you with time. What they have in common is that they change the way we view the world.
Behind every computing advance of the last century stands a great algorithm: error-correction for reliable communication, spectral decomposition and the Fourier transform for data analysis, public-key encryption for e-commerce, gradient descent and backpropagation for machine learning. The aim of the course is to provide a broad perspective on what makes these algorithms tick and the variety of contexts in which they apply.
| week | topic | |
|---|---|---|
| 1 | Sep 4 | Gaussian elimination |
| 2 | Sep 11 | Gradient descent |
| 3 | Sep 18 | Spectral decomposition |
| 4 | Sep 25 | Fourier transform |
| 5 | Oct 2 | Backpropagation |
| Oct 9 | Review | |
| Oct 16 | Reading Week | |
| Oct 23 | Midterm Exam | |
| 6 | Oct 30 | Secure multiparty computation |
| 7 | Nov 6 | Error correction |
| 8 | Nov 13 | Public-key encryption |
| 9 | Nov 20 | Markov Chain Monte Carlo |
| Nov 27 | Project presentations 1: 8.30-11.15 in DMS 1120 Project presentations 2: 5.30-7.30 in CRX C308 |
The assignments are on the scale of a small project. Make sure you have 10-15 hours available to spend on each. The midterm will be in class on 23 October from 8.30 to 9.50.
You are encouraged to collaborate on the homeworks as long as you write your own solutions and acknowledge your collaborators. I discourage you from looking up solutions to homework problems online, unless you have exhausted all other resources.
If you do so, you must provide proper credit and make sure you understand the solution before you write it. You may be asked to present your solution at any time. If you are unable to provide satisfactory explanations you will be considered in breach of academic integrity guidelines and subject to appropriate sanctions.
I strongly discourage use of chatbots. Any "information" provided by them is highly unreliable. It will take you longer to verify it than to use your own head. If you do rely on their assistance you must reference them properly. You are solely responsible for any resulting mistakes.
Late submissions won't be accepted.
You can upload your solutons here or bring them to class. The file name should be your student ID.
Notes will be provided for every lecture. Here are some additional references. These will be updated later.