Quantum University, Roorkee

Quantum School of Technology

Department of Computer Science & Engineering

Course File

Course Title: Discrete Mathematics

Course Code: CA3102

Branch & Semester: BCA 1ST sem

Faculty Name: Dr. Dev Baloni

 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Course Title: Discrete Mathematics Course Code: CA 3102

COURSE FILE INDEX

Task
Task Description
No
1 Program Outcomes (POs)

2 Course Outcomes (COs)

3 Syllabus Description

4 Lecture Plan

5 Time Table of Faculty

Assignment Sheets (minimum 2, one from first 2 units and other from 3 rd 4th and 5th
6
units)

7 Student List with Flip classes/ seminar topics and evaluation of student presentation.

8 Old Mid - Semester Question Papers with Model Answers

9 Old End – Semester Question Papers with Model Answers

Sign of Faculty:

Course File approved for uploading on:

Sign of HOD:
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Program Outcomes (POs)

The curriculum and syllabus have been structured in such a way that each of the courses meets one or more of
these outcomes. Program outcomes describe what students are expected to know and be able to do by the time of
graduation. These relate to the skills, knowledge and behaviors that students acquire as they progress through the
program. Further each course in the program spells out clear course outcomes (COs) which are mapped to the
program outcomes.

BCA Graduates will be able to:

Program –
B.C.A
PO- Computer Apply the knowledge of mathematics, science, and computer
01 Science programming to the solve of computer software problems.
Applications
knowledge
PO- Problem Analysis Identify, formulate, review research literature, and analyze
02 complex problems reaching substantiated conclusions using
first principles of mathematics, natural sciences, and
computer
software.
PO- Development Develop solutions for complex problems and design system
03 of solutions components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and
the cultural, societal, and environmental considerations.
PO- Modern tool usage Create, select, and apply appropriate techniques, resources,
04 and modern software development and IT tools.
PO- Environment Understand the impact of the professional engineering
05 and solutions in societal and environmental contexts, and
Sustainability demonstrate the knowledge of, and need for sustainable
development.
PO- Ethics Apply ethical principles and commit to professional ethics and
06 responsibilities and norms of the software development
practice.
PO- Individual and Function effectively as an individual, and as a member or
07 team work leader in diverse teams, and in multidisciplinary settings.
PO- Communication Communicate effectively on complex software programming
08 activities with the software development community and with
society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
PO- Life-long learning Recognize the need for, and have the preparation and ability
09 to engage in independent and life-long learning in the
broadest context of technological change.
Program Specific Outcomes (PSO’s)

By the completion of BCA program the student will have following Program specific
Outcomes.
PSO 1. To pursue further studies to get specialization in Computer Science and Applications, Economics,
Mathematics, business administration.

PSO 2. To pursue the career in corporate sector can opt for MBA or MCA.

PSO 3. To Work in the IT sector as programmer, system engineer, software tester, junior programmer, web
developer, system administrator, software developer etc.

Program Educational Objectives (PEO’s)

PEO1. To be well familiar with the concepts of Computer Applications for leading a successful career in
industry or as entrepreneur or to pursue higher education.

PEO 2. To develop techno-commercial skills for providing effective solutions to complex problems using
domain knowledge of Computer Science and Applications

PEO 3. To instill lifelong learning approach towards constantly evolving technologies with innovative and
ethical mindset.
Course Articulation Matrix (Highly Mapped- 3, Moderate- 2, Low-1):

CO’s/
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1
PO’s
0 1 2
CO1 3 3 3 2 2 1 2 1 3 - 3 3

CO2 3 3 3 3 2 1 2 2 3 - 3 3

CO3 3 3 3 2 2 1 2 1 3 - 3 3

CO4 3 3 3 3 2 1 2 2 3 - 3 3

CO5 3 3 3 2 2 1 2 1 3 - 3 3
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Course Outcomes (COs)

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

Course Outcomes: The student will be able to:

Bloom’ Bloo
Course Outcomes
s m’s
Taxono Leve
my l
Students will be able to understand the concepts
Rememb BL-1
of set along with proofs to prove equality in
CO er
sets.
-1
Various operations on sets, Principle of inclusion
and exclusion, and various properties of
Relation.

The students will be able to understand Apply BL

CO propositions and then would be able to find out -3
-2 the validity of the argument.

Understa BL
Students will get complete knowledge of number
CO nd -2
theory, induction and various operations on
-3
integers.
Students will understand the concepts of BL
Analyze -4
Graphs, Trees and related theorems along
CO
with various related algorithms. They will also
-4
learn Relation concepts and properties.
Students will be able to solve the problems of
Analyze BL
Permutation, Probability and Combination. They
CO -4
will learn the concepts of counting theory and
-5
techniques.

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

SYLLABUS DESCRIPTION

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

CA 3102 Title:Discrete Mathematics L T P

C3 2 0
Version No. 1.0
Course Prerequisites Nil
Write an argument using logical notation and determine if the argument is or is
not valid. Demonstrate the ability to write and evaluate a proof or outline the
Objective basic structure of and give examples of each proof technique described.
A number of recurring themes, and a set of general principles that have broad
Expected Outcome application to the field of computer science and discrete mathematics . The
social, legal, ethical, and cultural issues inherent in the discipline of computing .
Unit Unit Title No. of
No. Hrs
Unit 1 Introducti 6
on
Variables, The Language of Sets, The Language of Relations and Function Set Theory: Definitions and the
Element Method of Proof, Properties of Sets, Disproofs, Algebraic Proofs, Boolean Algebras, Russell’s Paradox
and the Halting Problem
Unit 2 Logic, Quantified Statements, Functions 7
The Logic of Compound Statements: Logical Form and Logical Equivalence, Conditional Statements, Valid and
Invalid Arguments: Functions Defined on General Sets, One-to-One and Onto, Inverse Functions, Composition
of Functions, Cardinality with Applications to Computability
Unit 3 Number Theory and Methods of Proof 8
Elementary Number Theory and Methods of Proof: Introduction to Direct Proofs, Rational Numbers,
Divisibility, Division into Cases and the Quotient-Remainder Theorem, Floor and Ceiling, Indirect Argument:
Contradiction and Contraposition, Two Classical Theorems, Applications in algorithms

Unit 4 Relations, Graph & Tree 7

Relations: Relations on Sets, Reflexivity, Symmetry, and Transitivity, Equivalence Relations, Partial Order
Relations Graphs and Trees: Definitions and Basic Properties, Trails, Paths, and Circuits, Matrix
Representations of Graphs, Isomorphism’s of Graphs, Trees, Rooted Trees, Isomorphism’s of Graphs, Spanning
trees and shortest paths
Unit 5 Counting and Probability 8
Counting and Probability: Introduction, Possibility Trees and the Multiplication Rule, Possibility Trees and the
Multiplication Rule, Counting Elements of Disjoint Sets: The Addition Rule, The Pigeonhole Principle,
Counting Subsets of a Set: Combinations, Combinations with Repetition Allowed, Probability Axioms and
Expected Value, Conditional Probability, Bayes’ Formula, and Independent Events

1. Discrete Mathematics with ApplicationsbySussana S. Epp,Cengage Learning

Text Books 2. Discrete Mathematics, Schaum’s Outlines Series by Seymour Lipschutz,
Marc Lipson, Tata MCGraw Hill
 1. Discrete Mathematics and its Applications , Kenneth H. Rosen , Tata
Reference Books MCGraw Hill
2. Discrete mathematical structures, B Kolman RC Busby, S Ross, PHI
Mode of Evaluation Internal and External Examinations
Recommended by Board 28-07-2020
of Studied on
Date of Approval by
the Academic
Council on
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Lecture Plan

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

Total No. of Lectures Required:36

U Bloom’s Refere P Actual

Lectur Topic Method
ni Topics to be C Taxonom nce g Dates of
e No. Learning of
t Covered O y & Level Book/ Delivery
Outcom Teachi
N Materi N
e ng
o al o
/ .
Ti
tl
e
Uni 1 Variables, The Students will C Rememb notes 22-Aug-
t Language of learn to form O- er, 2023
-1 Sets, sets 1 Understa
nd
BL-1, BL-2
2 The Language of Students will C Rememb notes 23-Aug-
Relations and learn the basics O- er, 2023
Function of relations and 1 Understa
Functions nd BL-1,
BL-2
3 Set Theory: Students will C Remember, notes 24-Aug-
Definitions and the learn the basics O- Understand, 2023
Element Method of of sets. 1 Apply,
Proof, Analyze BL-
1, BL-
2,BL-3,BL-4
4 Properties of Students will C Remember, notes 26-Aug-
Sets, learn about the O- Understand, 2023
Disproofs, properties of 1 Apply,
sets. Analyze BL-
1, BL-
2,BL-3,BL-4
5 Algebraic Students will C Rememb notes 29-Aug-
Proofs, Boolean learn the O- er, 2023
Algebras, proofs for 1 Understa
equality in nd,
sets. Apply
BL-1,
BL-
2,BL-3
6 Russell’s Paradox Students will C Rememb notes 30-Aug-
and the Halting get the O- er, 2023
Problem overview of 1 Understa
Russel’s nd BL-1,
Paradox and BL-2
halting
Problem
Uni 7 The Logic of Students will C Rememb notes 02-Sep-
t Compound learn about O er, 2023
-2 Statements: statements. - Understa
2 nd BL-1,
BL-2
8 Logical Form and Students C Rememb notes 05-Sep-
Logical will learn O- er, 2023
Equivalence about the 2 Understa
logical nd BL-1,
equivalence BL-2
in
propositions.
9 , Conditional Students C Rememb notes 06-Sep-
Statements, Valid will learn O- er, 2023
and Invalid about 2 Understa
logical nd,
connectiv Apply
es. BL-1,
BL-
2,BL-3
 10 Arguments: Students will C Remember, notes 09-Sep-
