COURSE STRUCTURE
( NEP REVISION 2023)
SCHOOL OF COMPUTER ENGINEERING W. E. F. : 2024-2025
RELEASE DATE : 01/08/2024
FIRST YEAR BACHELOR OF TECHNOLOGY
(COMPUTER ENGINEERING (SOFTWARE ENGINEERING))
REVISION NO. : 2.0 (NEP)
SEMESTER: II (COMPUTER ENGINEERING (SOFTWARE ENGINEERING))
TEACHING
COURSE EXAMINATION SCHEME AND MARKS
SCHEME
C
R
T E
Hour/Week THEORY PRACT
O D
TYPE CODE NAME T I
A T
TH P TU IA MSE ESE CA D/P
L
BSC 2301103 Statistics and Integral Calculus 3 - 1 30 20 50 20 30 150 4
2301102T Engineering Physics 2 - - 15 20 40 - - 75 2
BSC
2301102L Engineering Physics Lab - 2 - - - - 20 30 50 1
lectrical and Electronics
E
2307101T 2 - - 15 20 40 - - 75 2
Engineering
ESC
lectrical and Electronics
E
2307101L - 2 - - - - 20 30 50 1
Engineering Lab
2303101T Essentials of Data Science 2 - - 15 20 40 - - 75 2
ESC
2303101L Essentials of Data Science Lab - 2 - - - - 20 30 50 1
2310162T Data Visualization 1 - - 15 - 20 - - 35 1
VSEC
2310162L Data Visualization Lab - 2 - - - - 20 20 40 1
PCC 2310111T Discrete Structure 2 - - 15 20 40 - - 75 2
ommunication Skills
C
HMMS 2301111/
(English/German/Japanese/ - 4 - - - - 35 40 75 2
AEC 2/3/4
French)
CC 2307183 Creative Technologies - 4 - - - - 35 40 75 2
TOTAL 12 16 1 825 21
*Two Credit Internships need to be completed after Completion of the First Year.
Format No. :MITAOE/ACAD/ 001 Rev. No. :1.0 Rev. Date:01/07/2019 Page10of25
COURSE SYLLABUS
SCHOOL OF AY: 2023 - 2024
W.E.F
COMPUTER ENGINEERING (Rev. 2023 (NEP))
COURSE NAME Discrete Structure
FIRST YEAR BACHELOR OF
TECHNOLOGY COURSE CODE 2310111T
COURSE CREDITS 2
RELEASE DATE : 01/08/2023 REVISION NO. 2.0
TEACHING SCHEME EXAMINATION SCHEME AND MARKS
(HOURS/WEEK) THEORY LABORATORY
TOTAL
LECTURE PRACTICAL IA MSE ESE CA PRACT/DEMO/PRES.
2 NIL 15 20 40 NIL NIL 75
COURSE OBJECTIVES :
2310111T.CEO.1: To learn the basics of set theory and propositional logic.
2310111T.CEO.2: To use appropriate set, function, or relation models to analyze practical examples.
2310111T.CEO.3: To apply the Model and analyze computational processes using combinatorial meth-
ods.
2310111T.CEO.4: To explore several logical possibilities and algebraic structures.
2310111T.CEO.5: To understand and solve problems on graphs and trees.
COURSE OUTCOMES :
After successful completion of the course, students will be able to,
2310111T.CO.1: Develop the notion of mathematical thinking, and mathematical proofs in problem
analysis [L2].
2310111T.CO.2: Apply propositional logic to elementary mathematical arguments to ensure reasoning
[L3].
2310111T.CO.3: Solve problems using Permutations, combinations,relations, and functions [L2].
2310111T.CO.4: Apply the concepts of graphs and trees for problem-solving [L3].
Format No.: MITAOE/ACAD/002 Rev. No.: 2.0 Rev. Date: 01/07/2019
COURSE ABSTRACT:
The course will be an introduction to Discrete Mathematics which comprises the essentials for a computer
science student to go ahead and study any other topics in the subject. The emphasis will be on problem-
solving as well as proofs. The course will provide motivational illustrations and applications throughout
the course. The course assumes no prerequisites except for high school-level arithmetic and algebra.
THEORY COURSE CONTENTS
UNIT 1 BASIC SETS THEORY 06 HOURS
Applications/Case Study: Bank Management System, Online Shopping System: Specialization and
Generalization
Contents: Sets, Basic operations of sets, Finite and Infinite sets, Principle of Inclusion and exclusion,
power sets, countable and uncountable sets. .
Self Study: Multi-Sets, Use of Multi Sets
Further Readings:Applications of Mathematical Induction
UNIT 2 PROPOSITIONAL LOGIC 06 HOURS
Applications/Case Study: Applications of Propositional Logic in AI, Logic Puzzles
Contents: Propositional Logic: logic, Propositions, Conditional Propositions, Logical Connectivity,
prepositional calculus, Universal and Existential Quantifiers, and Rules of inference.
Self Study:Propositional Equivalences.
Further Readings:Application of propositional logic in Boolean Algebra, Logic Circuits.
UNIT 3 RELATIONS 06 HOURS
Applications/Case Study: Relation between sets and associated functions
Contents:Relations: Definition and Properties of Binary Relations, Closure of relations, Warshalls
algorithm, Equivalence relations and partitions, Partial ordering relations,Hasse Diagram, and lattices,
Chains and Antichains.
Functions: Functions, Surjective, Injective and Bijective functions, Composition of functions.
Self Study: Application Recurrence Relation for Analysis of Algorithm.
Further Readings:Linear Recurrence Relations with Constant Coefficients.
UNIT 4 COUNTING METHODS AND THE PIGEONHOLE PRINCI- 06 HOURS
PLE
Applications/Case Study: Library Management System, Diet Planning System
Contents: The Basics of Counting, rule of Sum and Product, Permutations and Combinations ,
Binomial Coefficients and Combinatorial Identities, and pigeonhole principle.
Self Study: Algorithms for generating Permutations and Combinations..
Further Readings:Discrete Probability Theory.
Format No.: MITAOE/ACAD/002 Rev. No.: 2.0 Rev. Date: 01/07/2019
UNIT 5 ALGEBRAIC STRUCTURES 06 HOURS
Applications/Case Study: Cryptography
Contents: Groups theory: Algebraic Systems, Groups, Semi-Groups, Monoids, Subgroups, Permuta-
tion Groups, Codes and Group codes, Isomorphism and Auto-morphisms, Homomorphism.
Self Study: Euclidean algorithm.
Further Readings:Abelian and cyclic groups.
TEXT BOOKS
1. R. Johnsonbaugh (2009). Discrete Mathematics. 5th Edition, Pearson Education, ISBN
817808279- 9 C.
2. Liu and D. P. Mohapatra (2008). Elements of Discrete Mathematics. 6th TataMcGraw-Hill,ISBN
10:0-07-066913-9
3. Kenneth H. Rosen (2007). Discrete Mathematics and its Applications. 6th McGraw-Hill, ISBN
978-0-07-288008-3
REFERENCE BOOKS
1. N. Biggs (2002). Discrete Mathematics. 3rd Edition, Oxford University Press.
2. E. Goodaire and M. Parmenter Discrete Mathematics with Graph Theory. 2nd Edition, Pearson
Education.
3. Semyour Lipschutz Marc Lipson Discrete Mathematics. 3rd Edition, McGraw-Hill.
4. B. Kolman, R. Busby and S. Ross Discrete Mathematical Structures. 4th Edition, Pearson
Education.
Format No.: MITAOE/ACAD/002 Rev. No.: 2.0 Rev. Date: 01/07/2019
