BMC104

Discrete Mathematics

L-T-P3-0-0 Credits3 Session2024-25 TypeTheory
Appears in 1 semester

MCA · Sem 1 (Core)

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: Set Theory

8 hrs

Introduction, Size of sets and Cardinals, Venn diagrams, Combination of sets, Multisets, Ordered pairs and Set Identities. Relation: Definition, Operations on relations, Composite relations, Properties of relations, Equality of relations, Partial order relation. Functions: Definition, Classification of functions, Operations on functions, Recursively defined functions.

Unit2

Unit 2: Posets, Hasse Diagram and Lattices

8 hrs

Introduction, Partial ordered sets, Combination of Partial ordered sets, Hasse diagram, Introduction of lattices, Properties of lattices – Bounded, Complemented, Modular and Complete lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Boolean functions. Simplification of Boolean functions, Karnaugh maps, Logic gates.

Unit3

Unit 3: Propositional

8 hrs

Propositions, Truth tables, Tautology, Contradiction, Algebra of Propositions, Theory of Inference and Natural Detection. Predicate Logic: Theory of Predicates, First order predicate, Predicate formulas, Quantifiers, Inference theory of predicate logic.

Unit4

Unit 4: Algebraic Structures

8 hrs

Introduction to algebraic Structures and properties. Types of algebraic structures: Semi group, Monoid, Group, Abelian group and Properties of group. Subgroup, Cyclic group, Cosets, Permutation groups, Homomorphism and Isomorphism of groups. Rings and Fields: Definition and elementary properties of Rings and Fields.

Unit5

Unit 5: Natural Numbers

8 hrs

Introduction, Piano’s axioms, Mathematical Induction, Strong Induction and Induction with Nonzero Base cases. Recurrence Relation & Generating functions: Introduction and properties of Generating Functions. Simple Recurrence relation with constant coefficients and Linear recurrence relation without constant coefficients. Methods of solving recurrences. Combinatorics: Introduction, Counting techniques and Pigeonhole principle, Polya’s Counting theorem.

Course Outcomes (COs)5 outcomes

After completion of the course student will be able to:

  1. CO1Use mathematical and logical notation to define and formally reason about basic discrete structures such as Sets, Relations and FunctionsK1, K2
  2. CO2Apply mathematical arguments using logical connectives and quantifiers to check the validity of an argument through truth tables and propositional and predicate logicK2, K3
  3. CO3Identify and prove properties of Algebraic Structures like Groups, Rings and FieldsK3, K4
  4. CO4Formulate and solve recurrences and recursive functionsK3, K4
  5. CO5Apply the concept of combinatorics to solve basic problems in discrete mathematicsK1, K3

Suggested Readings

  1. Rosen K. H., "Discrete Mathematics and Its Applications", McGraw Hill.
  2. Kolman B., Busby R.C and Ross S.C., "Discrete Mathematics Structures", Prentice Hall.
  3. Girimaldi R.P, "Discrete and Combinatorial Mathematics", Addison Wesley.
  4. Singh Y.N., "Discrete Mathematical Structures", Wiley- India.
  5. Sarkar S., "A Textbook of Discrete Mathematics”, S. Chand & Company PVT. LTD.
  6. Krishnamurthy V., "Combinatorics Theory & Application", East-West Press Pvt. Ltd.
  7. Liptschutz S. and Lipson M.C., "Discrete Mathematics", McGraw Hill.
  8. Trembely J.P. and Manohar R., "Discrete Mathematical Structure with application to Computer Science", McGraw Hill.

Official AKTU syllabus

This subject is on page 8, 9 of the original AKTU PDF.

Official AKTU syllabus PDF ↗