Module 1-Sets

1. Explain about sets and types of sets

Set : A collection of well defined , distinct
objects or items is called a set.
 The objects or items are called
elements of the set
 Uppercase letters – sets
 Lowercase letters – elements
Types of sets:
 Empty set : A set with no elements is
called as null set or empty set
 Denoted by {} or ∅
 Finite set : A set with finite number of
elements is called finite set
 Infinite set : A set with infinite
numbers of elements is called as infinite
set
 All number systems are infinite
set
 Power set : set of all the possible
subsets of a set are called as power set
 Denoted as P(A)
  Subset of a set : If X, Y are two sets ,
if all the elements of X are also the
element of Y , then the set X is called as
subset of Y
 Denoted by X subset Y
 Proper Subset : The subset which is not
equal to the given set and then it called as
proper set
 Improper set : The subset empty set
and equal to the given set are called
Improper subset
2. Explain about operations on sets
3. Explain Associative, commutative,
Distributive laws on sets
 Commutative law
 Associative law :

 Distributive law
4. Explain Identity, Inverse, DE
Morgan’s laws on sets
De morgan’s law

Identity law:
AUØ=A
LHS : AUØ = A or Ø
= A [ Ø has no element ]
A =A
LHS : A= A AND
=A[ all the elements of A are also
in ]
Inverse law :
AU❑ =U ❑

A❑ =Ø
❑

5. Determine the elements of the set

{x/x ϵ N such that 2x+1=0}
Here N = 1,2,3,4,5,6,………..
6.[5.] Find the A B and A B if A={x/x such
that -6<x<-4 } B= {x/x ϵ Z ,-1<x<1}
2x+1= 0
2(1)+1=2+1=3
2(2)+1=4+1=5
2(3)+1=6+1=7
 2(4)+1=8+1=9
So on…
{3,5,7,9,………..}
6.Find the A B and A B if A={x/x such
that -6<x<-4 } B= {x/x ϵ Z ,-1<x<1}
A={-5} B = {0}
A B = {} A B ={}
Both are empty sets
7.Sketch the Venn diagram for the set
operations A-B & B-A, Ā
Sketch the Venn diagram for the set
operations A ∪(B∩ c) & A-(B ∩ C)8.c
9.Sketch the Venn diagram for the set
operations u-(A∩ B) & (A∪ B)-C
10.No of elements in Power set of A if
n(A)=n
n
2

11.Find the Power set of A= {a, b, c}

3
2 =2 ×2 ×2=8

12.Explain about subset, superset, proper

subset, improper subset
 Subset of a set : If X, Y are two sets ,
if all the elements of X are also the
element of Y , then the set X is called as
subset of Y then the Y is the superset
 Denoted by X subset Y
 Proper Subset : The subset which is not
equal to the given set and then it called as
proper set
 Improper set : The subset empty set
and equal to the given set are called
Improper subset
 13.What kind of a set A={x/x C, x 2

+x^2+3x+3=0}

14.What kind of a set A={x/x Q, x +4=6}

2

❑ +4=6
❑

❑
❑
√❑

This is empty set

15.Explain construction of membership

table for ̅̅̅̅̅̅̅ A ∪ B
A∪B A∪B
A B
1 1 1 0
1 0 1 0
0 1 1 0
0 0 0 1

16.Find A Δ B if A={0,3},B={2,7},U=R
 Universal set is equal to real numbers
A={0,3}
B={2,7}
A B = {0,3,2,7}
17.Explain about representation of sets

18.Explain Universal set, Null set,

Singleton set, Disjoint set
Universal set: The set which contains all
the sets which defined is called universal
set
 Null set: A set with no elements are
called as null set
Singleton set: A set with one element are
called as singleton set
Disjoint set : If a,b are two sets , if they is
no common elements between a and b ,
then a , b are said to be disjoint sets
19.Give an example for Null set
A ={x|3<x<4 , x is whole numbers}
X= {x|x is prime numbers, and 14<x<16}
20.Find proper subsets A=(1,2,3}
Proper subsets of A = {{1},{2},{3}{1,2},
{2,3},{3,1},{1,2,3}}
 Module : 2
