Home Show ALL papers in Database

+ ----- CS Course Description ----- +

COMP Course ELEC Course LANG Course MATH Course

+ COMP Courses: +

COMP 001 Academic and Professional Development I [0 credit]

A compulsory one-year course for Computer Science students. This course is designed to provide academic advising to students and to develop their communication skills in interacting with technical and non-technical audiences. Graded P or F.

COMP 002 Academic and Professional Development II [0 credit]

Continuation of COMP 001. A compulsory, one-year course for Computer Science students. Graded P or F.

COMP 003 Academic and Professional Development III [0 credit]

Continuation of COMP 002. A compulsory, one-year course for Computer Science students. Graded P or F.

COMP 099 Industrial Training [0 credit]

For Computer Science students only. A practical training course for a period of four to five weeks. Topics may include basic computer architecture and maintenance, UNIX system and network administration, Windows NT system administration, and safety. Graded P or F.

COMP 101 Computing Fundamentals [2-0-2:3]

Introduction to computers and computing tools primarily for non-Engineering students. Computer hardware and software, data communications. Window managers, word processing, electronic mail, spreadsheets, presentation graphics, database management, statistical analysis.
Exclusions: ISMT 101; any COMP course

COMP 102 Computer and Programming Fundamentals I [3-0-2:3]

Introduction to computers and programming. Computer hardware and software. Problem solving. Program design. Procedural abstraction. Debugging and testing. Simple and structured data types. Recursive programming. Introduction to searching and sorting.
Exclusions: COMP 104, COMP 105 (prior to 98-99)

COMP 103 Computer and Programming Fundamentals II [2-0-1:2]

Programming techniques and introduction to object-oriented programming. Classes and objects. Data encapsulation and information hiding. Abstract data types. Pointers and linked data structures. Recursive data structures. Searching and sorting.
Exclusions: COMP 104, ISMT 223 Prerequisite: COMP 102 or COMP 105 (prior to 98-99)

COMP 104 Programming Fundamentals and Methodology [3-1-2:5]

Structured programming and introduction to object-oriented programming. Problem solving. Program design. Procedural abstraction. Debugging and testing. Recursive programming. Classes and objects. Abstract data types. Linked data structures. Searching and sorting.
Exclusions: COMP 102, COMP 103, COMP 105 (prior to 98-99), ISMT 223

COMP 109 Supplementary Programming Laboratory [0-0-2:0]

Supplementary programming laboratory sessions for students in COMP 104 without sufficient prior programming experience. Graded P or F.
Exclusions: Grade B or above in HKCEE Computer Studies; grade D or above in HKALE Computer Studies Corequisite: COMP 104

COMP 111 Software Tools [2-0-2:3]

Using, primarily, the UNIX environment and shell programming techniques as a platform for developing software tools. Laboratory exercises will also give hands-on practice with tools that increase programmer productivity such as document preparation tools, window managers and Internet facilities.
Exclusion: COMP 211 Prerequisite: COMP 102 or COMP 104

COMP 151 Object-Oriented Programming [3-0-2:3]

Object-oriented programming concepts and techniques. Software reuse. Classes, objects, and methods. Abstract data types. Object creation and initialization. Message passing. Class hierarchies and inheritance. Polymorphism. Templates and algorithm abstraction.
Exclusion: COMP 251 (prior to 1999-2000) Prerequisite: COMP 103 or COMP 104

COMP 171 Data Structures and Algorithms [3-2-0:3]

Asymptotic notations. Performance measurement. Sorting and searching: algorithms and lower bound. Abstract data types and classes. Data structures: heaps, search trees, tries, and hashing. Graphs: representation, depth-first-search, and breadth-first-search.
Exclusion: ISMT 227 (prior to 2000-01) Prerequisite: COMP 103 or COMP 104

COMP 180 Computer Organization [3-0-1:3]

Inner workings of modern digital computer systems and tradeoffs at the hardware-software interface. Topics include: instructions set design, memory systems, input-output systems, interrupts and exceptions, pipelining, performance and cost analysis, assembly language programming, and a survey of advanced architectures.
Exclusion: ELEC 152 Prerequisite: COMP 102 or COMP 104.

COMP 201 Java Programming [3-0-1:3]

[Previous Course Codes: COMP 300T, COMP 300W]
Introduction to Java programming. Fundamentals include language syntax, object-oriented programming, inheritance, polymorphism, exception handling, multithreading. Standard libraries for input / output, graphics programming, built-in data structures. Application programming interface and foundation class library.
Exclusion: ISMT 232 Prerequisite: COMP 151 or COMP 251 (prior to 1999-2000)

COMP 211 Introduction to Software Engineering [3-1-1:3]

