DM534 Introduction to Computer Science
Autumn 2014
Joan Boyar and
Rolf Fagerberg
"Instruktorer": D1: Magnus Gausdal Find,
D2: Christian Kudahl
Announcement:
For those who have flunked the course, either due to attendance problems or not having assignments approved, the reexam will be on February 23.
Announcement:
The updated rules for the reexam are here. This also contains the questions.
Course Information:
Start date: The course starts Tuesday, September 2, 8:15, in U43.
The textbook:
Computer Science: An Overview, 11th Edition, by J. Glenn Brookshear,
2012.
There is a
homepage for the
textbook (11th edition), including the simulator.
A list of errata for the textbook can be found here.
Assignments, etc.:
Official course description and schedule for fall,
in Danish.
"Studiestartopgave".
Reexam in "Studiestartopgave". Now available.
To pass this course, you must attend at least 80% of the lectures, discussion
sections and labs, plus have all assignments approved.
Policy on assignments. Assignments will be found here.
Assignment 1, due 8:15, Tuesday, September 30.
Assignment 2, due 8:15, Tuesday, October 21.
Assignment 3, due 8:15, Tuesday, November 4.
Assignment 4, due 8:15, Thursday, November 20. (Updated November 12.)
Assignment 5, due 8:15, Thursday, December 4.
Assignment 6, due 8:15, Thursday, December 18. (Last assignment)
Course evaluation from 2014: Student course evaluation summary and response.
Schedule:
Office hours:
Joan: Mondays 9:1510:00, Thursdays 10:4511:30.
Note that in the table below "I" stands for "lecture", "TE" for
"discussion section" (and D1 or D2 is indicated),
"TL" for "lab" (and D1 or D27 is indicated), "SF"
for "study group meeting", and "SFV" for "study group meeting with
advisor".
Week 
Type 
Date 
Time 
Room 
Relevant material 
36 
I 
Tue 2/9 
810 
U43 
Chapter 0, section 5.12.
Joan's slides and Rolf's slides. 
36 
I 
Wed 3/9 
810 
U20 
Sections 1.17. Notes on floating point representation.
Joan's slides on gates and Rolf's slides on number representation. 
36 
TE D2 
Wed 3/9 
1214 
U156 
Notes for discussion section. 
36 
TE D1 
Fri 5/9 
1214 
U27a 
Notes for discussion section. 
37 
I 
Tue 9/9 
810 
U43 
Finish chapter 1.
Slides. 
37 
I 
Thu 11/9 
1618 
U20 
Chapter 2 (slides), plus an introduction to LaTeX (slides). 
37 
SFV 



Notes for study groups. 
37 
TE D1 
Fri 12/9 
810 
U29a 
Notes for discussion section. 
37 
TE D2 
Fri 12/9 
1012 
U28a 
Notes for discussion section. 
38 
I 
Tue 16/9 
810 
U43 
Chapter 3.
Slides. 
38 
TL D1 
Wed 17/9 
1012 
IMADA's terminal room 
LaTeX notes for lab
written by Rolf Fagerberg in Danish.
Learn and use LaTeX. Links for LaTeX guides. 
38 
TL D2 
Wed 17/9 
1214 
IMADA's terminal room 
LaTeX notes for lab
written by Rolf Fagerberg in Danish.
Learn and use LaTeX. Links for LaTeX guides. 
38 
TL D1 
Fri 19/9 
810 
IMADA's terminal room 
Lab.
Simulator. 
38 
TL D2 
Fri 19/9 
1012 
IMADA's terminal room 
Lab.
Simulator. 
39 
I 
Tue 23/9 
810 
U43 
Chapter 4.
Slides. 
39 
SFV 



Notes for study groups. 
39 
TE D1 
Wed 24/9 
1012 
U157 
Notes for discussion section. 
39 
TE D2 
Wed 24/9 
1214 
U156 
Notes for discussion section. 
39 
I 
Thu 25/9 
1618 
U20 
Begin on chapter 5. Slides. 
40 
I 
Tue 30/9 
810 
U43 
Continue with chapter 5.
Slides. 
40 
SFV 



