Syllabus for Computer Architecture I

Datorarkitektur I

  • 7.5 credits
  • Course code: 1DT016
  • Education cycle: First cycle
  • Main field(s) of study and in-depth level: Computer Science G1F
  • Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
  • Established: 2007-03-19
  • Established by:
  • Revised: 2023-01-30
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: Autumn 2023
  • Entry requirements:

    A second course in computer programming, e.g. Computer Programming II.

  • Responsible department: Department of Information Technology

Learning outcomes

On completion of the course, the student should be able to:

  • explain how modern computer systems are constructed, including details about memory organisation, virtual and physical memory and memory technologies.
  • explain the principles for constructing instruction sets
  • describe constraints for computer systems in terms of bandwidth, effect, and cooling
  • explain how computer systems intract with it's surroundings through input and output systems including handling of interrupts
  • write small programs in assembley language that control a computer systems and its interactions with the outside


The von Neumann architecture. Machine instructions and addressing. The CPU, including pipeline techniques and the control unit Microprogramming. Memory technology and structure. I/O, interrupt systems, direct memory access. External units. Assembler programming. Orientation about alternative architectures.


Lectures, lessons, and labs.


The theoretical part  (4.5 credits) is examined with a written exam and assignments. The practical part (3 credits) is examined with assignments. The written exam is on campus.


 If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.

Reading list

The reading list is missing. For further information, please contact the responsible department.

Last modified: 2022-04-26