Scribd
Upload
214 views3 pages

SEHH2241 - Discrete Structure

This 3-credit subject aims to equip students with fundamental discrete mathematics concepts and logical reasoning skills required for computer science. Topics include logic, proofs, sets, relations, functions, counting, graphs, trees, networks, and Boolean algebra. Assessment consists of tests, assignments, and an exam testing students' understanding, application of concepts, and problem-solving abilities. Students are expected to spend 131 hours on this subject, including 39 hours of class contact and 92 hours of self-study.

Uploaded by

Glory of Billy's Empire Jorton Knight
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
214 views3 pages

SEHH2241 - Discrete Structure

This 3-credit subject aims to equip students with fundamental discrete mathematics concepts and logical reasoning skills required for computer science. Topics include logic, proofs, sets, relations, functions, counting, graphs, trees, networks, and Boolean algebra. Assessment consists of tests, assignments, and an exam testing students' understanding, application of concepts, and problem-solving abilities. Students are expected to spend 131 hours on this subject, including 39 hours of class contact and 92 hours of self-study.

Uploaded by

Glory of Billy's Empire Jorton Knight
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

November 2021

Hong Kong Community College

Subject Description Form

Subject Code SEHH2241

Subject Title Discrete Structures

Credit Value 3

Level 2

Medium of English
Instruction

Pre-requisite / Nil
Co-requisite/
Exclusion

Prior Knowledge Nil

Objectives This subject aims to equip students with the fundamental ideas of discrete
mathematics, such as formal mathematical reasoning techniques, basic
counting techniques and their applications; and to help students acquire the
mathematical knowledge and skills required in the field of computer
science.

Intended Learning Upon completion of the subject, students will be able to:
Outcomes
(a) describe the basic concepts of discrete mathematical structures and
logical reasoning;

(b) apply the discrete mathematical structures and logical reasoning to


solve problems in computer science applications;

(c) develop solutions to discrete mathematics related problems.

Subject Synopsis/ Logic and Proofs


Indicative Syllabus Propositions; Conditional propositions and logical equivalences;
Quantifiers; Proofs; Resolution proofs; Mathematical induction.

Sets, Relations and Functions


Sets; Number systems; Relations; Equivalence relations; Functions.

Counting Methods
Basic principles; Permutations and combinations; Algorithms for
generating permutations and combinations.

Graphs and Trees


Paths and cycles; Hamiltonian cycles and the Travelling Salesperson
Problem; Shortest-path algorithms; Representations of graphs;
Isomorphism of graphs; Planar graphs; Terminology and characterisations
of trees; Spanning trees; Minimal spanning trees; Binary trees; Tree

1
November 2021

traversals; Decision trees and the minimum time for sorting; Isomorphism
of trees.

Basic Network Problems


Network flows; Maximal-flow minimum-cut problem; Minimal-cost flow
problem; Applications, e.g., network design, transportation problem.

Boolean Algebras and Combinatorial Circuits


Combinatorial circuits and their properties; Boolean algebras; Boolean
functions and synthesis of circuits.

Teaching/Learning Concepts will be taught mainly through lectures in order to develop


Methodology students’ discrete mathematical techniques and reasoning skills. Exercises
will be carried out in tutorials to illustrate and reinforce the concepts,
techniques and skills in discrete mathematics.

Assessment A variety of assessment tools will be used to develop and assess students’
Methods in achievement of the subject-intended learning outcomes.
Alignment with
Intended Learning Specific assessment % Intended subject learning
Outcomes methods/tasks weighting outcomes to be assessed

a b c

Continuous Assessment 40

 Test 20   

 Assignment 1 10  

 Assignment 2 10   

Examination 60   

Total 100

To pass this subject, students are required to obtain Grade D or above in


both the Continuous Assessment and Examination.

Test and examination are designed to test students’ understanding of the


concepts and techniques of discrete mathematics and their ability to apply
these mathematical methods to a range of real-life applications.

Assignment 1 is designed to enable students to implement basic concepts


and methods of logic, proofs, relations and functions and to solve problems
of discrete mathematical structures.

Assignment 2 is designed to enable students to apply methods of


combinatorics as well as concepts of graph theory and network designs to
formulate mathematical models in a variety of applications.

2
November 2021

Student Study Class contact Hours


Effort Expected
 Lecture 26

 Tutorial 13

Other student study effort

 Self-study 92

Total student study effort 131

Reading List and Recommended Textbook


References
Rosen, K. H. (2018). Discrete mathematics and its applications. (8th ed.),
McGraw Hill.

References

Ferland, K. K. (2017). Discrete mathematics and applications. (2nd ed.),


CRC Press.

Hunter, D. (2017). Essentials of discrete mathematics. (3rd ed.), Jones &


Bartlett Learning.

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

The Reading List and References are indicative. Relevant reading


materials will be suggested and assigned from time-to-time when they are
deemed appropriate.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy