CS 301 Syllabus-Discrete Mathematics
CS 301 Syllabus-Discrete Mathematics
Course L T P S C
Course Code CS 301 Core 3-1-0-0
Category 3 1 0 0 4
Approval
Version 1.0 LEARNING LEVEL BTL-3
Details
Proof Strategies Proof Methods and Strategies: Forward Proof, Proof by Contradiction, Proof by contraposition,
Mathematical Induction
Graphs Connected components, Paths, Cycles, Trees, Hamiltonian/ Eulerian Walks, Colouring, Planarity.
Discrete Probability: Discrete Sample Space, Probability Distribution, Random variables, Expectation,
Variance, Bernoulli trials, Conditional probability & independence (Bayes’ Theorem).
TEXT BOOKS
Singh, S.B., Discrete Mathematics, Khanna Book Publishing Company, New Delhi
1.
REFERENCE BOOKS
1. Liu, C. L., & Mohapatra, D. P. (2008). Elements of Discrete Mathematics. Tata McGraw-Hill
2.
Rosen, K. H. (2019). Discrete Mathematics and Its Applications. (8th Edition) ISBN10:
125967651X ISBN13: 9781259676512.
E BOOKS
1. https://studylib.net/doc/25937569/discrete-mathematics-and-its-applications--kenneth-h.-ros...
Online Resources
1. https://www.coursera.org/learn/mathematics-for-computer-science
ASSESSMENT RUBRICS
CP (Class Criteria
Participation)
Grade Exemplary Proficient Partially Need
proficient improvement
Marks 5 4 3 2
Level of engagement The student listens The student The student The student listens
in class and proactively listens and listens and but never
contributes to class proactively contributes to contributes to class
by sharing ideas or contributes to class by sharing by sharing ideas or
clearing doubts class by ideas or clearing clearing doubts
many times in sharing ideas or doubts rarely
every session clearing doubts
at least once in
every session
Preparation The student is The student is The student is The student is
always prepared usually rarely prepared partially prepared
with given reading prepared with with given with given reading
materials and given reading reading materials materials and
completed home materials and and completed completed home
works completed home works works
home works
OT(Mini Project) The student who The student The student who The student who
completes mini who completes completes mini completes partially
project mini project project and trying to do
implementing a implementing a implementing a their level best
solution to a data medium basic data mining
mining problem complexity algorithm
and analyzing the data mining
data algorithm
Problem Solving Actively seeks and Improves Does not come up Does not try to solve
suggests solutions solutions based with solutions but problems or help
to problems on suggestions tries out solutions others to solve
by peer suggested by problems
others