Methods and tools for planning, designing, implementing, validating, and maintaining large software systems. Project work to build a software system as a team, using appropriate software engineering tools and techniques.
Exclusion: ISMT 221 Prerequisites: COMP 151 and COMP 171

COMP 221 Fundamentals of Artificial Intelligence [3-1-0:3]

Foundations underlying design of intelligent systems. Relations between logical, statistical, cognitive, biological paradigms; basic techniques for heuristic search, theorem proving, knowledge representation, adaptation; applications in vision, language, planning, expert systems.
Prerequisite: COMP 171

COMP 231 Database Management Systems [3-1-1:3]

Principles of database systems; conceptual modeling and data models; logical and physical database design; query languages and query processing; database services including concurrency, crash recovery, security and integrity. Hands-on DBMS experience.
Exclusion: ISMT 226 Prerequisite: COMP 171

COMP 241 Human-Computer Interaction [3-0-1:3]

Humans, computers, and interactions between them; input devices; usability; style; visual and auditory displays; user-centered design; models of the user interface; user testing.
Prerequisite: COMP 171 or ISMT 227 (prior to 2000-01)

COMP 251 Principles of Programming Languages [3-0-1:3]

Comparative studies of programming languages, programming language concepts and constructs. Non-imperative programming paradigms: object-oriented, functional, logic, concurrent programming. Basic concepts of program translation and interpretation. Storage allocation and run-time organization.
Prerequisites: COMP 151 and COMP 171

COMP 252 Principles of Systems Software [3-0-2:3]

Principles, purpose and organization of systems software; processes, tasks, scheduling, interprocess communication, synchronization, mutual exclusion; memory management; device management; file systems, security and protection, multi-CPU systems, computer networking and distributed computing.
Prerequisites: COMP 180/ELEC 152; and one of COMP 102, COMP 103 or COMP 104

COMP 271 Design and Analysis of Algorithms [3-1-0:3]

Time and space complexity analysis of algorithms. Design paradigms: divide-and-conquer, greedy algorithms, dynamic programming. Graph algorithms: searching and backtracking, connectivity, biconnectivity, minimum spanning tree, shortest path. NP-completeness.
Prerequisite: COMP 171

COMP 272 Theory of Computation [3-1-0:3]

Introduction to automata, formal languages, and computability. Set theory and countability. Finite automata and regular languages. Pushdown automata and context-free languages. Turing machines. Church's thesis. Halting problem. Uncomputability.
Prerequisites: COMP 171, MATH 111/113/152, and MATH 132

COMP 300 Special Topics in Computer Science [1-4 credit(s)]

Selected topics of current interest to the Department not covered by existing courses. Offerings are announced each semester.

COMP 303 Internet Computing [2-0-2:3]

[Previous Course Code: COMP 300X]
Technologies and standards for World Wide Web (WWW), user interfaces and Browsers, authoring tools, Internet protocols, Internet servers, database connectivity, Robots, Search engines, server-side programming, client-side programming, security and privacy, recent advances.
Prerequisite: COMP 251

COMP 322 Intelligent Robotic Systems [3-0-2:3]

Fundamentals in robot configurations; kinematics; robot programming languages; and robot vision. Introduction to the intelligent integration of sensors, robots and systems to achieve specific tasks.
Background: Basic knowledge in linear algebra

COMP 327 Introduction to Pattern Recognition [3-1-0:3]

Fundamentals of pattern recognition. Bayes decision theory. Parametric and non-parametric classifiers. Feature extraction and selection techniques. Pattern recognition applications. Project work to build a pattern recognition system.
Prerequisites: COMP 171 and MATH 241/244/246.

COMP 332 Principles of Database Design [3-1-0:3]

Data modeling concepts; conceptual, logical and physical design; analyzing, evaluating and improving schemas; schema documentation and maintenance; functional analysis; design tools; schema mappings; database tuning; distributed database design.
Exclusion: ISMT 226 Prerequisite: COMP 231

COMP 334 Distributed Database Systems [3-0-1:3]

Distributed database system concepts: system architectures; database design and administration; query processing and optimization; transaction management; concurrency control; availability; recovery. A course project using a commercial distributed DBMS is required.
Prerequisite: COMP 231

COMP 336 Information Retrieval [3-0-1:3]

Systems that provide relevance (similarity) based retrieval rather than exact matching. Topics: IR system architecture, IR models, performance, evaluation, relevance feed-back, clustering, other reduction indexing approaches, analysis applications, future trends.
Prerequisites: COMP 251 and COMP 271

COMP 341 Computer Graphics [3-0-1:3]

Input and output, graphics primitives, line drawing, coordinate systems, transformations, synthetic camera, color, curves, shading and rendering. Optional: surfaces, human vision, ray tracing, architectures.
Prerequisite: COMP 271

