Academic Handbook BSc (Hons) Applied Digital and Technology Solutions (online)
NCHNAL471 Mathematical Structures and Methods Course Descriptor
Last modified on January 25th, 2023 at 2:35 pm
Course Title | Mathematical Structures and Methods | Faculty | EDGE Innovation Unit (London) |
Course code | NCHNAL471 | Teaching Period | This course will typically be delivered over a 6-week period. |
Credit points | 15 | Date approved | March 2021 |
FHEQ level | 4 | ||
Compulsory/ Optional |
Compulsory | ||
Prerequisites | None | ||
Co-requisites | None |
Course Summary
This course introduces mathematical structures and methods that form the foundation of
computer science. Students will study structures such as sets, tuples, sequences, lists,
trees, and graphs. Functions, relations, ordering, and equivalence relations and inductive
and recursive definitions of structures and functions will be explored. The course covers
principles of proof such as truth tables, inductive proof, basic logic, counting techniques and
arguments needed to estimate the size of sets, the growth of functions, and the space-time
complexity of algorithms.
Course Aims
- Train students in the mathematical foundations of computer science.
- Train students in mathematical terminology and core techniques.
- Give students the tools to solve basic mathematical problems.
- Give students the underpinning mathematical knowledge and tools required for programming and computer science.
Learning Outcomes
On successful completion of the course, learners will be able to:
Knowledge and Understanding
K1a | Demonstrate an understanding of the basic body of knowledge associated with mathematical structures, functions and manipulations. |
K2a | Understand the basics of counting, such as the pigeonhole principle, permutations, and combinations. |
K3a | Understand the meaning of an algorithm and the ability to analyse an algorithm to determine its computational complexity. |
Subject Specific Skills
S1a | Apply mathematical logic for solving a range of data-driven problemss. |
S2a | Apply the inclusion-exclusion principle for common counting problems. |
S3a | Develop recurrence relations for divide-and-conquer algorithms and to determine their complexity. |
Transferable and Professional Skills
T1a | Understand logical arguments, identifying the assumptions made and the conclusions drawn. |
T2a | Solve problems relating to qualitative and quantitative information. |
T3ai | Demonstrate skill in numeracy and computation. |
T3aii | Display a developing technical proficiency in written English and an ability to communicate clearly and accurately in structured and coherent pieces of writing. |
Teaching and Learning
This is an e-learning course, taught throughout the year.
This course can be offered as a standalone short course.
Teaching and learning strategies for this course will include:
- On-line learning
- On-line discussion groups
- On-line assessment
Course information and supplementary materials will be available on the University’s Virtual Learning Environment (VLE).
Learners are required to attend and participate in all the formal and timetabled sessions for this course. Learners are also expected to manage their self-directed learning and independent study in support of the course.
The course learning and teaching hours will be structured as follows:
● Learning and teaching (6 days x 8 hours) = 48 hours
● Independent study = 102 hours
Indicative total learning hours for this course: 150 hours
Assignments (see below) will be completed as part of private study.
Assessment
Formative
Students will be formatively assessed during the course by means of set assignments. These will not count towards the final degree but will provide learners with developmental feedback.
Summative
Assessment will be in two forms:
AE | Assessment Type | Weighting | Online submission | Duration | Length |
1 | Online computer-based Examination |
40% | Yes | 1 hour | – |
2 | Set Mathematical Exercises |
60% | Yes | Requiring on average 20-30 hours to complete |
– |
Feedback
Students will receive formal feedback in a variety of ways: written (via email or VLE correspondence) and indirectly through online discussion groups. Students will also attend a formal meeting with their Academic Mentor (and for apprentices, including their Line Manager). These bi- or tri-partite reviews will monitor and evaluate the student’s progress.
Feedback is provided on summatively assessed assignments and through generic internal examiners’ reports, both of which are posted on the VLE.
Indicative Reading
Note: Comprehensive and current reading lists for courses are produced annually in the Course Syllabus or other documentation provided to learners; the indicative reading list provided below is used as part of the approval/modification process only.
Books
- Rosen, K. H., (2012), Discrete Mathematics and Its Applications, Content Technologies
- Rosen, K. H., (2011), Student’s Solution Guide to accompany Discrete Mathematics and Its Applications, Mcgraw Hill Higher Education
- Lewis, H. R., (2019), Essential discrete mathematics for computer science, Princeton: Princeton University Press
Journals
Students are encouraged to read material from relevant journals on Mathematical Structures and Methods as directed by their course trainer.
Electronic Resources
Students are encouraged to consult relevant websites on Mathematical Structures and Methods.
Indicative Topics
- Propositional Logic and Truth Tables
- Binary Numbers
- Sets and Set Operations
- Counting and Combinatorics
Title: NCHNAL471 Mathematical Structures and Methods Course Descriptor
Approved by: Academic Board Location: Academic Handbook/Programme specifications and Handbooks/ |
|||||
Version number | Date approved | Date published | Owner | Proposed next review date | Modification (As per AQF4) & category number |
3.0 | December 2022 | December 2022 | Dr Yu- Chun Pan | June 2026 | Category 3: Change to Teaching and Learning Strategy; Change to English Proficiency Learning Outcome
Category 1: Corrections/clarifications to documents which do not change approved content or learning outcomes |
2.1 | July 2022 | August 2022 | Scott Wildman | June 2026 | Category 1: Corrections/clarifications to documents which do not change approved content or learning outcomes |
2.0 | January 2022 | April 2022 | Scott Wildman | June 2026 | Category 3: Changes to Learning Outcomes |
1.0 | March 2021 | March 2021 | Scott Wildman | March 2026 |