1 Semester

48 Hours

Hawthorn, Sarawak

Nil

Nil

Credit Points: 12.5 Credit Points

Related Course/s:

A unit of study in the Bachelor of Computing, Bachelor of Science (Professional Software Development) and Bachelor of Science (Computer Science and Software Engineering)

Aims & Objectives:

Students who successfully complete this unit will be able to describe the role of the following topics in relation to computer science with appropriate application examples.

1.     Representation of information in digital form – especially representation of numbers
2.     The fundamental ways in which computation can be performed using electronic devices
3.     The use of Boolean logic and algebra for computation
4.     The use of (mathematical) sets to represent collections of data items
5.     The use of sets and logic to specify computer programs
6.     Algorithms: characteristics and limitations
7.     Efficiency of computation, including trade-offs between calculation and storing information, and between speed and storage
             requirements
8.      The application of discrete mathematical structures – especially graphs – in computation
9.      Some of the roles of probability and statistics in computer science and software engineering

Teaching Methods:

Lectures (24 hrs), Tutorials (24 hrs)

Assessment:

Assignments, Tests, Examination

Generic Skills Outcomes:

The graduate attributes which relate to this unit of study help to produce graduates who:

• Are capable in their chosen professional, vocational or study areas.
• Are adaptable and manage change.
• Operate effectively and ethically in work and community situations.

Content:

• Data representation
• Boolean logic and Boolean algebra
• Propositional and predicate logic
• Set theory
• Computability and Complexity
• Probability and Statistics
• Graph theory
  
• Problem solving
  

Reading Materials:

Predko, M, Programming and Customizing PICmicro MCU microcontrollers, McGraw-Hill, 2002.
Hamacher, C, Vranesic, Z & Zaky, S, Computer Organization, 5th edn, McGraw-Hill, 2002.
Discrete Mathematics for Computing, Rod Haggarty, Addison Wesley 2002 [ISBN:0-201-73047-2]