Scribd
Upload
4 views

CourseCurriculum (7)

Uploaded by

Lucky Gupta
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

CourseCurriculum (7)

Uploaded by

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

Course Curriculam

Course Code: CSE208 Credit Units L T P/S SW AS/DS FW No. of PSDA Total Credit Unit
Course Level UG 3 0 0 0 0 0 0 3
Course Title Discrete Mathematical Structures

Course
Description :

Course Objectives :

SN
Objectives
.
Provide the fundamentals and the concepts of Discrete Mathematical Structures with Applications to Computer Sciences including Mathematical
1
Logic, Boolean Algebra and its Applications, Graphs and Trees.
Help the students to understand the computational and algorithmic aspects of Sets, Relations, Mathematical Logic, Boolean algebra, Graphs, Trees
2
and Algebraic Structure in the field of Computer sciences and its applications.

Pre-Requisites : General

SN. Course Code Course Name

Course Contents / Syllabus :

SN. Module Descriptors / Topics Weightage


Set Theory Sets and Subsets, Venn Diagrams, Operations on sets, Laws of set theory, power sets and product of sets, principle
and of inclusion-exclusion. Proposition, Propositional Calculus- Propositional Variables and Compound propositions,
1 25.00
Mathematical Basic Logical Operations: Conjunction, Disjunction, Negation, Conditional, Biconditional. Compound Statements,
Logic Equivalence, Duality, Algebra of Statements, Valid and Invalid, Arguments, Tautologies, Contradiction, Contingency
Relations, Definition and Properties of relation, type of relation, diagraph representation of relation, equivalence and partially
2 diagraphs ordered relation, transitive closure and Warshall’s algorithm, posets and Hasse diagrams, Introduction to Lattice, 20.00
and lattices Types of Lattice, Distributed and Complemented lattice, Lattice as a Boolean Algebra.
Boolean Definition of Boolean Algebra, Laws of Boolean Algebra, Basic Theorems, Boolean Functions – Disjunctive Normal
3 Algebra and Form, Conjunctive Normal Form, Duality Principle. Boolean Expression – Sum of Products, Product of Sum, Minterm 20.00
Applications and Maxterm, Applications of Boolean Algebra.
Graph: Finite graph, Infinite graph, connected graph, Disconnected graph, Null graph. Subgraph, Incidence,
Graphs and Adjacency, Degree, Directed Graph, Walk, Path, Circuit, Wheel, Eulerian graph, Hamiltonian graph, Planar graph,
4 20.00
Trees Isomorphism of Graph, coloring of Graph. Tree: Properties of Tree, weighted tree, rooted tree, binary tree, Spanning
Tree, Incidence Matrix, Adjacency Matrix.
Algebraic Algebraic structure with one binary operation, semi groups, monoid and groups, isomorphism, homomorphism, cyclic
5 15.00
Structure group.

Course Learning Outcomes :

SN. Course Learning Outcomes


1 Understand and Demonstrate basics of mathematical Sets and proposition calculus
2 Demonstrate the knowledge of relations, diagraphs and lattices.
3 Understand the concept Boolean algebra, its properties and circuit design.
4 Apply the knowledge of Graph theory and trees in computer science
5 Demonstrate the knowledge of Algebraic Structures, its properties and various operations.

Pedagogy for Course Delivery :

SN. Pedagogy Methods


The class will be taught using remote teaching methodology. Students’ learning and assessment will be on the basis of four quadrants and flipped
1 class method. E-content will be also provided to the students for better learning. The course will be taught in theory based mode. The instructor will
discuss numerical computation problems to the students for better understanding of the concept.

Theory /VAC / Architecture Assessment (L,T & Self Work): 100.00 Max : 100

Attendance+CE+EE : 5+35+60

SN. Type Component Name Marks


1 Attendance 5.00
2 End Term Examination (OMR) 60.00
3 Internal CLASS TEST 15.00
4 Internal HOME ASSIGNMENT 10.00
5 Internal CLASS QUIZ 10.00

Lab/ Practical/ Studio/Arch. Studio/ Field Work Assessment : 0.00 Max : 100

N/A

List of Professional skill development activities :

No.of PSDA : 0
SN. PSDA Point

Text & References :

SN. Type Title/Name Description ISBN/ URL


C.L. Liu, Elements of Discrete Mathematics,
1 Book
Tata McGraw Hill, Second Edition
Kenneth H. Rosen, Discrete Mathematics
2 Book
and its Applications, Mc.Graw Hill
J.P.Tremblay & R. Manohar, “Discrete
3 Book Mathematical Structure with Applications to
Computer Science” M
Colmun, Busby and Ross, Discrete
4 Book
Mathematical Structure, PHI, 6th Edition,

You might also like