APIIT SU Degree: SOW Format

Module Title: Mathematics And Algorithmics Module Code: CE62021-2

Module Leader: Mr. Saw Date Appointed: 22-08-2006
Delivery Pattern: (15 Credits) Lectures: 2 times 1.5 hours per week Other Sessions: 1 times 1.5 hours per week
Assessment requirements: Exam 50 Coursework: 50 % Comprising of 2 tests

Original date: Originator: Approved By: Date: To be Implemented By:
Amendment 1:
2:
3:
4:
5:
Made By: Mr. Saw
Mapping of Summative Assessment and Learning Outcomes
Module Learning Outcomes
(LOs)
1. Demonstrate an understanding of
algorithmic paradigms and
mathematical and statistical
concepts.
2. Express practical problems in the
appropriate mathematical or
statistical notation.
3. Compare different algorithmic
approaches for efficiency
problem solving.
4. Apply mathematical and
statistical concepts in different
domains of computing, create
algorithms to solve computing
problems.




How assessed?

Application of mathematical
concept, techniques and
problem solving in the class
exercise, tutorials and class test
to show the level of
knowledge and understanding a
student has attained.
Final exam that is used to
determine the extent to which
the students have achieved the
objectives of the course.


The relationship Between
Programme and Module Los

Programme:
BSc in Computing
BSc in Computing with a
specialism in Software
Engineering
BSc in Computing with a
specialism in Mobile Computing
BSc in Computing with a
specialism in Multimedia
Technology
BSc in Computing with a
specialism in Web Development
BSc in Computing with a
specialism in Artificial
Intelligence


Learning and Employability
Skills
1. Analysis
2. Application
3. Enquiry
4. Knowledge &
Understanding
5. Learning
6. Problem solving












To have a critical understanding
of algorithms and their role in
underpinning the engineering of
complex and large-scale
software systems. (MLOs 1)
To be able to critically evaluate
and apply design paradigms,
languages, techniques and tools
in the development of complex
or large-scale software system.
(MLOs 2, 3)
To have a critical skill of
numeracy in both
understanding and presenting
cases involving a quantitative
dimension. (MLOs 2, 4)





Exam Paper Structure
This paper consists of seven questions. The candidates MUST attempt Question 1 together with FIVE from the remaining SIX questions.
Students may use their own calculators and they are permitted to refer to one A4 sheet (two sides) of self prepared notes

Coursework Handout Date: Hand in Date: Feedback return date:
Class test 1 Week 8 Week 9
Class test 2 Week 15 Week 16

Class Information
Class and Code: Lecturer:
Commencement Date: Finish Date:


Module Overview This module will extend your knowledge and skills in applying mathematics and statistics to a wide range of computing
based applications. Algorithms are vital to computing, so you will also study different algorithmic approaches to problem
solving.

Prior Learning Prior study Mathematics and Statistics for computing students, or equivalent.


Resources Reading Texts:
J. Truss Discrete Mathematics for Computer Students (1998) Addison Wesley ISBN: 0201360616
D. Brunskill, J. Turner Understanding Algorithms and Data Structures (1996) McGraw-Hill Education, ISBN:
0077091418






Language for Learning Algorithmics
Argand diagrams
Bayes theorem
Big O notation
Chain, product and quotient rules
Differentiation
Complex number
Complexity classes
Conditional probability
Divide and Conquer
Greedy Algorithms
Modulus
Normal distribution
Polar representation
Principal argument
Probability
Scalar product
Time and Storage complexity
Vectors


