DM534/DM558 Introduction to Computer Science

Autumn 2015
Joan Boyar
"Instruktorer": D1: Kristine Vitting Klinkby Knudsen, D2: Mathias W. Svendsen, D3: Jesper With Mikkelsen


Announcements:

1. Information about the re-exam is now available. See further down.
2. Assignment 4 and the redo of Assignment 3 have been graded.
3. An interesting book with the goal of showing the "beauty, depth and usefulness of key ideas in computer science" can by found here. The title of the book is Algorithmics Adventures and the author is Juraj Hromkovic. SDU has an electronic subscription to the series of books where this is included, so you should be able to access this while logged in at the university.

Course Information:

Start date: The course starts Wednesday, September 2, 12:15, in U50a.

The textbook: Computer Science: An Overview, 12th Edition, by J. Glenn Brookshear and Dennis Brylow, 2015.
There is a homepage for the textbook (12th edition), including the simulator. See the inside cover of the textbook for a code for registering. After registering, you can login by using this link again.

Assignments, etc.:
Official course description and schedule for DM534 fall 2015, in Danish.
Official course description and schedule for DM558 fall 2015, in Danish.
FF500 Take-home exam (and first assignment for DM558).
The redo of the take-home exam is due at 8:15 on October 5. Redo the original exam, correcting all errors, submit 1 PDF file via Blackboard, and place the graded version of your original exam in your "instruktor"'s mailbox.
FF500 Take-home re-exam. This re-exam is due at 8:15 on November 3, and there will not be any chance for a redo.

To pass this course, you must attend at least 80% of the lectures, discussion sections and labs, plus have all assignments approved.
Attendance is recorded by swiping student ID cards in class.
Policy on assignments. Assignments will be found here. Note that all assignments are for students in both DM534 and DM558.
Assignment 1, due 8:15, Thursday, October 1. Redo due at 8:30 on October 29.
Assignment 2, due 8:15, Monday, October 19. Redo due at 8:15 on November 9.
Assignment 3, due 8:15, Thursday, November 5. Redo due at 8:15 on November 25.
Assignment 4, due 8:15, Thursday, November 19. Redo due at 8:15 on December 14.
Assignment 5, due 8:15, Thursday, December 3.
Assignment 6, due 8:15, Thursday, December 17.
Information about the oral re-exam on February 26.

Course evaluation from 2015: Student course evaluation summary and response.

Schedule:

Office hours:
Joan: Mondays 9:00-9:45, Fridays 9:00-9:45.

Refer to the official course description and schedule for fall 2015, in Danish, for the actual schedule. There will probably be updates.

Note that in the table below "I" stands for "lecture", "TE" for "discussion section", "TL" for "lab", "SF" for "study group meeting", and "SFV" for "study group meeting with advisor".

.

.

Week Type Date Time Room Relevant material
36 I Wed 2/9 12-14 U50a Chapter 0, skipping section 0.2, section 5.1-2 (or appendix on pseudocode in your textbook by Rosen), and section 1.1. Slides.
36 I Thu 3/9 12-14 U50a Sections 1.1-6. Introduction to LaTeX. Slides.
36 TE Notes for discussion section.
37 SFV Notes for study groups.
37 I Tue 8/9 10-12 U20 Notes on floating point representation. Sections 1.4 (representing images and sound), 1.6 (excess notation), 1.7, 1.9--1.10. Through section 2.1 in chapter 2. Slides.
37 I Thu 10/9 12-14 U50a Sections 2.2-2.5, 2.7, and the beginning of chapter 3. Slides.
37 TL IMADA's terminal room Lab and LaTeX code for it. Learn to use LaTeX. Links for LaTeX guides..
38 I Tue 15/9 10-12 U50a Finish section 3.2, and cover sections 3.3-3.4 and much of chapter 4. Slides.
38 TL IMADA's terminal room Notes for lab (and discussion section). Simulator.
38 TE Notes for discussion section.
39 I Tue 22/9 10-12 U50a Cover sections 4.2-4.4. Begin on chapter 5 (up through Sequential Search). Slides.
39 I Thu 24/9 12-14 U50a Continue with algorithms from chapter 5, starting with Sequential Search. Slides. Notes by Torben Nielsen on asymptotic notation. Examples in Maple with asymptotic notation (try saving the files and opening with Maple): Linear vs. logarithmic, Other functions.
39 TE Notes for discussion section.
39 SFV Notes for study groups.
40 I Thu 1/10 12-14 U50a Continue with algorithms from chapter 5, starting with Insertion Sort. We will also look at bin packing. Slides.
40 TE Notes for first discussion section in week 40.
40 TE Notes for second discussion section in week 40.
40 SF Notes for study groups.
41 I Thu 1/10 12-14 U50a Kim Skak Larsen will guest lecture on databases (chapter 9). Slides.
41 TL IMADA's terminal room Notes for lab (and discussion section). Jakob Aae Mikkelsen's sorting simulator.
43 I Thu 22/10 12-14 U50a We will finish bin packing and then continue in chapter 9. Slides.
43 TE Notes for discussion section.
43 SFV Notes for study groups.
44 I Tue 27/10 10-12 U50a We will finish chapter 9. Slides. We will begin on chapter 12, and there will be no slides. Turing machine simulator written by a former student Morten Skyt Eriksen.
44 I Thu 29/10 12-14 U50a We continued in chapter 12, finished through 12.4 and starting 12.5. No slides.
44 TE Notes for discussion section.
45 I Thu 5/11 12-14 U50a Continue on chapter 12. We will also begin on security from sections 3.5 and 4.5. No slides.
45 TE Notes for first discussion section in week 45.
45 TE Notes for second discussion section in week 45, changed on November 2.
45 SF Notes for study groups.
46 I Tue 10/11 10-12 U50a 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 I Thu 12/11 12-14 U50a Daniel Merkle will guest lecture on bioinformatics and cheminformatics. Slides not yet available.
46 TE Notes for discussion section.
46 SF Notes for study groups.
47 I Thu 19/11 12-14 U50a Continuing with cryptology, using the same 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.
47 TE Notes for discussion section.
48 I Tue 24/11 10-12 U50a Finishing with cryptology (digital signatures), using the same slides, plus some about public key infrasturtures and PGP. We will start on chapter 11. No slides. Jakob Lykke Andersen will give an introduction to Mercurial.
48 I Thu 26/11 12-14 U50a Continuing with chapter 11, concentrating on sections 11.3 and 11.5, without slides.
48 TE Notes for discussion section.
48 SFV Notes by Jakob Lykke Andersen for study groups. Bring your computers. Note that Jakob Lykke Andersen will introduce Mercurial during the lecture on Tuesday in week 48.
49 I Thu 3/12 12-14 U50a Finishing chapter 11, without slides. We will also discuss how this course relates to your future studies and do a course evaluation.
49 TL IMADA's terminal room Lab description. For an introduction to cryptography, you can read How PGP works. Explanation for PGP, from PGP's homepage.
50 I Thu 10/12 12-14 U50a Rolf Fagerberg will lecture on graphics (slides), chapter 10, and on the computer science education in general (slides).
50 TE Notes for discussion section.
50 SF Notes for study groups.


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