Computational Complexity

The answers for the multiple choice part of the exams are here

 

Recitation will take place on 11/9/02 (Wed.) Schreiber 006 4pm

 

Ps

Doc

1st exam of 2001c

2001a.ps

2001a.doc

2nd exam of 2001c

2001b.ps

2001b.doc

For those of you who asked for it:

A recent poly-time algorithm to check if a given number is prime
by M. Agrawal, N. Kayal and N. Saxena  The original paper  A power-point presentation

Home Assignments

Home-assignments should be submitted at the mailbox of the grader, David Tankus, located in Schreiber building, 1st floor.
They will be returned to the course’s mailbox, room 114, Schreiber building . 

Any questions regarding grading, should be referred to David Tankus at tankus@tau.ac.il

You are allowed to submit in pairs.

In case of army service, an extension is automatically given (a day for each service day). Please attach a copy of the form to your submitted work.

Exe #

PS file

PDF file

Sol  PS file

Sol PDF file

Due to

Remarks

1

ex01.ps

ex01.pdf

ex01_ans.ps

ex01_ans.pdf

11/8/02

 

2

ex02.ps

ex02.pdf

ex02_ans.ps

ex02_ans.pdf

20/8/02

 

3

ex03.ps

ex03.pdf

ex03_ans.ps

ex03_ans.pdf

27/8/02

 

4

ex04.ps

ex04.pdf

ex04_ans.ps

ex04_ans.pdf

3/9/02

 

5

ex05.ps

ex05.pdf

ex05_ans.ps

ex05_ans.pdf

 

 

6

ex06.ps

ex06.pdf

ex06_ans.ps

ex06_ans.pdf

 

 


Answers for multiple choice part of the exam

The exam’s versions are here and here

 

 

1st exam

Question

Ver1

1

B

2

A

3

A

4

A

5

B

6

C

7

B

8

C

9

A

 

 

2nd exam

Question

Ver1

1

A

2

B

3

C

4

B

5

C

6

B

7

B

8

B

9

E