Boolean Algebra
1) Explain Boolean algebra
It is a branch of mathematics in
elementary algebra we deal the
operation on numerical values where
as in Boolean algebra we deal the
operations on logical values
2) Explain about operations on
Boolean algebra
3) Explain about finding the values
of Boolean function
 The function F:B^n to B, Where B
={0,1} and B^n =
{ (b1,b2,b3,b4………bn)/bj belongs to
(0,1) for (i=1,2,3,…….n)} is called as
boolean function of degree n.
 If set B ={0,1} then the number of
‘n’ tuples is 2^n where n is a order
of B
 If number of distant Boolean
functions of degree n is 2
n
2

Degree No of Boolean
function of degree
n
N=1 2 =4
1
2

N=2 2 =16
2
2

N=3 2 =256
3
2

N=4 2 =65536
4
2

Find the values of 1+ 1 , 0. 0 , 1+0.

N=5 2 =4,294,967,296
5
2

4)
← ←

 0. 0 , = 0
 1+ 1 = 1
←

 1+0. = 1
←
5) Find the values if any of the
Boolean variable x that satisfy the
equations x.1=0, x + x=0, x.1=x
 x.1=0 : This satisfies the Boolean
variable of x =0
 x + x=0 : This satisfies the Boolean
variable of x =0,1
 x.1=x : This satisfies the Boolean
variable of x =0,1
6) What values of the Boolean
variables x & y satisfies xy=x + y
For both x=1 and y =1 it satisfies the
equation even x=0 and y=0 it satisfies
the above equation by Boolean
variables.
7) Explain about Idempotent laws,
Identity laws, Double complement
law
Idempotent law:A+A =A A.A=A
Ex : If A = 1, then 1+1 =1 and 1.1 =1
If A = 0 , then 0 +0 =0 and 0.0=0
Identity laws: A+0=A A.1=A
Ex: If A = 1, then 1+0 =1 and 1.1 =1
If A = 0 , then 0 +0 =0 and 0.1=0
Double complement law: 7(7A) =A
If A = 1, then 7A = 0 and 7(7A)= 1
If A = 0 , then 7A = 1 and 7(7A)= 0

8) Explain about Domination,

Distributive, DE Morgan’s laws

Domination law :
A+1=1
A.0=0-
 A A+1 A.0
0 1 0
1 1 0

9) Explain about Absorption, Unit,

Zero properties
10)[8)] Explain about logic gates
It is digital circuits which is able to
operate on number of binary input inn
order to perform a logic functions.
Logic gates can have one or more input
but only one output
11)[9)] Explain types of gates
Basic gates :
AND Gates :
It is logic circuit which perform and
AND operation on the circuits Input.
The input to this gate all the values of
2 or Boolean variables .The output is
the Boolean product of their values .
The symbol is used for “AND” gates is
“.”
OR Gates :
 It is logic circuit which perform the
OR operation on the circuit input . The
input to this gate all the values of 2 or
Boolean variables . The output is the
Boolean sum of their values . The
symbol is used for “OR” gates is “+”.

NOT Gates:
This takes the values of one Boolean
variable as input and produces the
complement of this value as output .
The symbol is used for this invertor x
complement( x ¿
12)[10)] Explain types of gates with
truth tables
 AND Gates :
x y x.y
0 0 0
0 1 0
1 0 0
1 1 1
 OR Gates :
 x y x+y
0 0 0
0 1 1
1 0 1
1 1 1
 NOT Gates
x (x ¿)¿

0 1
1 0

13)[11)] Explain about minterm of

Boolean variables
14)[12)] Explain about maxterm of
Boolean variables

15)[13)] Explain about 2 variable K-

map
16)[14)] Explain about 3 variable K-
map
17)[15)] Explain about 4 variable K-
map
18)[16)] Explain the above K-Map
with expression and simplify
1 1
1 1 1
19)[17)] Explain the above K-Map
with expression and simplify
 1
