Scribd
Upload
6 views

Discreate Mathematics CSE-syllabus_-2024-25

The document outlines the Course Articulation Matrix for Discrete Mathematics and Formal Language & Automata Theory, detailing the mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs). It includes course objectives, prerequisites, unit content, and expected outcomes for students upon completion of the courses. Additionally, it provides a list of textbooks and reference materials for further study.

Uploaded by

priyatosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Discreate Mathematics CSE-syllabus_-2024-25

The document outlines the Course Articulation Matrix for Discrete Mathematics and Formal Language & Automata Theory, detailing the mapping of Course Outcomes (COs) with Program Outcomes (POs) and Program Specific Outcomes (PSOs). It includes course objectives, prerequisites, unit content, and expected outcomes for students upon completion of the courses. Additionally, it provides a list of textbooks and reference materials for further study.

Uploaded by

priyatosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Mapping of COs with POs and PSOs (Course Articulation Matrix):

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 2 2 - - - - - - - 3 3 3 1
CO2 3 2 2 2 1 - - - - 1 - 3 3 3 2
CO3 3 3 2 3 1 - - - - 1 - 3 3 3 3
CO4 2 3 3 3 - - - - 1 2 - 3 3 3 3
AVG. 2.83 2.83 2.17 2.50 1.00 1.00 1.00 0.00 1.00 1.33 0 3.00 3.00 3.00 2.50

Discrete Mathematics
Code: PCC-CSE 404
Contacts: 3L+1T
Theory: 4 hrs. / Week
Credit points: 4

Course Objective:
1. Use mathematically correct terminology and notation.
2. Construct correct direct and indirect proofs.
3. To know Syntax, Semantics, Validity and Satisfiability, Graphs and Trees.
4. Use counterexamples. Apply logical reasoning to solve a variety of problems.

Pre-Requisite:
1. Some concepts from basic math – algebra, geometry

Unit Content Hrs.


1 Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, 12
Binary Relation, Equivalence Relation, Partial Ordering Relation, Hasse diagram,
Functions, Domain and range of function Inverse and Composite Function,
Bijective function, Inverse and Composite Function, Principles of Mathematical
Induction, Well- ordering principle, Recursive definition, Division algorithm, Prime
Numbers, Greatest Common Divisor: Euclidean Algorithm, Fundamental theorem
of arithmetic, Least common multiple, Diophantine equation, Congruence,
Properties of congruence, residue classes, Solution of linear congruence, Fermat‟s
theorem, Wilson‟s theorem.
2 Basic counting techniques: Permutation and combination, Principle of inclusion and 4
exclusion, Pigeon-hole principle.
3 Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic 8
Connectives and Truth Tables, Logical Equivalence: The Laws of Logic, Logical
Implication, Rules of Inference, The use of Quantifiers. Proof Techniques: Some
Terminology, Proof Methods and Strategies, Forward Proof, Proof by
Contradiction, Proof by Contraposition, Proof of Necessity and Sufficiency.
4 Algebraic Structures and Morphism: Algebraic Structures with one Binary 10
Operation, Semi Groups, Monoids, Groups, Sub-group, Quotient Structures, Cyclic
Groups, Coset, Normal Subgroups, Permutation Groups, Quotient group.
Morphism: Homomorphism and Isomorphism, Kernel and Image. Algebraic
Structures with two Binary Operation, Rings, Integral Domain and Fields.
5 Graphs and Trees: Graph coloring, Chromatic number, Chromatic polynomial, 14
Decomposition theorem, Planarity of a graph, Clique, Clique number, Independent
set, Independence number, Brooke‟s theorem, Tree: Definition, types of tree
(rooted, binary), properties of trees. Theorems of tree, Prim‟s and Kruskal‟s
Algorithms to find MST. Weighted trees and prefix codes. Single source shortest
path: Dijkstra‟s Algorithm. Tree traversal algorithms: BFS & DFS. Dual and Planar
graphs, detection of planarity, Theorems on planarity. Matching, Maximal and
perfect matching, Matching number, SDR of Matching, Hall Marriage theorem.
Text book and Reference books:
1. A text book of Discrete Mathematics, Guruprasad Samanta, New Age International.
2. Gary Haggard, John Schlipf and Sue Whitesides, Discrete Mathematics for Computer
Science, CENGAGE Learning
3. J.K. Sharma, Discrete Mathematics, Macmillan
4. S. K. Chakraborty and B. K. Sarkar, Discrete Mathematics, OXFORD University Press.
5. Douglas B. West, Introduction to graph Theory, PHI
6. C. L. Liu, Elements of Discrete Mathematics, 2nd Ed., Tata McGraw-Hill, 2000.
7. N. Deo, Graph Theory, Prentice Hall of India, 1974.
8. S. Lipschutz and M. L. Lipson, Schaum's Outline of Theory and Problems of Discrete
Mathematics, 2nd Ed., Tata McGraw-Hill, 1999.
9. J. P. Tremblay and R. P. Manohar, Discrete Mathematics with Applications to Computer
Science, Tata McGraw-Hill, 1997.
10. N. Chandrasekaran and M. Umaparvathi, Discrete Mathematics, PHI

Course Outcomes:
On completion of the course students will be able to
PCC-CSE 404.1 Remember the concept of set theory, counting techniques, basic algebraic structures,
and graphs. Discuss the logic sentence in terms of predicates, quantifiers, and logical
connectives.
PCC-CSE 404.2 Derive the solution for a given problem using deductive logic and prove the solution
based on logical inference. Evaluate different relations, and algorithms of number
theory, logic, counting techniques, and graph theory.
PCC-CSE 404.3 Classify algebraic structure for a given a mathematical problem. Analyze algorithms
and logic related to real-life problems.
PCC-CSE 404.4 Apply functions, basic and advanced principles of counting, logical equivalence,
algebraic structures, and algorithms to solve complex engineering problems.

Mapping of COs with POs and PSOs (Course Articulation Matrix):


PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 3 2 - - - 1 - - 2 3 3 2
CO2 3 3 3 3 2 1 1 - 2 2 2 3 3 3 1
CO3 3 3 3 3 3 2 - - 1 1 1 3 3 3 2
CO4 3 3 2 3 3 - - 2 3 1 2 2 3 2 3
AVG. 3.00 3.00 2.75 3.00 2.50 1.50 1.00 2.00 1.75 1.33 1.67 2.50 3.00 2.75 2.00

Formal Language & Automata Theory


Code: PCC-CSE 405
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3

Course Objective:
1. Be able to know different classes of grammars and formal languages.
2. Be able to write grammar and construct finite automata for different languages.
3. Be able to know properties of regular expression and construct pushdown automata for context
free grammars.
4. Be able to understand undesirability and decide on languages that are undesirable.

Pre-Requisite:
1. Basics of Set Theory, Graph Theory
2. Principle of Mathematical Induction, Proof by Contradiction

You might also like