GRAPHIC ERA UNIVERSITY, DEHRADUN

Odd Semester 2017-2018

Course Handout

Vision and Mission of the Department of Computer Sc. and Engineering

Vision
To impart quality education for producing world class technocrats and entrepreneurs with
sound ethics, latest knowledge and innovative ideas in Computer Science and Engineering
to meet industrial needs and societal expectations.
Mission
M1. To impart world class value based technical education in all aspects of Computer
Science and Engineering through state of the art infrastructure and innovative
approach.
M2. To produce ethical, motivated and skilled engineers through theoretical knowledge
and practical applications.
M3. To inculcate ability for tackling simple to complex individually as well as in a team..
M4. To develop globally competent engineers with strong foundations, capable of “out of
the box” thinking so as to adapt to the rapidly changing scenarios requiring socially
conscious green computing solutions.

Program Educational Objectives (PEOs)

PEO 1. To produce the students employable towards building a successful career based on
sound understanding of theoretical and applied aspects and methodology to solve
multidisciplinary real life problems.
PEO 2. To produce professional graduates ready to work with a sense of responsibility,
ethics and enabling them to work efficiently individually and also in team.
PEO 3. To inculcate competent students so that they are able to pursue higher studies and
research in areas of engineering and other professionally related fields.
PEO 4. To inculcate ability to adapt to the changing technology through continuoual
learning.

PROGRAM SPECIFIC OUTCOMES (PSOs)

PSO1. Ability to analyze, design, implement, and test software systems based on
requirement specifications and development methodologies of software systems.
PSO2. Apply computer science theory blended with engineering mathematics to solve
computational tasks and model real world problems using appropriate programming
language, data structure, and algorithms.
PSO3. Ability to explore technological advancements in various domains, evaluate its merits
and identify research gaps to provide solution to new ideas and innovations.
Date : 21-07-2017
Course No. : TMA 306 (CSE)
Course Title : Discrete Mathematical Structures
Instructor In-charge : Manish Mahajan
Course Description
Discrete mathematics, also called finite mathematics or decision mathematics, is the study
of mathematical structures that are fundamentally discrete in the sense of not supporting or
requiring the notion of continuity. Objects studied in finite mathematics are largely countable
sets such as integers, finite graphs, and formal languages. Concepts and notations from
discrete mathematics are useful to study or describe objects or problems in computer
algorithms and programming languages. This course covers widely applicable mathematical
tools for computer science, including topics from logic, set theory, number theory,
probability theory, group theory and Boolean Algebra. It includes practice in reasoning
formally and proving theorems.
Scope & Course Outcomes
On completion of TMA 306, students will be able to explain and apply the basic methods of
discrete (noncontinuous) mathematics in Computer Science. They will be able to use these
methods in subsequent courses in the design and analysis of algorithms, computability
theory, software engineering, and computer systems.
In particular, students will be able to
CO 1. Produce convincing arguments, conceive and/or analyze basic mathematical proofs
and discriminate between valid and unreliable arguments.
CO 2. Understand the basics of discrete probability and number theory, and be able to
apply the methods from these subjects in problem solving.
CO 3. Establish the decisive properties of relations in order to compute inverses of
functions.
CO 4. Demonstrate an understanding of partial order relations and Lattices.
CO 5. Recognize the use of Karnaugh map to construct and minimize the canonical sum of
products of Boolean expressions and transform it into an equivalent Boolean
expression
CO 6. Discriminate, identify and prove the properties of groups and subgroups

Text Books

T1. S.Lipcshutz, M.Lipson “Discrete Mathematics – Schaum’s Outlines”, Tata McGraw

Hill

Reference Books :

R1. Kenneth H Rosen, “Discrete Mathematics and its Applications”, Tata McGraw Hill, 6 th
Edition

R2. S. Ghahramani, “Fundamentals of Probability”, Prentics Hall, 3RD Edition

Notes:

For certain topics, class notes may be provided through the LMS of the university, regarding
which the students will be timely intimated.
Course Plan :

Lecture Learning Objectives Topics to be Reference Chap/