Functions learn about O- Understa 2023
valid and 2 nd,
invalid Apply
arguments. BL-1,
BL-
2,BL-3
11 Defined on General Students will C Remember, notes 12-Sep-
Sets, One-to-One learn various O- Understa 2023
and Onto, types of 2 nd BL-1,
functions. BL-2
12 Inverse Functions, Students will C Remember, notes 13-Sep-
Composition learn about O- Understa 2023
of Functions, operations 2 nd BL-1,
on BL-2
functions.
13 Cardinality with Students will C Remember, notes 14-Sep-
Applications learn about O- Understa 2023
to cardinal 2 nd BL-1,
Computabili number. BL-2
ty
Uni 14 Elementary Number Students will C Remember, notes 16-Sep-
t Theory and Methods learn the O Understa 2023
of Proof: concepts of - nd BL-1,
-3
Introduction to elementary 3 BL-2
Direct Proofs, mathematics.
15 Rational Numbers, Students will C Remember, notes 19-Sep-
Divisibility, about various O- Understa 2023
theorems on 3 nd BL-1,
rational BL-2
numbers.
16 Division into Cases Students will C Remember, notes 20-Sep-
and learn O- Understand, 2023
the Quotient- the quotient 3 Apply,
Remainder Theorem remainder Analyze BL-
theorem 1, BL-
2,BL-3,BL-4
17 ,Floor and Ceiling, Students will C Remember, notes 21-Sep-
learn O- Understa 2023
the 3 nd BL-1,
application of BL-2
floor and
ceiling
functions.
18 Indirect Argument: Students will C Remember, notes 23-Sep-
Contradiction learn about O- Understa 2023
3 nd BL-1,
contradiction
BL-2
in
statements.
19 Contraposition, Students will C Remember, notes 26-Sep-
learn about O- Understand, 2023
contrapositio 3 Apply,
n in Analyze BL-
statements. 1, BL-
2,BL-3,BL-4
20 Two Classical Students will C Remember, notes 27-Sep-
Theorems, , learn O- Understand, 2023
various 3 Apply,
theorems Analyze BL-
on 1, BL-
integers. 2,BL-3,BL-4
21 Applications in Students will C Remember, notes 28-Sep-
algorithms learn O- Understa 2023
various 3 nd BL-1,
 applications BL-2
on
algorithms.
Uni 22 Relations: Relations Students will C Remember, notes 30-Sep-
t on get O- Understa 2023
Sets, Reflexivity, the basics of 4 nd BL-1,
-4
sets and BL-2
relations.
23 Symmetry, and Students will C Remember, notes 03-Oct-
Transitivity, learn various O- Understa 2023
Equivalence types of 4 nd BL-1,
Relations, relations. BL-2
24 Partial Order Students C Rememb notes 04-Oct-
Relations Graphs will learn O- er, 2023
and Trees: basics of 4 Understa
Definitions and graph nd BL-1,
Basic Properties, terminologi BL-2
es.
 25 Trails, Paths, and Students will C Remember, notes 05-Oct-
Circuits, Matrix learn about O- Understa 2023
Representations various 4 nd,
of Graphs, graph Apply
matrices BL-1,
and BL-
traversals. 2,BL-3
26 Isomorphism’s of Students will C Remember, notes 07-Oct-
Graphs, Trees, learn about O- Understa 2023
isomorphism 4 nd,
and Apply
homeomorpphi BL-1,
sm in graph BL-
2,BL-3
27 Rooted Trees, Students will C Remember, notes 10-Oct-
Isomorphism’s learn about O- Understa 2023
of Graphs, binary tree and 4 nd,
its properties Apply
BL-1,
BL-
2,BL-3
28 Spanning trees and Students will C Remember, notes 11-Oct-
shortest paths learn O- Understa 2023
about 4 nd,
spanning Apply
tree BL-1,
algorithms BL-
2,BL-3
Uni 29 Counting and Students will C Remember, notes 12-Oct-
t Probability: learn basics O- Understand, 2023
Introduction, of counting 5 Apply,
-5
Possibility Trees and techniques. Analyze BL-
the Multiplication 1, BL-
Rule, 2,BL-3,BL-4
30 Counting Elements Students C Remember, notes 14-Oct-
of Disjoint Sets: will learn O Understand, 2023
The Addition Rule, combinati - Apply,
on, 5 Analyze
permutations BL-1, BL-
2,BL-3,BL-4
31 The Pigeonhole Students will C Remember, notes 26-Oct-
Principle, the O- Understand, 2023
pigeonh 5 Apply,
ole Analyze BL-
principl 1, BL-
e. 2,BL-3,BL-4
32 Counting Subsets of Students will C Remember, notes 28-Oct-
a learns O- Understand, 2023
Set: theorems 5 Apply,
Combinations, based on Analyze BL-
Combinations combinatoric 1, BL-
with Repetition s. 2,BL-3,BL-4
Allowed,
33 Probability Axioms Students will C Remember, notes 31-Oct-
and Expected Value, learn O- Understand, 2023
Probability 5 Apply,
theorems. Analyze
BL-1, BL-
2,BL-3,BL-4
34 Conditional Students will C Remember, notes 01-Nov-
Probability, learn concepts O- Understand, 2023
of Probability 5 Apply,
Analyze BL-
1, BL-
 2,BL-3,BL-4
