Page 293 - 2024.2025 - 澳門理工大學學士學位課程手冊 (電子書)

ENGLISH

Code Module Credits Duration Prerequisite(s)
Elective Subjects - Group B (Cont.)

CSAI0121 Theory of Computation 3 45 hrs MATH1113,
COMP2112
This module provides a foundation of computation which is required for further computer
science modules. Topics which will be studied include: 1) Deterministic Finite Automata, 2)
Nondeterministic Finite Automata, 3) Regular Expressions, 4) Context-free Grammars, 5)
Pushdown Automata, 6) Pumping Lemma, 7) Turing Machine, 8) Decidable Languages, 9)
Undecidable Languages, and 10) Computational Complexity. Furthermore, computer science
related fields such as AI and its applications will be introduced and discussed.
CSAI0122 Graphics and Virtual Environments 3 45 hrs ---
Computer graphics are an intrinsic component of many modern software applications and
are often essential to the success of these applications. The objective of this learning model
is to familiarize students with fundamental algorithms and data structures that are used in
today’s interactive graphics systems as well as the programming and architecture of high-
resolution graphics computers. The principles and practice of computer graphics are
described from their mathematical foundations to the modern applications domains of
scientific visualization, virtual reality, computer games, and film animation. The model covers
fundamental topics such as graphical representations and transformations, the viewing
pipeline, visibility, lighting, and textures, as well as more advanced areas such as ray tracing
and global illumination.
CSAI0123 Numerical Optimization 3 45 hrs ---
This learning module provides an overview of the important topic of numerical optimization.
In this introductory-level module, we will cover the basic concepts of optimization, numerical
method techniques, key algorithms, and their applications in AI. Topics covered include: i)
Basic concepts in optimization. ii) Numerical Differentiation and Integration. iii) Common
optimization methods, e.g., First-Order methods and Second-Order methods. iv)
Applications, e.g., root-finding and regressions.

Remarks:
* Each credit includes at least 15 lecture hours.
** Students should perform 45 hours of internship as required.

286