Course syllabus for Introduction to computer engineering

Course syllabus adopted 2024-02-15 by Head of Programme (or corresponding).

Overview

  • Swedish nameGrundläggande datorteknik
  • CodeDAT430
  • Credits6 Credits
  • OwnerTKAUT
  • Education cycleFirst-cycle
  • Main field of studyComputer Science and Engineering
  • DepartmentCOMPUTER SCIENCE AND ENGINEERING
  • GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail

Course round 1

  • Teaching language Swedish
  • Application code 47122
  • Maximum participants128
  • Open for exchange studentsNo

Credit distribution

0120 Laboratory 2 c
Grading: UG		0 c0 c1 c1 c0 c0 c
0220 Examination 4 c
Grading: TH		0 c0 c2 c2 c0 c0 c
  • 12 Okt 2024 am J

In programmes

Examiner

Eligibility

General entry requirements for bachelor's level (first cycle)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Specific entry requirements

The same as for the programme that owns the course.
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Course specific prerequisites

Basic eligibility

Aim

The course covers basic knowledge and skills in the design and operation of computers, thereby providing a good theoretical and practical basis for further studies in both computer engineering and computer science.

Learning outcomes (after completion of the course the student should be able to)

Knowledge and understanding:
  • describe binary codes such as NBCD-code, alphanumerical codes, , excess codes and Gray code
  • describe addition and subtraction with two's complement arithmetic
  • describe the structure and function of the computer, at block level show how controller, data path, register file, arithmetic and logic unit (ALU) are connected in a central unit at block level
  • describe and analyse the function and structure of the automatic control unit and explain how instructions are built up by control sequences
  • explain the principle of the stored program
  • describe a programmer's image of a processor, (instruction set and addressing method)
  • describe basic exception handling in computer systems.
  • describe different types of memory technologies such as ROM, PROM, FLASH, static RAM and dynamic RAM.
  • explain the concept of memory hierarchy.
  • describe synchronous and asynchronous bus protocols and multiplex technology.
Competence and skills:
  • perform number conversions between decimal, binary and hexadecimal numbers.
  • perform addition and subtraction with unsigned binary integers.
  • perform addition and subtraction with signed binary numbers with two’s complement arithmetic.
  • using Boolean algebra, describe, analyse and construct combinatorial networks (such as multiplexers, demultiplexers, full adders, etc.) typically used to build a computer's central unit
  • using Boolean algebra, describe and analyse sequential networks (memory elements and counters) typically used to build a computer's central unit.
  • analyse / construct a simple ALU and design control signal sequences for basic ALU operations
  • analyse a simple data path, and construct and design control signal sequences for transfers between registers, ALU and memory.
  • describe, analyse and construct simple assembler programs, organized into subroutines.
  • translate program code between machine and assembler programs (assemble, disassemble)
Judgement and approach:
  • Ability to understand the interaction between hardware and software.
  • Awareness that basic knowledge of computer organisation is a prerequisite for working with and understand issues related to the performance, energy consumption, environmental impact, real time properties, dependability and security of computing systems.

Content

  • The essential elements and concepts of digital technology and different number systems.
  • Use of Boolean algebra to construct combinatorial networks and synchronous sequential circuits.
  • The computer's digital building blocks (ALU, data path, controller, memory, input and output devices).
  • The traditional processor architecture (data-path and control unit and its instruction set) as a synchronously operating digital machine.
  • Programming in machine language and assembly language.

Organisation

Scheduled teaching sessions consists of lectures, demonstrations, and group exercises, and four compulsory laboratory classes. The laboratory assignments shall by documented in a laboratory report. Prior to each laboratory classes, the student can take a voluntary test which, if approved, will yield one bonus point in the exam or the associated intermediate test (see Examination below)

The course is divided into four parts: 1) Combinational circuits and binary codes, 2) Assembly programming, 3) Sequential circuits and 4). The computer’s data path and control unit. The lectures cover theory and problem solving, while the demonstrations provide further guidance on how to solve exercise problems. The student construct digital circuits, including a data path and a control unit, and write assembler programs. The circuits and programs are tested using a special simulator at the group exercises and the laboratory classes.

Literature

See the course homepage.

Examination including compulsory elements

To pass the course the student must pass the exam (svenska tentamen) or four intermediate tests (svenska duggor) and be approved on four laboratory assignments. Based on the result of the final exam, or the sum of the results of the intermediate tests, the grades U, 3, 4 or 5 are awarded. The exam is divided into four parts: 1) Combinational circuits and binary codes, 2) Assembly programming, 3) Sequential circuits, and 4) The computer’s data path and control unit. The intermediate tests have the same format and grading as the corresponding part of the exam. The result of an intermediate test is counted as a valid result for the corresponding part of the first exam and for the two following resit exams. If a student has passed an intermediate test and still chooses to answer the corresponding part of the exam, then the grade will be calculated based on the best result achieved on either the intermediate test or the corresponding part of the final exam.

The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.