Module Handbook 2

MODULE
HANDBOOK
UNDERGRADUATE PROGRAMME IN MATHEMATICS
Faculty of Mathematics and Natural Sciences

Universitas Indonesia
2022
UNIVERSITAS INDONESIA
Department of Mathematics
Building D, Kampus UI Depok 16424, Telp: 021 - 7863439,
Email: sekretariat.math@sci.ui.ac.id, website: https://www.math.ui.ac.id/
MODULE HANDBOOK
Module designation Introduction to Data Science
Semester(s) in which the 1

module is taught
Person responsible for the Sarini Abdullah

module
Language Indonesian
Relation to curriculum Compulsory

The module is shared with all of undergraduate study programs
in FMIPA UI.
Teaching methods Flipped Class and Problem based learning using E-learning
Workload (incl. contact (Estimated) Total workload: 2 × 170 minutes per-week, for 16
hours, self-study hours) weeks
Lecture time: Friday, 13.00-14.40 pm (100 minutes)
Laboratory session: 60 minutes per 2- week
Private study (weekly average):
• 120 minutes asynchronously before the lecture time
• 90 minutes for reflection and evaluation after the lecture time.
Credit points 2 SKS (3.18 ECTS)
Required and recommended No pre-requisites

prerequisites for joining the
module
1
Module objectives/intended After completing the course, students are expected to have the
learning outcomes following capabilities:
In terms of knowledge:
• Able to identify and explain variety of data types and
their relation to the option of methods of data analysis.
• Aware of- and can explain the ethics in data gathering.
• Explain the concept of probability (data distribution) for
discrete and continuous data.
• Explain the concept of sampling distribution
• Able to explain the concept of big-data and data science,
and their relationship (or the role of statistics) in those
fields
In terms of skills:
• Able to extract insight from transactional data and
provide the interpretation in relation to the problem
represented by the data.
• Able to perform data pre-processing and simple
visualization.
• Able to perform data processing using R/Python (or other
open-source packages) for simple data: correlation,
regression, clustering, hypothesis testing (1 sample, 𝐾 ≥
2 samples, proportion, variance test)
In terms of competence:
• Able to identify and explain problems in the real-life
application that can be solved using basic statistical
methods, data science, and/or big-data technologies
• Able to use the open-source packages (R and/or Python)
for data analysis.
Content 1. Introduction to big data and data science: history and

properties of big data and data science, data profession
and competencies, variety, types and formats of data,
types of learning algorithms, technology in/for data
science and big data; challenge, trend and opportunity in
data science and big data.
2. Probability and data distributions (discrete and
continuous)
3. Hypothesis testing: 1 sample, 𝐾 ≥ 2 samples, proportion,
variance
4. Correlation, simple linear regression, K-means
clustering.
Examination forms Post-tests : multiple-choice questions, Mid- and final-exams :

multiple choice and essay, laboratory activities : data processing.
2
Study and examination The marking is based on the following components:
requirements 1. Post-tests: 15%
2. Group assignment & lab sessions: 30%
3. Mid-term exam: 25%
4. Final exam: 30%
To successfully pass the module it requires minimum 55% of the
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Baesens, B. (2014). Analytics in a big data world: The

essential guide to data science and its applications. John
Wiley & Sons. (general introduction to data science and big
data)
2. Cielen, D., Meysman, A., & Ali, M. (2016). Introducing
data science: big data, machine learning, and more, using
Python tools. Manning Publications Co. (good technical
reference to big data related problems)
3. Berman, J. J. (2018). Principles and Practice of Big Data:
Preparing, Sharing, and Analyzing Complex Information.
Academic Press.
4. Ratner, B. (2017). Statistical and Machine-Learning Data
Mining: Techniques for Better Predictive Modeling and
Analysis of Big Data. Chapman and Hall/CRC.
5. Furht, B., & Villanustre, F. (2016). Big data technologies
and applications. Berlin, Germany: Springer.
6. Walpole, R. E., Myers, R. H., Myers, S. L., & Ye, K.
(1993). Probability and statistics for engineers and
scientists (Vol. 5). New York: Macmillan.
7. Freeman, L., & Peace, A. G. (Eds.). (2005). Information
ethics: privacy and intellectual property. IGI Global.
3
MODULE HANDBOOK
Module designation Logic and Set

module is taught
Person responsible for the Kiki A. Sugeng, Bevina D. Handari, Nora Hariadi, Dipo Aldila
module
Language Indonesia
Workload (incl. contact Total workload: 170 minutes

hours, self-study hours) Contact hours (please specify whether lecture, exercise, laboratory
session, etc.):
Private study including examination preparation, specified in
hours1:
Required and recommended Linear Algebra, Algorithm and Programming, Discrete

prerequisites for joining the Mathematics
module
Module objectives/intended After completing the course, students have the ability:
learning outcomes 1. to explain the concept of propositional logic.
2. to explain the properties of sets and their operations
3. to use the concept of predicate and quantifier
4. to use proof techniques
5. to use propositional logic and predicate logic in simple
mathematical proofs.
6. to test the truth of statements in simple math problems using
direct, indirect, and mathematical induction techniques.
1
When calculating contact time, each contact hour is counted as a full hour because the organisation
of the schedule, moving from room to room, and individual questions to lecturers after the class, all mean that
about 60 minutes should be counted.
1
Content 1. Propositional logic (valid statement, truth table)
2. Set, properties of set and operation on set
3. Predicate and quantifier
4. Predicate logic (inference rule)
5. Technique of proofing (direct and indirect proof, proof by
contradiction, mathematical induction)
Examination forms Essay, multiple choice
Study and examination The final mark will be weighted as follows:

requirements 1. Online Quiz (10%)
2. Homework (15%).
3. Written Quiz (10%)
4. Lab sessions (5%)
5. Mid-term examination (30%)
6. Final examinations (30%)
To succesfully pass the module it requires minimum 55% of the
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. K.H. Rosen, Discrete Mathematics and Its Application, 7th
ed, Mac Graw Hill, 2012
2. U. Daepp dan P. Gorkin, Reading, Writing and Proving,
Springer, 2003
3. E. Mandelson, Introduction to Mathematical Logic, 6th ed,
CRC Press, 2015
2
MODULE HANDBOOK
Module designation Calculus 1

module is taught
Person responsible for the Dr. Hengki Tasman

module
Language Indonesian

The module is shared with Statistics, Actuarial Science, and
Physics undergraduate study programs
Teaching methods lecture, lab works
Workload (incl. contact (Estimated) Total workload: 9 hours/week x 14 weeks + 5.5

hours, self-study hours) hours/week x 2 weeks = 137 hours.
Contact hours: 3 hours (150 minutes lectures).
hours1:
3 hours structured activities and 3 hours individual study per
week.
Required and recommended -

module
1
1
Module objectives/intended After completing the course, students have the ability
learning outcomes 1. To determine the solution set of inequalities involving
absolute value,
2. To determine domain, codomain, range and operation of some
one variable functions and the graphs,
3. To determine limit and continuity of one variable functions,
4. To determine derivate of one variable functions,
5. To determine the solution of problems involving the derivate
of one variable function,
6. To determine proper integral of one variable functions,
7. To determine integral involving the fundamental theorem of
Calculus and method of substitution,
8. To determine the solution of problems involving the integral
of one variable function,
9. To determine inverse function and its derivate,
10. To compute derivate and integral involving transcendental
functions,
11. To compute integral with advanced integration techniques.
Content 1. Real number, inequalities, absolute value, Cartesian

coordinate system, function and its graph, operation on
function, trigonometry function.
2. Intuition, definition, theorems of limit, trigonometry function
limit, limit on infinity, infinite limit, continuity function,
3. Definition and rule of derivate, derivate of trigonometry
function, chain rule, higher order derivate, implicit derivate,
related rate, basic concept of differential,
4. Maximum and minimum, monotonicity and concavity, local
extreme, extreme value on open interval, graphing one
variable function, mean value theorem for derivate,
antiderivative,
5. Intuition of integral, proper integral, Fundamental Theorem
of Calculus, method of substitution, Mean Value Theorem for
integral, symmetries,
6. Area, solid revolution volume,
7. Natural logarithm function, inverse function and its derivate,
natural exponential function, general exponential function,
general logarithm function, hyperbolic function and its
inverse,
8. Basic rules of integration, partial integration method,
trigonometry integral, rationalizing substitution, integral of
rational function with partial fraction.
2
Examination forms 1. Class activities : Quiz (written and computer-based),
homework.
2. Lab sessions
3. Mid-term examination
4. Final examination

2. Homework (15%).
6. Final examination (30%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. Varberg, Dale; Edwin J. Purcell; Steven E. Rigdon.

Calculus, 9th Edition, Prentice Hall Inc, 2007
2. Finney R. L., Weir M. D., Giordano F. R., Thomas’
Calculus, 10th ed., Addison- Wesley Publishing Company,
2001
3. Lecturer’s Handout
4. Videos
3
MODULE HANDBOOK
Module designation Elementary Linear Algebra

module is taught
Person responsible for the Dra. Siti Aminah, M.Kom.

module
Language Indonesian

The module is shared with Statistics and Actuarial Science
undergraduate study programs
Teaching methods Lecture, lab works

hours, self-study hours) hours/week x 2 weeks = 91.34 hours.
hours1:
week.

module
1
1
learning outcomes 1. To explain the basic concepts of system of linear equations
2. To calculate the solution of a system of linear equations using
the Gauss elimination method and the Gauss Jordan
elimination method
3. To explain the basic concept of matrix
4. To calculate the inverse matrix
5. To determine the standard matrix of a transformation
6. To apply the concept of a linear system to some simple
problems in several fields of science
7. To calculate determinants of matrices
8. To explain the vector space concept of 𝑅𝑛
9. To solve the 𝑅2 and 𝑅3 geometry problem
10. To determine eigenvalue and eigenvector of a matrix
Content 1. Introduction to System of Linear Equations

2. Gaussian Elimination and Gauss Jordan
3. Matrices and Matrix Operation
4. Algebraic Properties of Matrix
5. Elementary Matrices and a Method for Finding 𝐴−1
6. More on Linear Systems and Invertible Matrices
7. Diagonal, Triangular, and Symmetric Matrices
8. Matrix Transformations
9. Applications of Linear Systems
10. Determinants by Cofactor Expansion
11. Evaluating Determinants by Row Reduction
12. Properties of Determinants; Cramer’s Rule
13. Vectors in 2-Space, 3-Space, and n-Space
14. Norm, Dot Product, and Distance in 𝑅𝑛
15. Orthogonality
16. The Geometry of Linear Systems
17. Cross product
18. Eigenvalue and Eigenvector

