I BCA
BCACACN201- Discrete Mathematical Structures
UNIT -I
Questions carrying 2 marks:
1. What are propositions? Give example.
2. Express the following compound statements in words taking p for hard work, q for
success and r for job.
i) ךp^ ךq ii) (ךp˅q)^r
3. Construct the truth tables for
i) ( ךp˅q) ii) ( ךp^q)
4. Write which of these is a tautology or a fallacy.
i) p˅ ךp ii) p ^ ךp
5. Define a set. Give an example.
6. Define null set and universal set.
7. Define proper subset. Give example.
8. Define disjoint sets. Give example.
9. Define subset. Give example.
10. Represent
a. A∪B b. A∩B c. A-B d. B-A e. ךA using Venn
diagram
11. Define power set. Give example.
12. Write the power set of A={1,2}
14. A={1,2,6,7} B={2,3,4,6,7} what is A+B?
15. A={1,2,3} B={1, 2,5,7,9} write A-B
16. A={1,2,3} B={1, 2,5,7,9}, find A+B.
17. A={2,3,4} B={1,2} and c={4, 5,6} what is (A+B )+(B+C)
18. Define Cartesian product of two sets.
19. A={a,b} B={1,2,3} write AxB and BXA.
20. Define symmetric relation and give an example.
21. Define reflexive relation. Give an example.
22. Define transitive relation. Give an example.
23. Write the power set of A={1,2,3}
24. What are equivalence relations? Give an example.
25. A={2,4,6,7,9} B={1,2,4,7,8} Find A-B and A+B.
26. A={1,2,3} B={a,b} write AXB and BXA
Questions Carrying 4 or more marks.
1. Write which of these is a tautology or a contradiction with the help of
truth table. i) p˅ (ךp˄q) ii) (p˄q)˄ (ךp˄q)
2. Using truth table, show that (p˄q) => p and p => (p˅q) are both tautologies, where p andq
are any two statements.
3. Write the following statements in symbolic form and give their negations.
i) If he works hard, he will pass the examination.
ii) If it rains, he will not go for a walk.
4. Prove by means of truth table that, (p˄q) => (p˅q) is a tautology but (p˅q) => (p˄q) si
not.
5. Prove by means of truth table that, pq (p→ q) ˄ (q→ p)
6. Show the following implications:
i. (p˄q) => (p→q)
ii. p => (q→p)
7. Show the following equivalences:
i. p→(q→p) = ךp→ (p→q)
ii. p →(q˅r) = (p→q) ˅(p→r)
8. Prove by means of truth table that, (ךp→q) = p˄ ךq
9. A={1,2,3} B={1,2,5,7,9} Write A-B, B-A, A+B, A∪B, A∩B.
10. A={1} B={a,b} C={2,3} write AXB, BXA, A2, B2,, AXBXC, C2XA 11. A={x/ x
is an integer and 0 ≤ 𝑥 ≤ 5 }, B={3,4,5,17} and C={1,2,3} Find
i. A∪B ii. A∩B iii. A-B iv. A-C iv. A∩C
12. A={α, β } and B={1, 2, 3} Find A2, B2, A X B and B X A 13.
A={3,4,5,17} B={1,2,3} C={x/X is an integer and 0 ≤ 𝑥 ≤ 5} write
A∪B, A∪C, B∪C, B-C, A-C, B∩C.
14. Let X = {1,2,3,4} and R = {(x,y) | x>y} Draw the graph of R and give its matrix.
15. R={<1,1> <1,2>, <1,4>, <2,1>, <2,2>, <2,3>, <3,2>, <3,3>, <4,2>, <4,4>} Construct
relation matrix of R and draw digraph of R
16. R={(1,1), (1,2), (1,4), (2,1), (2,2), (2,3), (3,2), (3,3), (4,2), (4,4)} Construct relation
matrix of R and draw digraph of R
17. Let X={1,2,3,….,7} and R={<x,y>|x-y is divisible by 3}, Show that R is an equivalence
relation.
20. Let X={1,2,3,….,7} and R={<x,y>|x-y is divisible by 3}, Draw the graph of the relation.
UNIT-II
Questions carrying 2 marks
1. Define partial order relation. Give an example
2. Define surjective function. Give an example.
3. Define injective function. Give an example.
4. Define bijective function. Give an example.
5. Define inverse function. Give an example.
6. Define domain of a function. Give an example
7. Define range of a function, with an example.
9. Let x={1,5,p,Jack}, Y={2,5,7,q,Jill} and f={<1,2>,<5,7>,<p,q>,<Jack,q>}, Find Df
and Rf (Domain and range of function)
10. There are 32 microcomputers in a computer center. Each microcomputer has 24 ports.
How many different ports to a microcomputer in the center are there?
11. A new company with just two employees, Sanchez and Patel, rents a floor of a building
with 12 offices. How many ways are there to assign different offices to these two
employees?
12. The chairs of an auditorium are to be labeled with an uppercase English letter
followed by a positive integer not exceeding 100. What is the largest number of chairs
that can be labelled differently?
13. How many different bit strings of length seven are there?
14. Define the sum rule.
15. A student can choose a computer project from one of three lists. The three lists contain
23, 15, and 19 possible projects, respectively. No project is on more than one list. How
many possible projects are there to choose from?
16. Define the subtraction rule.
17. What is Pigeonhole principle? Give an example.
18. How many students must be in a class to guarantee that at least two students receive the
same score on the final exam, if the exam is graded on a scale from 0 to 100 points?
19. In how many ways can we select three students from a group of five students to stand
in line for a photo session?
20. An office building contains 27 floors and has 37 offices on each floor. How many
offices are in the building?
21. Write the formula to calculate P(n,r).
22. Write the formula to calculate C(n,r).
Questions Carrying 4 or more marks.
1. Draw the Hasse diagram of the set A, under the partial ordering relation “divides” and
indicate those which are totally ordered.
A = {1,2,3,6,12}
2. Let X = {2,3,6,12,24,36} and the relation <= be such that x ≤ y, if x divides y. Draw
the Hasse diagram of (X, ≤)
3. Define Surjective, injective and Bijective functions with example.
4. Given h(x)=5−9xh(x)=5−9x find h−1(x)h−1(x).
5. Given g(x)=12x+7g(x)=12x+7 find g−1(x)g−1(x).
6. Given f(x)=(x−2)3+1f(x)=(x−2)3+1 find f−1(x)f−1(x).
1
7. Show that functions f(x)=x3 and g(x)=𝑥3 for x𝜀 R are inverse of one another.
8. How many different license plates can be made if each plate contains a sequence of
three uppercase English letters followed by three digits (and no sequences of letters are
prohibited, even if they are obscene)?
9. Suppose that either a member of the mathematics faculty or a student who is a
mathematics major is chosen as a representative to a university committee. How many
different choices are there for this representative if there are 37 members of the
mathematics faculty and 83 mathematics majors and no one is both a faculty member
and a student?
10. How many bit strings of length eight either start with a 1 bit or end with the two bits
00?
11. A computer company receives 350 applications from computer graduates for a job
planning a line of new Web servers. Suppose that 220 of these applicants majored in
computer science, 147 majored in business, and 51 majored both in computer science
and in business. How many of these applicants majored neither in computer science nor
in business?
12. There are 18 mathematics majors and 325 computer science majors at a college. In how
many ways can two representatives be picked so that one is a mathematics major and
the other is a computer science major?
13. How many ways are there to select a first-prize winner, a second-prize winner, and a
third-prize winner from 100 different people who have entered a contest?
UNIT-III
Questions carrying 2 marks
1. Define the terms : experiment, sample space, event.
2. An urn contains four blue balls and five red balls. What is the probability that a ball
chosen at random from the urn is blue?
3. What is the probability that when two dice are rolled, the sum of the numbers on the
two dice is 7?
4. Define Laplace’s definition of probability.
5. What is probability distribution?
6. What probabilities should we assign to the outcomes H (heads) and T (tails) when a
fair coin is flipped?
7. Define conditional probability.
8. Define independent events.
9. What is a random variable?
10. Define Bayes’ theorem.
11. Write the formula to calculate expected value.
12. What is variance?
13. What are the quotient and remainder when 101 is divided by 11?
14. Determine whether 17 is congruent to 5 modulo 6 and whether 24 and 14 are
congruent modulo 6.
15. Define prime and composite number.
16. Define GCD and LCM.
17. What is the greatest common divisor of 24 and 36?
18. Find the prime factorization of 641 and 100
19. Find the prime factorization of 1024
20. Find the prime factorization of 999
21. What is the greatest common divisor of 17 and 22?
Questions Carrying 4 or more marks.
1. There are many lotteries now that award enormous prizes to people who correctly
choose as set of six numbers out of the first n positive integers, where n is usually
between 30 and 60. What is the probability that a person picks the correct six numbers
out of 40?
2. Find the probability that a hand of five cards in poker contains four cards of one kind.
3. What is the probability that a poker hand contains a full house, that is, three of one kind
and two of another kind?
4. A sequence of 10 bits is randomly generated. What is the probability that at least one
of these bits is 0?
5. What is the probability that a positive integer selected at random from the set of positive
integers not exceeding 100 is divisible by either 2 or 5?
6. Suppose that a die is biased (or loaded) so that 3 appears twice as often as each other
number but that the other five outcomes are equally likely. What is the probability that
an odd number appears when we roll this die?
7. A bit string of length four is generated at random so that each of the 16 bit strings of
length four is equally likely. What is the probability that it contains at least two
consecutive 0s, given that its first bit is a 0? (We assume that 0 bits and 1 bits are equally
likely.)
8. What is the conditional probability that a family with two children has two boys, given
they have at least one boy?
9. Suppose E is the event that a randomly generated bit string of length four begins with
a 1 and F is the event that this bit string contains an even number of 1s. Are E and F
independent, if the 16 bit strings of length four are equally likely?
10. Are the events E, that a family with two children has two boys, and F, that a family with
two children has at least one boy, independent?
11. Let X be the number that comes up when a fair die is rolled. What is the expected value
of X?
12. A fair coin is flipped three times. Let S be the sample space of the eight possible
outcomes, and let X be the random variable that assigns to an outcome the number of
heads in this outcome. What is the expected value of X? (6 marks)
13. What is the expected value of the sum of the numbers that appear when a pair of fair
dice is rolled? (6 marks)
14. Are the random variables X1 and X2 independent, if the sum of the numbers that appear
when a pair of fair dice is rolled? (6 marks)
15. Find the greatest common divisor of 414 and 662 using the Euclidean algorithm
16. Find the greatest common divisor of 91 and 287 using the Euclidean algorithm
UNIT-IV
Questions carrying 2 marks
1. Define graph, simple graph, multigraph, pseudograph, simple directed graph, mixed
graph, loop, multi-edges with an example? (Ask any one)
2. Define degree of a vertex, with an example?
3. Define multiplicity of an edge with an example?
4. What are neighbours of a node? Give an example?
5. What are initial and terminal nodes? Give an example?
6. Define isolated and pendant nodes with an example.
7. State hand shaking theorem.
8. How many edges are there in a graph with 10 vertices each of degree six?
9. Define a complete graph with an example.
10. Define cycle and wheel with an example.
11. Find G1 ∪ G2 for the following graph
12. Find the number of vertices, the number of edges, and the degree of each vertex in the
given undirected graph.
13. Find isolated and pendant node in the graph
14. When do you say the graphs are isomorphic? Give an example.
15. Define an adjacency matrix.
16. Define an incidence matrix.
17. Define connected graph with an example.
18. Define disconnected graph with an example.
19. Define strongly and weakly connected graph.
20. What is a Euler circuit? Give an example
21. Define Euler path with an example.
22. Define a Hamilton path. Give an example
23. Define the chromatic number of a graph
24. What is meant by colouring a graph?
25. Find the chromatic number of the given graph
26. Find the chromatic number of the given graph
27. Define tree. Give an example
28. Define binary tree with example.
29. What is a (a) terminal node (b) degree of the node
30. What is a a) forest b) level of a node
31. Define root node and leaf node.
32. What is an ordered tree? Give an example
33. What is a binary tree? Give an example
Questions Carrying 4 or more marks.
1. What are the degrees and neighbourhood of the vertices in graph displayed?
2. What are the degrees and neighbourhood of the vertices in graph displayed?
3. Find the in-degree and out degree of each vertex in the graph G with directed edges as
shown in the figure?
4. Find the union of the given pair of simple graphs.
5. Find the union of the given pair of simple graphs.
6. Write adjacency list and adjacency matrix to describe the simple graph given in the
figure (6 marks)
7. Represent the directed graph shown in the figure by listing all the vertices that are the
terminal vertices of edges starting at each vertex of the graph.
8. Use an adjacency matrix to represent to represent the graph
9. Use an adjacency list to represent the given graph.
10. Use an adjacency list to represent the given graph.
11. Draw a graph with the adjacency matrix
12. Draw a graph with the given adjacency matrix.
13. Represent the graph in with an adjacency matrix
14. Represent the given graph with an adjacency matrix.
15. Represent the given graph using an adjacency matrix.
16. Use an adjacency matrix to represent the pseudograph
17. Represent the graph shown in the figure with an incidence matrix
18. Represent the pseudograph shown in the figure using an incidence matrix.
19. Show that the graphs G = (V , E) and H = (W, F ), displayed in the given figure, are
isomorphic.
20. Are the graphs shown in the figure G1 and G2 connected? Verify
21. Does each of these lists of vertices form a path in the following graph? Which paths are
simple? Which are circuits? What are the lengths of those that are paths?
(a) a, e, b, c, b (b) a, e, a, d, b, c, a
(c) e, b, a, d, b, e (d) c, b, d, a, e, c
22. Are the directed graphs G and H shown in Figure strongly connected? Are they weakly
connected?
23. Which of the undirected graphs in Figure have an Euler circuit? Of those that do not,
which have an Euler path? (any one figure)
24. Which of the directed graphs in Figure have an Euler circuit? Of those that do not,
which have an Euler path? (any one figure)
25. Which of the simple graphs in Figure have a Hamilton circuit or, if not, a Hamilton
path? (any one figure)
****************