Nyhetsflöde

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

1

Nov 4

14:15-16:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

2

Nov 67

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

4

Nov 18

14:15-16:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

14:15-16:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides¶

1

Nov 4

14:15-16:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1¶

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

¶

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

¶

4

Nov 18

14:15-16:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

¶

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

¶

6

Dec 2

14:15-16:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

¶

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

¶

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

¶

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

145:15-167:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

4

Nov 18

145:15-167:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

145:15-167:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

Lecture 3

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

Lecture 3

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

Lecture 4

5

Nov 25

10:15-12:00

SIP

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

Lecture 3

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

Lecture 4

5

Nov 254

10:15-12:00

SIPConf. Room, Floor 8

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

Lecture 3

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

Lecture 4

5

Nov 24

10:15-12:00

Conf. Room, Floor 8

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

Lecture 5

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

Lecture 3

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

Lecture 4

5

Nov 24

10:15-12:00

Conf. Room, Floor 8

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

Lecture 5

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

Lecture 6

7

Dec 9

9:15-11:00

SIP

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Course literature:
* Amos Lapidoth, "A Foundation in Digital Communication," Cambridge 2009.
Schedule: Lecture

Date    

Time

Place

Teacher

Topic

Reading

Lecture Slides

1

Nov 4

15:15-17:00

SIP

R.T. & T.O.

Course Introduction, Introduction in Stochastic Processes

chap 12, 13

Lecture 1

2

Nov 7

14:15-16:00

SIP

R.T.

Operational Power Spectral Density, PAM, QAM

chap 14, 15, 16

Lecture 2

3

Nov 11

10:15-12:00

SIP

R.T.

Energy, Power, and PSD in QAM, Complex RV and Processes

chap 17, 18, 19

Lecture 3

4

Nov 18

15:15-17:00

SIP

R.T.

Binary and Multi-Hypothesis Testing

chap 20, 21

Lecture 4

5

Nov 24

10:15-12:00

Conf. Room, Floor 8

R.T.

Sufficient Statistics, Multivariate Gaussian Distribution

chap 22, 23

Lecture 5

6

Dec 2

15:15-17:00

SIP

R.T.

Complex Gaussian and Circular Symmetry, Continuous-Time Stochastic Processes

chap 24, 25

Lecture 6

7

Dec 9

916:15-118:00

SIPConf. Room, Floor 8

T.O.

Detection in White Gaussian Noise

chap 26

8

Dec 16

14:15-16:00

SIP

T.O.

Non-coherent Detection, Signal Detection Gaussian Noise

chap 27, 28

Room: meeting room SIP, 3rd floor, Osquldas väg 10Teacher: R.T. = Ragnar Thobaben, T.O. = Tobias Oechtering

Mandatory Homework Assignment  Homework

Problem Set                   

Due                                

1

Homework 1 (pdf)

Wed, Oct 31

2

Homework 2 (pdf)

Wed, Nov 7

3 coming soon

Wed, Nov 14

4

coming soon

Wed, Nov 21

5

coming soon

Wed, Nov 28

6

coming soon

Wed, Dec 5

7 coming soon Wed, Dec 12 8 coming soon Wed, Dec 19
* Only oral discussion about the homework problems between students are allowed, i.e, you are not allowed to use pen and paper.
* Everybody has to hand in an own solution. Solutions will be checked against plagiarism!
* Each step has to be justified. If justification is missing then this is considered as wrong! Perhaps refer on equations from the book.
* Every correctly solved problem is worth 1 point, partially correct gives 0.5 point, mostly wrong 0 point.
Strict deadline: One day before each tutorial.

* On paper: During office hours (before 6 PM)
* Scanned via E-mail before midnight (preferred, send to both TAs and teacher), one minus point for every hour late.
Tutorial The tutorial will be of two parts.

* Discussion of a problem: The TA will discuss certain problem(s) of the next homework set.
* Ticking: This means in the beginning of the tutorial every student is asked to tick those problems the student is able to present at the board. The TA will then randomly call the students to present their solution.The problems are taken from the last homework set.
Bonus Points
* Participation: If you tick at least 4 problems, then you obtain 1 bonus point. If you tick at least 2 problems, then you obtain 1/2 bonus point.
* Presentation: If you successfully present a solution, then you obtain one extra bonus point. If it partially correct, then you obtain 1/2 extra bonus pont. If it is wrong, but it was an honest try, then you obtain 0 extra bonus point. Note, every step has to be justified.
* Cheating: If you obviously do not have a solution, but you ticked the problem, then the bonus points for this session will be removed. If this happens the second time, then also all previous bonus points will be removed.
Tutorial Schedule Tutorial

Date    

Time

Place

TA

1

Thu,Nov 1

15:15-17:00

L31

Ali

2

Thu, Nov 8

10:15-12:00

M38

Ali

3

Thu, Nov 15

10:15-12:00

M21

4

Thu, Nov 22

10:15-12:00

L21

5

Thu, Nov 29

10:15-12:00

L43

6

Thu, Dec 6

10:15-12:00

Q24

7

Thu, Dec 13

10:15-12:00

V12

Mandatory Homework Assignment  Homework

