1 Course Code CSE245

2 Course Title Discrete Structures

3 Credits 4
4 Contact Hours 3-1-0
This course provides a mathematical foundation for subsequent study
Course
5 in Computer Science, as well as developing the skills necessary to
Objective
solve practical problems.
After the completion of this course, students will be able to:
CO-1. Know the basic principles of sets and operations in sets.
CO-2. Classify logical notation and determine if the argument is or is
not valid.
Course CO-3. Use algebraic structures to construct models and prove.
6 Outcomes CO-4. Analyze basic principles of Boolean algebra with mathematical
(CO) description.
CO-5. Integrate Permutations and combinations in counting
techniques and applications of Graph Theory.
CO-6. Support ability to describe computer programs in a formal
mathematical manner.
7 Prerequisite Concepts of algebra
8 Course Contents
8.01 Unit A Introduction to Set Theory, Relations and Functions.
Set Theory: Introduction, Combination of sets, Multi sets, ordered
8.02 Unit A Topic 1
pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of relations,
8.03 Unit A Topic 2
Composite Relations, Equality of relations, Order of relations.
Functions: Definition, Classification of functions, Operations on
8.04 Unit A Topic 3
functions, Recursively defined functions.
8.05 Unit B Logics and Mathematical Induction
Propositional Logic: Proposition, well formed formula, Truth tables,
8.06 Unit B Topic 1 Tautology, Satisfiability, Contradiction, Algebra of proposition,
Theory of Inference, Natural Deduction.
Predicate Logic: First order predicate, well formed formula of
8.07 Unit B Topic 2
predicate, quantifiers, Inference theory of predicate logic.
Natural Numbers: Introduction, Mathematical Induction, Variants of
8.08 Unit B Topic 3
Induction, Induction with Nonzero Base cases.
8.09 Unit C Algebraic Structures
Definition, Groups, Subgroups and order, Cyclic Groups, Cosets,
8.10 Unit C Topic 1
Lagrange's theorem, Normal Subgroups,
Homomorphism’s, Definition and elementary properties of Rings and
8.11 Unit C Topic 2
Fields, Integers Modulo n.
Partial order sets: Definition, Partial order sets, Combination of
8.12 Unit C Topic 3
partial order sets, Hasse diagram.
8.13 Unit D Lattices and Applications
 Definition, Properties of lattices – Bounded, Complemented, Modular
8.14 Unit D Topic 1
and Complete Lattice, Morphisms of lattices.
Boolean Algebra: Introduction, Axioms and Theorems of Boolean
algebra, Algebraic manipulation of Boolean expressions.
8.15 Unit D Topic 2 Simplification of Boolean Functions, Karnaugh maps, Logic gates,
Digital circuits and Boolean algebra. Combinational and sequential
Circuits.
Recurrence Relation & Generating function: Recursive definition of
8.16 Unit D Topic 3
functions, Recursive algorithms, Method of solving recurrences.
8.17 Unit E Graph Theory and Applications.
Trees: Definition, Binary tree, Binary tree traversal, Binary search
8.18 Unit E Topic 1
tree.
Graphs: Definition and terminology, Representation of graphs, Multi
graphs, Bipartite graphs, Planar graphs, Isomorphism and
8.19 Unit E Topic 2
Homeomorphism of graphs, Euler and Hamiltonian paths, Graph
colouring.
Combinatorics: Introduction, Counting Techniques, Pigeonhole
8.20 Unit E Topic 3
Principle
9 Course Evaluation: Continuous Assessment-30 Marks
9.1 Attendance --
9.2 Homework 2 assignments, no weight
9.3 Quizzes 7 best quizzes (based on assignments) - 15 marks
9.4 Project 15
9.5 Any other NO
Mid Term
9.6 20 Marks
Examination
End Term
9.7 50 Marks
Examination
10 Reading Content
1) 1. C. L. Liu, Elements of Discrete Mathematics, second
edition 1985, McGraw-Hill Book Company. Reprinted
2000.
2) Jean Paul Trembley, R Manohar, “Discrete Mathematical
10.1 Text book*
Structures with Application to Computer Science”,
McGraw-Hill.
3) K. H. Rosen, Discrete Mathematics and applications, fifth
edition 2003, Tata McGraw Hill Publishing Company.
1) J .L. Mott, A. Kandel, T.P .Baker, Discrete Mathematics for
Computer Scientists and Mathematicians, second edition
10.2 other references 1986, Prentice Hall of India.
2) W.K. Grassmann and J.P.Trembnlay, Logic and Discrete
Mathematics, A Computer Science
PO and PSO mapping with level of strength Discrete Structures for Computer Science
(CSE )