CE303 Mathematical Foundation of Computer Science [3 1 0 4]

Course Learning Outcome:

After successful completion of this course, student will be able to

• understand discrete mathematical preliminaries
• apply discrete mathematics in formal representation of various computing constructs
• recognize the importance of analytical problem solving approach in engineering problems

Syllabus:

Sets Theory, Propositions and Computability: Introduction, Combinations of Sets, Finite and Infinite
Sets, Uncountable Infinite Sets, Mathematical Induction, Principle of Inclusion and Exclusion,
Propositions and Propositional Calculation, Russell’s Paradox and Non computability, Applications of
these concepts in language Theory and AI.

Permutations, Combinations, and Discrete Probability: Introduction, The Rules of sum and product,
Permutations, Combinations, Generation of Permutations and Combinations, Discrete Probability ,
Applications in Data recovery and Security.

Relations and Functions: Introduction, A relational Model for Data Bases, Properties of Binary
Relations, Equivalence Relations and Partitions, Partial Ordering Relations and Lattices, A Job-
scheduling Problem, Functions types of functions and the Pigeonhole Principle

Graphs and Trees: Basic Terminology, Multigraphs and Weighted Graphs, Paths and Circuits Shortest
Paths in Weighted Graphs, Euclidian Paths and Circuits, Hamiltonian Paths and Circuits, The Traveling
Salesperson Problem, Factors of a Graph, Planar Graphs, Trees, Rooted Trees, Path Lengths in Rooted
Trees, Prefix Codes, Binary Search Trees, Spanning Trees and Cut-Sets, Minimum Spanning Trees

Analysis of Algorithms Time Complexity of Algorithms: A Shortest-Path Algorithms, Complexity of

Problems, Tractable and Intractable Problems, Numeric Functions, Asymptotic Behavior of Numeric
Functions.

Recurrence Relations and Recursive Algorithms: Recurrence Relations, Linear Recurrence Relations
with Constant Coefficients, Homogeneous Solutions, Particular Solutions, Total Solutions. Use of
Recurrence Relations for Analysis of Algorithms.

Self-Study:

The self-study contents will be declared at the commencement of semester. Around 10% of the questions
will be asked from self-study contents.

Tutorial Work:

Tutorial work will be based on above syllabus with minimum 10 tutorials to be incorporated.
Page 1 of 2
References:

1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill

2. Tremblay, J.P. & Manohar, Discrete mathematical structures with application to computer
science, McGraw Hill
3. Rosen, Kenneth L., Discrete Mathematics and its applications, McGraw Hill

Page 2 of 2