Scribd
Upload
168 views192 pages

Discrete Mathematical Structures Min

This document provides information about the Discrete Mathematical Structures course offered by the Department of Computer Science and Engineering at an academic institution. The course is offered in the second semester of the second year and covers topics like mathematical logic, sets, relations, functions, counting techniques, combinatorics, recurrence relations, and graph theory. The course aims to introduce concepts that can help solve real-world problems. It has 5 units and covers 45 hours of teaching. Two textbooks and additional online resources are also listed.

Uploaded by

asamiteng
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
168 views192 pages

Discrete Mathematical Structures Min

This document provides information about the Discrete Mathematical Structures course offered by the Department of Computer Science and Engineering at an academic institution. The course is offered in the second semester of the second year and covers topics like mathematical logic, sets, relations, functions, counting techniques, combinatorics, recurrence relations, and graph theory. The course aims to introduce concepts that can help solve real-world problems. It has 5 units and covers 45 hours of teaching. Two textbooks and additional online resources are also listed.

Uploaded by

asamiteng
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 192

Department of Computer Science and Engineering

Academic Year 2023-24


II. B.Tech I Semster
Discrete Mathematical Structures
(Common to CSE,CIC,AIDS,AIML,CSE(DS))
(20ABS9914)
Prepared By

Dr. A Sreenivasulu
Assistant Professor
Department of HBS, AITS
Course Code L T P C
Discrete Mathematical Structures
20ABS9914 (common to CSE,CIC,AIDS,AIML,CSE(DS)) 3 0 0 3

Pre-requisite Basic Mathematics Semester II-I


Course Objectives:
Introduce the concepts of mathematical logic and gain knowledge in sets, relations and functions and Solve problems
using counting techniques and combinatorics and to introduce generating functions and recurrence relations. Use
Graph Theory for solving real world problems.
Course Outcomes (CO):
CO1: Make use of mathematical logic to solve problems
CO2: Analyse the concepts and perform the operations related to sets, relations and functions.
CO3: Identify basic counting techniques to solve combinatorial problems.
CO4: evaluate solutions by using recurrence relations
CO5: utilize Graph Theory in solving computer science problems

UNIT – I Mathematical Logic 9 Hrs


Introduction, Statements and Notation, Connectives, Well-formed formulas, Tautology, Duality law, Equivalence,
Implication, Normal Forms, Functionally complete set of connectives, Inference Theory of Statement Calculus,
Predicate Calculus, Inference theory of Predicate Calculus.
UNIT – II Set theory 9 Hrs
Basic Concepts of Set Theory, Relations and Ordering, The Principle of Inclusion- Exclusion, Pigeon hole principle
and its application, Functions composition of functions, Inverse Functions, Recursive Functions, Lattices and its
properties. Algebraic structures: Algebraic systems-Examples and General Properties, Semi groups and Monoids,
groups, sub groups, homomorphism, Isomorphism.
UNIT – III Elementary Combinatorics 9 Hrs
Basics of Counting, Combinations and Permutations, Enumeration of Combinations and Permutations,
Enumerating Combinations and Permutations with Repetitions, Enumerating Permutations with Constrained
Repetitions, Binomial Coefficients, The Binomial and Multinomial Theorems.
UNIT – IV Recurrence Relations 9 Hrs
Generating Functions of Sequences, Calculating Coefficients of Generating Functions, Recurrence relations, Solving
Recurrence Relations by Substitution and Generating functions, The Method of Characteristic roots, Solutions of
Inhomogeneous Recurrence Relations.
UNIT – V Graphs 9 Hrs
Basic Concepts, Isomorphism and Sub-graphs, Trees and their Properties, Spanning Trees,Directed Trees, Binary
Trees, Planar Graphs, Euler’s Formula, Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic
Numbers, The Four Color Problem
Textbooks:
1.Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for Computer Scientists &
Mathematicians, 2nd Edition, Pearson Education.
2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science,
Tata McGraw Hill, 2002.
Reference Books:
1.Kenneth H. Rosen, Discrete Mathematics and its Applications with Combinatorics and Graph Theory, 7th
Edition, McGraw Hill Education (India) Private Limited.
2. Graph Theory with Applications to Engineering and Computer Science by Narsingh Deo.
Online Learning Resources:
http://www.cs.yale.edu/homes/aspnes/classes/202/notes.pdf

Mapping of course outcomes with program outcomes


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3

CO2 3

CO3 3

CO4 3

CO5 3
(Levels of Correlation, viz., 1-Low, 2-Moderate, 3 High)

You might also like