We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Faculty Handbook Archive

# Archive Module Description

## Department: Computer Science

### COMP1021: MATHEMATICS FOR COMPUTER SCIENCE

Type Level Credits Availability Module Cap Open 1 20 Available in 2016/17 Durham

#### Corequisites

• Introduction to Programming OR Computational Thinking

#### Excluded Combination of Modules

• Mathematics for Computer Science, Discrete Mathematics MATH 1031

#### Aims

• To introduce students to fundamental concepts from logic, discrete structures and mathematics that are necessary for and relevant to modern Computer Science.
• To introduce students to the application of logic, discrete structures and mathematics to topics within mainstream Computer Science.

#### Content

• Propositional and predicate logic.
• Sets, functions and relations.
• The notion and methods of mathematical proof.
• Boolean algebra.
• Combinatorics and probability theory.
• Graphs.
• Matrix and linear algebra.
• Number theory.

#### Learning Outcomes

Subject-specific Knowledge:
• On completion of the module, students will be able to demonstrate:
• an understanding of the fundamental notions from logic, discrete structures and mathematics and their relevance to mainstream Computer Science
• an understanding of the concept of a mathematical proof
• an understanding of mathematical notation.
Subject-specific Skills:
• On completion of the module, students will be able to demonstrate:
• an ability to apply methods and techniques from logic, discrete structures and mathematics
• an ability to reason with and and apply methods of mathematical proof
• an ability to use mathematical notation.
Key Skills:
• On completion of the module, students will be able to demonstrate:
• an ability to apply logical reasoning to practical scenarios
• an ability to formalise general arguments.

#### Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

• Lectures enable the students to learn new material relevant to logic, discrete structures and mathematics, as well as their applications.
• Practical classes enable the students to put into practice learning from lectures and strengthen their understanding through application.
• Formative and summative assessments assess the application of methods and techniques, and examinations in addition assess an understanding of core concepts.

#### Teaching Methods and Learning Hours

 Activity Number Frequency Duration Total/Hours lectures 44 2 per week 1 hour 44 practical classes 22 1 per week 2 hours 44 ■ preparation and reading 112 total 200

#### Summative Assessment

Component: Examination Component Weighting: 66%
Element Length / duration Element Weighting Resit Opportunity
Examination 2 hours 100% Yes
Component: Coursework Component Weighting: 34%
Element Length / duration Element Weighting Resit Opportunity
Practical work 100% Yes

#### Formative Assessment:

Example formative exercises are given during the course. Additional revision lectures may be arranged in the module's lecture slots in the 3rd term.

Attendance at all activities marked with this symbol will be monitored. Students who fail to attend these activities, or to complete the summative or formative assessment specified above, will be subject to the procedures defined in the University's General Regulation V, and may be required to leave the University