1 1 1 1
20)[18)] Explain the above K-Map
with expression and simplify
1 1
1 1 1
1 1
1 1 1 1
 Module : 3
COMBINATORICS
1. A password consists of 3 letters
(A-Z) followed by 4 digits (0-9).
How many different possible
passwords can be created?
Number of choices for each letter :
26(A-Z)
Number of choices for each digit :
10 (0-9)
Total passwords : 26^3*10^4=
17,575*10000 = 175760000
2. The school offers 4 mathematics
courses and 3 science courses. If a
student can take only one
course, how many options are
available for them to choose from?
There are 4 mathematics courses and 3
science courses
Then student can take only one course
Total options are available for them to
choose is 3+4 = 7
3. How many ways can you arrange
the letters in the word
"COMPUTER"?
There are 8 letters in the word
‘COMPUTER’
8! = 8×7×6×5×4×3×2×1= 40,320
4. In how many ways can a
committee of 3 people be selected
from a group of 10 people?
Selecting 3 people from a group of
10
❑❑
Combination formula : ❑ ()
❑❑ ❑ ❑
❑ () = ❑ = ❑ =120

5. In a class of 30 students, 18 like

mathematics, 12 like physics, and 10
like both mathematics and
physics. How many students like
either mathematics or physics, or
both?
Total students : 30
Whose likes mathematics (M): 18
Whose likes physics (P) : 12
Whose like both mathematics and
physics (M: 10
Whose like either mathematics or

∣M∪P∣=∣M∣+∣P∣−∣M∩P∣
physics, or both ()

= 18+12-10
= 20
6. How many ways can you arrange
4 boys and 3 girls in a line such that
all the boys are standing
together?
7. In a school, there are 6 different
science textbooks, 5 different history
textbooks, and 4 different
math textbooks. How many ways
can a student choose one book from
each subject?
There are 6 science text books
There are 5 history text books
There are 4 math text books
student choose one book from each
subject 6.5.4 = 120
8. How many ways can you arrange
the letters in the word
"EXAMINATION"?
Total number letters in
‘EXAMINATION’ =11
Repeated letters = A(2) , I(2) , N(2)
Total arrangement : ❑❑ = ❑❑ = ❑❑
= 4989600
9. How many ways can you select 4
people from a group of 12?
❑❑
Combination formula : ❑ () = ❑❑ = ❑❑ =
495
10. How many ways can a 5-digit
phone number be created if the first
digit must be non-zero, and the
last digit must be even?
First digit (non – zero) = 9 choices (1-
9)
Last digit (even) = 5 (0,2,4,6,8)
Middle 3 digits : 10 choices each (0-9)
Total = 9.10^3.5 =9.1000.5= 45000
11. A library has 15 history books, 10
science books, and 5 literature
books. If a student can borrow only
one book, how many different
choices do they have?
A library has 15 history books
A library has 10 science books
A library has 5 literature books
student can borrow only one book so
these many different choices do they
have 15+10+5 =30

12. In how many ways can you

arrange the digits of the number
555123?
Total digit in the number : ‘555123’
Repeated digits : 5(3)
Total arrangements : ❑❑ = ❑❑
=❑❑ = 120
 Module : 4
Graph Theory
1) Explain about applications of Graph
theory
2) Explain about Graph with examples
Graph is denoted by’G’ =(V,E) i.e, graph is a
ordered pair with vertices and edges where V
is set of vertices and E is set of edges
3) Explain about Vertex, edge, size, order of
a graph
 Vertex : The points in a graph are called as
vertex or vertices
Edge : A cural joining two vertices is called an
edge. It is represented by a pair of end vertices
Size of a graph : If G=(V,E) is a graph , then
no edges in graph is called size of a graph and
it is denoted by |G(E )|
Order of a graph : If G =(V E) is a graph
then no of vertices in a graph is called order of
a graph which is denoted |G(V)|