homework.
2. Lab sessions
2
2. Homework (15%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Anton, Howard; Chris Rorres, Elementary Linear Algebra,

11thEd, Applications Version, John Wiley, 2014.
3. Videos
3
MODULE HANDBOOK
Module designation Algorithm and Programming

module is taught
Person responsible for the Gatot F. Hertono

module
Language Indonesian

The module is shared with the Statistics, Actuarial Science
Teaching methods Flipped learning and computer lab works

Contact hours: 150 minutes lectures.
Individual study including examination preparation, specified in
hours :
3 hours structured learning and 3 hours individual study per
week.
Credit points 3 SKS (4.77 ECTS), including lab works

module
Module objectives/intended After completing this course, students are expected to have the
learning outcomes basis for compiling algorithms properly and correctly. Students
are able to develop programs (through lab works) with conditional
and iterative logic flows. Using array data structures, as well as
subprograms and functions to solve scientific problems and
completion of numerical functions.
1
Content 1. Algorithm and Programming Concepts;
2. Algorithm Representation;
3. Data, Variables, Statements and Operations;
4. Logic Flow;
5. Array Data Structure;
6. Subprogram (procedure, function and recursive);
7. Algorithm Complexity.
Examination forms Essay
Study and examination Requirements for successfully passing the module:

requirements Individual assignment and lab works (30%), midterm exam
(35%), final exam (35%)
Reading list Compulsory:

[1] Kenneth H. Rosen, Discrete Mathematics and Its
Applications, 6th Ed, 2007, McGraw-Hill Inc.
[2] Peter Van Roy & Seif Haridi, Concepts, Techniques, and
Models of Computer Programming, 2004, MIT.
[3] Press.Gilles Brassard, Paul Bratley, Algorithmics: Theory &
Practice, 1988, Prentice Hall.
Optional:
[4] Harsh Bhasin, Algorithms: Design and Analysis, 2015,
Oxford.
2
Module designation Basic Biology
Semester(s) in which the 1st semester

module is taught
Person responsible for the Team teaching
module
Language Indonesia
Relation to curriculum Compulsory course of Undergraduate Program Biology
Teaching methods
Lecture, small group discussion; problem-based learning
Workload (incl. contact 1. Lectures: 3 x 50 minutes per week

hours, self-study hours) 2. Exercises and assignments: 3 x 50 = 150 minutes per
week
3. Independent study: 3 x 50 = 150 minutes per week
Credit points 3 credits poin ~….. ECTS

module
Module objectives/intended students are able to correlate biological principles with other
learning outcomes mathematical sciences (mathematics, chemistry, physics) and
demonstrate the behavior of working together in teams to solve
problems of biodiversity conservation and prospecting, especially
conservation and biodiversity in Indonesia in a simple way (C4) (A4)
Content Exploration of life, cell biology, genetics, evolution, diversity of living

things, animals, plants, ecological principles, biodiversity and
conservation, biotechnology
Examination forms ● Midterm examination

● Final Examination
● Group assignment
Study and examination
requirements
Reading list ● Sadava, D., D.M. Hillis, H.C. Heller & M.R. Berenbaum. 2011.
Life: The Science of Biology. 9th ed. Sinauer Association, Inc.
● Starr, C., R. Taggart, C. Evers & L. Starr. 2016. Biology: The
Unity and Diversity of Life. 14th ed.
MODULE HANDBOOK

module is taught
Person responsible for the Dr. Rahmi Rusin

module
Language Indonesian

The module is shared with Statistics, Actuarial Science, and
Physics undergraduate study programs

hours1:
week.
Required and recommended Calculus 1

module
1
1
learning outcomes 1. to solve indeterminate forms and improper integral problems
2. to solve the parametric representation of curves in the plane,
calculate the length of a plane curve and the area of a surface
of revolution.
3. to sketch the graph of a polar equation, calculate the
derivatives and the area problems in the polar coordinate
system.
4. to determine the domain, codomain, range of functions of two
or more variables, to do algebraic operations between them
and sketch their graphs.
5. to determine the limit and continuity of a functions of two
variables.
6. to evaluate the derivatives of functions ot two or more
variables.
7. to solve simple real problems related to derivatives of
functions of two or three variables.
8. To calculate the integrals of functions of two or three
variables.
9. To solve problems related to integral of functions of two or
three variables.
10. To determine the convergence of infinite sequences.
Content 1. Indeterminate forms and improper integrals.

2. Parametric representation of curves in the plane, the length of
a plane curve and the area of a surface of revolution.
3. Polar coordinate systems, graphs of polar equations, and
calculus in polar coordinate
4. Functions of two or more variables, partial derivatives, limit
and continuity, differentiability, directional derivatives and
gradient, the chain rule, and tangent planes and
approximations.
5. Maxima dan minima and the Lagrange multiplier method.
6. Double integrals over rectangles, iterated integrals, and
double integrals over nonrectangular regions.
7. Double integral in polar coordinates, applications of double
integrals, and surface area.
8. Triple integrals in cartesian coordinates, triple integrals in
cylindrical and spherical coordinates, and change of variables
in multiple integrals.
9. Infinite sequences.
2
homework.
2. Lab sessions

2. Homework (15%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. Varberg, Dale; Edwin J. Purcell; Steven E. Rigdon.

Calculus, 9th Edition, Prentice Hall Inc, 2007
2. Finney R. L., Weir M. D., Giordano F. R., Thomas’
Calculus, 10th ed., Addison- Wesley Publishing Company,
2001
3. Lecturer’s Handout (powerpoint)
4. Videos
3
MODULE HANDBOOK
Module designation Linear Algebra 1

module is taught
Person responsible for the Dr. Denny R. Silaban

module
Language Indonesia

Teaching methods Flipped Class and Question based learning using E-learning
Workload (incl. contact Total workload: 170 minutes/credit point

hours, self-study hours) Contact hours: 50 minutes synchronous and 120 minutes
asynchronous (independent study/reading, doing homework,
discussion with peers, computer practice)
Required and recommended Elementary Linear Algebra

module
1
Module objectives/intended After completing Elementary Linear Algebra courses, students
learning outcomes are
1. able to apply the basic theories of mathematical thinking in
Linear Algebra 1 (C4).
2. Able to identify the structure of vector space and subspace
(C4).
3. Able to discover the basis and dimension of vector space
(C4).
4. Able to correlate between linear system equations and
vector spaces and their properties (C4).
5. Able to determine matrix transformation (C3).
6. Able to relate between the invertibility matrix
transformation and transformation’s properties (C3).
7. Able to calculate eigen value and basis of eigen spaces of a
matrix (C3).
8. Able to identify the nature of inner product space (C3).
9. Able to compute orthonormal basis of a vector space using
Gram-Schmidt process (C3).
10. Able to compute orthogonal diagonalization of symmetric
matrices (C3).
11. Able to examine real quadratic function by using matrix
methods (C3).
12. Able to identify general linear transformation and it’s
properties (C4)
13. Able to use Linear Algebra software or toolkits (C3)
Content Real vector space, subspace, basis and dimension, change of basis,
row space, column space, null space, rank and nullity, linear
transformation and its properties, composition and inverse
transformation, matrix for general linear transformation, eigen
value and eigen vector, inner product space and orthogonality,
Gram-Schmidt process, ortogonal diagonalization, quadratic
form, similarity.
Examination forms Essay, multiple choice
2
Study and examination The final score is the composition of mid-test scores, quizzes, and
requirements assignments with the following weight:
Quiz : 20 %
Assignment (including computer assignment) : 25 %
Mid-test : 25 %
Final-test : 30 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list [1] Anton, Howard; Chris Rorres, Elementary Linear Algebra:
Applications Version, 11𝑡ℎ ed., Wiley 2014.
[2] Strang, Gilbert, Linear Algebra and Its Application, 4𝑡ℎ ed.,
Thomson Books/Cole, 2006.
3
MODULE HANDBOOK
Module designation Numerical Methods

module is taught

module
Language Indonesian


hours:
week.
Required and recommended Introduction to Data Science, Calculus 1

module
Module objectives/intended After completing this course, students are able to solve
learning outcomes mathematic problems numerically. Students also gain learning
experience in each several numerical methods in the form of
numerical simulations through computer programming.
1
Content 1. Number representation, error analysis, and algorithms,
2. Solution of one-variable equation,
3. Interpolation and polynomial approximation,
4. Numerical Differentiation,
5. Numerical Integration,
6. Direct method for solving a system of linear equations,
7. Iterative method to solve a system of linear equations.

(35%), final exam (35%)

[1] Burden, R.L., Numerical Analysis (9th International
Edition), 2011, Canada: Wadsworth, Brooks/Cole, Cengage
Learning.
Optional:
[2] Atkinson K. dan Han W., Elementary Numerical Analysis,
3rd Ed, 2004, John Wiley & Sons, Inc.
[3] Golub, G. H. dan Loan, C.F.V., Matrix Computations, 4th
Ed., 1995, The John Hopkin University Press
2
MODULE HANDBOOK
Module designation Mathematical Statistics 1

module is taught
Person responsible for the Siti Nurrohmah

module
Language Indonesian

The module is shared with Statistics and Actuarial Science
undergraduate study programs.
Teaching methods lecture
Workload (incl. contact (Estimated) Total workload: 9 hours/week x 14 weeks + 5.5 hours/week x
hours, self-study hours) 2 weeks =137 hours.
Contact hours : 3 hours (150 minutes lectures).
Private study including examination preparation, specified in hours1:
3 hours structured activities and 3 hours individual study per week.
Required and recommended Calculus 1 and Introduction to Data Science

module
1
1
learning outcomes 1. to determine the probability of an event and its conditional
probability.
2. to identify random variable and probability density function.
3. to determine the cumulative distribution function.
4. to determine the distribution of a random variable function
using the distribution function technique.
5. to determine mathematical expectation and moment generating
function (mgf).
6. to determine the joint distribution of two random variables.
7. to determine conditional distribution and expectations.
8. to determine the coefficient of correlation and independence
between two random variables
9. to apply theories of the distribution of two random variables for
use in the distribution of more than two random variables
10. to determine the characteristics of several distributions for
discrete random variables such as Uniform, Binomial,
Trinomial, Multinomial, Negative Binomial, Geometric,
Hypergeometric and Poisson distributions.
11. to determine the characteristics of several distributions for
continuous random variables such as Uniform, Gamma, Chi-
square, and Exponential, Normal and Bivariate Normal
distributions.
12. to determine the distribution of statistic using distribution
function techniques, random variable transformation
techniques and mgf techniques.
13. to determine the expectations of the random variable functions.
Content 1. The probability set function, conditional probability and
independence.
2. Random variable of the discrete type and continuous type.
3. Properties of distribution function.
4. Expectation of random variable and some special expectations.
5. Distribution of two random variables.
6. Conditional distributions and expectations.
7. The correlation coefficient and independent random variable.
8. Extension to several random variables.
9. Binomial and related distribution and Poisson distribution.
10. Gamma and chi-square distributions, normal distribution and
bivariate normal distribution.
11. Sampling theory, transformation of variables of discrete type,
transformation of variables of continuous type and mgf
technique.
12. Beta, t and F distribution.
13. Extension of the change of variable technique.
2
14. Distribution of 𝑋̅ and 𝑛𝑆 ⁄𝜎 2 .
15. Expectations of Functions of Random Variables.
Examination forms 1. Class activities : Quiz and homework.

2. Mid-term examination.
3. Final examination.
2
requirements 1. Mid-term examination (30%).
2. Final examination (30%).
3. Homework (20%).
4. Quiz (15%).
5. Active participation in class (5%)
To successfully pass the module it requires minimum 55% of the total

mark.
Mark Grade
85 - 100 A
80 - <85 A-
75 - <80 B+
70 - <75 B
65 - <70 B-
60 - <65 C+
55 - <60 C
40 - < 55 D
< 40 E
1. Hogg R.V, ; Craig A.T. Introduction to Mathematical Statistics,

Reading list (resources)
5th edition; Prentice-Hall, Inc, 1995.
2. Hogg R.V. ; Mc Kean J.W.; Craig A.T. Introduction to
Mathematical Statistics, 8th edition, Pearson Education Inc, 2019
3. Asimow L.A. ; Maxwell,M.M. Probability & Statistics with
Applications, ACTEX Pub Inc, 2010.
4. Lecturer’s handout (powerpoint).
5. Videos
3
Module Handbook
Module name Basic Physics 1
Module level, if applicable 1st year
Code, if applicable SCPH601101
Semester(s) in which the
1st semester
module is taught
Person responsible for the
Dr. sc. hum. Deni Hardiansyah
module
Lecturer Dr. sc. hum. Deni Hardiansyah
Language Indonesian
Relation to curriculum Compulsory Course
Types of teaching Class Attendance time (hour per Forms of active
Workload
and learning size week per semester) participation
Interactive
56
Interactive Question-based learning
50 4 Self-directed study 56
learning learning
Assignments 56
Workload 168 hours
Credit points 4 Credits
Minimum attendance of 75% (according to UI regulation). Final score is
Requirements according to
evaluated based on individual assignment (15%), group assignment (15%),
the examination regulations
quizzes (20%), mid-term exam (25%), and final exam (25%).
Recommended prerequisites None
Related course None
Intended Learning Outcomes:

Students are able to apply basic physics concepts to formulate a solution as well
as its application in physics phenomenon in everyday life.
Skill & Knowledge:

Module objectives/intended 1. Able to apply motion mechanics concepts to physics phenomenon in
learning outcomes everyday life.
2. Able to apply fluid mechanics concepts to physics phenomenon in everyday
life.
3. Able to apply vibrations and waves concepts to physics phenomenon in
everyday life.
4. Able to apply heat physics concepts to physics phenomenon in everyday life.
• Units, Dimension, and Measurements.

• Motion Kinematics
• Motion Dynamics
• Work and Energy
• Momentum and Impulse
• Rotating Motion
Content • Equilibrium
• Gravity
• Vibrations
• Waves
• Fluid Mechanics
• Calor and Kinetic Theory of Gas
• 1st and 2nd Law of Termodynamics
Study and examination
requirements and forms of Online Exam
examination
Media employed PowerPoint
1. Halliday, Resnick, dan Walker, Principles of Physics 10th Edition, Wiley,
2014.
Reading list 2. Serway Jewett, Physics for Scientists and Engineers 9th Edition, Thomson
Brooks/Cole, 2014.
3. Giancoli, Physics for Scientists and Engineers 7th Edition, Pearson, 2014
MODULE HANDBOOK
Module designation Analysis 1

module is taught
Person responsible for the Rahmi Rusin

module
Language Indonesian
Teaching methods Lectures, group discussions
Workload (incl. contact (Estimated) Total workload: 11.3 hours x 14 weeks + 3 hours x 2
Contact hours: 3 hours and 20 minutes lectures per week
hours1:
4 hours structured activities, and 4 hours individual study per
week

module
Module objectives/intended After completing the course, students have the ability to analyse
learning outcomes and apply some basic concepts in real analysis to prove theorems
and their applications related to real numbers, sequences, limit
and continuity of one variable real valued functions.
1
Content 1. Algebraic and order properties of real numbers
2. Absolute value and the real line
3. The completeness property of real numbers
4. Applications of the supremum property
5. Intervals
6. Sequences and their limits
7. Limit of sequences theorems
8. Monotone sequences
9. Subsequences and the Bolzano-Weierstrass Theorem
10. Cauchy criterion
11. Properly divergent sequences
12. Limits of functions
13. Limit of functions theorems
14. Some extensions of the limit concept
15. Continuous functions
16. Combinations of continuous functions
Examination forms 1. Class activities : Quiz, homework.

2. Group discussion sessions
requirements 1. Homework (20%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Robert G. Bartle & Donald R. Sherbert. Introduction to

Real Analysis, Fourth Ed. 2010. John Wiley & Sons, Inc.
2. Lecturer’s Handout.
3. Videos.
MODULE HANDBOOK

module is taught

module
Language Indonesian
Teaching methods Lecture

hours1:
week.

module
1
1
learning outcomes 1. to determine the convergence or divergence of a series of real
numbers using series tests.
2. to determine the convergence interval of a power series.
3. determine convergence, uniform convergence, or divergence
of a series of functions using series tests.
4. to determine function expansion in power series
5. to determine the convergence or divergence of improper
integrals by using improper integral tests.
6. to determine the Fourier series of a periodic function, even
function, odd function, and function formed from half-range
expansion.
7. to analyse the convergence of an infinite series and improper
integral using the Fourier series.
8. to determine the Fourier integral of a function.
9. to analyse the convergence of an infinite series and improper
integral using Fourier integral.
Content 1. Infinite Series, Positive Series, Integral Test

2. Positive Series: Other Test
3. Alternative Series, Absolute Convergence, and Conditional
Convergence
4. Power Series, Operation of Power Series, Taylor and
MacLaurin Series
5. Infinite Sequence to a function, Infinite series to a Function,
Uniform Convergence
6. Uniform Convergence Test, Uniform Convergence Theorem
7. Power Series, Operation of Power Series, Power Series
Theorem
8. Expansion of Function in Power Series, Taylor Theorem
9. Introduction of Improper Integral, Improper Integral of type 1
10. Improper Integral of type 2, Improper Integral of type 3
11. Periodic Functions, Fourier Series, Orthogonality Conditions
for Sine and Cosine Functions, Dirichlet Conditions
12. Even and odd Function, Half Range Fourier Series: Sine or
Cosines
13. Parseval Identity, Differentiation and Integration of Fourier
Series, Orthogonal Functions
14. Fourier Integral, Equivalent Forms of the Fourier Integral
Theorem
15. Fourier Transformation
2
Examination forms 1. Class activities : Written quiz, homework.

total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Varberg, Dale; Edwin J. Purcell; Steven E. Rigdon. Calculus,

9th Edition, Prentice Hall Inc, 2007
2. Spiegel, etc. Advanced Calculus 3rd. ed., Schaum’s Outines
Series, 2010.
3. Kreyszig. Advanced Engineering Mathematics 10thed, 2011.
5. Videos
3
MODULE HANDBOOK
Module designation Discrete Mathematics

module is taught
Person responsible for the Dr. Kiki Ariyanti Sugeng

module
Language Indonesia and English
Teaching methods Flipped Class and Problem-based learning using E-learning

asynchronous (independent study/ reading, doing homework,
discussion with peers)
Required and recommended Logic and Set

module
Module objectives/intended After completing discrete mathematics courses, students are

learning outcomes 1. able to apply the basic theories of mathematical thinking in
discrete structure (C4).
2. Able to explain the nature of number theory (C4)
3. Able to solve simple combinatorics problems (C3)
4. Able to solve advanced counting techniques (C3, A3)
5. Able to solve problems related to recursive functions (C3)
6. Able to explain operations on Boolean algebra (C4, A3)
7. Able to choose the appropriate graph model to solve optimal
solution problems. (C4)
1
Content Integer Representation, Prime Number and GCD, Congruence,
Recursive Function, Counting, Permutation and Combination,
Linear/Non-Linear Homogeneous Recurrence Relation, Divide
and Conquer, Generating Function, Inclusive and Exclusive
Principle, Equivalence Relation, Lattices, Graph, Boolean
Algebra.
Examination forms Essay, Poster
Study and examination The final score is the composition of mid-test scores, quizzes,
requirements and assignments with the following weight:
Quiz : 15 %
Assignment : 20 %
Poster : 10 %
Mid-test : 25 %
Paper : 30 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. K. H. Rosen, Discrete Mathematics and Its Applications,

7𝑡ℎ Edition, McGraw-Hill, Inc., International Editions,
2013.
2. Kolman/Busby/Ross, Discrete Mathematical Structures, 5th
ed., 2003, Prentice Hall.
2
MODULE HANDBOOK
Module designation Mathematical Programming

module is taught
Person responsible for the Dr. Zuherman Rustam, D.E.A.

module
Language Indonesian
Contact hours: 150 minutes lectures, 180 minutes of structured
activities, and 180 minutes of individual study per week
hours1:
Required and recommended Elementary Linear Algebra

module
learning outcomes 1. to make mathematical models of a linear, integer, and
nonlinear optimization problem.
2. to solve optimization problems linear, integer, and nonlinear
exactly using the appropriate method problem characteristics.
3. to solve optimization problems linear, integer, and nonlinear
numerically using the appropriate method problem
characteristics.
1
Content 1. Optimization Model and Linear Programming
2. Linear Programming: Eligible area, set convex
3. Linear Programming: Graphic Method, Simplex Method
4. Linear Programming: The Principle of Duality
5. Integer Programming
6. Nonlinear Programming
7. Quadratic Programming
Examination forms 1. Assignment (homework)

3. Final examinations

requirements 1. Assignment (homework) (30%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Kerami, D. & Silaban, D.R., 2009, Riset Operasional I, UT.
2. Winston, Wayne L. & Venkataramanan, Munirpallam,
2003, Introduction to Mathematical Programming:
Application & Algorithm, Thomson Learning.
3. Hilier, Frederick & Lieberman, Gerald J., 1995,
Introduction to operation Research, McGraw Hill.
4. Bazaraa, M. S., Jarvis, J.J., Sherali, H. D., 2010, Linear
Programming and Network Flows, 4th ed. John Wiley &
Sons
5. Bazaraa, M. S., Sherali, H. D. & Shetty, C. M., 2006,
Nonlinear Programming Theory and Algorithms, 3rd ed.
John Wiley & Sons.
6. Taha, Hamdy A, 2007, Operation Research: an
introduction, 8th ed, Pearson Education.
MODULE HANDBOOK
Module designation Data Structure

module is taught
Person responsible for the Dra. Bevina D. Handari, M.Sc., Ph.D.

module
Language Indonesian
Teaching methods Flipped learning and Project-Based Learning
Workload (incl. contact (Estimated) Asynchronous Forum Discussion in EMAS 1 x 60 minutes

hours, self-study hours) (with teacher) + 1 x 60 minutes (between students).
Contact hours: Flipped Learning 1 x 50 minutes, Lecture 1 x 50
minutes.
1-hour structured activities and 1-hour individual study per week.
Required and recommended Elementary Linear Algebra, Algorithm and Programming

module
Module objectives/intended By following this course, students will be able to design and use
learning outcomes appropriate data structure and efficient in structured, modular
and object-oriented programming for solving a problem with
computer assistance. Furthermore, students can design efficient
and effective data management integrated using standard and up-
to-date tools. The language used in this lesson is Indonesian.
1
1
Content 1. Algorithm Data Structure Review
2. Algorithm Complexity Review
3. Static Memory Allocation:
a) One-Dimensional Array
b) Two-Dimensional Array
c) Array of Function Parameters
d) Array Manipulation
e) Searching
f) Sorting
4. Dynamic Memory Allocation:
a) Linked List
b) Single Linked List
c) Doubly Linked List
d) Searching in Linked List
e) Inserting into a Linked List
f) Deleting From a Linked List
5. Basic Data Structure:
a) Stack
b) Queue
6. Hierarchical Data Structure:
Tree
Binary Tree
B-Tree
Heap Tree
Balance Tree
Examination forms 1. Class activities: Homework, small projects
3. Final examination (presentation)
2
requirements 1. Homework (20%)
3. Small Projects (20%)
To successfully pass the module it requires minimum 55% of the total
mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. Brookshear, J.G., Computer Science An Overview, 9th

