Scribd
Upload
61 views2 pages

Discrete BCAsyllabus

This document outlines the course details for a Discrete Mathematics course, including course code, semester, department, and 5 course outcomes. It also includes the topics to be covered in each of the 5 units, along with the relevant course outcome and number of proposed lectures for each topic.

Uploaded by

surabhi.purwar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
61 views2 pages

Discrete BCAsyllabus

This document outlines the course details for a Discrete Mathematics course, including course code, semester, department, and 5 course outcomes. It also includes the topics to be covered in each of the 5 units, along with the relevant course outcome and number of proposed lectures for each topic.

Uploaded by

surabhi.purwar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

School: School of Computer Year: 1

Science and Engineering: Semester: 1 Subject


Department: Computer Science Name/Code:
and Engineering: Discrete
Course: BCA Mathematics /BCA
101

L-T-P: 3-1-0

Pre-requisite
Subject: Basic
Concepts of
Mathematics

Course Outcome Description


(At the end of the course, student will be able to)

CO1 Understand basic ideas of sets, relations, functions.

CO2 Demonstrate partial order relation, POSET and LATTICE.

CO3 Incorporate logic through combinatorics and understanding of


recursive relation.

CO4 Learn the arguments using logical notation and determine if the
argument is or is not valid.

CO5 Model problems in Computer Science using graphs.

Detailed Syllabus (Theory)

Unit Topics CO No. of


No. No. proposed
lectures

1 Sets: Type of sets, Operations on Sets: Union, Intersection 1 8


difference and Complements of Sets, Algebra of sets,
Cartesian product
Relation: Properties of Relations, Equivalence Relation,
Partial Order Relation, Composition of relations, and
Representation of relations using digraph and Matrix,
Function: Domain and Range, onto, into and One to One
Functions, Composite, and Inverse Functions, Hashing
functions
2 Partial order relations: Partial Order Sets, totally ordered set, 2 8
Representation of POSETS using Hasse diagram, Chains,
Maximal and Minimal elements, Greatest lower. bound, least
upper bound, Lattices and Algebraic Structure, Principle of
Duality
Lattices: Sub lattices, Bounded lattice, Distributed &
Complemented Lattices, Isomorphic lattices. Boolean lattice

3 Combinatorics: Introduction, Basic Counting Principles, 3 8


Permutations, Permutations of things not all different, Circular
Permutations, Combinations, Restricted Permutations and
Combinations, Derangement, Pascal’s Triangle,
Recurrence relations: Introduction, Order of Recurrence
Relations, Degree of Recurrence Relations, Linear
Homogeneous Recurrence Relations

4 Propositional Logic: Proposition, well-formed formula, Truth 4 8


tables, Tautology, Satisfiability, Contradiction, Algebra of
proposition, Theory of Inference.
Predicate Logic: First order predicate, well-formed formula
of predicate, quantifiers, Inference theory of predicate logic

5 GRAPHS: Introduction, Degree of a vertex of a graph, 5 8


Handshaking Theorem, types of Graphs, sub graph, Matrix
representation of a graph: adjacent and incidence matrices,
Isomorphic graphs, path, and circuit, Connected graph,
Hamiltonian graph, Euler graph, Graph coloring (Vertex,
Edges and Map).

Text Books:
1. Rosen, K.H., Discrete Mathematics and its Applications, McGraw Hill Education, 8th edition 2021,
2. Kolman, Busby and Ross, “Discrete Mathematical Structures”, Pearson, 10th edition 2015
3. Babu Ram, “Discrete Mathematics”, Pearson Education, 1st edition 2010

Reference Books:
1. D. S. Malik, M. K. Sen, “Discrete Mathematics” Cengage Learning, 2012
2. S.K. Sarkar “A Text Book of Discrete Mathematics” S. Chand Publications, 9th edition 2019
3. Singh J. P. “Discrete Mathematics for Undergraduates” ANE Books, 1st edition, 2013
4. Tremblay J.P. and Manohar, R., “Discrete Mathematical Structures with
Applications to Computer Science” Tata McGraw Hill

You might also like