4) Explain about null graph, simple graph,

connected graph
Null graph : A graph with no edges is called a
null graph
Simple graph : A graph with no loop and no
parallel edges is called as simple graph

connected graph :
5) Explain about sub graph, spanning sub
graph, complete graph
sub graph: Let’G’ be a graph , the graph, the
graph ‘H’ is said to be sun graph of G if and
only if
spanning sub graph: A subgraph ‘H’ of a
graph ‘G’ is said to be spanning sub – graph if
‘H’ contains all the vertices of G

complete graph:
A graph ‘G’ is said to be complete graph if
there exists exactly one edge between each
pair of distinct vertices.
A complete graph is denoted by Kn, where n
represents no of vertices in a graph
6) Explain about multi graph, Directed
graph, degree, in degree, out degree of a
vertex in a graph
multi graph: A graph which contains more
than one edge between any 2 vertices then it is
called as multi graph
EX :

Degree of a vertex : number of edges incident

to that vertex is called as degree of a vertex . It
is denoted by deg (v)
 In degree of a vertex : The number of edges
incident to a vertex ‘V’ is called as indegree
of a vertex
It is denoted by G (V).
out degree of a vertex : The number of
edges which are incident from the vertex is
called as out degree of a vertex.
It is denoted by G+(V)

7) Explain about graph traversal methods,

BFS, DFS

8) Explain about Dijkstra’s algorithm

 9) Explain about Euler Graphs

Explain about Hamiltonian Graphs

10) Explain about walk, open walk, circuit
with examples

11) Explain about adjacency matrix

12) Explain about incident matrix

13) Explain about isomorphism of graphs
14) Explain about adjacent edges, adjacent
vertices inn graph
 Module : 5
Logics
1.Explain about statements and types of
statements with examples
Statements : A sentence which is true or false is
called statement . statement are usually denoted by
lower case letters p,q,r,s, and so on
EX : 50 is a even number
3+5=7
Primitive statements : A statement is called a
primitive if can be break into simple sentence.
Compound statements : compound statements
can be formed by primitive statement by using
logical connections.
2.If P; Triangle ABC is Equilateral and q:
Triangle ABC is equiangular then ¬ p → ¬q means
2.If P; Triangle ABC is Equilateral and q:
Triangle ABC is equiangular then means
P : triangle ABC is equilateral
Q : triangle ABC is equiangular
meaning
 is the negation of p that means “Triangle ABC
is not equilateral
is the negation of q that means “Triangle ABC
is not equiangular
3.Simplify [p^(p→q) →q]
p q p→q p^(p→q) p^(p→q) →q
0 0 1 0 1
0 1 1 0 1
1 0 0 0 1

1 1 1 1 1

4. (p^q) → p is
p q p^q (p^q) → p
0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 1
5. Explain commutative, Associative,
Distributive laws
 6. Explain Domination, Absorption,
Negation laws
Domination law:
PvT =T and P^F = F
P T F PvT P^F
1 1 0 1 0
0 1 0 1 0
Absorption law:
A+(A.B) =A
A.(A+B)=A
A B A.B A+(A.B) A+B A.(A+B)
0 0 0 0 0 0
0 1 0 0 1 0
1 0 0 1 1 1
1 1 1 1 1 1

Negation law :
P 7P
0 1
1 0

7. Explain conjunction, Disjunction,

Negation along with truth tables
Conjunction: It is a logical operation on 2
statements p,q defined by p and q and it is denoted
by p^q . The truth value of conjuction of p,q is true
if both the statements are true otherwise false
Truth table
p q p^q
0 0 0
0 1 0
1 0 0
1 1 1

Disjunction: It is operation on two statements

such that it takes truth values true if any one of the
statements is true, if p,q are two statements then
disjunction is defined by p or q it is denoted by
pvq
Truth table
p q pvq
0 0 0
0 1 1
1 0 1
1 1 1

Negation: It is an operation on logical values

