Computer Science Home | People | Degrees | Papers | Research | Events | Other FCMS Subjects
Level 1 Papers

Level 2 Papers

Level 3 Papers

Level 4 Papers

Level 5 Papers

Summer School Papers

Industry Papers

Visual Design for Interactive Media

Computer Graphic Design 1

Computer Graphic Design 2

Studies in Visual Communication

Computer Systems

Computer Communications

Programming with Data Structures

Object-Oriented Program Design

Database Practice and Experience

Introduction to 3D Modelling and Animation

Information Discovery

Visual Design for Interactive Media

Internet Applications

Logic and Computation

Software Engineering Development

Software Engineering Process

Programming Usable Systems

Interactive Computing

Electronics for Digital Systems

2014 Papers
Level 2 Papers >> All Papers
COMP235B Logic and Computation

20 Points

This paper introduces computer science and mathematics students to the formal theory of computation, as well as some important ideas in discrete mathematics of relevance to computer science and IT.

In the discrete mathematics half of the paper, a formal approach to logic is introduced: the basic connectives, well-formed formulas, truth tables, laws of equivalence, testing validity of logical arguments, plus an introduction to predicates and quantifiers. Also covered are modular arithmetic and its applications (to coding and cryptography for example) as well as an introduction to binary relations and directed graphs (connectivity and Warshall’s algorithm).

The other half of the paper deals with the theory of computation. Topics include: finite state automata and regular languages, Kleene’s theorem, Turing machines and the Halting problem, formal grammars and the Chomsky hierarchy. There is laboratory work in which students design Turing Machines.

Learning Outcomes
Students who pass this paper will understand the differences between data types such as sets, functions, relations, graphs and trees. They will be able to explain several common graph and tree algorithms. They will be able to manipulate propositional logic formulae and explain the limitations of computation systems such as finite state automata and Turing machines.

Pre Requisite Papers
MATH102 Introduction to Algebra

Restricted Papers
MATH258 Introduction to Discrete Mathematics

Lecturers and Tutors

B Semester

Moodle Link


Three to four lectures per week, a weekly tutorial and up to five hours in total of supervised laboratory work.

Official Timetable Information

Assessment Ratio
Internal assessment/final examination ratio 1:1

Other Information
This paper is compulsory for a major in Computer Science, except for the Applied Computing specialisation.

Academic Integrity
Follow this link for Academic Integrity information.

Performance Impairment
Follow this link for information on Performance Impairment.

Student Concerns and Complaints
Follow this link for Student Concerns and Complaints information.

Application for Extension
Follow this link for information on applying for an Extension.

Review of Grade
Follow this link for information on applying for a Review of Grade.

University Regulations
Your attention is drawn to the following regulations and policies, which are published in the University Calendar:

  © 2007 FCMS. The University of Waikato - Te Whare Wananga o Waikato