Course Title: Mathematics for Computing 1

Part A: Course Overview

Course Title: Mathematics for Computing 1

Credit Points: 12.00


Course Coordinator: Sebastian Sardina

Course Coordinator Phone: +61 3 9925 9824

Course Coordinator Email: sebastian.sardina@rmit.edu.au

Course Coordinator Location: 014.08.07D

Course Coordinator Availability: by appointment


Pre-requisite Courses and Assumed Knowledge and Capabilities

None


Course Description

Mathematics for Computing 1 provides a foundation for Computer Science. Many other areas of Computer Science require the ability to work with concepts from discrete structures. Discrete structures include topics such as set theory, logic, and graph theory. The material in discrete structures is pervasive in the areas of data structures and algorithms but appears elsewhere in Computer Science as well.


Objectives/Learning Outcomes/Capability Development

Program Learning Outcomes (PLOs): 

  

This course contributes to the following Program Learning Outcomes for BP09421 Bachelor of Computer Science (Studios), BP096P21 Bachelor of Software Engineering (Studios) and BP215P21 Bachelor of Information Technology (Games and Graphics Programming) (Studios): 

 

PLO1. Enabling Knowledge 

You will gain skills as you apply knowledge effectively in diverse contexts. 

 

PLO3. Problem Solving 

Your capability to analyse problems and synthesise suitable solutions will be extended as you learn to: 

- Design and implement software solutions that accommodate specified requirements and constraints, based on analysis or modelling or requirements specification. 


Course Learning Outcomes (CLOs):

Upon successful completion of this course you should be able to:

CLO 1: Apply formal logic proofs and/or informal, but rigorous, logical reasoning to real problems, such as predicting the behaviour of software or solving problems such as puzzles.

CLO 2: Demonstrate comprehension of discrete structures and their relevance within the context of computer science, in the areas of data structures and algorithms, in particular.

CLO 3: Apply discrete structures into other computing problems such as formal specification, verification, databases, artificial intelligence, and cryptography.

CLO 4: Demonstrate mathematical skills, analytical and critical thinking abilities.

CLO 5: Communicate clearly and effectively using the technical language of the field correctly.


Overview of Learning Activities

Instructor Guided Hours (face to face): 48 per offering

The content will be presented in a blended mode, with online material supplemented with instructor guided activities and consultation sessions. This will take place over a period of 8 to 10 weeks.

Learner Directed Hours: 72 per offering

Learner-directed hours include time spent reading and studying online materials; working through examples; and performing exercises and assignments designed by the instructors to reinforce concepts and develop practical skills across a variety of problem types.


Overview of Learning Resources

You will make extensive use of computer laboratories and relevant software provided by the School. You will be able to access course information and learning materials through MyRMIT and may be provided with copies of additional materials in class or via email. Lists of relevant reference texts, resources in the library and freely accessible Internet sites will be provided.


Overview of Assessment

This course has no hurdle requirements.

Assessment tasks

Assessment Task 1: Workshop preparation activities. Weighting 20%

This assessment task supports CLOs 1, 2, 3, 4

Assessment Task 2: Take-home exercises. Weighting 30%

This assessment task supports CLOs 1 - 5

Assessment Task 3: Final take-home exercise. Weighting 50%

This assessment task supports CLOs 1 - 5