Scribd
Upload
13 views

Discrete Mathmatics-Lecture - 1

Uploaded by

rushilpatel210210
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views

Discrete Mathmatics-Lecture - 1

Uploaded by

rushilpatel210210
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Discrete Mathematics-

2CS305
Objective of the Course

 The objective of the course is to build the fundamentals from


Mathematical perspective into students and prepare them for domain-
specific or interdisciplinary applications of these aspects. Students are
expected to learn the concepts of various facets of Discrete
Mathematics and use them in solving problems in relevant fields.
Faculty Members Involved
 (Course Coordinator) Prof. Deepti Saraswat :[email protected]

 Dr Swati Jain : [email protected]

 Dr Ram krishan Dewangan : [email protected]


Program Objectives
 The Program Educational Objectives of B. Tech. Program are:

 PEO I: To prepare graduates who will be successful professionals


in industry, government, academia, research, entrepreneurial pursuit and
consulting firms.
 PEO II: To prepare graduates who will contribute to society as broadly
educated, expressive, ethical and responsible citizens with proven
expertise.
 PEO III: To prepare graduates who will achieve peer-recognition; as
an individual or in a team; through demonstration of good analytical,
design and implementation skills.
 PEO IV: To prepare graduates who will thrive to pursue life-long
learning to fulfill their goals.
Program Outcomes
 Program Outcomes of B. Tech. Program are:
 PO1 : an ability to apply knowledge of mathematics, science and engineering in
practice
 PO2 : an ability to identify, critically analyze, formulate and solve engineering
problems with comprehensive knowledge in the area of specialization
 PO3 : an ability to select modern engineering tools and techniques and use them with
appropriate skills
 PO4 : an ability to design a system and process to meet desired needs within realistic
constraints such as health, safety, security and manufacturability
 PO5 : an ability to contribute by research and innovation to solve engineering
problems
 PO6 : an ability to understand the impact of engineering solutions in a contemporary,
global, economical, environmental, and societal context for sustainable development
 PO7 : an ability to function professionally with ethical responsibility as an individual as
well as in multidisciplinary teams with positive attitude
 PO8 : an ability to communicate effectively
 PO9 : an ability to appreciate the importance of goal setting and to recognize the need
for life-long reflective learning
Course Objectives
Programme Outcomes: PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9

CLO1: interpret the


preliminaries of discrete √
mathematics

CLO2: comprehend role of


discrete mathematics in √ √ √ √ √
theoretical computer science

CLO3: recognize the


importance of formal approach √ √ √
for solving computing
problems
Syllabus: Teachi
ng
Hours:
Unit I Syllabus
Sets, Relation and Function: Operations and laws of sets, Cartesian products, binary
3

relation, partial ordering relation, equivalence relation, image of a set, sum and
product of functions, bijective functions, inverse and composite function. Basic
counting techniques: inclusion and exclusion, pigeon-hole principle.
Unit II 6
Proof Techniques: proof methods and strategies, forward proof, proof by
contradiction, principles of mathematical induction, strong induction, the well-
ordering principle, recursive definition, proof by contraposition, proof of necessity
and sufficiency.
Unit III 6
Propositional Logic: syntax, semantics, validity and satisfiability, basic connectives
and truth tables. logical equivalence: the laws of logic, logical implication, rules of
inference, the use of quantifiers.
Unit IV 5
Algebraic Structures and Morphism: algebraic structures with one binary operation,
semi groups, monoids, groups, congruence relation and quotient structures, free and
cyclic monoids and groups, permutation groups.
Unit V 6
Graphs and Trees: graphs and their properties, isomorphism, Eulerian and
Hamiltonian walks, graph coloring, perfect graph, rooted trees, trees and sorting,
weighted trees and prefix codes, shortest path, spanning trees.
Unit VI 4
Recurrence Relations and Recursive Algorithms: Recurrence relations, linear
recurrence relations with constant coefficients, use of recurrence relations for
analysis of algorithms
Reference Books

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


 Tremblay, J.P. & Manohar, Discrete mathematical structures with
application to computer science, McGraw Hill
 Rosen, Kenneth L., Discrete Mathematics and its applications, McGraw
Hill
 Susanna S. Epp, Discrete Mathematics with Applications, Wadsworth
Publishing Co. Inc.
Exam Weightage

Evaluation Scheme

CE LP SEE

0.60 0.00 0.40

CE
Component
0.30 0.30 0.40

3 Class Test 2 Tutorial Based Comprehensive


Test Assesment
Interse weitage(CE)

 Test Based on tutorials : 0.3


 3 Quiz : 0.3
 Comprehensive assessment: 0.3
How we will conduct the session
 Online sessions two divisions combined

 3 sessions instead of two to help you better understand.

You might also like