COMP 342 Introduction to Computer Music [3-0-1:3]

An introductory course in the technology of computer music. Music representation, music theory, musical acoustics, spectral analysis, sound synthesis techniques, sound modification techniques and effects. No previous musical background required, but helpful.
Prerequisite: COMP 171 or ISMT 227 (prior to 2000-01)

COMP 343 Fundamentals of Multimedia Computing [3-0-1:3]

Digital media representation; compression techniques and standards; multimedia storage, retrieval and communications; quality of service; multimedia resource management; multimedia database; synchronization; multimedia document, authoring; multimedia programming; applications.
Exclusion: ELEC 360 Prerequisite: COMP 252

COMP 351 Performance Evaluation of Computer Systems [3-1-0:3]

Basic concepts and techniques in modeling complex systems; elements of probability, statistics, Markov processes, queuing theory, operational analysis and simulation. Model parameterization, verification and validation.
Prerequisites: COMP 252, and MATH 241/244/246

COMP 361 Computer Communication Networks I [3-0-1:3]

Principles of network architectures and communications protocols; switching and multiplexing techniques; the OSI reference model: physical, data link, network and transport layers: LAN protocols and performance; introduction to network programming.
Background: Probability and statistics
Exclusions: ELEC 315, ISMT 335 Prerequisite: COMP 252

COMP 362 Computer Communication Networks II [3-0-1:3]

Design and implementation of computer communication networks, services and applications; bridging and routing; internetworking; ASN.1; network management. Examples are drawn primarily from TCP/IP protocol suite.
Prerequisite: COMP 361 or ELEC 315

COMP 364 Computer and Communication Security [3-0-0:3]

Cryptosystems, symmetric-key and public-key cryptography, cryptanalysis, authentication, message digests, digital signatures, and random number generation. Access controls and firewalls. Applications such as certificate authorities, electronic commerce, smart cards, and digital cash.
Prerequisite: COMP 271

COMP 381 Design and Analysis of Computer Architectures [3-1-0:3]

Analysis, synthesis and evaluation of different computer architectures. Emphasis on computer design with respect to price/performance and its relation to architectural choices such as pipelining, memory hierarchy, input/output, instruction set design, vector processing, and multiprocessing.
Prerequisite: COMP 252

COMP 382 Introduction to Parallel Computing [3-0-0:3]

Concept of high-performance computing using parallel and distributed processing. Design, algorithms, applications, and programming of parallel systems such as the Intel Paragon and network of workstations.
Background: Programming experience and knowledge of computer architecture.
Prerequisites: COMP 171, and COMP 180/ELEC 152.

COMP 394 Computer Engineering Project I [0-0-6:2]

[Also ELEC 394]
Each Computer Engineering student is required to take COMP/ELEC 394, 395 and 396. The project is conducted under the supervision of a Computer Science and/or Electrical and Electronic Engineering faculty member. May be graded PP.

COMP 395 Computer Engineering Project II [0-0-9:3]

[Also ELEC 395]
Continuation of COMP 394. May be graded PP.
Prerequisite: COMP 394

COMP 396 Computer Engineering Project III [0-0-9:3]

[Also ELEC 396] Continuation of COMP 395.
Prerequisite: COMP 395

COMP 397 Final Year Project I [0-0-9:3]

A project in an area of specialization in Computer Science under the guidance of a faculty member. Objectives are to integrate the classroom material from several courses, and to apply them to solve practical problems. May be graded PP.

COMP 398 Final Year Project II [0-0-12:4]

Continuation of COMP 397.

COMP Course ELEC Course LANG Course MATH Course
top

+ ELEC Courses: +

ELEC 101 Basic Electronics [3-1-3:4]

Covers basic electronic concepts, DC and AC electric circuits, basic analogue electronics: theories and applications of semiconductor diodes, transistors and operational amplifiers, and basic digital electronics.
Exclusion: ELEC 102 Prerequisite: AL Pure Mathematics/AL Applied Mathematics/AS Applied Mathematics/AS Mathematics and Statistics, or MATH 001 as co-requisite.

ELEC 102 Electronic Circuits I [3-1-3:5]

Fundamental concepts, Ohm's law, passive and active components, KVL and KCL, Thevenin and Norton Theroems, linearity and superposition, nodal analysis, transient analysis, sinusoidal steady state and phasor, transfer functions, op-amps, diodes, MOS transistors and related circuits.
Exclusion: ELEC 101 Prerequisites: AL Pure Mathematics; and one of AL/AS Physics, AL Engineering Science or AL Computer Studies

ELEC 151 Digital Circuits and Systems [3-1-2:4]

Design of combinatorial and sequential logic circuits; introduction to logic families (TTL and CMOS); programmable logic devices; special digital systems. Laboratory assignments make extensive use of computer-aided design (CAD) tools for design, simulation and testing.