Problem Set                   

Due                                

1

Homework 1 (pdf)

Wed, Oct 31

2

Homework 2 (pdf)

Wed, Nov 7

3 Homework 3 (pdf)

Wed, Nov 14

4

cHoming soonework 4 (pdf)

Wed, Nov 21

5

coming soon

Wed, Nov 28

6

coming soon

Wed, Dec 5

7 coming soon Wed, Dec 12 8 coming soon Wed, Dec 19
* Only oral discussion about the homework problems between students are allowed, i.e, you are not allowed to use pen and paper.
* Everybody has to hand in an own solution. Solutions will be checked against plagiarism!
* Each step has to be justified. If justification is missing then this is considered as wrong! Perhaps refer on equations from the book.
* Every correctly solved problem is worth 1 point, partially correct gives 0.5 point, mostly wrong 0 point.
Strict deadline: One day before each tutorial.

* On paper: During office hours (before 6 PM)
* Scanned via E-mail before midnight (preferred, send to both TAs and teacher), one minus point for every hour late.
Tutorial The tutorial will be of two parts.

* Discussion of a problem: The TA will discuss certain problem(s) of the next homework set.
* Ticking: This means in the beginning of the tutorial every student is asked to tick those problems the student is able to present at the board. The TA will then randomly call the students to present their solution.The problems are taken from the last homework set.
Bonus Points
* Participation: If you tick at least 4 problems, then you obtain 1 bonus point. If you tick at least 2 problems, then you obtain 1/2 bonus point.
* Presentation: If you successfully present a solution, then you obtain one extra bonus point. If it partially correct, then you obtain 1/2 extra bonus pont. If it is wrong, but it was an honest try, then you obtain 0 extra bonus point. Note, every step has to be justified.
* Cheating: If you obviously do not have a solution, but you ticked the problem, then the bonus points for this session will be removed. If this happens the second time, then also all previous bonus points will be removed.
Tutorial Schedule Tutorial

Date    

Time

Place

TA

1

Thu,Nov 1

15:15-17:00

L31

Ali

2

Thu, Nov 8

10:15-12:00

M38

Ali

3

Thu, Nov 15

10:15-12:00

M21

4

Thu, Nov 22

10:15-12:00

L21

5

Thu, Nov 29

10:15-12:00

L43

6

Thu, Dec 6

10:15-12:00

Q24

7

Thu, Dec 13

10:15-12:00

V12

Mandatory Homework Assignment  Homework

Problem Set                   

Due                                

1

Homework 1 (pdf)

Wed, Oct 31

2

Homework 2 (pdf)

Wed, Nov 7

3 Homework 3 (pdf)

Wed, Nov 14

4

Homework 4 (pdf)

Wed, Nov 21

5

Homework 5 (pdf)

Wed, Nov 28

6

cHoming soonework 6 (txt)

Wed, Dec 5

7 coming soon Wed, Dec 12 8 coming soon Wed, Dec 19
* Only oral discussion about the homework problems between students are allowed, i.e, you are not allowed to use pen and paper.
* Everybody has to hand in an own solution. Solutions will be checked against plagiarism!
* Each step has to be justified. If justification is missing then this is considered as wrong! Perhaps refer on equations from the book.
* Every correctly solved problem is worth 1 point, partially correct gives 0.5 point, mostly wrong 0 point.
Strict deadline: One day before each tutorial.

* On paper: During office hours (before 6 PM)
* Scanned via E-mail before midnight (preferred, send to both TAs and teacher), one minus point for every hour late.
Tutorial The tutorial will be of two parts.

* Discussion of a problem: The TA will discuss certain problem(s) of the next homework set.
* Ticking: This means in the beginning of the tutorial every student is asked to tick those problems the student is able to present at the board. The TA will then randomly call the students to present their solution.The problems are taken from the last homework set.
Bonus Points
* Participation: If you tick at least 4 problems, then you obtain 1 bonus point. If you tick at least 2 problems, then you obtain 1/2 bonus point.
* Presentation: If you successfully present a solution, then you obtain one extra bonus point. If it partially correct, then you obtain 1/2 extra bonus pont. If it is wrong, but it was an honest try, then you obtain 0 extra bonus point. Note, every step has to be justified.
* Cheating: If you obviously do not have a solution, but you ticked the problem, then the bonus points for this session will be removed. If this happens the second time, then also all previous bonus points will be removed.
Tutorial Schedule Tutorial

Date    

Time

Place

TA

1

Thu,Nov 1

15:15-17:00

L31

Ali

2

Thu, Nov 8

10:15-12:00

M38

Ali

3

Thu, Nov 15

10:15-12:00

M21

4

Thu, Nov 22

10:15-12:00

L21

5

Thu, Nov 29

10:15-12:00

L43

6

Thu, Dec 6

10:15-12:00

Q24

7

Thu, Dec 13

10:15-12:00

V12

Mandatory Homework Assignment  Homework

Problem Set                   

Due                                

1

Homework 1 (pdf)

Wed, Oct 31

2

Homework 2 (pdf)

Wed, Nov 7

3 Homework 3 (pdf)

Wed, Nov 14

