Discrete Structures

COMP 3630SED

Course Guide

Discrete Structures

COMP 3630SED

Course Guide

Discrete Structures

Course Start Date

N/A

Course Level

N/A

Length in Terms

N/A

Credits

N/A

Language

N/A

Fees ($) (including lab fees)

N/A

Future Terms

Quota and Schedule

Course Start Date	Course Level	Length in Terms	Credits	Language	Fees ($) (including lab fees)	Future Terms
N/A	N/A	N/A	N/A	N/A	N/A

Quota and Schedule

Course Coordinator:

Dr Keith LEE Lap-kei, BEng, PhD (HKU)

Course Developer:

HUNG Chi-kwong, Consultant

COMP 3630SED Discrete Structures is a two-term, six-credit-unit, 3000-level course within the Bachelor of Computing with Honours in Internet Technology (BCITH) programme suite. It is a compulsory course for BCITH. This course is designed for students to understand the foundation of discrete mathematics and master the techniques of algorithm analysis, which will be useful in studying other computing courses.

Aims

This course aims to:

explain the basic concepts of discrete mathematics;
equip students with different techniques for analysing and solving discrete mathematical problems that may appear in practical computing applications;
introduce existing algorithms for different kinds of problems; and
equip students with different techniques for analysing computing algorithms.

Contents

The course consists of the following study units:

Sets and logic
Proofs
Functions
Counting methods and the pigeonhole principle
Algorithms
Recurrence relations
Graph theory
Graph algorithms

Learning support

There are five forms of tutor-student interaction to be provided in this course, including tutorials, surgeries, online discussion board, email, and telephone tutoring.

Tutors will conduct eight 2-hour face-to-face tutorials and eight two-hour surgery sessions. At these sessions key concepts will be reviewed and reinforced; topical issues discussed; individual student questions answered; and assistance related to assignments provided.

Assessment

The course assessment includes three continuous assessments (50%) and a final examination (50%). Students are required to submit assignments via the Online Learning Environment (OLE).

Online requirement

This course is supported by the Online Learning Environment (OLE). You can find the latest course information on the OLE. Through the OLE, you can communicate electronically with your tutor and the Course Coordinator as well as other students. To access the OLE, students will need to have access to the Internet. The use of the OLE is required for the study of this course.

Equipment

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

IBM compatible PC with an x86 CPU or equivalent
256 MB RAM
Hard disk
CD-ROM drive
Sound card with speakers
Internet access

You need to be familiar with the basic use of a computer.

Software

You should have English Windows with Microsoft Word. Some other software will be provided or downloaded from the Internet. Familiarity with word-processing software is required. Besides, experience in using the Internet and World Wide Web is highly recommended.

If you cannot access the Internet for some reason, make sure that someone can access it for you.

Set book(s)

Johnsonbaugh, R. (2018). Discrete mathematics, Global edition, 8th ed., Pearson.

Students with disabilities or special educational needs

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