Fundamental Discrete Structure

Twitter

BUM1213

FUNDAMENTAL DISCRETE STRUCTURE

Credit : 3 credit

Pre-requisite : None

Synopsis

This subject introduces and discusses the fundamental of the discrete as apply to computer science, focusing on providing  a basic theoretical foundation for futher work. Students are exposed to logic, set theory, elementary number of theory, functions, relations, fundamentals of counting, Boolean algebra and simple proof technique. This course integrates symbolic tools, graphical concepts, and numerical calculations.

Course outcomes

1. Acquire fundamental principle of discrete mathematics.
2. Analyze mathematical problem using discrete mathematics.
3. Provide solution to discrete mathematics problems arise from computer scince and engineering field.

References

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