35 Bayes’ Formula, and Students will C Remember, notes
learn about O- Understand,
bayes theorem 5 Apply,
and its Analyze BL-
functionality 1, BL-
2,BL-3,BL-4
36 Independent Events Students will C Remember, notes
learn O- Understand,
about 5 Apply,
independ Analyze BL-
ent 1, BL-
events 2,BL-3,BL-4
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Time Table of Class and Faculty

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

SNO 1 2 3 4 5 6 7 8

Day/ 9:00 TO 9:55 TO 10:50 TO 11:45 TO 12:40 TO 1:35 1:35 TO 2:30 2:30 TO 3:25 TO 4:30
Time 9:55 10:50 11:45 12:40 3:25

MON (Diploma (Diploma/ Bachelor of Bachelor of

/CSE/ CSE/Sem- Technology Technology/ (Bachelor
Sem-5) 5)(CS /CSECSCQ/ SECTION - of
(CS 1540(L)) Sem-7) I/Sem-1) Technolo
1540(L)) (CS3703(S) (CS31101(S)) gy/
) SECTION
-
I/Sem-1)
(CS3110
1(S))

TUE (Master Bachelor (Bachelor of Bachelor

of of Technology/ of
Compute Computer SECTION - Technolo
r Applicatio I/Sem-1) gy/
Applicatio ns/ (CS31101(S)) CSECSC
ns/ SECTION - Q/
SECTION C/Sem-1) Sem-7)
- (CA31103 (CS3703(
A/ (S)) S))

WED Diploma/ (Bachelor Diploma/

CSE/ of CSE/Sem-
Sem-5) Computer 5)(CS
(CS Applicatio 1501(S))
1501(S)) ns/
SECTION -
C/Sem-1)
(CA31103
(S))
THU (Bachelor (Bachelor of
of Computer
Technolo Applications/
gy/ SECTION -
SECTION C/Sem-1)
- (CA31103(S))
I/Sem-1)
(CS3110
1(S))

FRI Bachelor (Bachelor Bachelor Master of

of of of Technolo
Technolo Technology Computer gy/CSE/
gy/ /SECTION - Application Sem-1)
CSECSCQ I/Sem-1) s/Section- (CS4110
/ (CS31101( 1 3(S))
Sem-7) S)) /Sem-5)
(CS3703( (CA3570(L
 S)) ))
SAT Bachelor of Master of
Computer Technology/
Application CSE/Sem-1)
s/SECTION (CS41103(S))
- <br />
C/Sem-1) (Assign
(CA31103( Date-
S)) 06/10/2023)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Assignment: 1
Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

S. Assignme C Bloom’s BL
N. nt O Taxonomy
remember BL-1
1 Explain Proposition with examples. CO
-1
Remember BL
2 Discuss various logical connectives with their truth table. CO -1
-1
For the statement “If it rains, then I get wet.” Find its understand BL-2
3 converse, inverse and contra-positive in terms of CO
propositional variables. -1
Explain Predicate Logic. Also discuss quantifiers. Remember BL
Translate the following sentences in quantified -1
4 expression of predicate logic: CO
1. All students need financial aid. -1
2. Some students need financial aid.
Explain Rules of Inference. Also determine the validity of Remember BL
the following argument: -1
S1: If I like mathematics, then I will
5 study. S2: Either I study or I get less CO
marks. -1
…………………
S: If I get less marks, I do not like mathematics.
Define Sets with examples. How do we represent remember BL-1
6 CO
the sets? Also define various types of sets.
-2
Explain, with examples, various operations that can be Remember BL
7 CO -1
performed on sets.
-2
Define a Relation. Explain various properties Remember BL-1
8 CO
of a Relation.
-2
Discuss in detail along with suitable example: Remember BL-1
9 1. Equivalence Relation CO
2. Partial order relation. -2
Understand B
10 Show that for sets A, B, C: A (BՍC) = (A B) Ս (A C) CO L-
-2 2

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Assignment: 2
Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