Notes for study groups. 
40 
TE D1 
Wed 1/10 
1012 
U31a 
Notes for discussion section. 
40 
TE D2 
Wed 1/10 
1214 
U146 
Notes for discussion section. 
40 
TL D1 
Fri 3/10 
810 
IMADA's terminal room 
Lab description. Link
to Jacob Aae Mikkelsen's sorting simulator. 
40 
TL D2 
Fri 3/10 
1012 
IMADA's terminal room 
Lab description. Link
to Jacob Aae Mikkelsen's sorting simulator. 
41 
I 
Tue 7/10 
810 
U43 
Finish chapter 5 (slides at end of those from September 30). Begin on section 9.5.
Slides. 
41 
TE D1 
Wed 8/10 
1012 
U31a 
Continue with questions from October 1. Then start on Notes for discussion section. 
41 
TE D2 
Wed 8/10 
1214 
U20 
Continue with questions from October 1. Then start on Notes for discussion section. 
41 
I 
Thu 9/10 
1618 
U20 
Lecture by Kim Skak Larsen on chapter 9 (slides). 
43 
I 
Tue 21/10 
810 
U43 
Continue with chapter 9.
Slides. 
43 
TE D1 
Wed 22/10 
1012 
U31a 
Notes for discussion section, continuing with
where you ended on October 8. 
43 
TE D2 
Wed 22/10 
1214 
U28A 
Notes for discussion section, continuing with
where you ended on October 8. 
43 
TE D1 
Wed 22/10 
1618 
U152 
Notes for discussion section.

43 
TE D2 
Thu 23/10 
1618 
U156 
Notes for discussion section.

44 
I 
Tue 28/10 
810 
U43 
Finish with merging. Midway course evaluation, see Link for rating topics. Begin on chapter 12 (no slides). Turing machine simulator written by a former student Morten Skyt Eriksen. 
44 
SFV 



Notes for study groups. 
44 
TE D1 
Wed 29/10 
1012 
U31a 
Notes for discussion section. 
44 
TE D2 
Wed 29/10 
1214 
U146 
Notes for discussion section. 
44 
I 
Thu 30/10 
1618 
U20 
Continue on chapter 12. No slides. 
45 
I 
Tue 4/11 
810 
U43 
Continue on chapter 12. We will also begin on security from sections 3.5 and 4.5. No slides. 
45 
SF 



Notes for study groups. 
45 
TE D1 
Wed 5/11 
1012 
U31a 
Notes for discussion section. 
45 
TE D2 
Wed 5/111 
1214 
U154 
Notes for discussion section. 
45 
TE D1 
Wed 5/11 
1618 
U152 
Discuss the problems on page 535 (except 3). 
45 
TE D2 
Thu 6/11 
1618 
U156 
Discuss the problems on page 535 (except 3). 
46 
I 
Tue 11/11 
810 
U43 
Finish with security. Cryptology. Covering up through the definition of an efficient modular exponentiation algorithm in the following:
Slides. See also Chapter 4 in Rosen's
Discrete Mathematics and Its Applications, 7th edition, for information on the greatest common divisor, other number theory, and RSA. 
46 
TE D1 
Wed 12/11 
1012 
U31a 
Notes for discussion section. 
46 
TE D2 
Wed 12/11 
1214 
U20 
Notes for discussion section. 
46 
I 
Thu 13/11 
1618 
U20 
Continuing with cryptology using the same slides. 
47 
I 
Tue 18/11 
810 
U43 
Continuing with cryptology using the same slides. 
47 
TE D1 
Wed 19/11 
1012 
U31a 
Notes for discussion section. 
47 
TE D2 
Wed 19/11 
1214 
U47 
Notes for discussion section. 
47 
TL D1 
Fri 21/11 
810 
IMADA's terminal room 
Lab description. For an introduction to cryptography, you can read How PGP
works.
Explanation for
PGP,
from PGP's homepage.

47 
TL D2 
Fri 21/11 
1012 
IMADA's terminal room 
Lab description. For an introduction to cryptography, you can read How PGP
works.
Explanation for
PGP,
from PGP's homepage.

48 
SFV 



Notes for study groups. 
48 
I 
Tue 25/11 
810 
U43 
Start on chapter 11, concentrating on sections 11.3 and 11.5. No slides. 
48 
TE 
Wed 26/11 


Discussion sections cancelled this week. 
48 
I 
The 27/11 


Lecture on Thursday cancelled this week. 
49 
SF 



Notes for study groups. 
49 
I 
Tue 2/12 
810 
U43 
Continue with chapter 11 (guest: Magnus Gausdal Find). Begin on chapter 10 (slides by Rolf).

49 
TE D1 
Wed 3/12 
1012 
U31a 
Notes for discussion section. 
49 
TE D2 
Wed 3/12 
1214 
U20 
Notes for discussion section. 
49 
TL D1 
Fri 5/12 
810 
IMADA's terminal room 
Notes about version control by Jacob Lykke Andersen. 
49 
TL D2 
Fri 5/12 
1012 
IMADA's terminal room 
Notes about version control by Jacob Lykke Andersen. 
50 
I 
Tue 9/12 
810 
U43 
Continue with chapter 10. Course summary (slides by Rolf about studying computer science).

Maintained by Joan Boyar
(joan@imada.sdu.dk)

