Design and Analysis of Algorithms

Home Admissions Course Information Design and Analysis of Algorithms

COMP 8650SEF

Course Guide
DESIGN AND ANALYSIS OF ALGORITHMS

COMP 8650SEF

Course Guide

DESIGN AND ANALYSIS OF ALGORITHMS

Course Start Date
Spr 2025
Course Level
Postgraduate
Length in Terms
1 term
Credits
3
Language
English
Fees ($) (including lab fees)
Future Terms
Quota and Schedule
Course Start Date
Course LevelLength in TermsCredits
Language
Fees ($) (including lab fees)
Future Terms
Spr 2025
Postgraduate1 term3
English

Course Coordinator:

Dr. Wang Dan Debby, PhD CityU

Course Developer:

Dr. Wang Dan Debby

COMP 2010SED Computing Fundamentals with Java is a two-term, six-credit-unit, 2000-level course within the Bachelor of Computing with Honours in Internet Technology (BCITH) programme suite and the Bachelor of Science with Honours in Computing and Networking (BSCICNH) programme suite. It is a compulsory course for BCITH and BSCICNH. This course is designed to provide a solid foundation in the fundamentals of computing and is suitable for students who do not have prior experience in programming. The problem solving aspect of computing will be emphasised. The main focus is to learn an object-oriented programming language (Java) and use it to solve problems. The software development cycle will also be introduced.

Advisory Prerequisite(s)

You are strongly advised to have already studied PSYC 2028AED

Excluded Combinations and Courses Not Allowed to be Taken Again

ENGL 4430EEF

Aims

This course aims to introduce the algorithms in various domains, and techniques for designing efficient algorithms. It trains the students' ability to analyse the time and space complexity and correctness of algorithms, and the skills to design solutions to problems.

Contents

The course includes the following main topics:

  • Analysis of algorithms
  • Greedy heuristics
  • Divide and conquer
  • Graph algorithms I (Graph traversal)
  • Graph algorithms II (Building minimum spanning tree)
  • Graph algorithms III (Shortest path algorithm)
  • Languages
  • Finite automata
  • Regular expressions

Learning support

Tutorials

Assessment

The continuous assessment (50%) consists of assignments (30%) and one test (20%). There will be no written examination for this course. The final examination (50%) will be based on an individual project consisting of a presentation and a project report.

Electronic submission of assignments

Except for some designated assignments, students are required to submit assignments via the Online Learning Environment (OLE).

Online requirement

Students are required to submit their assignments and project report via the Online Learning Environment (OLE).

Equipment and Software

A computer or electronic device capable of connecting to the Internet.

Equipment

A PC-compatible computer ready for connecting to the Internet is essential. The minimum configuration of the computer is:

  • PC with an x86 CPU or equivalent
  • 1GB RAM
  • Hard disk
  • Sound card with speakers

You need to be familiar with the basic use of a computer including keyboard, mouse and word processing software. Experience in using email, the Internet and the World Wide Web is also essential.

Software

You should have Windows with Microsoft Word. Other software will be downloaded from the Internet. You may need to use OpenOffice to prepare assignment answers.

Set book(s)

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to algorithms (4th ed.). MIT Press.

Students with disabilities or special educational needs

The audio and visual components of this course may cause difficulties for students with an audio or visual handicap. You are encouraged to seek advice from the Course Coordinator before enrolling on this course.