S. Assignme C Bloom’s BL
N. nt O Taxonomy
Define Function, Domain, Co-domain and Range. Remember BL-1
1 CO
Explain various types of Mappings with examples.
-3
Explain composition of functions. Let f: R⟶R be Understand B
defined by L-
2 f(x) = 2x + 1, x ≤ 0 and x2 + 1, x CO 2
> 1 and g: R⟶R be defined by -3
g(x) = 3x-7, x≤0 and x3, x>0. Now find gof.
Explain Pigeonhole Principle. Also differentiate Remember B
3 CO L-
between Inverse and Identity functions.
-3 1
Define a Group. Show that A = {1, ω, ω2} forms an Remember BL-1
4 abelian group under multiplication where ω is the CO
cube -4
root of unity.
Prove that the set of integers I with respect to ‘+ Remember BL-1
5 (Addition)’ and CO
‘. (Multiplication)’ is a Ring. -4
Define Field. Also prove that a Field is an Remember B
6 CO L-
Integral domain.
-4 1
Remember B
Define Lattice. Also explain Hasse diagram
7 CO L-
with example.
-4 1

Remember B
Define Permutation. Prove that the number of L-
8 different permutations of n distinct objects taken ‘r’ CO 1
at a time, r n is given by n(n-1)(n-2)(n-3)… (n – r -5
+ 1).
How many ways can we select a software apply BL-3
development group of 1 project leader, 5
9 programmers and 6 data entry operators from a CO
group of 5 project leaders, 20 programmers and 25 -5
data entry operators?
Find the solution of recurrence Understand B
10 CO L-
relation: ar = ar -1 + 2ar-2 with a0 =
-5 2
2, a1 = 7.

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Question Bank – Unit -1

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

MCQs/True False/Fill in the Blanks

Bloom’
Q. Questi C B
s
N. on O L
Taxono
my
A proposition is defined as a sentence that is either Rememb B
1 CO er L-
true
-1 1
or false.
“May God bless you.” is a proposition. (True/False) Remem B
2 CO ber L-
-1 1
A Proposition is always true. (True/False) Remem B
3 CO ber L-
-1 1
Idempotent property in Propositions says.......................... Rememb B
4 CO er L-
-1 1
De Morgan’s Laws in propositions says............................ Rememb B
5 CO er L-
-1 1
Disjunction of propositions p and q is “False”, when both p Remem B
6 and q are “True”. (True/False) CO ber L-
-1 1
Conjunction of propositions p and q is “True”, when both p Remem B
7 and q are “False”. (True/False) CO ber L-
-1 1
If the truth value of any statement is “True”, then the Remem B
8 truth value of its negation is............ CO ber L-
-1 1
The symbols for universal and existential quantifiers are Rememb B
9 CO er L-
…………..
-1 1
and respectively.
Remem B
10 NAND connective is derived from Disjunction. (True/ False) CO ber L-
-1 1

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
Long Answer

Bloom’
Q. Questi C B
s
N. on O L
Taxono
my
Rememb B
1 Explain Propositions with examples. What are truth values? CO er L-
-1 1
Rememb B
2 Differentiate between primitive and compound statement. CO er L-
-1 1
Discuss Conjunction. Also construct the truth table Rememb B
3 CO er L-
for Conjunction.
-1 1
Rememb B
4 Discuss Disjunction. Also construct the truth table for CO er L-
Disjunction. -1 1
Discuss Implication/ Conditional connective. Also construct Rememb B
5 CO er L-
the truth table for connective conditional.
-1 1
Discuss Equivalence/ Bi-conditional connective. Also construct Rememb B
6 CO er L-
the truth table.
-1 1
Understa B
7 Differentiate between NAND and NOR connective. CO nd L-
-1 2
Rememb B
8 Explain the logic of predicates. What are quantifiers? CO er L-
-1 1
Rememb B
9 List and explain any 5 rules of Inference. CO er L-
-1 1
Rememb B
10 Compute the truth table of (¬p ∨ q ) 𝖠 (q (¬r 𝖠 ¬p)) 𝖠 (p ∨ r). CO er L-
-1 2
Rememb B
11 Use the truth tables method to determine whether p (q CO er L-
𝖠 ¬q) and ¬p are logically equivalent. -1 1
“If I am guilty, I must be Understa B
punished”. “I’m not guilty”. nd L-
12 …………………… CO 2
“Therefore I must not be punished.” -1
Is the argument logically correct? Explain.
Compare, with examples, tautology, contradiction Rememb B
13 CO er L-
and contingency.
-1 1
Let M(x): x is mammal. A(x): x is animal. W(x): x is Understa B
warm blooded. nd L-
14 CO
Translate the statement “Every mammal is warm blooded” into 2
-1
formula using quantifiers.
Consider the conditional statement “If the floods destroy my Understa B
house or fires destroy my house, then my insurance company nd L-
15 CO
will pay me.” Write the formula for converse, Inverse and 2
-1
contra- positive of the statement along with its meaning.

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Question Bank – Unit -2

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

