BSc IT (Bachelor of Science in Information Technology)
Subject Code BT0069 (Discrete Mathematics )
PART - A
PART - B
PART - C
Discrete Mathematics Syllabus.
Unit 1: Mathematical Preliminaries.
Sets; Relations; Functions; Basic Number Theory.
Unit 2: Elementary Combinatory
Principle of Counting; Permutation of Distinct Things; Combinations;
Partitions and Binomial Coefficients; Principle of Inclusion and Exclusion.
Unit 3: Recurrence Relations
Recurrence Relation; Particular Solution; Generating Functions; Applications
of Recurrences Integer Functions.
Unit 4: Partially Ordered
Sets Partially ordered sets; diagram representation of posets
Unit 5: Lattices
Definitions and examples; properties and complemented lattices; distributive
Lattices; distributive Lattices.
Unit 6: Algebraic Structures
Semi groups; Monoids; groups; permutation groups.
Unit 7: Propositional Calculus and Quantifiers
Equivalence of formulas; Normal forms; Logical Interference.
Unit 8: Predicate Calculus
Predicates; Quantifiers; Free and Bound Occurrences; rules of interference.
Unit 9: Finite Boolean Algebras
Boolean algebra; Functions of Boolean algebra; Gating Networks.
Unit 10: Formal Languages
Grammars and Languages; Classification of Grammars.
Unit 11: Finite Automata
Basic Terms; Deterministic Finite Automata (DFA); Transition System
(Transition graph) Language Accepted by a DFA.
Unit 12: Basic Graph Theory
Definitions and Examples; Adjacency and Degree; Sub graphs; Trees;
Properties of Trees Rooted Trees and Applications.
Unit 13: Algebraic Codes and Cryptography
Preliminaries; Hamming Distance; Linear Codes; Introduction to Cryptography.