Introduction to Computer Science

Announcement: If you did not pass DM501 and wish to do the re-exam now, rather than next fall, you must contact me immediately.
Announcement: For information about modulo computation, etc, for the 6th assignment, see the notes for lecture 8, in addition to the lab and assignment on the notes for lecture 10. Jacob Allerelli has also written some notes in Danish. See below.
Announcement: The last assignment (and any retry which should be turned in with the last assignment) is due on Friday (not a Monday), October 28 at 10:00 AM, in my (Joan's) office (in person or by e-mail, or to a secretary in IMADA's office).
Announcement: Your last assignments will be graded by Tuesday, November 1. Pick them up in my (Joan's) office on Tuesday. If you cannot get there on Tuesday, they will be with Jacob Allerelli. If your last assignment is not approved, the retry should be turned in to Joan (in person or by e-mail, or to a secretary in IMADA's office) by 10:00 AM on Wednesday, November 9.

The textbook:

Computer Science: An Overview, 8th Edition, by J. Glenn Brookshear, 2005.
There is a homepage for the textbook, including the simulator.
A list of errata for the textbook can be found here.
The textbook will be supplemented with notes.


There will be no exam at the end of the course; instead there are mandatory assignments, of which all 7 must be completed well and on time in order to pass the course. You are allowed to retry (only once) on at most 3 assignments which were not approved the first time.

Lecture notes

  1. Note 1 (also in PDF).
  2. Note 2 (also in PDF).
  3. Note 3 (also in PDF).
  4. Note 4 (also in PDF).
  5. Note 5 (also in PDF).
  6. Note 6 (also in PDF).
  7. Note 7 (also in PDF).
  8. Note 8 (also in PDF).
  9. Note 9 (also in PDF).
  10. Note 10 (also in PDF).
  11. Note 11 (also in PDF).
  12. Note 12 (also in PDF).
  13. Note 13 (also in PDF).
  14. Note 14 (also in PDF).


IMADA HOME | SDU HOME | Previous page |
Last modified: Thu Nov 10 12:37:19 CET 2005 - Joan Boyar <>