4

Homework 4 (pdf)

Wed, Nov 21

5

Homework 5 (pdf)

Wed, Nov 28

6

Homework 6 (pdf)

Wed, Dec 5

7 cHoming soonework 7 (pdf) Wed, Dec 12 8 coming soon Wed, Dec 19
* Only oral discussion about the homework problems between students are allowed, i.e, you are not allowed to use pen and paper.
* Everybody has to hand in an own solution. Solutions will be checked against plagiarism!
* Each step has to be justified. If justification is missing then this is considered as wrong! Perhaps refer on equations from the book.
* Every correctly solved problem is worth 1 point, partially correct gives 0.5 point, mostly wrong 0 point.
Strict deadline: One day before each tutorial.

* On paper: During office hours (before 6 PM)
* Scanned via E-mail before midnight (preferred, send to both TAs and teacher), one minus point for every hour late.
Tutorial The tutorial will be of two parts.

* Discussion of a problem: The TA will discuss certain problem(s) of the next homework set.
* Ticking: This means in the beginning of the tutorial every student is asked to tick those problems the student is able to present at the board. The TA will then randomly call the students to present their solution.The problems are taken from the last homework set.
Bonus Points
* Participation: If you tick at least 4 problems, then you obtain 1 bonus point. If you tick at least 2 problems, then you obtain 1/2 bonus point.
* Presentation: If you successfully present a solution, then you obtain one extra bonus point. If it partially correct, then you obtain 1/2 extra bonus pont. If it is wrong, but it was an honest try, then you obtain 0 extra bonus point. Note, every step has to be justified.
* Cheating: If you obviously do not have a solution, but you ticked the problem, then the bonus points for this session will be removed. If this happens the second time, then also all previous bonus points will be removed.
Tutorial Schedule Tutorial

Date    

Time

Place

TA

1

Thu,Nov 1

15:15-17:00

L31

Ali

2

Thu, Nov 8

10:15-12:00

M38

Ali

3

Thu, Nov 15

10:15-12:00

M21

Ali

4

Thu, Nov 22

10:15-12:00

L21

Ali

5

Thu, Nov 29

10:15-12:00

L43

Ali

6

Thu, Dec 6

10:15-12:00

Q24

Ricardo

7

Thu, Dec 13

10:15-12:00

V12

Ricardo

Mandatory Homework Assignment  Homework

Problem Set                   

Due                                

1

Homework 1 (pdf)

Wed, Oct 31

2

Homework 2 (pdf)

Wed, Nov 7

3 Homework 3 (pdf)

Wed, Nov 14

4

Homework 4 (pdf)

Wed, Nov 21

5

Homework 5 (pdf)

Wed, Nov 28

6

Homework 6 (pdf)

Wed, Dec 5

7 Homework 7 (pdf) Wed, Dec 12 8 cHoming soonework 8 (pdf) Wed, Dec 19
* Only oral discussion about the homework problems between students are allowed, i.e, you are not allowed to use pen and paper.
* Everybody has to hand in an own solution. Solutions will be checked against plagiarism!
* Each step has to be justified. If justification is missing then this is considered as wrong! Perhaps refer on equations from the book.
* Every correctly solved problem is worth 1 point, partially correct gives 0.5 point, mostly wrong 0 point.
Strict deadline: One day before each tutorial.

* On paper: During office hours (before 6 PM)
* Scanned via E-mail before midnight (preferred, send to both TAs and teacher), one minus point for every hour late.
Tutorial The tutorial will be of two parts.

* Discussion of a problem: The TA will discuss certain problem(s) of the next homework set.
* Ticking: This means in the beginning of the tutorial every student is asked to tick those problems the student is able to present at the board. The TA will then randomly call the students to present their solution.The problems are taken from the last homework set.
Bonus Points
* Participation: If you tick at least 4 problems, then you obtain 1 bonus point. If you tick at least 2 problems, then you obtain 1/2 bonus point.
* Presentation: If you successfully present a solution, then you obtain one extra bonus point. If it partially correct, then you obtain 1/2 extra bonus pont. If it is wrong, but it was an honest try, then you obtain 0 extra bonus point. Note, every step has to be justified.
* Cheating: If you obviously do not have a solution, but you ticked the problem, then the bonus points for this session will be removed. If this happens the second time, then also all previous bonus points will be removed.
Tutorial Schedule Tutorial

Date    

Time

Place

TA

1

Thu,Nov 1

15:15-17:00

L31

Ali

2

Thu, Nov 8

10:15-12:00

M38

Ali

3

Thu, Nov 15

10:15-12:00

M21

Ali

4

Thu, Nov 22

10:15-12:00

L21

Ali

5

Thu, Nov 29

10:15-12:00

L43

Ali

6

Thu, Dec 6

10:15-12:00

Q24

Ricardo

7

Thu, Dec 13

10:15-12:00

V12

Ricardo

Addtional Homework Set There will be one more tutorial and mandatory homework set. The homework set will contain more problems than the previous homework sets. ¶

Homework set: Homework 9

Additional Tutorial Session There will be one more tutorial on Thu, Jan 17 from 10:15-12:00 in room L31.