## Second Exam Grades | |

Grades are online. Appeals can be sent to Tamer no later than 10/11. Scans will be uploaded in the next few day |

15/10/2017, 16:33:56 |

## Final Exam Moed B is online | |

The exam and its solution were uploaded to the website. |

13/10/2017, 12:10:09 |

## Reception Hour | |

A reception hour will be held Sunday 8/10 at 15:00 in my office (Taub 532). Please e-mail me any questions you might have in advance if possible. |

2/10/2017, 15:26:36 |

## First Exam Grades | |

Grades are online. Appeals can be sent to Tamer no longer than 5/8. Scans should be uploaded in the next few days. |

17/7/2017, 18:51:51 |

## Final Exam Moed A is online | |

The final exam and its solution were uploaded to the website. |

12/7/2017, 17:17:01 |

## Today's reception hour | |

Today's reception hour is postponed to 14:30. |

9/7/2017, 10:59:36 |

## Problem set 2 official solution | |

An official solution for Q3 in HW2 was uploaded to the website. Also, the solution of questions 2.2, 2.3 in HW3 were slightly corrected (please do not panic). |

8/7/2017, 21:18:38 |

## Reception Hour Before Exam | |

I'm holding a reception hour two days before the first final exam, to answer all questions you might have. Time: Monday 10/7, 16:00 Place: Taub, 201 To avoid surprises, please try to add any question you wish to ask right here: https://goo.gl/9EjG2J |

5/7/2017, 17:08:20 |

## Official Solution of Problem set 5 and Previous Exams | |

An official solution for problem set 5, as well as a collection of final exams and midterms from previous semesters, were uploaded to the website. |

4/7/2017, 17:00:26 |

## Problem set 5 is online | |

The exercise is not for submission, unless you took it as a task of course. |

23/6/2017, 12:25:11 |

## Second Midterm Grades | |

The grades are online. Scans should be available in a few days. Appeals can be sent to Tamer by e-mail no later than 20/7/2017. |

20/6/2017, 15:52:13 |

## Solution of Problem Set 4 Correction | |

Solution of question 3 was correction. Sorry for the inconvenience. |

17/6/2017, 20:13:18 |

## Tutorial 5 Correction | |

The convolution formula in tutorial was corrected (right hand side should be multiplied by n+1 rather than 2n+1). |

17/6/2017, 20:00:45 |

## Official Solution of Problem sets 3,4 | |

Official solutions were uploaded to the website. Special thanks to the students that contributed to this. |

15/6/2017, 14:08:55 |

## Problem set 4 is online | |

The exercise is not for submission, unless you took is as a task of course. |

4/6/2017, 23:19:10 |

## Bonus Task | |

A bonus task was published in the assignments section. It can grant you up to 15 extra points to the final grade. |

29/5/2017, 13:30:33 |

## Tomorrow's reception hour | |

The reception hour of tomorrow is moved to 16:00. If the time is problematic for any of you, we can always make an appointment by e-mail. |

27/5/2017, 19:47:37 |

## Note regarding tutorial 6 | |

In the last tutorial (tutorial 6, Sunday 21/5/17), we've seen a theorem that said that a set of characters of a group Gamma is an orthonormal basis for all functions Gamma->C. This theorem is true only for groups that are finite and abelian, and does not necessarily hold for a group that is not such. The theorem will be stated correctly in the tutorial notes that will be uploaded to the website in the following days. |

22/5/2017, 23:42:07 |

## Problem set 3 is online | |

The exercise is not for submission. |

22/5/2017, 23:37:54 |

## First midterm grades | |

The grades are online. Scans should be available in a few days. Appeals can be sent to Tamer by e-mail no later than 1/6/2017. |

10/5/2017, 18:48:02 |

## Complementary Tutorial Place | |

The complementary tutorial next Sunday will be held in Taub 9. |

3/5/2017, 12:17:44 |

## Guidance and clarifications regarding HW2 | |

- Questions 1.1 and 1.2 are independent of each other. - In question 2, the idea is to take any division operation and transform it to a form that suits the form of the algorithm presented in the lecture notes, namely, an algorithm over polynomials. You can refer to the lecture notes in the link under Lecture 4 in the course material section to see the transformation. Once you see it, you should be able to prove its correctness alone. - To solve question 4, follow the proof in the latest lecture notes. The proof there investigates matrix multiplication, and transforms every algorithm for matrix multiplication into an algorithm that works with polynomials. In matrix multiplication, we had polynomials of degree 2 since the output expression involved multiplication. For computing the sum of n inputs we will need to work with polynomials of degree 1 only. Having polynomials of degree 1, we can see that multiplication is not needed (except maybe multiplying with constants). |

2/5/2017, 18:45:26 |

## Complementary Tutorial Time | |

Hi all, Since the survey did not help reach an agreement, and due to some requests, the complementary tutorial will be held Sunday 7/5 16:30. The room in which the tutorial will take place will be announced later this week. Students who cannot attend the tutorial can refer to the notes that will be uploaded right after the class, and can always reach out to me for any questions. Tamer |

1/5/2017, 23:55:53 |

## Complementary Tutorial | |

Since we could not have a tutorial today, we will have a complementary one this week (either Wed or Thu). In order to find the best time for all of you, please fill in the following survey no later than tomorrow noon. https://goo.gl/forms/vp8lQVfczBl604473 The material of the complementary tutorial will not be included in the first midterm. |

30/4/2017, 16:46:33 |

## Problem set 2 is online | |

The exercise is not for submission. |

26/4/2017, 17:46:14 |

## Problem set 1 is online | |

The exercise is not for submission. |

2/4/2017, 16:44:13 |