Prerequisite Modules
Description
This module presents theoretical
aspects of computer science which are necessary to support and enhance
other modules on the course. In particular the topics covered on this
module will be required in computer technology, database, software
engineering, programming, and algorithms.
Aims
The aim of this module is to provide
the student with the theoretical foundations for other modules on the
programme.
Learning Outcomes
Knowledge and Understanding
On successful completion the
graduate will be able to:
-
demonstrate a knowledge of number
systems, Boolean algebra, sets, logic, relations and functions
-
identify foundational issues when
they are encountered in other course modules
-
apply fundamental theory to other
course modules.
Skills and Know-How
On successful completion the
graduate will be able to:
-
use the module topics to solve
computing problems
-
use module software and related
tools
Competence
On successful completion the
graduate will be able to:
-
use module topics on a variety of
problems
-
use appropriate software to solve
problems
Learning and Teaching Methods
Lectures, self-study, labs,
tutorials, and any combination of discussion, case study,
problem-solving exercises, readings, seminars, and computer-based
learning.
Content
Logic:
Propositional calculus, truth tables, logical equivalence, logical
argument, predicate calculus, simple proofs.
Set Theory:
Algebra of sets, power sets, cardinality, Venn diagrams, programming
using sets.
Relations:
Types, representations, equivalence, partial order, relational
database theory.
Functions:
The graph of a function, properties, composition, functions in
programming languages.
Boolean Algebra:
Basic laws, simplification of expressions, application to switching
circuits.
Number Systems:
Binary, octal, decimal, hexadecimal, simple binary arithmetic.
Supporting software:
The above topics will be supported by software tools including
functional and logic based languages.
Assessment
The methods of assessment to be used
to measure the learning objectives stated above are written
examination and continuous assessment including one or more of
assignment, essay, problem-solving exercise, oral presentation, and
class or lab tests.
-
Continuous Assessment: 30%
-
Examination: 70%
Recommended
Reading
-
Seymour Lipschutz,
Essential Computer Mathematics, Schaum's Outline series, 1987, ISBN
0-07-0379990-4.
-
Winfred Karl Grassmann and
Jean-Paul Tremblay , 1996, Logic and Discrete Mathematics; A
Computer Science Perspective, Prentice Hall 1996, ISBN:
0-13-501206-6.
-
Seymour Lipschutz and Marc
Lars Lipson, 1997, Discrete Mathematics, Schaum's Outline series,
ISBN 0-07-038045-7.
|
|
For more information contact
Ciarán O'Leary
|
Home