Edition, Pearson International Edition, 2007.
2. Mehta, D.P., Sahni, S., Handbook of Data Structures and
Applications,2nd Ed, Chapman & Hill/ICR Computer &
Information Science Series, 2018
3. Bhasin. H., Algorithm Design and Analysis, Oxford
University Press, 2015
3
MODULE HANDBOOK
Module designation Ordinary Differential Equations

module is taught
Person responsible for the Dr. Dipo Aldila

module
Language Indonesian
Teaching methods Lecture and lab works

9 hours/week divided into:
- Contact hours: 3 hours (150 minutes lectures).
- Study independent including examination preparation,
specified in hours1: 3 hours structured activities and 3 hours
individual study per week.

prerequisites for joining the Elementary Linear Algebra
module
1
1
learning outcomes 1. to distinguish different between ODE and PDE, linear and
nonlinear ODE, and determine the order of ODE
2. to draw a phase portrait manually and using a software
3. to solve an initial value problem of a first order ODE
analytically using a proper method
4. to solve an initial value problem of a second order ODE
5. to solve an initial value problem of a nth-order ODE
6. to solve a second order of ODE using infinite series
7. to calculate a Laplace transform of a simple function, step
function, impulse function and convolution integral
8. to solve a second order of ODE using Laplace transform
9. to solve a two-dimension linear system of ODE using concept
of eigenvalues and eigenvectors
10. to solve a two-dimension nonlinear system of ODE using
concept of eigenvalues and eigenvectors
Content 1. Definition of ODE, PDE, linear and nonlinear ODE, and the
order of ODE
2. Phase portrait
3. Solution of a first, and nth-order of ODE
4. Solution of second order of ODE using infinite series
5. Laplace transform and its application to solve a second order
of ODE
6. System of linear and nonlinear of an ODE