MCQs/True False/Fill in the Blanks

Bloom’
Q. Questi CO B
s
N. on L
Taxono
my
Rememb BL
1 A set is a collection of objects. CO-2 er -1
Rememb BL
2 The objects in the set are called its ……………… CO-2 er -1
Rememb BL
3 A set with countable elements is called set. CO-2 er -1
Rememb BL
4 The set with no elements is called singleton set. (True/False) CO-2 er -1
Rememb B
5 According to De Morgan’s Law (A B)’ =................. CO-2 er L-
1
Equivalence Relation is Reflexive, Rememb B
6 CO-2 er L-
Symmetric and...................
1
The Cartesian product of two sets A and B is Rememb BL
7 CO-2 er -1
denoted by................
The number of elements in a set is known as its Rememb BL
8 CO-2 er -1
............number.
Rememb BL
9 Every set is a subset of itself. (True/ False) CO-2 er -1
A partial ordered relation is Reflexive, Rememb B
10 CO-2 er L-
Transitive and……………………
1

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
Long Answer

Bloom’
Q. Questi C B
s
N. on O L
Taxono
my
Define Set with example. Also explain its various Rememb B
1 CO er L-
types. Give examples also. -2 1
Define a Subset. Explain various properties of a subset. Rememb B
2 CO er L-
Give suitable examples. -2 1
Discuss the methods of Set formation? Explain with Rememb B
3 CO er L-
suitable example. -2 1
Discuss various operations on sets. Give suitable examples Rememb B
4 CO er L-
for each. -2 1
A survey of 550 television watchers produced the Understa B
following information: 285 watch football, 195 watch nd L-
2
hockey, 115 watch baseball, 45 watch football and
baseball, 70 watch football and hockey, 50 watch hockey
5 and baseball and 100 do not watch any of the three games. CO
a) How many people in the survey watch all the -2
three games?
b) How many people watch exactly one of the three games?

Among the first 1000 positive integers: Understa B

a) Determine the number of integers which are not nd L-
6 CO 2
divisible by 5, nor by 7 and nor by 9.
b) Find the number of integers divisible by 5, but not by -2
7, not by 9.
If U={0,1,2,3,4,5,6,7,8}, A={1,5,6,7,8}, B={0,1,6,7}, Understa B
C={1,2,3,5,8}. verify that: nd L-
7 CO 2
a) A𝖴 (BC) = (A 𝖴 B) (A 𝖴C) -2
b)b) (AB) c
=Ac 𝖴 Bc
Understa B
Let R be a binary relation defined as R = {(a, b) ɛ R2
nd L-
8 CO and transitive.
: (a-b) 3}. Determine whether R is reflexive, symmetric, anti-symmetric
2
-2
Rememb B
9 Discuss the properties of Relation with examples. CO er L-
-2 1
Understa B
Let S be the set of all points in a plane. Let R be a relation
nd L-
10 such that for any two points a and b, (a, b) ɛ R if b is within CO
2
2 centimeters from a. Show that R is not an Equivalence -2
relation.
Rememb B
11 Discuss Equivalence Relation. CO er L-
-2 1
Rememb B
12 Discuss Partial ordered Relation. CO er L-
-2 1
 Understa B
Let X = {1, 2, 3, 4, 5, 6, 7} and R = {(x, y): (x-y) is divisible nd L-
13 CO
by 3}. Show that R is an Equivalence Relation. 2
-2
Rememb B
14 State and prove Distributive Laws in Set Theory. CO er L-
-2 1
Out of 300 students, 64 had taken Mathematics, 94 had Understa B
15 taken English, 58 had taken Computer, 28 had taken CO nd L-
-2 2
Mathematics and Computers, 26 had taken English
and
 Mathematics, 22 had taken English and Computers and 14
had taken all the three subjects.
a) How many students had not taken any of
the three subjects?
b) How many had taken only Computers?

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Question Bank – Unit -3

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

MCQs/True False/Fill in the Blanks

Bloom’
Q. Questi C BL
s
N. on O
Taxono
my
Remembe BL
1 The set on which a function is defined is called…………….. CO r -1
-3
Remembe BL
2 An injection function is a function. CO r -1
-3
Rememb B
3 Co-domain is the subset of Range. (True/ False) CO er L-
-3 1
Rememb B
4 Range is the subset of Co-domain. (True/False) CO er L-
-3 1
We use the sign of division (/) to denote the composition Remembe BL
5 CO r -1
of functions. (True/ False)
-3
Remembe BL
6 Let f: A B. If A is the domain then B is ………………. CO r -1
-3
Remembe BL
7 A surjection function is a function. CO r -1
-3
For an onto function range is equivalent to co- Rememb B
8 CO er L-
domain. (True/ False) -3 1
Remembe BL
9 Onto functions are also known as……………………. CO r -1
-3
Rememb B
10 A bijection is a function which is one-one and onto. (True/ False) CO er L-
-3 1

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
Long Answer
 Bloom’
