SUK · Second Year B.Tech. Computer Science and Engineering · NEP 2020
Discrete Mathematical Structures
CSE2101 · Semester III · 3 credits · ISE 10 + mid-semester 30 + ESE 60
Unit 1: Mathematical Logic
7 hoursStatements and notation, connectives, statement formulas and truth tables, well-formed formulas, tautologies, equivalence of formulas, the duality law, tautological implications, functionally complete sets of connectives, other connectives and normal forms.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Propositional logic and equivalences
- Logical equivalences and normal forms
- Rules of inference and valid arguments
Unit 2: Set Theory
5 hoursBasic concepts and operations on sets; ordered pairs and n-tuples; the Cartesian product.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 3: Relations and Ordering
6 hoursRelations and the properties of binary relations; matrix and graph representations; partitions and coverings; equivalence relations; composition of relations; posets and Hasse diagrams; functions, their types and composition.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
Unit 4: Algebraic Systems
7 hoursAlgebraic systems: examples and general properties; semigroups and monoids; groups, subgroups and homomorphisms.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Groups, semigroups and monoids
- Subgroups, abelian and cyclic groups
- Group codes and homomorphism
Unit 5: Lattices and Boolean Algebra
7 hoursLattices as partially ordered sets and as algebraic systems; special lattices; Boolean algebra, Boolean functions and their representation and minimisation.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Chains, antichains and sublattices
- Boolean algebra and Boolean rings
- Karnaugh maps
Unit 6: Graph Theory
7 hoursBasic concepts of graphs; paths, reachability and connectedness; matrix representations of graphs; storage representation and manipulation of graphs; PERT and related techniques.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Graph terminology and special graphs
- Graph representation and isomorphism
- Euler and Hamilton paths
- Warshall's algorithm for path matrices
- PERT and CPM
Unit contents are summarised from the official SUK syllabus . AiCanCode.org is not affiliated with Shivaji University, Kolhapur.