homework.
2. Lab sessions
2
2. Homework (15%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Boyce,W.E., DiPrima,R.C., Elementary Differential

Equations and Boundary Value Problems, 9th edition, John
Willey & Sons, 2008.
2. Bronson, R., Schaum’s Easy Outline: Diffrential Equations,
4th Edition, McGraw-Hill, 2014.
3
MODULE HANDBOOK
Module designation Vector Calculus

module is taught

module
Language Indonesian
Teaching methods Lecture

hours, self-study hours) hours/week x 2 weeks = 91.34 hours.
hours1:
week.

module
1
1
learning outcomes 1. to calculate operations on vector-valued functions, namely
limit, differentiation, and integration.
2. to calculate velocity, acceleration, curvature, and acceleration
components of vector-valued functions.
3. to describe vectors in a vector field.
4. to calculate divergence and curl in a vector field.
5. to calculate the line integral of a function along a curve.
6. to calculate the work done by a force field in moving a
particle along a curve.
7. to use the theorem (conservative vector field) to prove that a
vector field is conservative.
8. to use the (independence of path) theorem to prove that a line
integral is the independence of path
9. to use Green's theorem to calculate the line integral on a
closed curve.
10. to calculate the surface integral of a function.
11. to calculate the flux of a vector field passing through a
surface using Gauss's theorem.
12. to calculate the flux circulation of a vector field around a
surface using Stokes' theorem
Content 1. Introduction of Vector (Vector and Vector Operations)

2. Vector-valued function
3. Curvilinear Motion
4. Curve
5. Acceleration component
6. Vector Fields
7. Divergence and Curl of Vector Fields
8. Line Integrals
9. Force Fields
10. Criteria for Independence of Path
11. Recovering a Function from Its Gradient
12. Conservation of Energy
13. Green’s Theorem in the Plane
14. Vector forms of Green’s Theorem
15. Evaluating Surface Integral
16. The flux of Vector Field through a surface
17. Surface area for a parametrized surface
18. Gauss’s Theorem
19. Extensions and Application
20. Stokes’s theorem
21. Examples and Applications
2
Examination forms 1. Class activities : Written quiz, homework.

total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Varberg, Dale; Edwin J. Purcell; Steven E. Rigdon. Calculus,

9th Edition, Prentice Hall Inc, 2007
2. Spiegel, M.R, Vector Analysis, 2nd ed, Schaum’s Series,
McGraw Hill, 1981.
4. Videos
3
MODULE HANDBOOK
Module designation Analytic Geometry

module is taught

module
Language Indonesian
Teaching methods lecture, discussion

hours1:
week.
Required and recommended Linear Algebra 1

module
learning outcomes 1. to construct coordinate systems in 2-d space,
2. to determine the solution of linear geometry problems,
3. to determine the solution of quadratic geometry problems,
4. to classify the types of quadrics and conics,
5. to explain the difference between affine transformation and
orthogonal transformation
1
1
Content 1. Coordinate system in plane,
2. Equations of linear geometry object (line, plane) and problems
in linear geometry,
3. Equations of quadratic geometry object (circle, sphere) and
problems in quadratic geometry,
4. Conics, quadrics, and their classification,
5. Affine transformation and orthogonal transformation.

homework.
2. Group presentation

