Syllabus DS B2 Version August22
Syllabus DS B2 Version August22
Second year
GENERAL INFORMATION
DESCRIPTION
ASSESSMENT/EVALUATION
59
Mid-term test 20 Writing exam
Final exams 70 Writing exam
MAIN CONTENTS
Contact hours
No. Contents
Lecture Exercise Practical
Topic 1: Project Introduction
1 Project definition, Project classification, 3
Project –Notable Examples
Topic 2: Project management Basics
60
INTELLECTUAL PROPERTY MANAGEMENT
GENERAL INFORMATION
DESCRIPTION
61
Considering the most important element for IP management,
CO4
the IP policy;
62
CL0 search scientific information and patent on online databases
9
ASSESSMENT/EVALUATION
63
devices into the examination
room)
Total 100%
MAIN CONTENTS
Contact hours
N Contents
o. Lecture Exercise Practical
Introduction to intellectual property
and its associated rights
▪ Ideas
1 ▪ IP and its associated rights 2
▪ Managing IP
▪ What are ways of granting permission
to use IP and/or IPRs?
World intellectual property scene
▪ Treaty and convention
▪ Paris Convention for the Protection of
Industrial Property
▪ Berne Convention for the Protection of
Literary and Artistic Works
▪ General Agreement on Tariffs and
Trade (GATT)
▪ Trade-related Aspects of Intellectual
2 Property Rights (TRIPs) 2
▪ Patent Cooperation Treaty (PCT)
▪ Madrid Agreement Concerning the
International Registration of Marks
▪ International Union for the Protection
of New Varieties of Plants – UPOV
Convention
▪ World Intellectual Property
Organization (WIPO)
▪ World Trade Organization (WTO)
Protecting intellectual property
▪ Vietnamese laws and regulations
governing IPRs
3 3
▪ Patents
▪ Copyrights
▪ Trademarks
64
▪ Trade secrets
▪ Plant variety protection
Intellectual property policy
▪ Why an IP policy is important?
4 ▪ What are major components of an 3
institutional IP policy?
▪ How to write an institutional IP policy
An intellectual property management
office
▪ Why have an IP management office?
▪ What does an IP management office
do?
▪ Setting up an IP management office –
major areas
5 2
▪ What’s needed to establish a good IP
management office?
▪ Established IP management office
activity
▪ Value of IP and technology transfer
▪ What’s not needed by a good IP
office?
Intellectual property agreements
▪ Why have IP agreements?
▪ What type of IP agreements should be
used?
▪ Confidential disclosure agreement
6 ▪ Material transfer agreement 3 1 1
▪ Research agreement
▪ Cooperative/inter-institutional
agreement
▪ License agreement
▪ Negotiation exercise
How to search patents on selected
databases
▪ US Patent and Trademark Office
(USPTO)
7 0.5 1 1
▪ European Patent Office (Espacenet)
▪ WIPO
▪ National Office of IP (NOIP) of
Vietnam
How to write and keep a laboratory
9 0.5
notebook
65
Total 16 2 2
66
FRENCH 2.1
GENERAL INFORMATION
DESCRIPTION
ASSESSMENT/EVALUATION
67
Percentage (%) Type
Attendance, Participation
Attendance/Attitude 20
Homeworks
Exercise 0
MAIN CONTENTS
Contact hours
No. Contents
Lecture Exercise Practical
1.1 Lesson 0 1
1
1.2 Lesson 1 2
2.1 Lesson 1 2
2
2.2 Lesson 2 1
3 3.1 Lesson 2 3
4 4.1 Lesson 2 1
5 4.1 Lesson 3 2
5.1 Lesson 3 2
6 5.2 A short stop for ... (French culture and 1
civilisation contents) Lesson 4
6.1 A short stop for ... (French culture and 2
7 civilisation contents) Lesson 4 1
6.2 Know-how Unit 1
8 7.1 Lesson 5 3
8.1 Lesson 5 2
9
8.2 Lesson 6 1
10 9.1 Lesson 6 3
10.1 Lesson 6 1
11 10.2 Midterm Test 45’
10.3 Lesson 7 1
12 11.1 Lesson 7 3
13 12.1 Lesson 7 1
68
12.2 Lesson 8 2
14 13.1 Lesson 8 3
14.1 Know-how Unit 2 1
15
14.2 Lesson 9 2
16 15.1 Lesson 9 3
17 16.1 Lesson 10 3
17.1 Lesson 10 2
18
17.2 Lesson 11 1
19 18.1 Lesson 11 3
19.1 Lesson 11 2
20 19.2 A short stop for ... (French culture and 1
civilisation contents) Lesson 12
20.1 A short stop for ... (French culture and
civilisation contents) Lesson 12 1
21 20.2 Know-how 2
20.3 Evaluation
20.4 Q/R
22 Final Test 4
69
FRENCH 2.2
GENERAL INFORMATION
DESCRIPTION
ASSESSMENT/EVALUATION
MAIN CONTENTS
Contact hours
No. Contents
Lecture Exercise Practical
1.1. Unit 4 3
1
1.2. Lesson 13
2 2.1. Lesson 13 3
3 3.1. Lesson 14 3
4 4.1. Lesson 14 3
5 5.1. Lesson 15 3
6 6.1. Lesson 15 3
7.1. A short stop for ... (French culture and 3
7 civilization contents) Lesson 16
7.2. Know-how
8 8.1. Unit 5 Lesson 17 3
9.1. Lesson 17 2
9
9.2. Lesson 18 1
10 10.1. Lesson 18 3
11.1. Lesson 18 1
11
11.2. Lesson 19 2
12 12.1. Lesson 19 3
13.1 Lesson 20 A short stop for ... (French 2
13
culture and civilization contents) 1
71
13.2. Know-how
14.1. Midterm Test 1
14
14.2. Unit 6 Lesson 21 2
15 15.1. Lesson 21 3
16 16.1. Lesson 22 3
17.1. Lesson 22 2
17
17.2. Lesson 23 1
18 18.1. Lesson 23 3
19.1. Lesson 23 1
19 19.2. Lesson 24 A short stop for ... (French 2
culture and civilization contents
20.1. Evaluation 2 1.5
20
20.2. Revision/QR sur le 1.5
21 Final Test 4
72
PROBABILITY
GENERAL INFORMATION
In English: Probability
Course Title
In Vietnamese: Xác suất
Course Code DS2.004 Credit points (ECTS) 3
Requirement Required
Prerequisites Calculus I, Calculus II
Lecture 18 hrs
Exercises 18 hrs
Time Commitment
Practical 0 hrs
Total 36 hrs
DESCRIPTION
ASSESSMENT/EVALUATION
73
Mid-term exam 30%
Final exam 70%
MAIN CONTENTS
No. Hours
L
Contents e E P
c x r Resources
t r. c.
.
0 02
1 - Discrete probability distributions [1, Chapter 1]
2
0 02
2 Continuous probability densities [1, Chapter 2]
2
0 02
3 Conditional probability [1, Chapter 4]
2
0 02
4 Distribution and densities [1, Chapter 5]
2
0 02
5 Expected value and variance [1, Chapter 6]
2
0 02
6 Law of large numbers [1, Chapter 8]
2
0 02
7 Central limit theorem [1, Chapter 9]
2
Probability with simulation: random numbers 0 02
8 [2, Part II]
& Discrete distribution 2
Probability with simulation: Continuous 0 02
9 [2, Part III]
distribution, Law and central limit theorem 2
Reference Literature:
74
75
NUMERICAL METHOD
GENERAL INFORMATION
DESCRIPTION
76
ASSESSMENT/EVALUATION
LU decomposition
6.1 Eigenvalues and eigenvectors
6 2 2
6.2 LU decomposition
6.3 Decomposition with pivot
77
7 Curve fitting 1 1
Linear Programming
8 8.1 Standard forms and duality 1 1
8.2 Simplex method
Numerical Differentiation and Integration
9.1 Numerical Differentiation
9 2 3
9.2 Numerical Integration
9.3 ODE
78
DATA STRUCTURES AND ALGORITHMS
GENERAL INFORMATION
Total 36 hrs
DESCRIPTION
ASSESSMENT/EVALUATION
MAIN CONTENTS
No. Hours
L
Contents P Resources
e E
r
ct xr.
c.
.
1 Basic Programming Concepts in C++ 2
2 Elementary Data Structures 2
3 Abstract (Linear) Data Types I 2 2
4 Abstract (Linear) Data Types II 2 2
5 Recursive Algorithms 2 2
6 Trees 2 2
Sorting Algorithm I
7 2 2
Sorting Algorithm II
8 2 2
Searching Algorithm
9 2 2
80
Graphs
10 2 2
OBJECT-ORIENTED PROGRAMMING
GENERAL INFORMATION
Total 40 hrs
DESCRIPTION
81
programming language. The topics covered include: objects
and classes, encapsulation, inheritance, polymorphism,
abstraction, interfaces, exception handling, and input/output
streams.
[1] Kathy Sierra, Bert Bates, Head First Java, 2nd Edition,
O' Reilly, 2005
Textbooks
[2] Deitel & Deitel, Java How to Program, 9th Edition,
Prentice Hall, 2011.
ASSESSMENT/EVALUATION
82
Interfaces
9 2 1
Exceptions
10 2 1
Data structures
11 2 1
I/O Streams
12 2 1
Principles of object-oriented design
13 3 1
Assignment 2 presentation
14 3 1
Reference Literature:
[1]. Kathy Sierra, Bert Bates, Head First Java, 2nd Edition, O' Reilly, 2005.
[2]. Deitel&Deitel, Java How to Program, 9th Edition, Prentice Hall, 2011.
[3]. Java™ Platform, Standard Edition 7 API Specification,
[Link]
83
FUNDAMENTALS OF DATABASES
GENERAL INFORMATION
Total 36 hrs
DESCRIPTION
84
[2] Database Systems: A Practical Approach to Design,
Implementation, and Management (6th Edition). Thomas
Connolly and Carolyn Begg. Addison-Wesley, 2014.
ASSESSMENT/EVALUATION
85
[1]. Database Systems: Design, Implementation, and Management (11st Edition).
Carlos Coronel,Steven Morris. Cengage Learning, 2014
[2]. Database System Concepts (6th Edition). Avi Silberschatz, Henry F. Korth, S.
[Link]-Hill, 2010
GENERAL INFORMATION
Total 30 hrs
DESCRIPTION
86
[2] Machine Learning by Thomas M. Mitchell
ASSESSMENT/EVALUATION
MAIN CONTENTS
No Hours
. L
E P Resour
Contents e
x r ces
c
r c
t
. .
.
Introduction
1 3
● Introduction to machine learning
Linear Regression
2 • Linear Regression problem, 5 3
• Gradient descent and normal equation algorithm
Logistic Regression
3 • Logistic Regression problem 4 3
• Gradient descent and Newton method
Regularization
4 • Under fitting, over fitting problem 3
• Regularization technique
Data usage and model evaluation
• Data usage: training, validation, testing and cross-
5 validation 3
• How to evaluate a machine learning model with various
evaluation metrics?
Artificial neural network
6 • Artificial neural network 3 3
• Back propagation technique
87
SIGNAL AND SYSTEMS
GENERAL INFORMATION
Total 36 hrs
DESCRIPTION
88
ASSESSMENT/EVALUATION
MAIN CONTENTS
No Hours
. L
E P Resource
Contents e
x r s
c
r c
t
. .
.
1 Signals, Systems, Operation/Transformations 1 1
2 Discrete time LTI system 1 1
3 Continuous LTI system 2 1
4 Properties of LTI system, Frequency Response 2 1
5 Fourier Series of Continuous-Time Periodic Signals 2 2
6 Fourier Series of Discrete-Time Periodic Signals 2 2
7 Continuous-time Fourier Transform 2 2
8 Fourier Transform: signals & systems 2 2
9 Discrete-time Fourier Transform 2 2
10 Sampling Theorem, Reconstruction/Interpolation 2 2
11 Review 1
12 Octave Introduction 1
Reference Literature:
[1] Signals and Systems [2nd Edition] by Alan V. Oppenheim and Alan S. Willsky
89
[2] Linear Systems and Signals [2nd Edition] by B. P. Lathi
90
ADVANCED PROGRAMMING WITH PYTHON
GENERAL INFORMATION
hrs
Tutorial
40 hrs
Total
DESCRIPTION
91
[2] Burkhard A. Meier, “Python GUI Programming Cookbook:
Use recipes to develop responsive and powerful GUIs using
Tkinter, 2nd Edition”, Packt Publishing, ISBN 978-
1787129450, 2021.
ASSESSMENT/EVALUATION
MAIN CONTENTS
No. Hours
L
Contents e E P
c x r Resources
t r. c.
.
1 Introduction to Python Programming 3 0
2 The Python Language 3 2
3 OOP in Python 6 2
4 Module and Package 3 1
5 Files and Directories 3 1
6 Multi Processing 3 1
7 Multi Threading 3 1
8 Graphical User Interface 6 2
92
ALGEBRAIC STRUCTURES
GENERAL INFORMATION
Total 36 hrs
DESCRIPTION
93
analysis. The algebraic part helps the learners to conquest the
mathematical basics of computer sciences in the semi groups,
groups, ring, relations, field’s terminologies and application in
daily using.
[1] W. F. Trench, Introduction to real analysis (Available
online)
Textbooks
[2] Milner, Group theory, Lecture notes, 2003 (Available
online for personal use)
ASSESSMENT/EVALUATION
94
B. Curvilinear integrals
- Parameterizations of the curve.
- The first kind of curvilinear integrals: in the relation with
the length element.
- The second kind of curvilinear integrals: the orientation,
Green formula.
- Method of re-parameterizations.
C. Surface integrals
- Several parameterizations of the surface.
- The area as the integral element for the 1-st kind integral.
- The differential form in 2-nd kind integral.
- Orientation’ influence on the sign of integrals.
- The Gauss formula.
- The Stokes theorem.
1.4. Applications: 2 2
- The graphing computerizing illustrations: Explanation of
4
graphs, dragging mode while graphing, understanding the role
of parameters, exploring the curves and special surfaces.
Topic 2: Algebraic structures
2.1. Basic definitions 2 2
- Groups, subgroups
- Order
5
- Cyclic groups
- Cossets
- Normal subgroups
2.2. Semi groups as the flows 2 2
- Free semi groups.
6
- Generators and relations.
- Finitely presented groups.
2.3. Groups acting on the sets 2 2
7 - Permutations.
- The Todd-Coxeter algorithm.
2.4. Computer algebra: algebra of the polynomials, power 2 2
series, rational functions
- Rings and Fields
- Divisibility and Factorization of the domains.
8
- Euclidean algorithm.
- Quotient Field and Rational functions.
- The data structures for the polynomials, rational
functions and power series
95
Reference Literature:
[1]. [Link], [Link]: Multivariable calculus, 1997.
[2]. W. F. Trench, Introduction to real analysis (Available online)
[3]. Milner, Group theory, Lecture notes, 2003 (Available online for personal
use)
[4]. Gedder et al., Algorithms for computer algebra, Kluwer Academic
Publishers, 1992.
STATISTICS
GENERAL INFORMATION
In English: Statistics
Course Title In Vietnamese: Thống kê
Credit 3
Course Code DS2.005 points
(ECTS)
Requirement Required
- Calculus I, Calculus II
Prerequisites
- Probability
Lecture 18 hrs
Exercises 18 hrs
Time
Commitment Practical 0 hrs
Total 36 hrs
DESCRIPTION
96
[2] R.V. Hogg, E.A. Tanis and D.L. Zimmerman.
Probabilityand StatisticalInference. 9th ed.p. cm. ISBN 978-
0-321-92327-1
[3] R.V. Hogg, J.W. McKean, A. T. Craig. Introduction to
mathematicalstatistics. 7th ed. p. cm. ISBN 978-0-321-
79543-4
ASSESSMENT/EVALUATION
97
[1] G. [Link] for Management and Economics [Link]-Western
Cengage Learning, 2011.
[2] R.V. Hogg, E.A. Tanis and D.L. Zimmerman. Probability and StatisticalInference.
9th ed.p. [Link] 978-0-321-92327-1
[3] R.V. Hogg, J.W. McKean, A. T. Craig. Introduction to mathematical statistics. 7th
ed. p. cm. ISBN 978-0-321-79543-4
GENERAL INFORMATION
Total 30 hrs
DESCRIPTION
98
Understand prerequisites of using recent AI
CO4
frameworks (tools)
CLO
Describe fundamental background on AI
1
Course learning
CLO Use recent AI frameworks to analyze real-world
outcomes (CLO)
2 problem in which AI is currently applied
The course will introduce students to the main foundational
concepts and techniques used in Artificial Intelligence (AI),
including representation, search, inference, and machine
learning. The course will present a range of real-world
Course Description applications in which AI is currently used. Students will be
introduced to the history of AI, as well as the potential future
of a world in which AI is commonplace. Students will engage
in hands-on exercises to get a feel for AI techniques. This
course is required for students
(1) Russell, Stuart J Norvig, Peter. Artificial Intelligence: A
Modern Approach. Prentice Hall. 4th edition. 2020.
Textbooks
(2) Winston, Patrick Henry. Artificial Intelligence. Addison-
Wesley, 3rd edition. 1992.
ASSESSMENT/EVALUATION
99
- Concepts in AI (concept of intelligence, 3
2
Turing test, knowledge representation ...)
- Approaches to AI: search, logic - expert 3
3 system, statistics, classical machine
learning, deep learning
4 - Approaches to AI: deep learning 3
- Narrow, General and Strong AI - future of 3
5 AI
- Explanable AI (xAI) 3
8 - Ethics of AI Ethics of AI (philosophy,
ethics, culture, law, policy,...)
- Experience using and developing artificial 3
intelligence systems based on available
9
platforms
100
IMAGE PROCESSING
GENERAL INFORMATION
Total 36 hrs
DESCRIPTION
101
[1] Solomon, Chris, and Toby Breckon. Fundamentals of
Digital Image Processing: A practical approach with
Textbooks examples in Matlab. John Wiley & Sons, 2011.
[2] Petrou, Maria, and Costas Petrou. Image processing: the
fundamentals. John Wiley & Sons, 2010.
ASSESSMENT/EVALUATION
MAIN CONTENTS
No. Hours
L
Contents e E P Resources
c x r
t r. c.
.
1 Course Introduction 2
- Introduction to Matlab for Image 2
2
Processing
3 - Color Representation 3 1
4 - Image transform 3 2
5 Assignment Presentation 1 3 2
6 Point Processing 3 2
7 Spatial filtering 3 2
8 - Edge detection 3
102
9 Mathematical morphology 3
10 - Assignment Presentation 2 2
GENERAL INFORMATION
Total 36 hrs
DESCRIPTION
103
[1] Hastie, Trevor; Tibshirani, Robert; Friedman, Jerome
(2009). "The Elements of Statistical Learning: Data
Textbooks Mining, Inference, and Prediction".
[2] C.M. Bishop, “Pattern Recognition and Machine
Learning (2006) “, Springer
ASSESSMENT/EVALUATION
104
SOFTWARE ENGINEERING
GENERAL INFORMATION
Lecture 24 hrs
Exercises 0 hrs
Time
Commitment Practical 12 hrs
Total 36 hrs
DESCRIPTION
105
Distinguish between different types and levels of
CLO
testing (for instance, unit, integration, systems, and
6
acceptance) for medium-size software products
CLO Discuss various testing techniques such as white box
7 and black box testing
Discuss key principles and common methods for
CLO
software project management such as scheduling, size
8
estimation, cost estimation and risk analysis
CLO Get familiar with CASE tools and/or environments
9 including UML drawing tools and IDEs
This course will study a collection of methods which embody
an engineering approach for software development. We will
discuss the nature of software and software projects, software
development models, software process maturity. We will study
methods for analysis, design, testing, and implementation of
Course Description
large, complex software systems. We will inquire into the
various perspectives on software quality - what it means, how
to measure it, how to improve it. Moreover, though group
projects, students can obtain hands-on experiences on entire
phases and workflow of the software process.
[1]. Software Engineering, Ian Sommerville, 8th Edition,
Textbooks
Addison Wesley Press, 2007
ASSESSMENT/EVALUATION
106
MAIN CONTENTS
No. Hours
L
Contents e E P Resources
c x r
t r. c.
.
Course introduction – Background 2
1 information – Introduction to software
engineering
- Socio-Technical Systems - Critical 2 2
2
Systems
3 - Software Processes 2 2
- Software Requirements and 2 2
4
Requirements Engineering Processes
5 System Models 2 2
6 Critical Systems Specification 2 2
Design Principles and Architectural 2 2
7
Design
8 User Interface Design 2 2
9 Implementation 2 2
10 Verification, Validation, and Testing 2 2
107
FUNDAMENTAL OF OPTIMIZATION
GENERAL INFORMATION
DESCRIPTION
108
[1] G.H. Hurlbert. Linear Optimization. The Simplex
Worldbook. Springer Undergraduate Texts in Mathematics
Textbooks 2010.
[2] [Link], Introduction to Nonlinear Optimization, Theory,
Algorithms and Applications with Matlab, SIAM 2014.
ASSESSMENT/EVALUATION
109
● Basis algorithms: steepest-descent
method, Newton’s method
Software
3.3 Constrained Optimization 3 2
● Karush-Khun-Tucker Conditions
7 [2, Chapter 9-10]
(KKT)
Methods and Software
110
APLLIED STATISTICS AND EXPERIMENTAL DESIGN
GENERAL INFORMATION
hrs
Tutorial
36 hrs
Total
DESCRIPTION
111
[2] Douglas C. Montgomery. Design and Analysis of
Experiments. 8th ed Wiley, 2012.
ASSESSMENT/EVALUATION
MAIN CONTENTS
N Hours
o. L E
Contents P
e x Resources
r
c r
c.
t. .
Introduction to experimental design and Review 2 2
1 [1, Chapter 1]
Statistics
2 Experiments with a single factor (I) 2 2 [1, Chapter 2]
3 Experiments with a single factor (II) 2 2 [1, Chapter 2]
4 Randomized block design 2 2 [2, Chapter 4]
5 Experiments with two or more factors 2 2 [1, Chapter 3]
6 Factorial design at two levels (I) 2 2 [1, Chapter 4]
7 Factorial design at two levels (II) 2 2 [1, Chapter 4]
8 Fractional factorial design (I) 2 2 [1, Chapter 5]
9 Fractional factorial design (II) 2 2 [1, Chapter 5]
Reference Literature:
[2] Douglas C. Montgomery. Design and Analysis of Experiments. 8th ed Wiley, 2012.
112