No. Covered Sec (Book)
1-2 Introduction to probability Theory – Probability Theory T1 - 7.1, 7.2, 7.3
Experiments, Events, Classical R2 – Chap 1
Probability
3-4 Conditional Probability – Total Conditional T1 – 7.4
probability theorem and Baye’s Probability R2 – Chap 3
Theorem
5-6 Random Variables – Discrete and Random Variables T1 – 7.7
Continuous, Probability mass and R2 – Chap 4
Density Functions,
7 Probability Distributions , Probability R2 – Chap 4
Cumulative distribution, Mean and Distributions
variance, Expectation
8-9 Distributions – Uniform, Normal, Types of R2 – Chap 5
Exponential, Poisson, Binomial Distributions
10-11 Review of Sets, relations and Set theory T1 – Chap 1,2,3
Functions R1 – 2.1, 2.2, 7.1
12 Injective, Surjective and Bijective Functions T1 – 3.3
functions, Function Inverse R1 – 2.3
13 Function composition, relation of Function T1 – 3.4
composition with function inverse composition
14-15 Relation representation using Relation theory T1 - 2.4 – 2.8
matrix and graphs, relation R1 – 8.3 – 8.5
composition, closures
16 Partial Order Relations, hasse Posets T1 – 2.9
Diagrams, Properties of Hasse R1 – 8.6
Diagram
17-19 Lattices, properties of lattices, Lattices T1 – Chap 14
sublattices, special lattice types –
isomorphic, bounded, modular,
distributive, complemented
20-21 Basic logical connectives and truth Mathematical Logic T1 – 4.1 – 4.8
tables, Conditional and R1 – 1.1, 1.2
Biconditional, , logical equivalence,
Laws of Logic
22-23 Logicsl Implication and rules of Inference T1 – 4.9
inference R1 – 1.2, 1.5
24-25 Quantifiers and quantified rules of Quantifiers T1 – 4.10, 4.11
Inference R1 – 1.3 – 1.5,
1.8
26-27 Methods of Proofs – Mathematical Mathematical T1 – 11.3
Induction, proof by contradiction, proofs R1 – 1.6, 4.1
contraposition etc
28-29 Basic definition of groups and Algebraic T1 – B.1 – B.3
properties, Group Operations Structures
30 Morphisms – Homomorphism and Group Theory T1 – B.4
isomorphism
31-32 Types of Groups – permutation Group Types T1 – B.5
groups, subgroups, cyclic groups
33-36 Cosets, Lagrange theorem, Cosets T1 – B.6
Groupoid, Monoid, semigroup,
Introdution to Rings and Fields
37-38 Introduction to Boolean Algebra, Algebras T1 – 15.1 , 15.2,
Rules and properties of Algebras 15.5
and subalgebras, Boolean R1 – 11.1
Algebras as lattices
39-40 Basic Operators of Boolean Boolean Algebra T1 – 15.3, 15.4,
algebra, Duality, Basic Theorems, Concepts 15.11
truth Tables, Logic Gates R1 – 11.1, 11.2
41-43 SoP and PoS form of Boolean Boolean T1 – 15.6 – 15.8
expressions, Canonical forms of Expressions
expressions, minterms and
maxterms, Prime implicants
44-45 Minimization of Boolean Minimization of T1 – 15.9, 15.12
expressions using Boolean laws expressions R1 – 11.4
and K-maps of 4-5 variable
expressions
46 Implementation of minimized Logic Gate T1 – 15.10
Boolean expressions using Logic implementation R1 – 11.3, 11.4
gates

Evaluation Scheme

EC Component Duration Marks Weightage Date & Nature

No. (%) Time
1 Mid Term test 1:30 Hrs 25 25 Closed Book
2 End Term 03:00 Hrs 50 50 Closed Book
Examination
3 Class Attendance
4. Assignments 10 * Note 1
5. Quizzes/ Class * Note 2 Open/Closed
tests Book

Chamber Consultation Hours : To be announced in the class

Note 1 : A total of 5 Assignments will be given in the entire semester, one per unit.
Note 2: In the entire semester 2-3 quizzes/ class tests will be conducted. The performance
in the same will count towards final evaluation

Notices, slides and assignments and other course related material: Would be made
available through university LMS system/Moodle