ELEC 211 Signals and Systems [3-1-0:4]

This is an introductory course for signal and system analysis. The course covers signal analysis tools such as Fourier series, Fourier transform, Laplace transform and z-transform; interactions between signals and linear time invariant (LTI) systems; sampling theorem; differential and difference equations. MATLAB CAD tools are introduced as an integral part of this course.
Prerequisites: MATH 150 /151/152, and ELEC 101/102

ELEC 214 Communication Systems [3-1-3:5]

This course provides a broad treatment of communication theory, beginning with communication networks, physical noise characteristics, probability theory and random signals, and noiseless modulation theory, proceeding through a treatment of the effects of noise in communication systems, and ending with an introductory treatment of digital communications, source coding and reliable communication in the presence of noise.
Prerequisite: ELEC 211

ELEC 301 CMOS VLSI Design [2-0-3:3]

CMOS process and design rules; MOS device electronics; CMOS circuit and logic circuit characterization and performance estimation; VLSI design and verification tools. Laboratory work will be centered on industry standard tools.
Prerequisite: ELEC 151

ELEC 314 Digital Communications [3-1-0:3]

Representation of signals, optimum detection of signals in noise, matched filtering, error probability calculations for digital modulation. Multilevel modulation schemes, comparison of digital communications systems, signaling through band-limited channels, equalization, mobile and wireless channels, spread-spectrum communications, CDMA for cellular mobile and wireless communications.
Prerequisite: ELEC 214

COMP Course ELEC Course LANG Course MATH Course
top

+ LANG Courses: +

LANG 106 English for Engineering Students I [0-2-0:1]

A one-year discipline-oriented course for all Engineering students, which focuses on enhancing English language skills, developing learning strategies and building student confidence. Graded P or F.

LANG 206 English for Engineering Students II [0-2-0:1]

A one-year discipline-oriented course for all Engineering students, which focuses on organizing and conducting meetings; writing minutes and memos; writing proposals, progress and final reports; and preparing, giving and defending oral presentations.
Prerequisite: LANG 106

LANG 306 English for Engineering Management II [0-2-0:1]

A one-year discipline-oriented course for all Engineering students, which focuses on targeting communication for different audiences. It offers a range of modules on oral presentations, business letter-writing, legal contracts and technical vocabulary.
Prerequisite: LANG 206

COMP Course ELEC Course LANG Course MATH Course
top

+ MATH Courses: +

MATH 100 Introduction to Multivariable Calculus [2-1-0:2]

Differentiation in several variables, with applications in approximation, maximum and minimum and geometry. Integration in several variables, vector analysis.
Exclusions: MATH 101, MATH 104, MATH 106, MATH 107 Prerequisite: AL Pure Mathematics/AL Applied Mathematics or MATH 001/006/011

MATH 111 Linear Algebra [3-1-0:4]

Vector space, matrices and system of linear equations, linear mappings and matrix forms, inner product, orthogonality, eigenvalues and eigenvectors, symmetric matrix.
Exclusions: MATH 113, MATH 152 Prerequisite: AL Pure Mathematics/AL Applied Mathematics or MATH 001/006/011

MATH 132 Discrete Structures [3-1-0:4]

Logic: propositions, axiomatization of propositional calculus, deduction theorem, completeness and soundness. Combinatorics: permutations and combinations, generating functions. Set theory: basic operations on sets, relations, countable and uncountable sets.
Prerequisite: AL Pure Mathematics/AL Applied Mathematics or MATH 001/006/011

MATH 152 Applied Linear Algebra and Differential Equations [4-1-0:4]

First order equation, linear second order equations, Laplace transform, Euler and Runge-Kutta methods, introduction to partial differential equations, matrix, systems of linear equations, eigenvalue and eigenvector, systems of differential equations, orthogonal projection.
Exclusions: MATH 111, MATH 113, MATH 150, MATH 151 Prerequisite: AL Pure Mathematics/AL Applied Mathematics or MATH 001/006/011

MATH 244 Applied Statistics [3-1-0:4]

A systematic introduction to statistical inference, including the necessary probabilistic background, point and interval estimation, hypothesis testing.
Exclusion: BISC 215 Prerequisite: AL Pure Mathematics/AL Applied Mathematics or MATH 001/006/011.

MATH 246 Probability and Random Processes [3-1-0:4]

An introduction to random processes, including the necessary background. Random variables, distributions and density functions, expectations, limit theorems, discrete and continuous time random processes, stationary random processes, ergodic theorems, power spectral density, response of linear systems to random signals.
Exclusions: MATH 241, ELEC 210 Prerequisite: AL Pure Mathematics/AL Applied Mathematics or MATH 001/006/011

Copyright by Donald, 2001