Learning Strategies
Week No Weekly Learning Outcomes Learning & Employability Skills Developed
I=Introduced D= Developed A=Assessed
Teaching & Learning Strategy
Lists Learning Outcomes for
the topics and their links to
the Programme Learning
Outcomes
List which learning and employability skills are
introduced and/or developed and/or assessed
Indicates how the students would learn e.g. through
syndicate work, brainstorming, note taking, annotating
handouts, case studies, solving problems and attempting
test questions.
Teaching strategies employed in this module are as
below:
*Thinking skills movement which requires students to
be active participants in the learning process.
*Lecture information/facts is communicated to the
students.
*case methods providing an opportunity for students to
apply what they learn in the classroom to real-life
experiences
*Tutorials exercises will be given where students will be
able to reflect on what they learn.
So the learning strategies will be
*active learning where students will participate in the
discussion , listen to lectures and reflect through
problem solving exercises, case studies.
This is carried out as shown in the lesson plan below:
Wk 1 - 3 Create awareness and interest
in the module
Discuss on the relationship
between program and module
learning outcomes


Knowledge & Understanding skills -I

Brainstorming on the importance of the subject matter to the
students
Awareness on the assessment methods & the breakdown of
marks

Students will be able to define
and use the three laws of
probability.
Define and use Bayes
Theorem.
Students will be able to build
models using the binomial,

Knowledge & understanding skills I, D
Application I, D
Enquiry I, D
Analysis I, D
Problem solving skills I, D

Discussion on the conditional probability and introduce
Bayes Theorem.
Solving problems involving the normal distributions.
Take note of the examples given by the lecturer.
Asking questions and solving problems in class.
Practice doing related exercises during the tutorial class.
Poisson and normal
distributions


Wk 4 6
Students will be able to
perform simple arithmetic on
Complex numbers and
illustrate the results
geometrically

Knowledge & understanding skills I, D
Application I, D
Enquiry I, D
Problem solving skills I, D


Discussion on the complex numbers.
Listening to explanation
Taking note of examples given by lecturer
Practice doing related exercises during the tutorial class.
Asking questions and solving problems in class.





Wk 7 8 Students will be able to
evaluate the magnitude,
addition and subtraction of 2D
and 3D vectors. The scalar
product and vector product
will be introduced
Students will be able to use
partial differentiation to
calculate the tangent vector
for parametric equations and
use matrices to transform
simple geometric objects or
equations.

TEST 1
A 2 hrs test is prepared and
covers topics: Probability
Distribution, Complex Numbers
and Vector Geometry.



Knowledge & understanding skills I, D
Application I, D
Enquiry I, D
Analysis I, D
Problem solving skills I, D










Knowledge & Understanding
Problem solving skills

Discussion on the qualitative methods used in forecasting.
Listening to explanation
Observing lecturer solving related problems
Asking questions
Practice doing related exercises during the tutorial class










Correction on the mistakes made

Wk 9 11
Students will be able to
differentiate exponential and

Knowledge & understanding skills I, D

Discussion on how to use the product, quotients and chain
trigonometric functions.
Use the product, quotients and
chain rules to differentiate
expressions.


Application I, D
Problem solving skills I, D




rules to differentiate .
Discussion on how to differentiate exponential and
trigonometric functions.
Listening to lecturers explanation
Observing lecturer solving the related problems
Practice solving related problems during the tutorial class
Asking questions & solving problems








Wk 12 15
Students will be able to define
and use the big O notation for
Algorithm complexity.
Students will be able to
describe and use the 'Divide
and Conquer' and the
'Dynamic Programming'
programming paradigm


TEST 2
A 2 hrs test is prepared and
covers topics: Calculus and
Algorithms


Analysis skills I, D
Enquiry I, D
Problem solving I, D
Communication I, D
IT skills I, D






Knowledge & Understanding
Problem solving skills

Discussion on the big O notation and how to use it to
determine the algorithm complexity
Learn how to use the 'Divide and Conquer' and the 'Dynamic
Programming' programming paradigm
Asking questions and solving problems in class.
Listening to lecturers explanation
Practice doing related exercises during the tutorial class.





Correction on the mistakes made

Wk 16
Students will be well-
prepared for the final exam
and sit with confidence

Analysis skills - A
Application A
Problem solving skills A
Communication skills - A

Work on the revision exercises and seek help from the
lecturer or tutor to ensure that full understanding of the
subject has attained.


Learning Topics and Activities