of the statements that sends true to false and false
to true negation of a statements is defined as NOT
p and it is denoted by 7p
Truth table
p 7p
0 1
1 0

8. Explain Implication, Bi-conditional, with

truth tables
Implication law : It is denoted p-> q and it
can be read as p implies q . if p then q implication
of p , q is false , if p is true and q is false otherwise
it is true . It is called as conditional.
Truth table
p q p->q
0 0 1
0 1 1
1 0 0
1 1 1

Bi-conditional law : If p , q are two

statements then bi conditional of p,q are denotes
by p q [if only of] . It takes the truth value true if
both statements have same truth values
Truth table
p q pq
0 0 1
0 1 0
1 0 0
1 1 1

9. Explain tautology, Contradiction

Tautology: A compound statements is said to
if it true for all the truth values assigned and for its
primitive statements and denoted by ‘To’
 Contradiction: A compound statements said
to be contradiction if it is false for all the truth
values assigned for its primitives statements and
denoted by ‘Fo’.
10. Explain NAND, NOR
NAND : The logical NAND is a combination
of the 2 logical connectives NOT and AND which
means p NAND q  NOT (p AND q) and its is
denoted by p↑q
Truth table p↑q = 7(p^q)
p q P^q 7(p^q) =p↑q

0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0
From the value we observe that the truth value of
NAND is false when the both the value are true
NOR : NOR is also logical connective which
is a combination of NOT and OR . it is denoted by
p↓q
Truth value : 7(pvq) = p↓q
 p q pvq 7(pvq) = p↓q

0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0

11. Explain about Quantifiers along with its

types
Quantifiers : The word which represents the
quantity of the variable is called as quantifiers
There are two types of Quantifiers
 Universal quantifiers
 Existenial quantifiers
Universal quantifiers : It is denoted as ∀ x and refer
to the word ‘All’ and it can also be expressed by
the following word
 For all x
 For every x
 For each x
 For any x
Existenial quantifiers :It is denoted as ∃ x and refers
to the word ‘some’ . It can be expressed in any of
the following words.
 There is atleast one x
 There exist an x such that
 For some x such that
 Some x such that
12. Explain about predicates with examples
means
The statement which are neither true nor
false that is a sentence with variable has 2 parts
first one is X [variable] which is called as
subject to the sentence and the second part is
greater than 3 is called as predicate and it is
represent the condition or property that the
subject of sentence should be satisfy . If p(x)
represents a sentence p(x)>3 which indicates
predicate and x indicates variables.
I. Let Q(x,y) denote sentence x=y+3 what
are truth values of statements Q(1,2)
and Q(3,0)
Given : Q (x,y) : “x=y+3”
Q(1,2) : 1=2+3 = 5
Truth value of Q(1,2) is false
 Q(3,0) : 3=1+3 = 3
Truth value of Q(3,0) is true
13. Explain about logically equivalence
statements
The S1 and S2 are statement have the same
truth values then S1 is called as logical
equivalent to S2 and it is denoted by S1 S2 or
S1 S2
Example : Show that the statement
and p q are logically equivalent
S1 :
S2 : p q
P.T S1 S2
We prove by using truth value
p q pq

0 0 1 1 1
0 1 1 1 1
1 0 0 0 0
1 1 0 1 1

14. Simplify p→q in terms of conjuction

 p q 7p 7pVq pq
0 0 0 1 1
0 1 0 0 0
1 0 1 1 1
1 1 1 1 1

15. Explain Identity, Inverse laws

Identity law:
P^T = P Pvf = p
P T F P^T PvF
1 1 0 1 1
0 1 0 0 0
Inverse law :
7pVp =T 7p^p = F
P 7P 7pVp 7p^p
0 1 1 0
1 0 1 0

16. Explain proof of commutative laws

17. Explain substitution laws
17. Explain Substitution laws
P→ q 7pVq
p q 7p 7pVq P→ q
0 0 1 1 1
0 0 1 1 1
1 1 0 0 0
1 1 0 1 1