This course is projected to provide students with three fundamental area’s such as (a) Basic concepts of computer graphics on rendering, and polygonal meshes, (b) Basic theories and methods of the bezier curves and surfaces, and (c) Basic concepts and functions of shading, lighting, and texture algorithms.
This course covers the basic concept in computer graphics. It covers basic knowledge related to computer graphics from the hardware and software aspects. It includes graphics devices, image transformations in 2D and 3D, projection, geometric modelling, bezier curves and surfaces, shading, lighting, texture algorithms, and interactive programming.
This course provides an introduction to the principles of computer graphics. In particular, this course focus on the theoretical aspects and implementation of computer graphics through 3D graphics Application Programming Interfaces. Design and develop methods of modelling polygons, UV texture and shading, shadows and illumination, and rendering will be introduced. The methods are typically used to interact with graphics processing unit (GPU) to create computer graphics.
This course will cover abstractions and implementation techniques for the construction of distributed systems, including programming tools, basic principle, consistency, common schemes, comparison, fault tolerance problem, existing methods, future trend, parallel computation models, computation methods, parallel programming environment, security problem, and schemes
This course covers the fundamentals of multimedia technology and multimedia design application. It lays the foundation for the theoretical, conceptual, and technical development of multimedia. Thank you.
CST207 Design and Analysis of Algorithms 2024/04
Mohammed N. M. Ali
CST402 ARM Assembly Language
2024/04 Mohammed N. M. Ali
This course is concerned with providing the students with a firm theoretical basis for compiler construction and sound engineering principles for selecting alternate methods and implementing them. It mainly focuses on the theory and techniques of the construction of a compiler, covers the major parts of a compiler, including lexical analysis, syntax analysis, parser generators, abstract syntax, symbol tables, semantic analysis, intermediate languages, code generation, code optimization, run-time storage management, error handling.
This course covers fundamentals of discrete linear systems, discrete time Fourier transform, Z transform, digital filter, finite impulse response filter, infinite impulse response, and Fourier transform.
This course covers the introductory concepts of database such as data modelling, entities relationship diagram and covers the basic rules of Structured Query Language (SQL). The course also emphasizes the understanding of the fundamentals of relational systems and database manipulations. The course also provides an understanding of process and procedure of database and trends such as data warehousing and data mining. The course uses a problem-based approach to learning.
This course provides a thorough introduction to the C programming language. It will cover basic syntax, grammar and topics . It aims to impart the practical programming techniques to the students.
This course introduces computer organization looking at data representation, computer arithmetic, instruction of set architecture, data-path and control, memory organization, I/O, communications, and trends in computer architecture. In addition we will build a virtual computer from basic components up to a working architecture that can be programming in machine code.
This course provides an introduction to the principles of computer graphics. In particular, this course focus on the theoretical aspects and implementation of computer graphics through 3D graphics Application Programming Interfaces. Design and develop methods of modelling polygons, UV texture and shading, shadows and illumination, and rendering will be introduced. The methods are typically used to interact with graphics processing unit (GPU) to create computer graphics.
This course is a survey of fundamental data structures for information processing, including lists, stacks, queues, trees, and graphs. It explores the implementation of these data structures (both array-based and linked representations) and examines classic algorithms that use these structures for tasks such as sorting, searching, and text compression. The C programming language is used to demonstrate the topics discussed; and key notions of object-oriented programming, including encapsulation and abstract data types, are emphasized.
Lecturer Name: Dr. Lutfun Nahar
Course timeline: 2024/04