Q. Questi C B
s
N. on O L
Taxono
my
Rememb B
1 Define a function with examples. CO er L-
-3 1
Rememb B
2 Explain, with example, various types of functions. CO er L-
-3 1
Rememb B
3 Differentiate between injective and surjective functions. CO er L-
-3 1
Rememb B
4 Explain domain, co-domain and range in a function. CO er L-
-3 1
Prove that mapping f: R Understa B
5 COfunction. nd
R, f(x) = 1/x for all x R and x 0, is one-one onto L-
-3 2
Prove that mapping f(x) = cos x for all x Understa B
6 CO
R where f: RR, is neither one-one nor onto. nd L-
-3 2
If f: R R, is defined by f(x) = ax + b where a, b, x R and a Understa B
7 CO nd L-
0. Show that ‘f’ is invertible and find the inverse of ‘f’. -3 2
Let X = {a, b, c}. Function f: X Understa B
8 X is2 defined
-1 such that f = {(a, b), (b, a), (c,CO
c)}. Find f nd L-
, f and f3. -3 2
Let N be the set of natural numbers including zero. Given f: Understa B
9 N N such that f(x) = x 2 + 2. Find whether it is one - one onto CO nd L-
or -3 2
one – one into.
Let X= {1, 2, 3}, Y = {p, q} and Z = {a, b}. f: X Y = {(1,p), Understa B
10 (2,p), (3,q)} and g: Y CO nd L-
Z = {(p, b), (q, b)}. Find gof and show it pictorially. -3 2

Rememb B
11 State and prove the Pigeonhole principle. CO er L-
-3 1
Explain the operation of composition in functions. Give Rememb B
12 CO er L-
suitable example.
-3 1
Let f: X Understa B
13 Y be an invertible function and A and B -1be arbitrary -non-empty CO
subsets of Y.nd
Show that f L-
(AՍB) = f -3 2
1
(A) Ս f -1(B).
Given f(x) = 3x - 4, x>0 and -3x + 2, x0. f: R Understa B
14 R. Determine
-1 the value of f(-2), f CO nd L-
(0) and f-1(-7). -3 2
Let f: X Y and g: Y Understa B
15 Z be-1one -1– one onto mappings. Prove that: (gof)
-1
CO nd L-
=f og . -3 2

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Question Bank – Unit -4

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

MCQs/True False/Fill in the Blanks

Bloom’
Q. Questi CO B
s
N. on L
Taxono
my
A non empty set A is termed as an algebraic structure Rememb BL
1 CO er -1
with respect to binary operation *. (True/ False)
-4
Rememb BL
2 An Abelian Group satisfies Commutative property. (True/ False) CO er -1
-4
The non-empty set R is said to form a Ring under Rememb BL
3 CO er -1
operations addition and …………………
-4
The inverse of - i in the multiplicative group, {1, - 1, i , - Understa B
4 CO nd L-
i} is………
-4 2
Rememb BL
5 0 is the identity element for multiplication. (True/ False) CO er -1
-4
Rememb BL
6 1 is the identity element for multiplication. (True/ False) CO er -1
-4
Rememb BL
7 The least upper bound in lattice is denoted by………….. CO er -1
-4
Rememb BL
8 The greatest upper bound in lattice is denoted by………… CO er -1
-4
Rememb BL
9 A POSET is Reflexive, Anti-symmetric and ……………….. CO er -1
-4
The number of elements in a Group is called of the Rememb BL
10 CO er -1
Group.
-4

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
Long Answer

Bloom’
Q. Questi CO BL
s
N. on
Taxono
my
Rememb B
1 Define Group. Give example. CO er L-
-4 1
Rememb B
2 Define Ring. Give example. CO er L-
-4 1
Rememb B
3 Define Field. Give example. CO er L-
-4 1
Rememb B
4 Define Integral Domain with example. CO er L-
-4 1
Rememb B
5 Differentiate between Groupoid and Abelian Group. CO er L-
-4 1
Rememb B
6 Differentiate between semi-group and monoid. CO er L-
-4 1
Understa B
7 Prove that a field is necessarily an Integral Domain. CO nd L-
-4 1
Understa B
8 COusual orderingnd
Explain a Partial Ordered Set (POSET). Prove that the set of integers Z with the ‘’ is a POSET. L-
-4 2
Consider the operation * defined on Z, the set of integers as Understa B
9 CO nd L-
a*b
-4 2
= a+b-2ab. Determine whether * is commutative or associative.
Show that the set Z of integers forms an abelian group under Understa B
10 CO nd L-
operation * defined as a*b = a+b+1 for all a, b ɛ Z.
-4 2
Understa B
11 Prove that {1, -1, i, -i} forms an abelian multiplication group. CO nd L-
-4 2
Let A= {2,3,6,12,24,36} and R be the relation on A defined by Understa B
12 “a/b” (a ‘divides’ b). Show that R is POSET. Also draw the CO nd L-
Hasse Diagram for the POSET. -4 2
Define a Lattice. Let A = {1,2,3}.Prove that the power set Understa B
13 CO nd L-
of A P(A) under relation “⊆” is a lattice.
-4 2
Define with examples: Rememb B
14 a. Linearly ordered set or Totally ordered set CO er L-
b. Well-ordered set -4 1
Show that set L = {1, 2, 3, 5, 6, 12} under divisibility Understa B
15 CO nd L-
forms a Lattice.
-4 2

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
 School of Technology
