MA3354 Discrete Mathematics Lecture Notes 2
MA3354 Discrete Mathematics Lecture Notes 2
com
COURSE OBJECTIVES:
To extend student’s logical and mathematical maturity and ability to deal with abstraction.
To introduce most of the basic terminologies used in computer science courses and application
of ideas to solve practical problems.
To understand the basic concepts of combinatorics and graph theory.
To familiarize the applications of algebraic structures.
To understand the concepts and significance of lattices and boolean algebra which are widely
used in computer science and engineering.
21
TEXT BOOKS:
1. Rosen. K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw
Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2017.
2. Tremblay. J.P. and Manohar. R, "Discrete Mathematical Structures with Applications to
Computer Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
REFERENCES:
1. Grimaldi. R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction",
5thEdition, Pearson Education Asia, Delhi, 2013.
2. Koshy. T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Lipschutz. S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata McGraw Hill
Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.
UNIT IV PROCESSOR 9
Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control,
Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.
22