COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Dept.: COMPUTER SCIENCE & ENGINEERING
Name/Dept. : SATENDRA KUMAR Year/Semester :
2nd/ 3rd
Hours
Subject : Discrete Structure and Theory of Logic Required : 40
Code BCS303 Hours Planned 106
: :
Coordinator Mr. Abhishek Kr Yadav Pre-Requisite BASIC KNOWLEDGE OF SET THEOTY
:
Course Objectives:
1. To introduce the concepts of mathematical logic
2. To introduce the concepts of sets, relations, and functions.
3. To perform the operations associated with sets, functions, and relations.
4. To introduce generating functions and recurrence relations.
5. To relate practical examples to the appropriate set, function, or relation model, and interpret the associated operations and terminology in context. To use Graph
Theory for solving problems
Course Outcomes:
1. Write an argument using logical notation and determine if the argument is or is not valid.
2. Understand the basic principles of sets and operations in sets.
3. Demonstrate an understanding of relations and functions and be able to determine their properties.
4. Demonstrate different traversal methods for trees and graphs.
5. Ability to apply mathematical logic to solve problems.
6. Able to model and solve real world problems using graphs and trees
7. Model problems in Computer Science using graphs and trees.
8. Determine when a function is 1-1 and "onto".
9. Demonstrate different traversal methods for trees and graphs.
10. Model problems in Computer Science using graphs and trees.
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Unit I
Text Books:
Set Theory, Functions and Natural 1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e,
Numbers: 2. McGraw-Hill, 2006.
3. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
Target Lecture Hours :25 4. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
5. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
Target Tutorial Hours : 02 6. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
Sl. Period Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
01 04.09.2024 1 Introduction, Combination of sets. White Board Marker
02 06.09.2024 1 Multisets, Ordered pairs White Board Marker
03 08.09.2024 1 Proofs of some general identities on sets. White Board Marker
04 09.09.2024 2 Relations Definition, Operations on relations White Board Marker
05 12.09.2024 1 Properties of relations, Composite Relations White Board Marker
Equality of relations, Recursive definition of White Board Marker
06 13.09.2024 2
relation
07 15.09.2024 1 Order of relations White Board Marker
08 16.09.2024 2 Functions: Definition, Classification of functions White Board Marker
09 19.09.2024 1 Operations on functions White Board Marker
10 20.09.2024 1 Recursively defined functions White Board Marker
11 21.09.2024 1 Growth of Functions White Board Marker
12 22.09.2024 1 Natural Numbers: Introduction White Board Marker
13 23.09.2024 1 Mathematical Induction White Board Marker
14 25.09.2024 1 Variants of Induction White Board Marker
15 26.09.2024 1 Induction with Nonzero Base cases. White Board Marker
16 27.09.2024 2 Proof Methods White Board Marker
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
17 29.09.2024 1 Proof by counter – example White Board Marker
18 30.09.2024 2 Proof by contradiction White Board Marker
19 02.10.2024 1 Tutorial
20 03.10.2024 1 Class test
Faculty Class Coordinator HoD
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Unit II
Text Books:
Algebraic Structures 1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e,
2. McGraw-Hill, 2006.
3. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
Target Lecture Hours :20 4. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
5. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
Target Tutorial Hours : 02 6. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
Sl. Period Actual Date of
Date Topics to be Covered Ref. Book/ Page No. Mode of Teaching Remark
No. Reqd. Completion
1 04.10.2024 2 Algebraic Structures: Definition, Groups White Board Marker
2 06.10.2024 2 Subgroups and order White Board Marker
3 09.10.2024 2 Cyclic Groups, Cosets White Board Marker
4 11.10.2024 2 Lagrange's theorem White Board Marker
5 13.10.2024 2 Normal Subgroups White Board Marker
6 14.10.2024 2 Permutation and Symmetric groups White Board Marker
7 17.10.2024 2 Group Homeomorphisms, White Board Marker
8 19.10.2024 2 Definition and elementary properties of Rings White Board Marker
9 21.10.2024 2 Definition and elementary properties Fields. White Board Marker
10 23.10.2024 1 Tutorial
11 24.10.2024 1 Class test
Faculty Class Coordinator HoD
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Unit III
Text Books:
Lattices: 1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e,
2. McGraw-Hill, 2006.
3. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
4. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
Target Lecture Hours : 21
5. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
6. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
Target Tutorial Hours : 02 7. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill.
Sl. Period Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
01 25.10.2024 2 Definition, Properties of lattices White Board Marker
02 27.10.2024 2 Bounded lattices White Board Marker
03 30.10.2024 2 Complemented lattices White Board Marker
04 01.11.2024 2 Modular and Complete lattice. White Board Marker
Boolean Algebra: Introduction, Axioms and
05 03.11.2024 2 Theorems of Boolean algebra
White Board Marker
06 04.11.2024 2 Algebraic manipulation of Boolean expressions White Board Marker
07 07.11.2024 2 Simplification of Boolean Functions White Board Marker
08 10.11.2024 2 Karnaugh maps White Board Marker
09 14.11.2024 1 Logic gates,
10 15.11.2024 2 Digital circuits and Boolean algebra.
11 17.11.2024 1 Tutorial
12 18.11.2024 1 Class test
Faculty Class Coordinator HoD
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Unit IV
Text Books:
Propositional Logic and 1. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
Predicate Logic 2. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
3. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
Target Lecture Hours :22 4. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
5. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill.
Target Tutorial Hours : 02
Sl. Period Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
Propositional Logic: Proposition, well
01 20.11.2024 2 White Board Marker
formed formula,
02 22.11.2024 2 Truth tables White Board Marker
03 24.11.2024 2 Tautology White Board Marker
04 28.11.2024 2 Satisfiability White Board Marker
05 30.11.2024 1 Contradiction White Board Marker
06 01.12.2024 1 Algebra of proposition White Board Marker
07 02.12.2024 2 Theory of Inference White Board Marker
08 05.12.2024 2 Predicate Logic: First order predicate, White Board Marker
09 07.12.2024 2 well-formed formula of predicate White Board Marker
10 09.12.2024 2 Quantifiers White Board Marker
11 12.12.2024 2 Inference theory of predicate logic. White Board Marker
12 14.12.2024 1 Tutorial
13 15.12.2024 1 Class test
Faculty Class Coordinator HoD
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Unit V
Text Books:
Trees, Graphs and 1. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
Combinatorics 2. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
3. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
Target Lecture Hours :20 4. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
5. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill.
Target Tutorial Hours : 02
Sl. Period Ref. Book/ Page Actual Date of
Date Topics to be Covered Mode of Teaching Remark
No. Reqd. No. Completion
01 16.12.2024 1 Definition of Binary tree, Chalk & talk
02 18.12.2024 1 Binary tree traversal Chalk & talk
03 19.12.2024 1 Binary search tree. Chalk & talk
04 20.12.2024 1 Graphs: Definition and terminology Chalk & talk
05 21.12.2024 1 Representation of graphs Chalk & talk
06 22.12.2024 1 Multigraphs, Bipartite graphs Chalk & talk
23.12.2024 2 Planar graphs, Isomorphism and Chalk & talk
07
Homeomorphism of graphs
08 26.12.2024 1 Euler and Hamiltonian paths Chalk & talk
09 27.12.2024 1 Graph coloring Chalk & talk
10 28.12.2024 1 Recurrence Relation & Generating function Chalk & talk
11 29.12.2024 1 Recursive definition of functions Chalk & talk
12 30.12.2024 1 Recursive algorithms Chalk & talk
13 31.12.2024 2 Method of solving recurrences Chalk & talk
14 02.01.2025 1 Combinatorics: Introduction Chalk & talk
15 04.01.2025 1 Counting Techniques Chalk & talk
16 05.01.2025 1 Pigeonhole Principle Chalk & talk
17 06.01.2025 1 Tutorial
18 07.01.2025 1 Class test
Discrete Structure and Theory of Satendra Kumar
Logic
COURSE PLAN PRASAD INSTITUTE OF TECHNOLOGY, JAUNPUR (144)
Text Books:
1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
4. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill.
6. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill.
7. Deo, Narsingh, “Graph Theory With application to Engineering and Computer. Science.” PHI.
8. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi
Reference Books:
1. C. Liu, D. Mohapatra[CM]. Elements of Discrete Mathematics. 2008.
2. Tata McGraw-Hill. [Link] [TK].Discrete mathematics with applications.2003.
3. Academic Press. J. Hein [JH]. Discrete structures, logic and computability.2009. Jones & Bartlett Publishers.
Faculty In-charge Class Coordinator HoD
PRINCIPAL
Discrete Structure and Theory of Satendra Kumar
Logic
