CS106 - Computer Systems & Organisation
| TIMETABLE | TEACHING MATERIAL |
| Credits | 20 |
| Level | 1 |
| Semester | Semester 1, Semester 2 |
| Mode of Delivery |
|
| Availability | Can be chosen as an elective. |
| Prerequisites | None |
| Learning Activities Breakdown | 44 lectures, with 10 tutorials and 10 practicals |
| Items of Assessment | 2 |
| Assessment | This class is assessed 100% via coursework. This mark is usually made up of the following assessments. In semester 1 there will be a total of 2 class tests worth 25% making up 50% of the final grade. In semester 2 there will be two class tests worth 20% each, making up 40% of the final grade. The final 10% of semester 2 is made up of 10 short weekly quizzes worth 1% each.
|
| ILO Assessment Mapping | |
| Education for Sustainable Development Competences |
|
| Pedagogical Methods Used to Support Competency Development | |
| Resit | The resit for this class consists of a take home assignment which focusses on the practical aspects of the course. |
| Lecturer | Alasdair Lambert, Conor McBride, Guillaume Allais |
Aims and Objectives
Semester 1: to enable the student to develop an understanding and appreciation of a computer system’s functional components – both hardware and software, their characteristics, their interactions, and their fundamental role in the manipulation of data.
Semester 2: to further the student’s knowledge of the design parameters of a typical computer system and the impact these have on the functionality, and implementation, of the hardware and software components.
Learning Outcomes
On completion of the first half of the class, a student should have developed an understanding of:
1. The function and basic operation of the fundamental hardware components of computer systems.
2. The function and basic operation of the fundamental software components of computer systems.
3. The hierarchy of, and the interaction between, the components of a typical computer system.
4. The concept of a logical layer and the benefits of building abstract layers in hierarchical fashion.
5. The concept of an instruction set architecture (ISA), and the nature of a machine-level instruction in terms of its functionality and use of resources (registers and memory).
6. The various classes of instruction: data movement, arithmetic, logical, and flow control; their use and abuse in simple programs.
7. Boolean functions and logic expressions and their implementation in digital logic gates, and combinational and sequential circuits.
8. Appreciate how a CPU may be constructed from combinational and sequential logic circuits.
9. Appreciate how conditional operations are implemented at the machine level.
On completion of the second half of the class, a student should be able to:
1. Demonstrate their knowledge of data/number/information representations and the limitations of such representations.
2. Understand the relationship between instruction set architecture, micro-architecture, and system architecture and their roles in the development of the computer.
3. Understand the differences between the two main types of instruction set architecture and be aware of the major strengths and weaknesses of the alternative types of ISA.
4. Understand the way in which subroutines are invoked, how their parameters are passed and how their local workspace is created and accessed, and how they return to the point of invocation.
5. The typical types of data/number/information representations and the implications of these for calculations and transformations.
6. Appreciate how an ISA has an impact on high-level languages and the design of compilers.
7. Understand the basic principles of operation of the memory.
8. Appreciate how future developments in computer systems may be influenced by current trends and technologies.
Syllabus
Semester 1
* Machines and Computation: Brief history of computers and the nature of computation, e.g. how arithmetic expressions are evaluated.
* Introduction to a simple computer: CPU basics and organisation (registers, the ALU, the Control Unit and datapath); the bus; clocks; I/O; memory; interrupts).
* Basic Functional (Hardware) Components of Computer Systems: for example, CPU, memory, I/O.
* Basic Functional (Software) Components of Computer Systems: for example, assemblers, compilers, and operating systems.
* Representation of numeric data: unsigned binary, signed magnitude, and twos complement; twos complement arithmetic.
* Function of logic gates; sum of products expressions, Boolean algebra, combinatorial and sequential logic circuits, for example those for multiplexers, adders, registers, shift registers, counters, overflow detection; PLAs.
* Testing correctness of simple circuits: edge cases; remarkable properties; unit testing.
Semester 2
* Introduction to instruction set architecture, micro-architecture and system architecture.
* Processor instruction set architecture: instruction types and formats, register sets, addressing modes.
* Processor structures: memory-to-register architectures; load/store architectures.
* Elementary assembly language programming: simple computations involving loops, counters, and accumulation; awareness of bugs.
* The relationship between low-level and high-level programming languages.
* Instruction sequencing, flow-of-control, subroutine call and return mechanisms.
* Low-level architectural support for high-level languages.
* Memory: types of memory, overview of the memory hierarchy.
* Current and future trends in computer systems: an overview of the current trends in state-of-the-art computer systems and an extrapolation of these (in an attempt) to predict future developments.
Recommended Reading
This list is indicative only – the class lecturer may recommend alternative reading material. Please do not purchase any of the reading material listed below until you have confirmed with the class lecturer that it will be used for this class.
The Essentials of Computer Organisation and Architecture, 2nd edition, Linda Null and Julia Lobur, Jones and Bartlett, 2006, 0763737696
Last updated: 2026-08-11 13:52:03