0% found this document useful (0 votes)
38 views3 pages

CS 301 Syllabus-Discrete Mathematics

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
0% found this document useful (0 votes)
38 views3 pages

CS 301 Syllabus-Discrete Mathematics

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/ 3

Course Syllabus

Course Title DISCRETE MATHEMATICS CREDITS 4

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

Co-requisite Pre-requisite Calculus

Mathematics is a foundational course of Computer science and Engineering, since every


programmer needs to have basic mathematical knowledge in programming. It is very important in
learning the basic usage of algorithms that are utilized in an advanced form in computer science,
Course This course provides an essential foundation for almost every area of computer science and
Description engineering with its applications in the form of Set theory, Proof methods, Combinatorics, Graph
theory and Probability. The lectures will be delivered on theoretical concepts, problem solving, and
applications. This course will be the platform for some of the core computer science / information
technology courses in higher semesters.
Course
CO Statement PO / PSO SO (EAC) SO (CAC)
Outcome
Identify formal algebraic structures in
PO1(3), PO2(3),
computer science Demonstrate a working SO1(1),
PO4(2), PO6(2), SO1(1), SO2(2),
1 knowledge of set notation and elementary set SO2(2),
PO12(2), SO4(2)
theory, and prove elementary results involving SO3(2),
PSO1(3),
sets, relations and functions
PO1(3), PO2(3),
SO1(2),
PO3(3), PO4(2), SO1(3), SO4(2),
Construct direct, indirect proofs and proofs by SO2(2),
2 PO5(1), PO6(2), SO2(3), SO6(2),
induction SO3(2),
PO12(2), SO7(1)
SO6(3)
PSO1(3), PSO(2)
PO1(3), PO2(3),
SO1(3),
PO3(2) SO1(2), SO2(3),
Solve engineering problems involving SO2(2),
3 PO4(2), PO5(2), SO4(2), SO6(2),
generating functions and recurrence relations SO3(2),
PO6(2), PO12(2), SO7(2)
SO6(3)
PSO1(3), PSO(3)
PO1(3), PO2(3),
PO3(3)
SO1(3),
Apply the concept of graph theory and PO4(2), PO5(2), SO1(3), SO2(3),
SO2(2),
4 coloring of graph and its application in PO6(2), SO4(2), SO6(2),
SO3(2),
computer science PO11(2), SO7(2)
SO6(3)
PO12(3),
PSO1(3), PSO(3)
SO1(2), SO2(3), SO1(3),
Explain and apply the basic concepts of PO1(3), PO2(3),
5 SO4(2), SO6(2), SO2(2),
probability to solve the problems PO3(2)
SO7(2) SO3(2),
PO4(2), PO5(2), SO6(3)
PO6(2), PO12(2),
PSO1(3), PSO(3)
1: Weakly related, 2: Moderately related and 3: Strongly related
Course Contents (60 hrs)
Set, Relations, Functions Size of a Set, Finite and infinite Sets, Countable and uncountable Sets, Cantor's diagonal
argument and The Power Set theorem. Operations and Laws of Sets, Cartesian Products, Binary Relation, Partial
Ordering Relation, Equivalence Relation, Image of a Set, Sum and Product of Functions, Bijective functions,
Inverse and Composite Function

Proof Strategies Proof Methods and Strategies: Forward Proof, Proof by Contradiction, Proof by contraposition,
Mathematical Induction

Combinatorics Permutation & Combination, Inclusion- Exclusion, Pigeon-hole principle, Generating


functions, Recurrence relations.

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

Teamwork All team members Assisted Finished Contributed little to


contributed equally group/partner individual task but the group effort
to the finished in the finished did not assist during the project.
project. project. group/partner
during the project

AS(Assignment) The detailed The detailed Explanation Missed key points


response given response given unclear, but and the response is
with novel some level of response shows not aligned to
approaches novelty some problem
and learning understanding of
the problem
Quiz Addresses the Addresses the Doesn’t address Doesn’t really
question. States a question. States the questions address the question.
relevant, justifiable a explicitly, States few relevant
answer. relevant, although does so answers.
Presents arguments justifiable tangentially. Reveals some
in a logical answer. States a relevant misconceptions. Is
order. Uses Presents and not clearly or
acceptable style arguments in a justifiable answer. logically organized.
and logical Presents Errors in grammar
grammar (no order. Uses arguments in a and style.
errors) acceptable style logical order.
and Uses
grammar (with acceptable style
minor errors and grammar (1-2
errors).

You might also like