DBATU · Second Year B.Tech Artificial Intelligence & Allied · NEP 2020
Discrete Mathematics
25AF1245PC303 · Semester III · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60
Unit 1: Logic
9 hoursPropositions, truth tables, precedence and compound propositions; logical equivalences and normal forms; predicates and universal and existential quantifiers, nested quantifiers and their negation; translating English; rules of inference, resolution and fallacies.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Propositions and truth tables
- Logical equivalences and normal forms
- Predicates and quantifiers
- Nested quantifiers
- Rules of inference and valid arguments
Unit 2: Sets, Functions and Relations
9 hoursSets, Venn diagrams, power sets, Cartesian products, set operations and identities, cardinality; injective, surjective and bijective functions, inverses and composition; relations and their properties, representations, closures, equivalence relations and partitions, partial orders, Hasse diagrams and topological sort.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Sets, set operations and identities
- Cardinality of sets
- Functions: injective, surjective and bijective
- Relations and their properties
- Closures of relations
- Equivalence relations and partitions
- Partial orders and Hasse diagrams
Unit 3: Combinatorics
7 hoursApplications of recurrence relations; solving linear recurrence relations.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Recurrence relations and their applications
- Solving linear recurrence relations
Unit 4: Graphs and Trees
7 hoursSpecial simple and bipartite graphs, new graphs from old; shortest paths; Euler and Hamiltonian paths; isomorphism; planar graphs; connectivity, matching and colouring; prefix codes and Huffman coding; spanning trees and cut sets; Kruskal's and Prim's minimal spanning trees.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Special graphs and bipartite graphs
- Euler and Hamiltonian paths
- Graph isomorphism and planar graphs
- Graph colouring and matching
- Prefix codes and Huffman coding
- Spanning trees and minimal spanning trees
Unit 5: Algebraic Structures and Morphism
5 hoursStructures with one binary operation: semigroups, monoids and groups; congruence relations and quotient structures; cyclic and permutation groups, substructures and normal subgroups; rings, integral domains and fields; Boolean algebra and Boolean rings.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Semigroups, monoids and groups
- Cyclic and permutation groups
- Normal subgroups and quotient structures
- Rings, integral domains and fields
- Boolean algebra
Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).