SN BCA100 Computational Logic and Mathematical L T P C Course Type

4 Foundations
3 0 0 3 Theory
PRE- High-school education
REQUISITE
CO-REQUISITE None
ANTI-REQUISITE None

a. Course objectives-
● To understand the fundamental concepts of discrete mathematics.
● To study logic, set theory, and graph theory.
● To develop problem-solving and analytical skills.
● To enhance abstract reasoning abilities.
● To apply discrete mathematics concepts in computer science applications.

b. Course outcomes-
CO Define and describe key concepts of mathematical logic, including propositions, connectives, and truth
tables.
1
CO Explain the basic principles of set theory and relations, and describe their applications in computer
2 science.
CO Apply the rules of propositional logic to determine the validity of a simple argument.
3
CO Use fundamental counting techniques (permutations and combinations) to solve basic combinatorial
problems.
4
CO Explain mathematical induction and apply it to prove statements, and use matrices and graphs to solve
5 problems.

c. Syllabus
Unit- Mathematical Logic Contact Hours:
1 10
Propositional Logic: Propositions and logical connectives (negation, conjunction, disjunction,
implication, biconditional), Constructing truth tables, Tautologies, contradictions, and
contingencies. Equivalence and Inference: Logical equivalence and laws of logic (De Morgan's
Laws, Commutative, Associative, and Distributive Laws), Arguments and rules of inference
(Modus Ponens, Modus Tollens), Predicate Logic: Predicates, quantifiers (universal and
existential), Translating English sentences into logical expressions. Negating quantified
expressions.
Unit- Set Theory and Relations Contact Hours:
2 10
Set Theory Fundamentals: Sets, elements, and set notation, Subsets, proper subsets, and the power
set, Set operations: union, intersection, difference, complement, and symmetric difference, Venn
diagrams to visualize set operations. Relations: Ordered pairs and Cartesian product, Definition of
a relation, Types of relations: reflexive, symmetric, transitive, and antisymmetric, Equivalence
relations and equivalence classes.
Unit- Functions and Counting Principles Contact Hours:
3 10
Functions: Definition of a function and its properties, Types of functions: one-to-one, onto, and
bijective, Inverse functions and composition of functions, Counting Principles: The multiplication
and addition rules, Permutations and combinations, The Pigeonhole Principle.
Unit- Elementary Probability Contact Hours: 10
4
Introduction to Graphs: Definition of a graph, vertices, and edges, Types of graphs: simple,
directed, undirected, and weighted, Graph representations: adjacency matrix and adjacency list.
Graph Traversals: Breadth-First Search (BFS) and Depth-First Search (DFS). Trees: Introduction to
trees as a special type of graph, Properties of trees, Spanning trees.
Unit-5 Elementary Probability and Course Review Contact Hours: 6
Basic Probability Concepts: Sample space, events, and outcomes, Calculating probabilities of
simple events. Course Review: A comprehensive review of all mathematical concepts. Connecting
the learned topics to their applications in various computer science fields, such as database design,
network routing, and algorithm efficiency.
 d. Textbooks/ reference books

TEXTBOOKS
T1: Discrete Mathematics and its Applications by Kenneth H. Rosen, McGraw-Hill Education.2025
T2: Discrete Mathematical Structures by Bernard Kolman, Robert Busby, and Sharon Ross, Pearson Education.
2021
T3: Elements of Discrete Mathematics: A Computer Oriented Approach by C.L. Liu and D.P. Mohapatra, Tata
McGraw-Hill. 2011

e. REFERENCE BOOKS
R1: Logic and Discrete Mathematics: A Computer Science Perspective by Winfried Karl Grassman and Jean-Paul
Tremblay, Pearson Education. 2007
R2: Discrete Mathematics with Applications by Susanna S. Epp, Cengage Learning. 2019
R3: A First Course in Probability by Sheldon Ross, Pearson Education. 2018

f. Assessment Pattern - Internal and External

The performance of students is evaluated as follows:

Theory- Mandatory Graded

Component Continuous Internal Assessment (CIA) End Semester Examination (ESE)
Marks 50 50
Total Marks 100

Theory Courses: Evaluation Component:

S. Components Type of Assessment Mar Final Weightage
No ks
Assessment
1 Continuous Internal First Assessment test (FAT) 30 15%
2 Assessment (CIA) Second Assessment test (SAT) 30 15%
3 Assignment/ Quiz/ Surprise test/ 20 20%
Mini Project/ Presentation/
Group Discussion etc.
4 End Semester End Semester Examination (ESE)) 50 50%
Examination (ESE)

g. CO-PO Mapping:

[Link] PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
3 2 - - - - - - - - 1 1
CO1
3 2 - - - - - - - - 1 2
CO2
3 3 1 - - - - - - - 1 1
CO3
3 3 1 - - - - - - - 1 3
CO4
3 2 2 1 - - - - - - - 1
CO5