Week No Topics to be Covered
Lists main topics/sub topics.
In Class learning Activities Independent Learning Activities Link to other
Modules
Lectures Labs/tutorials/
Other
Activities designed to
consolidate students learning
and supervised by the lecturer.
These may be individual or in
syndicates and carried out at
UCTI (labs, syndicate rooms
etc.)
Includes assessment e.g. case
study, test, report and
presentations.
Activities designed to consolidate
students learning not directly
supervised by the lecturer. These may be
individual or in syndicates and carried
out at UCTI (labs, syndicate rooms etc.)
or at home.
Lists the link between
topics and other
modules.
Wk 1 3 Introduction
Course
Overview,
Requirements &
Grading
Probability
Distribution
Discrete
probability
Probability
theory
Bayes Theorem
Normal
Distribution









Tutorial

Discussion led by the lecturer




Discussion led by the lecturer
on define and use the three laws
of probability
Discussion on define and use
Bayes Theorem
Discussion on the normal
distribution.






Read up all the relevant material in the
reference text prescribed to clarify any
doubts and to make own notes.


Other modules related to
mathematics and
algorithmics.

Wk 4 6
Complex Numbers
Introduction to
complex
numbers
Manipulation of
complex

Tutorial


Demonstrate by examples on
how to add, subtract, multiply
and divide complex numbers
in rectangular form
Demonstrate by examples on

Complete all the exercises and check
with the lecturer during the tutorial
class.
Read up all the relevant material in the
reference text prescribed to clarify any

numbers
Illustration of
complex
numbers:
Cartesian
form: notation
& Argand
diagram
Polar form.
how to calculate the modulus
and argument of a complex
number.
Demonstrate by examples on
how to convert between the
rectangular, polar and
exponential forms of complex
numbers
Class exercises during tutorial
and lab session to let the
students practice and apply
their learning.


doubts and to make own notes.





Wk 7 8

Vector Geometry
Vector.
Scalar Product
Vector Product
Parametric
equations.
Tangent Vector







Test 1

Tutorial

Demonstrate by examples on
how to find the magnitude of
2D and 3D vectors, and apply
this to finding unit vectors.
Demonstrate by examples on
how to define the scalar
product and vector product of
two vectors.
Demonstrate by examples on
how to apply differentiation
to finding velocities and
accelerations on curves given
in parametric coordinate form

Test 1 discussion





Read up the relevant material in the
reference text recommended so as to
participate in the class discussion.
Complete all the exercises and check
with the lecturer during the tutorial class.




Wk 9 11
Differentiation
Calculus
Revision of basic
differentiation
rules
Derivatives of
trigonometric
functions
Derivative of sine
Derivative of
cosine
Derivative of
other
trigonometric
functions
Derivatives of
logarithmic
functions

Tutorial

Demonstrate by examples on
how to use the product,
quotients and chain rules to
differentiate expressions.
Demonstrate by examples on
how to differentiate constants,
powers, sines, cosines,
exponential and logarithmic
functions.
Take note of the examples
given by lecturers.




Read up the relevant material in the
reference text recommended so as to
participate in the class discussion
Complete all the exercises and check
with the lecturer during the tutorial class.











Wk 12 15

Algorithms

Time and Storage
complexity
Big O notation
Complexity
classes
Divide and
Conquer
Greedy
Algorithms
Dynamic
Programming




Tutorial



Discussion led by the lecturer
on define and use the big O
notation for Algorithm
complexity
Discussion led by the lecturer
on describe space and time
complexities
Demonstrate how to use
pseudo code to specify
algorithms.
Demonstrate how to describe
and use the 'Divide and
Conquer' programming
paradigm
Demonstrate how to describe
and use the 'Dynamic
Programming' programming


Read up the relevant material in the
reference text recommended so as to
participate in the class discussion.
Complete the class exercise and check
the answer with the lecturer during the
tutorial





Modules related to
algorithms (e.g.
DSA)

paradigm.


Wk 16

Revision

Work on the revision exercises
and seek help from the lecturer
or tutor to ensure that full
understanding of the subject has
attained.

Complete all the exercises and read up
all the relevant material in the subject
manual and prepare for the final
examination