COURSE INFORMATION SHEET

Course Name: Course C212 AY: 2018-19

MATHEMATICAL FOUNDATION OF Code:
COMPUTER SCIENCE

Course Category: Professional Core L-T-P-C 4-0-0-3

COURSE OUTCOMES (CO):
CO# CO STATEMENT TAXONOMY
To explain concept of discrete mathematics, mathematical logic, truth tables, Understand
C212.1
well-formed formula, normal forms and tautology.
C212.2 To explain set theory, relations and Hasse diagrams. Create
C212.3 To write algebraic structures and number theory. Remember
C212.4 To explain concept of permutations and combinations. Analysis
C212.5 To write concept of recurrence relations. Apply
C212.6 To explain graph theory. Create
SYLLABUS:
UNIT DETAILS
I Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Well
Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law,
Tautological Implications, Normal Forms, Theory of Inference for Statement Calculus,
Consistency of Premises, Indirect Method of Proof. Predicate Calculus:Predicative Logic,
Statement Functions, Variables and Quantifiers, Free and Bound Variables, Inference
Theory for Predicate Calculus.

II Set Theory: Introduction, Operations on Binary Sets, Principle of Inclusion and Exclusion,
Relations: Properties of Binary Relations, Relation Matrix and Digraph, Operations on
Relations, Partition and Covering, Transitive Closure, Equivalence, Compatibility and
Partial Ordering Relations, Hasse Diagrams, Functions: Bijective Functions, Composition of
Functions, Inverse Functions, Permutation Functions, Recursive Functions, Lattice and its
Properties.

III Algebraic Structures and Number Theory: Algebraic Structures:Algebraic Systems,

Examples, General Properties, Semi Groups and Monoids, Homomorphism of Semi
Groups and Monoids, Group, Subgroup, Abelian Group, Homomorphism, Isomorphism,
Number Theory:Properties of Integers, Division Theorem, The Greatest Common Divisor,
Euclidean Algorithm, Least Common Multiple, Testing for Prime Numbers, The
Fundamental Theorem of Arithmetic, Modular Arithmetic (Fermat’s Theorem and Euler’s
Theorem)
IV Combinatorics: Basic of Counting, Permutations, Permutations with Repetitions, Circular
Permutations, Restricted Permutations, Combinations, Restricted Combinations,
Generating Functions of Permutations and Combinations, Binomial and Multinomial
Coefficients, Binomial and Multinomial Theorems, The Principles of Inclusion–Exclusion,
Pigeonhole Principle and its Application.

V Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions,

Calculating Coefficient of Generating Functions, Recurrence Relations, Formulation as
Recurrence Relations, Solving Recurrence Relations by Substitution and Generating
Functions, Method of Characteristic Roots, Solving Inhomogeneous Recurrence Relations

VI Graph Theory: Basic Concepts of Graphs, Sub graphs, Matrix Representation of Graphs:
Adjacency Matrices, Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian
and Hamiltonian Graphs, Multigraphs, Planar Graphs, Euler’s Formula, Graph Colouring
and Covering, Chromatic Number, Spanning Trees, Algorithms for Spanning Trees
(Problems Only and Theorems without Proofs).

TEXT/REFERENCE/ADDITIONAL BOOKS:
T/ BOOK TITLE/AUTHORS/PUBLISHER
R
T1 Discrete Mathematical Structures with Applications to Computer Science, J. P.
Tremblay and P. Manohar, Tata McGraw Hill.

T2 Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D. P.

Mohapatra, 3rdEdition, Tata McGraw Hill.

R1 Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel,

T.P. Baker, 2nd Edition, Prentice Hall of India.

R2 Discrete Mathematical Structures, BernandKolman, Robert C. Busby, Sharon

Cutler Ross, PHI.

WEB REFERENCES: (Detailed Topic link)