Computer Science & Engineering
Quantum University, Roorkee

Question Bank – Unit -5

Program: BCA Semester: 1st

Course Title: Discrete Mathematics Course Code: CA 3102

Name of Faculty: Dr. Dev Baloni Session: 2023-2024

MCQs/True False/Fill in the Blanks

Bloom’
Q. Questi CO B
s
N. on L
Taxono
my
The chance of occurring of a certain event Rememb BL
1 CO er -1
is called…………….. -5
Rememb BL
2 The performance of an experiment is called a……………. CO er -1
-5
The total number of permutations of ‘n’ objects taken ‘r’ Rememb BL
3 CO er -1
at a time is denoted by…………… -5
The number of combinations of ‘n’ objects taken ‘r’ Rememb BL
4 CO er -1
at a time is denoted by………… -5
Rememb BL
5 The factorial n (n ) = …………………. CO er -1
-5
The highest power of ar occurring in a recurrence relation Rememb BL
6 CO er -1
is called its ……………
-5
Rememb BL
7 A recurrence relation is said to be if its degree is one. CO er -1
-5
The difference between the largest and smallest Rememb BL
8 CO er -1
subscript appearing in the relation is called its ………….
-5
Rememb BL
9 The expansion of the formula nPr = ………………… CO er -1
-5
Rememb BL
10 The expansion of the formula nCr = ………………… CO er -1
-5

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)
Long Answer
Bloom’
Q. Questi C B
s
N. on O L
Taxono
my
Define Permutation. Prove that the number of different Understa B
1 permutations of n distinct objects taken ‘r’ at a time, r CO nd L-
-5 2

n
is given by n(n-1)(n-2)(n-3) (n – r + 1).
From a bag containing 4 black and 5 white balls, a man Understa B
2 draws four balls at random. Find the probability that there CO nd L-
-5 2
are 2 black and 2 white balls.
There are 4 blue, 3 red and 2 black pens in a box. These are Analy B
3 drawn one by one. Determine all the different CO ze L-
permutations. -5 3
How many ways can we select a software development Analy B
group of 1 project leader, 5 programmers and 6 data entry ze L-
4 operators from a group of 5 project leaders, 20 CO 3
programmers -5
and 25 data entry operators.
n-1
Determine the value of ‘n’ in nC4 = nC3 and n
P4 = Analy B
5 CO ze L-
3 7 -5
P4. 3

In a shipment, there are 40 floppy disks of which 5 are Analy B

defective. Determine: ze L-
3
6 a). In how many ways we can select five floppy disks. CO
b). In how many ways we can select five non – defective -5
floppy disks.

Two dice are tossed once. Find the probability of getting an Analy B
7 even number on first dice or a total of 8. CO ze L-
-5 3
A fair six-sided die is rolled twice. What is the probability Analy B
8 of getting 2 on the first roll and not getting 4 on the second CO ze L-
-5 3
roll?
Explain Multiplication Theorem in Probability. Rememb BL-1
9 CO
er
-5
Find the in-order, pre-order and post-order traversal Analy B
ze L-
3
10 CO
-5

Analy B
11 Explain graph? Explain its key terms CO ze L-
-5 3
Consider the graph below,draw its adjacency matrix. Analy B
ze L-
3
12 CO
-5
 Given the following adjacency matrix, draw the
weighted graph.
13 CO Understa B
-5 nd L-
2

A man has 11 close relatives and he wishes to invite 5 of them Understa BL-2
to nd
dinner. In how many ways can he invite them in the
14 CO
following situation:
-5
a. There is no restriction on the choice.
b. Two particular persons will not attend separately.
c. Two particular persons will not attend together.

Find the solution of recurrence relation ar – 6ar-1 + 9ar-2 = 0, Appl B

15 CO
with initial conditions a0 = 1 and a1 = 6. y L-
-5
3

Bloom’s Taxonomy and Bloom’s Level

(BL-1: Remember, BL-2: Understand, BL-3: Apply, BL-4: Analyze, BL-5: Evaluate, BL-6: Create)