Module Title:   Computer Architecture and Systems

Module Credit:   20

Module Code:   CM-1077D

Academic Year:   2015/6

Teaching Period:   Semester 1

Module Occurrence:   A

Module Level:   FHEQ Level 7

Module Type:   Standard module

Provider:   Computer Science

Related Department/Subject Area:   School of Electrical Engineering & Computer Science

Principal Co-ordinator:   Prof A Vourdas

Additional Tutor(s):   Dr A Csenki

Prerequisite(s):   None

Corequisite(s):   None

Aims:
The module consists of 2 parts: Introduction to Computer Architecture and Finite Automata and aspects of Turning machines.

Learning Teaching & Assessment Strategy:
Lectures and tutorials. Computer software will be used which will assist the students to get a deeper understanding of models of computing machines.

Lectures:   36.00          Directed Study:   150.00           
Seminars/Tutorials:   12.00          Other:   0.00           
Laboratory/Practical:   0.00          Formal Exams:   2.00          Total:   200.00

On successful completion of this module you will be able to...

understand how information is represented in binary form, the operation of the design and construction of simple computer architectures and the relationship between the machine and low level software.

On successful completion of this module you will be able to...

design, build and test basic logic circuits to perform specific functions; write simple assembly language programs; demonstrate a working knowledge of computer organisation and basic skills in assembly language programming.

On successful completion of this module you will be able to...

n/a

  Coursework 1.00 15%
 
  coursework
  Examination - closed book 2.00 85%
 
  closed book exam
  Examination - closed book 2.00 100%
 
  supplementary assessment - closed book exam

Outline Syllabus:
Overview of computer system organisation. Binary representation of information. Binary arithmetic and logical operations. Digital logic and logic circuit design, truth tables for combinatorial logic, circuit simplification techniques, Boolean algebra, Karnough -maps, State diagrams, Flip Flops, Arithmetic Logic Units. Computer memory, input/output, bus interconnections. Finite automata. Deterministic and non-deterministic finite automata. Kleenes theorem. Turing machines. Computability. Decidability.

Version No:  1