W1 https://www.tutorialspoint.com/discrete_mathematics/index.htm
W2 https://lecturenotes.in/subject/381/mathematical-foundations-of-computer-science-mfcs
W3 https://examupdates.in/mathematical-foundation-of-computer-science/
COs VS Program Outcomes (POs) mapping (HIGH: 3; MEDIUM: 2; LOW: 1)
CO# PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
C223.1 3 - 2 - - - - - - - - - 1
C223.2 3 - 2 - - - - - - - - - 2
C223.3 3 - 2 - 2 - - - - - - - 3
C223.4 3 - 2 - - - - - - - - - 2
C223.5 3 - 2 - 2 - - - - - - - 2
C223.6 3 - 2 - - - - - - - - - 1
C223* 3.00 2.00 2.0 1.83
* For Entire Course, PO & PSO Mapping
POs & PSOs:
PO Engineering Knowledge PO6 Engineer & Society PO11 Project Mgmt & Finance
1
PO Problem Analysis PO7 Environment & Sustainability PO12 Life-long Learning
2
PO Design / Development of Solutions PO8 Ethics PSO1 Advanced concepts of
3 DLD
PO Conduct Investigations of complex PO9 Individual & Team Work PSO2 ………………………….
4 problems
PO Modern Tool usage PO10 Communication Skills PSO3 …………………………..
5

Curricular Gaps identified - To attain COs, POs & PSOs:

S.No GAP DESCRIPTION CO# PO / PSO
1 Detailed explanation of DLD truthtables,DLD circuits C212.1 PO1,PO3
2 Different operations of sets C212.2 PO4
TOPICS BEYOND SYLLABUS:
S.N Description CO# PO / PSO
o
1 Prims algorithm C212.5 PO2
2 Kruskal’s algorithm C212.5 PO3
3 Shortest path algorithms C212.5 PO5
INSTRUCTIONAL METHODS / PEDAGOGICAL INITIATIVES:
SNO TEACHING METHODOLOGY

1 Power point presentation and use of internet to make teaching -learning more interactive and interesting

2 Virtual Video Lecture

3 Students are allotted topics to prepare power point presentations and class seminars are held

4 Feedback on lectures obtained from students

Web Link of the Course Material: www.byndr.in

COURSE OUTCOMES VS POs MAPPING WITH TOPIC BEYOND SYLLABUS:
 CO# PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
C223.1 3 - 2 - - - - - - - - - 1
C223.2 3 - 2 - - - - - - - - - 2
C223.3 3 - 2 - 2 - - - - - - - 3
C223.4 3 - 2 - - - - - - - - - 2
C223.5 3 3 3 2 2 - - - - - - - 2
C223.6 3 - 2 - - - - - - - - - 1
C223* 3.0 3.0 2.17 2.0 2.0 1.83

ASSESSMENT METHODOLOGIES-DIRECT METHOD

Examination CO1 CO2 CO3 CO4 CO5 CO6 TL1 TL2 TL3 TL4 TL5 TL6

Internal exam 16.7% 16.7% 16.7% 16.7% 16.7% 16.7% 16.67 16.67% 16.67% 33.34% ------ 33.34%
%
Assignments 16.7% 16.7% 16.7% 16.7% 16.7% 16.7% 16.67 16.67% 16.67% 33.34% ------- 33.34%
%
End semester 16.7% 16.7% 16.7% 16,7% 16.7% 16.7% ---- 33.34% 33.34% ------ ------- 33.34%

Taxonomy Levels: TL1: Remember; TL2: Understand; TL3: Apply; TL4: Analyse; TL5: Evaluate; TL6: create
CO ATTAINMENT
Direct Methods Weightage CO1 CO2 CO3 CO4 CO5 CO6 Overall
Internal
examinations 15 1 1 1 3 1 2 1.50
(Subjetive)
Internal
examinations 10 2 2 2 3 3 3 2.50
(Objective)
Assignments 5 3 3 3 3 3 3 3.00
End semester
70 1 1 1 1 1 1 1.00
examination
Attainment-Direct
100% 1.2 1.2 1.2 1.6 1.3 1.45 1.33
method (a)
Indirect Methods
– 2.3 2.3 2.4 2.41 2.28 2.3 2.33
CO Feedback (b)
Overall
Attainment 1.42 1.42 1.44 1.762 1.496 1.62 1.53
(0.8a+0.2b)
Target Set for the course 2.33
 NOT
Attainment Status Attained

Best performing CO: CO4 Least Performing CO: CO1,CO2

Reasons for low attainment Due to lack of knowledge on permutations, recurrence relations
Plan of Action Take extra classes on recurrence relations

PO ATTAINMENT (Direct)
Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO PO9 PO10 PO11 PO1 PSO1 PSO2
Attainmen 8 2
t
1.53 1.53 1.53 1.53 1.53 1.53 - - - - - - - 1.53

Prepared by Approved by
G.Sasi Bhushan Rao HOD