Scribd
Upload
520 views

Discrete Structures Syllabus PDF

This document provides information about the Discrete Structures course offered at Madhav Institute of Technology & Science. The course aims to teach students about basic algebra, functions and relations, propositional logic, graph theory, and discrete numeric functions. It is divided into 5 units that cover topics such as sets, functions, propositional logic, graph theory, recurrence relations, and algebraic structures. The course outcomes are that students will understand key concepts and be able to illustrate, implement, apply, analyze, and design solutions to engineering problems using the discrete mathematics topics studied in the course. Recommended textbooks are also listed.

Uploaded by

King Developer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
520 views

Discrete Structures Syllabus PDF

This document provides information about the Discrete Structures course offered at Madhav Institute of Technology & Science. The course aims to teach students about basic algebra, functions and relations, propositional logic, graph theory, and discrete numeric functions. It is divided into 5 units that cover topics such as sets, functions, propositional logic, graph theory, recurrence relations, and algebraic structures. The course outcomes are that students will understand key concepts and be able to illustrate, implement, apply, analyze, and design solutions to engineering problems using the discrete mathematics topics studied in the course. Recommended textbooks are also listed.

Uploaded by

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

MADHAV INSTITUTE OF TECHNOLOGY & SCIENCE, GWALIOR

(A Govt. Aided UGC Autonomous Institute Affiliated to RGPV, Bhopal)

B.E. (Fifth semester for CS and IT)

BSC-6: Discrete Structures (CS 150501/IT 160501)

L T P C
Objective of Course
To perceive the knowledge of basic algebra 3 1 NIL 4
To describe function and its relation
To familiarize propositional logic
To know about the graph theory and its application in computer engineering
To familiarize the discrete numeric function and generating function

Unit 1:
Finite and infinite sets, mathematical induction, Principles of inclusion and exclusion, multisets, functions and
relations, binary relations, equivalence relations and partitions, partial ordering relations and lattices, chains,
Pigeonhole principle.

Unit 2:
Prepositional logic, syntax, semantics of Atf (atomic formula), Wff’(well formed formula’s),validity and
satisfiability of wff’ by Quine’s method, Normal and closure form of prepositional calculus.

Unit 3:
Introduction and basic terminology of graphs, planner graphs, multi-graphs and weighted graph, shortest path in
weighted graph, Introduction to Eularian paths and circuits, Hamiltonian paths and circuits, Introduction to
trees, rooted trees, Path length in rooted trees, spanning trees and cut trees.

Unit 4:
Introduction to discrete numeric functions and generating functions, Introduction to recurrence relations and
recursive algorithms, linear recurrence relations with constant coefficients, homogeneous solutions, particular
solutions and total solutions.

Unit 5:
Introduction to group, subgroups, generations and evaluation of power, cosets and Lagrange’s theorem, group
codes, isomorphism and automorphism, homomorphism and normal sub groups, ring, integral domain and field.

Course Outcomes
After completing this course, the students will be able to:

CO1 Understand the basic concept of set theory, prepositional logic, graph theory, discrete numeric function
and algebraic structure.
CO2 Illustrate the knowledge of course content and distinguish between them in terms of their applications.
CO3 Implement the course content tosolve the problems.
CO4 Apply the concepts of studied topics with suitable technique faced in engineering problems.
CO5 Analyze the set theory, prepositional logic, graph theory, discrete numeric function and algebraic
structure to examine the real world problem.
CO6 Design analytical skill and interpret applications of engineering beneficial in real time troubleshooting.

Recommended Books:
J. Tremblay and Manohar: Discrete Mathematical Structures with Application to Computer science.
Narsingh Deo: Graph Theory.
C.L.Liu: Discrete Mathematics.
Rosen: Discrete Mathematics and its Applications
Herstein: Topics in Algebra

You might also like