ALLIANCE COLLEGE OF ENGINEERING & DESIGN

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Chikkahagade Cross, Chandapura - Anekal Main Road, Anekal
Bangalore 562106
Semester: 3

Year: 2015-2019

Course Title: Engineering Mathematics III

Course Code: CS 301

Credits (L:T:P) : 4:0:0

Core/ Elective: Core

Type of course: Lecture

Total Contact Hours: 48hrs

Prerequisites: Nil
Course Objectives:
The students will
1.

Students will learn the essential concepts and ideas in Discrete mathematics, required for rigorous studies

2.
3.

in computer science.
To learn the fundamental concepts in graph theory to prepare for modern applications.
To correlate the theoretical principles with application based studies.

Course Content:
Unit 1
Relations and Functions: Equivalence relations, partial orders, Hasse Diagrams. Functions: Definitions, Types of
functions, Stirlings numbers of the second kind, composition of functions, invertible functions, pigeonhole
principle.
Unit 2
Combinatorics 1:Recursive definitions, Fibonacci numbers, Lucas numbers, Eulerian numbers, Ackermans
numbers. Introductory Examples, Definition and Examples Calculational Techniques, Partitions of Integers, the
Exponential Generating Function, the Summation Operator.
Unit 3
Combinatorics 2:First Order Linear Recurrence Relation, the Second order Linear Homogeneous Recurrence
Relation with Constant Coefficients, The Non-homogeneous Recurrence Relation, Method of generating functions.
Unit 4
Graphs and Directed Graphs:Review of basic graph theory,Euler circuits and Euler trails,Hamilton pathsand cycles.
Unit 5
Trees: Trees and their basic properties, rooted trees, binary tree, spanning trees, minimal spanning trees, Kruskals
and Prims algorithms,prefix codes, cut-sets, Network flows, shortest path.

Text Books:
1.

Narsing Deo, Graph Theory with Applications to Engineering and Computer Science, PHI Learning, New

2.

Delhi, 2001.
Ralph. P. Grimaldi and B V Ramana, Discrete and Combinatorial Mathematics, PHI/Pearson

3.
4.
5.
6.

Education,5thEd.,2004.
Kenneth H. Rosen,Discrete Mathematics and its Applications, McGraw Hill, 6th Ed., 2007.
Thomas Koshy,Discrete Mathematics with Applications, Elsevier, 2008.
Dr. D.S. Chandrasekharaiah,Graph Theory and Combinatorics, PRISMBook Pvt. Ltd., 2005.
Dr.D.S.Chandrasekharaiah, Discrete Mathematical Structures, PRISM Book Pvt. Ltd., 2nd Ed., 2005

Course Outcomes:
At the end of the course, the students
a)
b)
c)
d)
e)
f)
g)
h)
i)
j)

should gain an ability to analyze and interpret data.

should be able to understand logical arguments and logical constructs.
should possess an ability to function on multidisciplinary teams.
should have a better understanding of sets, functions and relations.
acquire ability to describe computer programs in a formal mathematical manner.
gain an ability to communicate effectively
possess the mathematical knowledge and maturity that are required
for upper level computer science courses.
appreciate a recognition of the need for, and an ability to engage in life-long learning
possess an ability to use the techniques, skills, and modern mathematicaltools necessary for engineering
practice.

Objectives
CS 301

I
a,b,d,g

II
a,b,c,e,g

III
b

Expected Outcomes
IV
V
VI
c
i
f

VII
h

VIII
i

IX
H