BMTS413 - IfE

BMTS413
Counting Techniques

MQF Level: 6

ECTS Value: 3 ECTS

Self-Study Hours: 36

Duration: 6 Sessions

Contact Hours: 15

Mode of Delivery: Blended

Assessment Hours: 24

Entry Requirements

Applicants applying for the module are to be in possession of the following:

1 An MQF Level 3 (minimum Grade 5 or C) in Maltese, English Language and Mathematics awarded by MATSEC or an equivalent examination body recognised by the IfE

AND

A minimum of one of the following:

a) An awarded MATSEC Certificate or equivalent (MQF Level 4) with a Grade C or better in Mathematics at Advanced Level; OR

b) Three subjects at advanced level (MQF Level 4) including a Grade C or better in Mathematics and another subject, and at least a Grade D in a third subject; OR

c) Two subjects at Advanced Level (MQF Level 4) at Grade C or better including Mathematics, and three intermediate subjects with a minimum Grade D.

Overall Objectives and Outcomes

This module revisits the fundamental principles and methods used to solve counting problems in mathematics, including the key concepts of permutations and combinations. Throughout the module, course participants will distinguish between combinations and permutations and apply the appropriate tools to solve a wide range of problems, ranging from arranging objects in a linear or a circular arrangement, to selecting groups from larger sets, with or without repetitions. These skills are essential for understanding more complex topics in mathematics, computer science, and probability.

This module is ideal for course participants with a basic understanding of algebra and an interest in mathematical problem-solving and is aimed at enhancing their understanding in preparing them to design appropriate activities, lessons and assessments in this topic at post-secondary education levels.

By the end of this module, the learner will be able to:

Competences

support others in learning and applying the meaning and practical uses of different counting techniques;
create lesson plans and/or resource packs for teaching this topic;
design relevant assessment tasks to supervise students’ understanding of this topic.

Knowledge

a. State the fundamental principle of counting;

b. Define the factorial notation and evaluate for different values of ;

c. Define a permutation as an ordered arrangement of a number of items;

d. Recall .

e. Define a combination as an unordered selection of a number of items from a given set;

f. Derive .

g. Distinguish between permutations and combinations when presented with counting problems to solve.

Skills

Apply their knowledge about permutations in linear and circular ordered arrangements and use to solve related counting problems;
Apply their knowledge about combinations as an unordered selection of a number of items and use to solve related counting problems;
Derive and explain the relationship between combinations and permutations as ;
Solve simple probability problems involving permutations and combinations.

Assessment Methods

This module will be assessed through: Assessment Tasks, Lesson Plan.