requirements 1. Quiz (20%)
2. Essay assignment (10%)
3. Presentation assignment (20%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. I. Vaisman, Analytical geometry, World Scientific, 1997.

2
MODULE HANDBOOK
Module designation Graph Theory

module is taught

module
Language Indonesia and English

Required and recommended Linear Algebra

prerequisites for joining the Discrete Mathematics
module
Module objectives/intended After completing this module, student be able to

learning outcomes 1. Explain the basic concepts of graph theory and graph
properties.
2. Using graphs as a tool to model real-world problems
(Transportation, clustering, etc.).
3. Using graph labeling as a tool to solve several related
problems.
4. Communicate well to explain the concept of graph theory.
5. Present the results of group discussions / research.
1
Content Undirected Graph, Isomorphism, Tree, Connectivity, Graph
Coloring, Directed Graph
Project: Graph Labeling; Combinatorial Optimisation.
Examination forms Essay, Presentation Slide
requirements and assignments with the following weight:
Quiz : 10 %
Discussion : 20 %
Presentation : 10 %
Mid-test : 30 %
Paper : 30 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Chartrand, G. and Zhang, P., 2012, A First Course to

Graph Theory, Mc Graw Hill.
2. D. B. West, Introduction to Graph Theory, Prentice Hall,
2001.
3. K. Sugeng, S. Slamet dan D. Riama, Teori Graf dan
Aplikasinya, Departemen Matematika FMIPA UI, 2014.
4. Various articles
2
MODULE HANDBOOK
Module designation Data Science

module is taught

module
Language Indonesian
Teaching methods Blended Learning, Flipped learning and Collaborative Learning
Workload (incl. contact (Estimated) Asinchronous Forum Discussion in EMAS 1 x 60

hours, self-study hours) mnts (with teacher) + 1 x 60 mnts (between students).
Contact hours: Flipped Learning 1 x 50 mnts, Lecture 2 x 50
mnts.
hours1:
week.
Required and recommended Intelligent Computation

module
1
1
learning outcomes 1. to study basics, problems, topics, processes, and algorithms in
data science
2. to process data for use in the next process
3. to analyze regression, classification problems, and clustering
using the related methods.
4. to connect mathematical theory to neural network models
5. to cooperate to build a neural network model to predict a
solution to a problem
6. to cooperate to make a paper using Bahasa Indonesia.
Content 1. Data
Introduction to data science
Studying and preparing data
Supervised and Unsupervised
2. Regression and classification
Least square and linear regression
Linier Classifier and Logistic Regression
Support Vector Machine
Decision tree
3. Clustering and Similarity
Nearest Neighbor Search
K-Means
4. Recommending Products and Deep Learning: Searching for
images
5. Introduction to Deep Learning
6. Neural networks with a hidden layer, using forward and
back-propagation
7. Deep Neural Network
8. Aspects of Deep Learning
9. Optimization Algorithms
10. Hyperparameter tuning, Batch Normalization and
Programming Frameworks
Examination forms 1. Class activities: Homework, small projects

3. Final examination (presentation)
2
3. Small Projects (20%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. Aggarwal, C. (2018). Neural Networks and Deep Learning.
Cham, Switzerland: Springer
2. Alpaydin, E. (2010). Introduction to Machine Learning. MIT
Press.
3. Deisenroth, A. Aldo, A.F., Ong, C.S. (2020). Mathematics
for Machine Learning. Cambridge University Press.
4. Goodfellow, I., Bengio, Y., Courville, A. (2016). Deep
Learning. MIT Press.
5. Kotu, V., Deshpande B., (2019). Data Science Concepts
and Practice 2nd Ed, Elsevier Inc, Cambridge.
6. Marc Peter Deisenroth., A.Aldo Faisal., Cheng Soon Ong.
(2020). Mathematics for Machine Learning. Published by
Cambridge University.
7. Saltz, J., S. (2018). An Introduction to Data Science,
Sage Pub., Syracuse University.
8. Swalin, A. (2018). How to Handle Missing Data.
https://towardsdatascience.com/how-to-handle-missing-data-
86418db0d4
9. Vitria, J., et al. (2017). Introduction to Data Science a
Phyton Approach to Concepts, Techniques and
Applications. Springer, Switzerland.
10. Zumel, N., and Mount., J. (2020). Practical Data
Science with R. Manning Pub., New York
3
MODULE HANDBOOK
Module designation Partial Differential Equations and Boundary Value Problems

module is taught

module
Language Indonesian
Contact hours: 2.5 hours lectures per week
hours1:
week
Required and recommended Ordinary Differential Equations

module
Module objectives/intended After completing the course, students have the ability to identify
learning outcomes boundary value problems of order 1 and 2 and solve them
analytically by basic techniques of partial differential equations.
1
Content 1. PDE Models, classification of PDE’s and type of boundary
conditions, characteristics coordinates and canonical form.
2. Conservation Laws, The method of characteristics, singular
solution of wave equations of order 1 (shockwave).
3. Diffusion, Vibrations and Acoustics, Steady-State solutions
of order 1 dan 2 PDE’s , Laplace’s Equations.
4. Cauchy problem for the heat equation, Cauchy problem for
the wave equation, semi-infinite domains.
5. Well-Posed problems, Sources and Duhamel’s principle
6. Laplace transforms & Fourier transforms.
7. Fourier method and orthogonal expansions.
8. Overview of separation of variables.
9. Sturm-Liouville problems, generalization and singular
problems.
10. Laplace’s equation with bounded domain, cooling of a sphere.
11. Diffusion in a disk, sources on bounded domains.
Examination forms 1. Class activities : Quiz, homework

2. Written Quiz (20%).
3. Mid-term examination (30%).
4. Final examinations (30%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. J. David Logan, Applied Partial Differential Equations:
3rd Edition (Undergraduate text in mathematics),
Springer, 2015.
3. Videos.
MODULE HANDBOOK
Module designation Numerical differential equations

module is taught

module
Language Indonesian
Teaching methods Lecture, lab works, project

9 hours/week divided into :
specified in hours1: 3 hours structured activities and 3
hours individual study per week.
Required and recommended Ordinary differential equations and Numerical Method

module
1
1
learning outcomes 1. explaining properties of uniqueness of solutions on initial
and boundary value problems
2. explaining properties well-posed and perturbed problems on
initial value problems
3. implementing numerical methods to solve initial value
problem on ODE
4. implementing shooting methods to solve a boundary value
problems
5. implementing finite difference methods to solve an initial and
boundary value problem on PDE.
Content 1. Unique solution on initial and boundary value problems

2. Well-posed and perturbed problems on initial value problems
3. Numerical method for ODE (Euler, Taylor and high order of
Taylor, Runge-Kutta, multistep methods, more on errors
(stability))
4. Shooting method for linear and nonlinear problem on
boundary value problems
5. Finite difference (explicit scheme) for PDE
6. Finite difference (implicit scheme) for PDE

homework.
2. Lab sessions
2
2. Homework (15%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Burden R.L. dan Faires J.D., 2011, Numerical Analysis,
Brooks/Coles, Cengange Learning.
2. Boyce,W.E., DiPrima,R.C., Elementary Differential
Equations and Boundary Value Problems, 9th edition, John
Willey & Sons, 2008
3. Logan, J. D., Undergraduate Texts in Mathematics: Applied
partial differential equations (3rd edition), Springer-Ney
York, 2015.
3
MODULE HANDBOOK
Module designation Analysis 2

module is taught

module
Language Indonesian
Contact hours: 3 hours and 20 minutes lectures per week
hours1:
week
Required and recommended Analysis 1

module
Module objectives/intended After completing the course, students have the ability to analyse
learning outcomes and apply some basic concepts in real analysis to prove theorems
and their applications related to uniform continuity,
differentiation, Riemann integral, and sequence of functions
mathematically.
1
Content 1. Pointwise continuity and continuous functions on intervals
2. Uniform continuity, Continuous extension theorem,
Lipschitz function
3. Monotone and inverse functions
4. Derivatives of function
5. Chain Rule, inverse functions
6. Mean Value Theorem, Rolle’s Theorem, Intermediate Value
Theorem, Darboux’s Theorem
7. L’Hospital’s Rules
8. Taylor’s Theorem
9. Gauge
10. Definition and examples of Riemann Integral
11. Classes of Riemann integrable functions
12. Additivity Theorem and Fundamental Theorems
13. Lebesgue’s integrability criterion,
14. Composition and product theorem for integral
15. Pointwise and uniform convergence of sequences of functions
16. Interchange of limit (and integral, derivatives, limit and
continuity)

total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Robert G. Bartle & Donald R. Sherbert. Introduction to

Real Analysis, Fourth Ed. 2010. John Wiley & Sons, Inc.
3. Videos.
MODULE HANDBOOK
Module designation Research Methodology

module is taught
Person responsible for the Module Coordinator

module
Language Indonesian
Workload (incl. contact (Estimated) Total workload: 8.5 hours x 14 weeks + 3 hours x 2 weeks
hours, self-study hours) Contact hours: 150 minutes lectures, 180 minutes structured activities,
and 180 minutes individual study per week
Private study including examination preparation, specified in hours 1:
Credit points 2 sks (3,18 ECTS)

module
1
learning outcomes 1. to explain the basic understanding of research methods, include
understanding of scientific research, research methods, types of
approaches in research, and research steps.
2. to identify the scope of research, in particular research in
mathematics, including problem definition, and literature search
that supports problem solving.
3. to do mathematical reasoning in reading topics, theorems, and their
proofs, and rewrite them according to the rules scientific writing
4. to characterize the types of scientific publications
5. to prepare research proposals according to the rules by following the
rules of scientific writing
6. to compile scientific papers according to the rules by following the
rules of scientific writing.
Content 1. Introduction to scientific research

2. Mathematical Analysis
3. Introduction about scientific publication
4. How to write research proposal
5. How to write scientific article
6. Thesis and Disertation
Examination forms 1. Class activities : Assignment

2. Project Presentation

requirements 1. Assignment: 80%
2. Project Présentation (20%)
To succesfully pass the module it requires minimum 55% of the total

mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Pandey, Prabat; Meenu Mishra Pandey. 2015. Research
Methodology: Tools And
Techniques. Bridge Center Publ.;
Kumar, Ranjit. 2011.
2. Research Methodology . - a step-by-step guide for beginners;
3rd
ed.; SAGE Publ.Inc.
3. Gustavi, Bjo’rn, 2008. How to Write and Illustrate Scientific
Papers ; 2nd ed; Cambridge
Univ Press.
MODULE HANDBOOK
Module designation Algebra
Semester(s) in which the 5th

module is taught
Person responsible for the Nora Hariadi

module
Language Indonesian
Teaching methods Flipped class, question-based learning, lecturing
Contact hours: 150 minutes lectures, 180 minutes structured
activities, and 180 minutes individual study per week
hours1:
Required and recommended Linear Algebra 1

module
1
learning outcomes 1. to make use of the definitions and theorems in group and
ring to prove algebra problems
2. to determine normal subgroup and quotient group
3. to determine isomorphism between groups or rings
4. to determine ideal and quotient ring
5. to apply the polynomial’s properties
6. to discover some simple examples of the application of
group / ring algebra in other disciplines
7. to elaborate the proof of theorems and properties in
algebra
Content 1. Group
a. Definitions and Examples of Groups
b. Subgroups
c. Cyclic Groups
d. Permutation Groups
e. Cosets and Lagrange’s Theorem
f. Group Homomorphism
g. Normal Subgroups and Quotient Groups
h. The Homomorphism Theorems
2. Ring
a. Rings, the Types of Rings, and Subrings
b. Ideal and Ring Homomorphism
c. Quotient Rings
d. The Ring Homomorphism Theorems
e. Maximal Ideal
f. Polynomial Rings
g. Field of Quotients of an Integral Domain
Examination forms 1. Class activities: Quiz (written and computer-based),
homework.
2. Mid-term examination.
3. Final examination.
Study and examination The final mark will be weighted as follows :
requirements 1. Quiz (written and computer-based): 30%
2. Homeworks: 20%
3. Mid-term examination: 25%
4. Final examinations : 25%
To pass successfully the module it requires minimum 55% of the
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Judson, T. dan Steve, F., 2015, Abstract Algebra,

Austin State University
2. Herstein, I.N.,1999, Abstract Algebra, 3ed, John Wiley
and Son.
3. Gallian, J.A., 2010, Contemporary Abstract Algebra,
Brooks/Cole.
MODULE HANDBOOK
Module designation Complex Function

module is taught

module
Language Indonesian
Teaching methods Lecture, seminar.
Workload (incl. contact (Estimated) Total workload: 9 hours/week x 14 weeks + 5.5 hours/week x
hours, self-study hours) 2 weeks = 137 hours.
specified in hours1: 3 hours structured activities and 3 hours
individual study per week.
Credit points 3 SKS
Required and recommended Calculus-3

module
learning outcomes 1. to proof the identities related to complex number
2. to proof limit, continuity, and derivation of complex function
3. to identify characteristic of an analytic function
4. to integrate a simple complex function
5. to find a relation a concept of sequences, series, residue, and pole to
calculate an integration of a complex function
6. to use residue and pole to calculate a more complicated integration
of a complex function
7. to draw a mapping of a complex function.
1
1
Content 1. Complex number
2. Function, limit, and theorems on limit of complex function
3. Analytic function
4. Integral of complex function
5. Series of a complex function
6. Residue and pole
7. Mapping of a complex function


2. Homework (15%).
mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list J.W.Brown dan R.V.Churchill. 2014. Complex variables and

applications, 9th edition. Mc. Graw Hill Education.
2
MODULE HANDBOOK
Module designation Mathematical Modeling

module is taught

module
Language Indonesian
Teaching methods Collaborated Learning
Workload (incl. contact (Estimated) Asynchronous in EMAS 1 x 60 minutes (with

hours, self-study hours) teacher) + 2 x 60 minutes (between students).
Contact hours: Synchronous 1 x 60 minutes,
Private study including presentation preparation, specified in
hours1:
2 hours structured activities per week.
Required and recommended Mathematical Statistics 1, Ordinary Differential Equation,

prerequisites for joining the Numerical Differential Equations, Partial Differential Equations
module and Boundary Conditions.
1
1
Module objectives/intended After completing the course, students have the following abilities:
learning outcomes 1. As a group, interpreting simple real-world problems in
correct mathematical language.
2. Determine the problem of the topic given.
3. Determine a model’s parameters, parameters and
assumptions and the solution to be used based on the
explanation of real-world problems.
4. Adapting a mathematical model to a real-world problem.
5. Extracting a mathematical model using a variety of basic
mathematical concepts.
6. Demonstrating the obtained model analytically or
numerically with an easily understood implementation.
7. Creating a report with correct use of Bahasa Indonesia.
Content 1. Introduction to mathematical modeling

2. Exploration of real-world problems as the first stage of
mathematical modeling
3. Parameters and variables in mathematical modeling
4. Adapting mathematical models based on assumptions
5. Analysis of mathematical models
Examination forms 1. Class activities: Small, Projects and Project

2. Presentations
3. Paper
2
requirements 1. Small Project (10%)
2. Presentation I (20%)
3. Presentation II (25%)
4. Presentation III (30%)
5. Paper (15%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. Michael D. Alder, An Introduction to Mathematical

Modelling, HeavenForBooks.com, 2001
2. N. D. Fowkes, An Introduction to Mathematical Modelling,
Wiley, 1994.
3
MODULE HANDBOOK
Module designation Topology

module is taught
Person responsible for the Nora Hariadi

module
Language Indonesian
Relation to curriculum Elective (pure math)
Teaching methods Question based learning, small group discussion, lecturing,

project based.
hours1:

module
1
learning outcomes 1. to determine the metric space and it’s properties
2. to apply the basic concepts of topological space
3. to explain the definition and the properties of continuous
function in topological space
4. to analyze the connectedness and separation properties in
topological space
5. to construct a new topological space from the old ones
6. to analyze the convergence of the sequence in topological
space
7. to analyze the compactness properties in topological space
8. to use the topological properties in the application
problems
9. to work in groups
Content 1. Topological space and continuity

a. Metric space and topological space
b. Continuous maps
c. Connectedness
d. Separation properties
2. Construction of topological space
a. The product topology
b. The quotient topology
3. Convergence in topological space
a. Convergence of nets
b. Nets and filters
4. Compactness
a. Compact space
b. Continuous maps and compactness
c. Tikhonov’s theorem
5. Special topics

homework.
4. Group project : paper and presentation
Study and examination The final mark will be weighted as follows :
requirements 1. Quiz (written and computer-based): 20%
2. Homework: 10%
3. Mid-term examination: 20%
4. Final examinations : 20%
5. Group project : 20%
6. Peer evaluation : 10%
mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Waldmann, S., 2014, Topology, An Introduction,

Springer International Publishing Switzerland
2. J. R. Munkres, 2000, Topology, 2nd ed, Prentice Hall
Inc, London.
3. C. W. Patty, 1993, Foundations of Topology,
International Thomson Publishing
MODULE HANDBOOK
Module designation Stochastic Differential Equation

module is taught
Person responsible for the Dra. Bevina D. Handari, M.Sc., Ph.D

module
Language Indonesian
Teaching methods Flipped learning
Workload (incl. contact (Estimated) Asynchronous Forum Discussion in EMAS 1 x 60

hours, self-study hours) minutess (with teacher) + 2 x 60 minutes (between students)
hours1:
2 hours’ structured activities and 1 hour’s individual study per
week.
Required and recommended Ordinary Differential Equation, Mathematical Statistics 1

module
1
1
learning outcomes
1. To explain the stochastic process and stochastic problems
2. To use basic elements of the stochastic process
3. To implement integration and differentiation in stochastic
differential equations
4. To solve stochastic differential equations using the theories
learned
5. To solve stochastic differential equations in real-world
problems
Content 1. Examples of stochastic processes in real-world problems

2. Elements of the stochastic process
3. Some important stochastic processes
4. Stochastic integration and differentiation
5. Stochastic integration techniques
6. Stochastic differential equations
7. Real-world stochastic applications
Examination forms 1. Class activities: Homework


total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
2
Reading list (resources) 1. Calin, O. (2015). An Informal Introduction to
Stochastic Calculus with Applications, World
Scientific Publishing Co. Pte. Ltd., London
2. Cyganowski, S., Kloeden, P., Ombach, J. (2002), From
Elementary Probability to Stochastic Differential
Equations with MAPLE, Springer-Verlag, Germany.
3. Klebaner, F. (2005). Introduction to Stochastic Calculus
with Applications 2nd Ed. Imperial College Press,
London.
3
MODULE HANDBOOK
Module designation Research Operation

module is taught
Person responsible for the Dr. Zuherman Rustam, D.E.A.

module
Language Indonesian
Relation to curriculum Elective
Teaching methods Lecture, discussion, project.

hours :
week.

module
learning outcomes 1. To explain the characteristic and principle of dynamic
programming optimization problems.
2. To solve deterministic and probabilistic dynamic
programming problems.
3. To solve problems related to dynamic programming.
4. To explain the characteristics of the queuing system.
5. To explain various models of queuing systems.
6. To explain Markov system.
7. To use Markov system to analyze stochastic processes.
8. To solve problems related to the queuing system.
1
Content 1. Characteristics and principles of deterministic and
probabilistic dynamic programming optimization problems.
2. Dynamic programming applications in the real world.
3. Characteristics and various models of queuing systems.
4. Markov system.
5. Application of queuing theory in the real world.
6. The use of software to solve dynamic programming and
queuing system problems.
Examination forms Oral presentation, essay.

2. Homework (20%).
4. Final report (20%)
5. Presentation (20%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list F. S. Hillier and G. J. Lieberman, Introduction to Operations

Research, 10th ed. McGraw-Hill Education, 2015.
2
MODULE HANDBOOK
Module designation Computational Intelligence

module is taught
Person responsible for the Zuherman Rustam

module
Language Indonesian
hours1:
week
Required and recommended Data Science

module
Module objectives/intended After completing the course, students have the ability to
learning outcomes implement machine learning algorithm to solve problems which
needs a big data analysis.
1
Content 1. C4.5 algorithm and its applications
2. K-Means clustering algorithm and its applications
3. Support vector machines (SVM) algorithm and its
applications
4. Apriori algorithm and its applications
5. Expectation-Maximization algorithm and its applications
6. Page rank algorithm and its applications
7. AdaBoost algorithm and its applications
8. K-Nearest Neighbors algorithm and its applications
9. Naïve Bayes algorithm and its applications
10. Classification and Regression Trees (CART) algorithm and
its applications

To succesfully pass the module it requires a minimum 55% of the
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list X. Wu and V. Kumar, The Top Ten Algorithms in Data Mining.
Chapman & Hall/CRC, 2009.
MODULE HANDBOOK
Module designation Design and Analysis of Algorithm

module is taught

module
Language Indonesian
Relation to curriculum Elective course

hours :
week.

module
Module objectives/intended This course has been designed with an emphasis on Algorithmic,
learning outcomes which is a systematic study of the use of basic techniques to
design and analyze efficient algorithms. After completing this
course, students are expected to be able to apply the concept of
time complexity, asymptote notation and recursive relation in
determining the performance of an algorithm. Students are also
expected to be able to implement several algorithmic techniques
such as Divide and Conquer, Dynamic Programming, Greedy
Algorithm and Graph Algorithm in various types of problems
and have knowledge in Parallel Algorithms.
1
Content 1. Algorithm Concepts;
2. Analysis of Algorithm
a. Time Complexity;
b. Asymptotic notation;
c. Recurrence Relation;
3. Design of Algorithm
a. Brute Force;
b. Divide and Conquer;
c. Greedy;
d. Dynamic Programming;
e. Graph Algorithm;
4. Introduction to Parallel Algorithm.

(35%), final exam (35%)
Reading list [1] Gilles Brassard, Paul Bratley, Algorithmics: Theory &
Practice, 1988, Prentice Hall.
[2] Cormen Thomas H., Leiserson Charles E., Rivest Ronald L.,
Introduction to Algorithms, 1991, Mc.McGraw-Hill.
[3] Harsh Bhasin, Algorithms: Design and Analysis, 2015,
Oxford.
[4] Kenneth A. Berman, Jerome L. Paul, Fundamentals of
Sequential and Parallel Algorithms, 1997, ITP.
2
MODULE HANDBOOK
Module designation Linear Algebra 2

module is taught
Person responsible for the Kiki Ariyanti, Ph.D.

module
Language Indonesia
Workload (incl. contact Total workload: 170 minutes

hours, self-study hours) Contact hours (please specify whether lecture, exercise, laboratory
session, etc.):

Linear Algebra, Algebra
Required and recommended
module
1
1
Module objectives/intended 1. The students can explain the algebraic structure and its relation,
learning outcomes Vector Spaces, Linear Transformations, Matrix Representation of
Linear Transformations of Inner Product Spaces, Eigen Values and
Vectors, Singular Value Decomposition, Cayley-Hamilton Theorem,
Jordan Forms, and Module Introduction.
2. The students can use definitions and theorems in proving the
properties of algebraic structures in vector spaces and linear
transformations. Students can determine the matrix representation of
a given linear transformation.
3. The students can explain the inner product space and its properties.
4. The students can determine the values and eigenvectors of a given
linear transformation representation matrix.
5. The students can explain properties related to endomorphism
decomposition
6. The students can explain the simple nature of the module.
7. The students can re-proven theorems and proofs of properties and
theorems in linear algebra related to their algebraic structure.
1. Vector Space
Content
2. Linear Transformations, Representation Matrices of Linear
Transformations
3. Inner Product Spaces
4. Eigenvalues and Eigenvectors
5. Decomposition of Singular Value, Cayley-Hamilton Theorem,
Jordan Form
6. An Introduction to module

mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
2
1. Robert J. Valenza, Linear Algebra: An Introduction to Abstract
Reading list
Mathematics, Springer, 1993
2. Ahmad Arifin, Aljabar Linier, edisi II, 2001, Penerbit ITB.
3. Bill Jacob, Linear algebra, 1990, W.H. Freeman and Company.
4. Paul R. Halmos, Finite Dimensional Vector Spaces, 1987, Springer-
Verlag.
3
MODULE HANDBOOK
Module designation Cryptography
Semester(s) in which the 6, 7

module is taught

module
Language Indonesia

asynchronous (independent study / reading, doing homework,

Discrete Mathematics
prerequisites for joining the Algebra
module
Module objectives/intended After completing this module, students be able to

• Explaining the basic concept of cryptographic systems.
learning outcomes
• Using basic mathematical concepts in classification and
modern cryptography.
• Explaining how block cipher and public key Cryptography
works
• Explaining post-quantum cryptography
• Show examples on what the cryptography applications in
everyday life and how it works
Content Classic Cryptography, Block Cipher Cryptography, Public Key

Cryptography and RSA, Post Quantum Cryptography, Application
of Cryptography.
Examination forms Essay, Project, Presentation
1
assignments with the following weight:
requirements Assignment and Presentation : 40 %
Mid-test : 30 %
Project : 30 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list [1] W. Stalling, Cryptography and Network Security, 4th ed,
Pearson2006
[2] Various articles
2
MODULE HANDBOOK
Module designation Parallel Computing

module is taught

module
Language Indonesian
Teaching methods Lecture, lab works
hours1:
Required and recommended Algorithm and Programming

module
learning outcomes 1. distinguishing parallel and sequential algorithms
2. distinguishing parallel computing architecture
3. compiling parallel algorithm
4. to analyze the performance of parallel algorithms
5. processing big data
6. designing parallel computing on big data
1
Content 1. Sequential and Parallel Algorithm
2. Parallel computing architecture (shared, distributed, and
hybrid computing)
3. Parallel Algorithm Analysis
4. Parallel Algorithm Model
5. Parallel Algorithm Structure
6. Design Techniques
7. Big Data
8. Parallel Implementation on Big Data
Examination forms 1. Class activities : Assignment


requirements 1. Class activities : Assignment (20%)
3. Use-case group project (20%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Fundamentals of Sequential and Parallel Algorithms,
Kenneth A. Berman, Jerome L. Paul, ITP, 1997.
2. The Design and Analysis of Parallel Algorithms, Selim G.
Akl, Prentice-Hall, 1989.
3. Python Parallel Programming Cookbook, Giancarlo
Zaccone, 2nd Ed, 2019.
4. Parallel Computing for data science with examples in R,
C++ and CUDA, Norman Matloff, CRC Press, 2016.
MODULE HANDBOOK
Module designation Numerical Mathematics

module is taught
Person responsible for the Dr. Yudi Satria

module
Language Indonesia
Teaching methods Flipped learning.

hours :
week.
Required and recommended Numerical Methods

module
1
learning outcomes 1. To solve the problem of approximating a single variable
function using several methods, namely Discrete Least
Squares, Orthogonal Polynomials and Least Squares,
Chebyshev Polynomials and Economization of Power Series,
Rational Functions, Trigonometric Polynomials, and Fast
Fourier Transforms Approximation.
2. To solve value approximation problems and eigenvectors
using several methods, namely, Power, Householder, QR,
and Singular Value Decomposition.
3. To solve non-linear system of equations by using several
methods, namely Fixed points for functions of several
variables, Newton's method, Quasi-Newton, and Steepest
Descent techniques
Content 1. Methods to find the approximation of a single variable

function, namely Discrete Least Squares, Orthogonal
Polynomials and Least Squares, Chebyshev Polynomials and
Economization of Power Series, Rational Functions,
Trigonometric Polynomials, and Fast Fourier Transforms
Approximation.
2. Methods to find eigenvalue approximations, namely Power,
Householder, QR, and Singular Value Decomposition
(SVD).
3. Methods to solve nonlinear systems numerically, namely
Fixed points method for functions of several variables,
Newton's method, Quasi-Newton, and Steepest Descent
techniques.
Examination forms Essay.
2
requirements 1. Assignments (40%)
3. Final-term examination (30%)
To successfully pass the module it requires a minimum 55% of

the total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
[1] Burden, R.L., Numerical Analysis (9th International

Edition), 2011, Canada: Wadsworth, Brooks/Cole,
Cengage Learning.
Elective:
[2] Atkinson K. dan Han W., Elementary Numerical Analysis,

3rd Ed, 2004, John Wiley & Sons, Inc.
[3] Golub, G. H. dan Loan, C.F.V., Matrix Computations, 4th

Ed., 1995, The John Hopkin University Press.
3
MODULE HANDBOOK
Module designation Numerical Stochastic Differential Equations

module is taught

module
Language Indonesian

hours:
week.
Required and recommended Numerical Differential Equations, Mathematical Statistics 1

module
Module objectives/intended After completing this course, students are expected to be able to
learning outcomes apply Stochastic Differential Equations Methods in the fields of
Science and Finance. The main topics covered include random
walk and Brownian motion, stochastic differential equations
(SDEs), Euler-Maruyama (EM) method and Milstein method,
convergence and stability properties of EM and Milstein
methods, Monte Carlo simulation, SDEs model stock prices,
SDEs models in science.
1
Content 1. Random walk and Brownian motion,
2. Stochastic Differential Equations (SDEs),
3. Euler-Maruyama (EM) method,
4. Milstein method,
5. Convergence and stability properties of EM and Milstein
methods,
6. Monte Carlo simulation,
7. SDEs model in stock prices,
8. SDEs models in science.
Examination forms Essay and presentation

requirements Student activity in discussion forum (10%), quiz/assignment
(30%), midterm exam (30%), final exam (30%)
Reading list [1] Glasserman P. 2004. Monte Carlo methods on Financial

Engineering. Springer, New York.
[2] Heath, M.T., 1997, Scientific Computing: An Introduction
Survey, McGraw-Hill Co.
[3] Higham ,D.J., 2001. An Algorithmic Introduction to
Numerical Simulation of Stochastic Differential Equations,
SIAM Rewiew Vol. 43, No.3, pp 525-546.
[4] Hull, J.C. 2008. Options, Futures, & Other Derivatives, 7th
Ed. Prentice Hal Int., New Jersey.
[5] Kloeden, P.E., Platen, E. 1995. Numerical Solution of
Stochastic Differential
Equations. Springer, Berlin.
[6] Kloeden, P.E., Platen, E., Schurs, H. 2003. Numerical
Solution of SDE through Computer Experiments. Springer,
Berlin.
[7] Shreve, S.E. 2004. Stochastic Calculus for Finance II
Continuous-Time Models. Springer, New York.
[8] Wilmot, P., Quantitative Finance 3, Volume set 2nd Ed.
2
MODULE HANDBOOK
Module designation Dynamical Systems

module is taught
Person responsible for the Dr. Rahmi Rusin

module
Language Indonesian
hours1:
week
Required and recommended Ordinary Differential Equations

module
Module objectives/intended After completing the course, students have the ability to
learning outcomes understand and use the techniques in dynamical systems and
apply them to the real-world systems. The approach emphasizes
qualitative ideas rather than explicit computation.
1
Content 1. Overview: Dynamical Systems
2. Types of Systems
3. Examples of Dynamical Systems
4. System Modeling
5. Characteristics of Dynamical Systems
6. Existence and Uniqueness of Solutions
7. Equilibrium and Nullclines
8. Stability
9. Lyapunov Functions
10. Types of Nonlinear Systems
11. Limit Cycles
12. Bifurcation
13. Chaos
14. Linearization

total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Stephen Lynch, Dynamical Systems with Applications
using Maple, 2nd Edition, Springer, 2010
2. Patricia Mellodge, A Practical Approach to Dynamical
Systems for Engineers, Woodhead Publishing, 2016.
4. Videos.
MODULE HANDBOOK
Module designation Network Optimization

module is taught

module
Language Indonesian
hours1:
week
Required and recommended - Mathematical programming

prerequisites for joining the - Discrete Mathematics
module
learning outcomes the characteristic features of a network optimization, and
implement an appropriate algorithm to solve the problems.
1
Content 1. Definition of a network and it features
2. Design and analyze a network
3. Shortest path algorithm
4. Minimum spanning tree algorithm
5. Maximum and minimum cost flows algorithm
6. Generalization of flows problem
7. Multicommodity flows

total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list R. K. Ahuja, T. L. Magnanti, dan J. B. Orlin, Network flows:

theory, algorithms, and applications. Prentice-Hall, Inc., 1993.
MODULE HANDBOOK
Module designation Coding Theory and Cryptography

module is taught

module
Language Indonesia


module
Algebra
1
learning outcomes
• Explain the basic concepts of coding theory
• Differentiate the code types and their properties
• Explain the concept of error correction code and its
properties
• Explain the application of the code in everyday life
• Explain on how cryptographic schemes work
• Give example on cryptography applications in
everyday life.
Content Basic concept of code, linear code and its property, error
correction code, application of coding theory in the daily life,
relation with cryptography, classic encryption scheme, block
cipher cryptography, Public Key Cryptography and Application
of Cryptography.
Examination forms Essay, Project, Presentation Slide
and assignments with the following weight:
requirements Assignment and Presentation : 40 %
Mid-test : 30 %
Project : 30 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
2
Reading list [1] W. Stalling, Cryptography and Network Security,
4th ed, Pearson2006
[2] C. Wuthrich, Coding and Cryptography,
https://www.maths.nottingham.ac.uk/plp/pmzcw
/download/ccr.pdf
[3] Various articles
3
MODULE HANDBOOK
Module designation Web Mining

module is taught
Person responsible for the Dr. rer. nat. Hendri Murfi

module
Language Indonesia
Teaching methods Lecture, Lesson, Project and Presentation

Required and recommended Calculus

prerequisites for joining the Linear Algebra
module Algorithm and Programming
Numerical Methods
learning outcomes 1. Explain the basic concepts of big data
2. Explain the basic concepts of neural networks and deep
learning
3. Explain the basic architectures of deep learning, i.e.,
convolution neural networks, long-short term memory
neural networks, deep autoencoder
4. Explain the application of deep learning in image
classification, sentiment analysis, document clustering, and
topic detection
5. Apply the deep learning to the real-world dataset
1
Content Big data; neural networks, deep learning, convolution neural
networks (CNN), long-short term memory (LSTM) neural
networks, autoencoder; image classification, sentiment analysis,
document clustering, topic detection
Examination forms Essay, Project Report and Oral Presentation
Study and examination The final score is the composition of assignments, mid-test scores,
requirements and project with the following weight:
Assignment : 20 %
Mid-test : 40 %
Project : 40 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list [1] I. Goodfellow, Y. Bengio, A. Courville. Deep Learning. MIT

Press, 2016.
[2] A. Zhang, Z. C. Lipton, M. Li, A. J. Smola. Dive into Deep
Learning, 2020.
[3] Various articles.
2
MODULE HANDBOOK
Module designation Functional Analysis

module is taught
Person responsible for the Nora Hariadi, M.Si.

module
Language Indonesia

Required and recommended Analysis 1, Algebra

module
Module objectives/intended After completing Analysis 1 and Algebra courses, students are
learning outcomes 1. able to apply the basic theories of mathematical thinking in
functional analysis (C4).
2. Able to explain the basic concept of topology and
compactness property in metric space (C4, A3)
3. Able to explain the nature of normed space and Hilbert space
(C4, A3)
4. Able to analyze the properties of linear operator and it’s dual
in norm space and inner product space (C4)
5. Able to analyze the properties of linear functional and it’s
dual in norm space and inner product space (C4)
6. Able to dissect proofs in functional analysis (C4)
7. Able to apply the functional analysis concept in mathematics
problem (C4) and formulate opinions to solve the problem
(A4)
1
Content Metric space, compact set, norm space, linear operator, The
Uniform Boundedness Principle, functional linear, weak
convergence, adjoint operator, reflexivity, the spectrum, inner
product space, Riesz Representation Theorem, spectral
decomposition in Banach space
Examination forms Essay and poster
requirements assignments with the following weight:
Quiz : 15 %
Assignment : 20 %
Poster : 10 %
Mid-test : 25 %
Paper : 30 %
Total : 100 %
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Clason, C., 2020, Introduction to Functional Analysis,

Springer Nature Switzerland.
2. Kreyszig, E., 1978, Introductory Functional Analysis with
Applications, John Wiley & Sons.
2
MODULE HANDBOOK
Module designation Measure theory and integration

module is taught

module
Language Indonesian
Teaching methods Discussion

hours1:
week.

module
learning outcomes 1. to determine the solution of problems in measurable function,
2. to determine the solution of problems in measure,
3. to determine the solution of problems in integral,
4. to determine the solution of problems in integrable function,
5. to determine the solution of problems in Lebesgue space,
6. to determine the solution of problems in convergence,
7. to determine the solution of problems in measure
decomposition.
1
1
Content 1. Measurable real valued functions, generalized measurable
real valued functions, measurable complex valued functions,
function between measurable spaces,
2. Measure, measurable space, almost everywhere, charge.
3. Simple function and its integral, integral of generalized
measurable real valued functions, Theorem of Monotone
Convergence, Lemma Fatou, properties of integral,
4. Integrable real valued functions, positivity and linearity of
integral, Lebesgue Dominance Convergence Theorem,
parameter depended integrand,
5. Norm space, Lp-space, Holder inequality, Minkowski
inequality, Theorem of completeness, L infinity-space,
6. Types of convergence of function sequence, relation between
types of convergence,
7. Types of measure decomposition,
Examination forms 1. Quiz

2. Presentation

2. Presentation assignment (30%)
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list (resources) 1. Robert G. Bartle, The elements of integration and Lebesgue
measure, John Wiley & Sons, 1966.
2
MODULE HANDBOOK
Module designation Optimal control theory

module is taught

module
Language Indonesian
hours1:
week
Required and recommended - Mathematical programming

prerequisites for joining the - Ordinary differential equations
module
learning outcomes the characteristic of an optimal control problem, and implement a
proper method to solve the problem.
1
Content 1. Transversality conditions
2. Autonomous system
3. Diagram analysis
4. Type of endpoints
5. Application of optimal control theory to investment and
advertising problem
6. Pontryagin principle
7. Dynamic programming
8. Stochastic optimal control problem

total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list Kamien, M. I. dan Schwartz, N. L. (1991). Dynamic

optimization: The calculus of variations and optimal control in
economics and management. Amsterdam: North-Holland.
MODULE HANDBOOK
Module designation Theory of Computation

module is taught
Person responsible for the Dr. Yudi Satria

module
Language Indonesian
Teaching methods Flipped learning.

hours:
week.
Required and recommended Algorithm and Programming

module
learning outcomes 1. To explain mathematically an abstract machine.
2. To explain computability theory.
3. To diagnose language and language expressions that can be
accepted by an abstract machine.
1
Content 1. Formal language and its grammar
2. Chomsky classification
3. Finite state machine
4. Finite automata
5. Deterministic finite automata
6. Regular grammar
7. Regular expression
8. Nondeterministic finite automata
9. Context-free grammar
10. Formal Context-free grammar
11. Push down automata
12. Deterministic push down automata
13. Context-free grammar receivable push down automata
14. Turing machine
Examination forms Essay.

requirements 1. Assignments (30%)
3. Final-term examination (35%)
To successfully pass the module it requires a minimum 55% of

the total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Sipser. M., Introduction to The Theory of Computation, 3rd

Ed, Cengage Learning, 2012.
2. John C. Martin, Introduction to Languages and the Theory
of Computation, 4th Ed, Mc Graw Hill, 2011.
3. Djati Kerami, Diktat Pengantar Teori Komputasi, Jurusan
Matematika FMIPA UI, 2001.
2
MODULE HANDBOOK
Module designation Bioinformatics

module is taught

module
Language Indonesian
Workload (incl. contact (Estimated) Total workload: 8.5 hours x 14 weeks + 3 hours x 2 weeks
hours, self-study hours) Contact hours: 150 minutes lectures, 180 minutes structured activities,
and 180 minutes individual study per week
Private study including examination preparation, specified in hours 1:
Credit points 3 sks (4, 77 ECTS)
Required and recommended Parallel Computing, Machine Learning

module
learning outcomes 1. to express biological sequences (DNA and protein) as string
information
2. to explain methods for determining patterns in biological sequences
3. to describe with basic concepts and terminology in computational
science
4. to apply methods to determine patterns in biological sequences
5. to apply bioinformatics methods for sequence and structure analysis
6. to use the program as a tool to solve basic scientific problems
7. to analyze different biological sequences from generic string
analysis
1
Content 1. Introduction of Bioinformatics
2. Pair-wise sequence alignments and database search
3. Phylogenic tree and multiple sequence alignments
4. Protein Structure Alignments
5. Modelling of Protein-protein interactions
6. Biological Data Modeling
7. Analyzing Data From High Throughput Experiments
Examination forms 1. Class activities : homework, mini project


2. Mini Project (30%)
mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Supratim Choudhuri, Bioinformatics for Beginners: Genes,
Genomes, Molecular Evolution,
Databases and Analytical Tools 1st Edition, Elsevier and AP,
2014
2. Elloumi M., and Zomaya A.Y., Biological Knowledge
Discovery Handbook, Wiley Series on
Bioinformatics Computational Techniques and Engineering,
2012.
3. Dress, A., Linial, M., Troyanskaya, O., Vingron, M.
Computational Biology, Springer, 2015.
4. Röbbe Wünschiers, Computational Biology: A Practical
Introduction to BioData Processing
and Analysis with Linux, MySQL, and R 2nd ed, Springer,
2013.
MODULE HANDBOOK
Module designation Biomathematics

module is taught

module
Language Indonesian
Teaching methods Lecture, lab works, seminar.

specified in hours1: 3 hours structured activities and 3
hours individual study per week.
Required and recommended Mathematical modelling

module
1
1
learning outcomes 1. to explain and analyze a qualitative and quantitative
behaviour of an exponential growth, logistic growth, logistic
growth with Allee effect and logistic growth with fear factor
model
2. to explain and analyze a qualitative and quantitative
behaviour of a competing species models
behaviour of a predator prey model
behaviour of an SIR model
behaviour of a vector borne disease model
6. to calculate and explain the sensitivity analysis of a
dynamical system
7. to detect a type of bifurcation that appears from an
epidemiological model
Content 1. Exponential growth, logistic growth, logistic growth with

Allee effect and logistic growth with fear factor model
2. Competing species models
3. Predator prey model
4. The SIR model with demography
5. Vector-borne disease model
6. Sensitivity analysis of a dynamical system
7. Bifurcation analysis on an epidemiological model

2
2. Homework (15%).
total mark.
Mark Grade
85—100 A
80—<85 A-
75—<80 B+
70—<75 B
65—<70 B-
60—<65 C+
55—<60 C
40—<55 D
<40 E
Reading list 1. Maia Martcheva, Texts in applied mathematics (Vol. 61) :

An introduction to mathematical epidemiology, Springer-
New York, 2015.
2. Richard Haberman, Mathematical models: mechanical
vibrations, population dynamics, and traffic flow, SIAM-
Philadelphia, 1998.

Module Handbook 2

Uploaded by

Copyright:

Available Formats

You might also like

Module Handbook 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module Handbook 2

Uploaded by

Copyright:

Available Formats

MODULE

Faculty of Mathematics and Natural Sciences

Module designation Introduction to Data Science

Semester(s) in which the 1

Person responsible for the Sarini Abdullah

Relation to curriculum Compulsory

Credit points 2 SKS (3.18 ECTS)

Required and recommended No pre-requisites

Content 1. Introduction to big data and data science: history and

Examination forms Post-tests : multiple-choice questions, Mid- and final-exams :

Reading list 1. Baesens, B. (2014). Analytics in a big data world: The

Module designation Logic and Set

Semester(s) in which the 1

Relation to curriculum Compulsory

Workload (incl. contact Total workload: 170 minutes

Credit points 3 SKS (4.77 ECTS)

Required and recommended Linear Algebra, Algorithm and Programming, Discrete

2. Set, properties of set and operation on set

3. Predicate and quantifier

4. Predicate logic (inference rule)

5. Technique of proofing (direct and indirect proof, proof by

contradiction, mathematical induction)

Examination forms Essay, multiple choice

Study and examination The final mark will be weighted as follows:

Module designation Calculus 1

Semester(s) in which the 1

Person responsible for the Dr. Hengki Tasman

Relation to curriculum Compulsory

Teaching methods lecture, lab works

Workload (incl. contact (Estimated) Total workload: 9 hours/week x 14 weeks + 5.5

Credit points 3 SKS (4.77 ECTS)

Required and recommended -

Content 1. Real number, inequalities, absolute value, Cartesian

Study and examination The final mark will be weighted as follows:

Reading list (resources) 1. Varberg, Dale; Edwin J. Purcell; Steven E. Rigdon.

Module designation Elementary Linear Algebra

Semester(s) in which the 1

Person responsible for the Dra. Siti Aminah, M.Kom.

Relation to curriculum Compulsory

Teaching methods Lecture, lab works

Workload (incl. contact (Estimated) Total workload: 6 hours/week x 14 weeks + 3.67

Credit points 2 SKS (3.18 ECTS)

Required and recommended -

Content 1. Introduction to System of Linear Equations

Examination forms 1. Class activities : Quiz (written and computer-based),

Reading list 1. Anton, Howard; Chris Rorres, Elementary Linear Algebra,

Module designation Algorithm and Programming

Semester(s) in which the 1

Person responsible for the Gatot F. Hertono

Relation to curriculum Compulsory

Teaching methods Flipped learning and computer lab works

Workload (incl. contact (Estimated) Total workload: 9 hours/week x 14 weeks + 5.5

Credit points 3 SKS (4.77 ECTS), including lab works

Required and recommended -

Examination forms Essay

Study and examination Requirements for successfully passing the module:

Reading list Compulsory:

Semester(s) in which the 1st semester