Discrete Structure & Applications

Twitter

BUM2223

DISCRETE STRUCTURE & APPLICATIONS

Credit : 3 credit

Pre-requisite : BUM1213 Fundamental Discrete Structure

Synopsis

This subject discusses an in depth of the discrete structures as they apply to computer science, focusing on providing a basic theoretical foundation for further work. Topics include review on algorithm, integers and matrices, advanced counting technique, graphs, trees, and modeling computation. This course integrates symbolic tools, graphical concepts, and numerical calculations.

Course outcomes

1. Acquire fundamental principle of discrete structure.
2. Analyze mathematical problems using discrete structure knowledge.
3. Provide solution to discrete structure problem arise from computer science & engineering fields.

Reference

1. Rosen K.H., Discrete Mathematics & Its Applications, (Seventh Edition), McGraw-Hill, 2012.
2. Kolman B., Busby R.C. & Ross S.C., Discrete Mathematical Structures. (Sixth Edition), Prentice-Hall, 2009-(latest edition).
3. Epp S.S, Discrete Mathematics with Applications, (Fourth Edition), Thomson Learning, 2011.
4. Gossett E., Discrete Mathematics with Proof, (Second Edition), Wiley, 2009-(latest edition).
5. R. Garnier, J. Taylor, Discrete Mathematics: Proofs, Structures and Applications, (Third Edition), Taylor and Francies, 2009 (latest edition).