Join Telegram- TECHVINES CODERS UINION.

https://t.me/Techvines_Coders_Union
FOR ALL SANFOUNDRY MCQ (1000+
MCQ) JOIN telegram group >>
https://t.me/edcsppu
Discrete Mathematics Questions and
Answers – Sets
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Sets”.

1. A __________ is an ordered collection of objects.

a) Relation
b) Function
c) Set
d) Proposition
View Answer

Answer: c
Explanation: By the definition of set.
advertisement

2. The set O of odd positive integers less than 10 can be expressed by _____________
a) {1, 2, 3}
b) {1, 3, 5, 7, 9}
c) {1, 2, 5, 9}
d) {1, 5, 7, 9, 11}
View Answer

Answer: b
Explanation: Odd numbers less than 10 is {1, 3, 5, 7, 9}.

3. Power set of empty set has exactly _________ subset.

a) One
b) Two
c) Zero
d) Three
View Answer

Answer: a
Explanation: Power set of null set has exactly one subset which is empty set.
4. What is the Cartesian product of A = {1, 2} and B = {a, b}?
a) {(1, a), (1, b), (2, a), (b, b)}
b) {(1, 1), (2, 2), (a, a), (b, b)}
c) {(1, a), (2, a), (1, b), (2, b)}
d) {(1, 1), (a, a), (2, a), (1, b)}
View Answer

Answer: c
Explanation: A subset R of the Cartesian product A x B is a relation from the set A to the set
B.

5. The Cartesian Product B x A is equal to the Cartesian product A x B.

a) True
b) False
View Answer

Answer: b
Explanation: Let A = {1, 2} and B = {a, b}. The Cartesian product A x B = {(1, a), (1, b), (2,
a), (2, b)} and the Cartesian product B x A = {(a, 1), (a, 2), (b, 1), (b, 2)}. This is not equal to
A x B.
advertisement

6. What is the cardinality of the set of odd positive integers less than 10?
a) 10
b) 5
c) 3
d) 20
View Answer

Answer: b
Explanation: Set S of odd positive an odd integer less than 10 is {1, 3, 5, 7, 9}. Then,
Cardinality of set S = |S| which is 5.

7. Which of the following two sets are equal?

a) A = {1, 2} and B = {1}
b) A = {1, 2} and B = {1, 2, 3}
c) A = {1, 2, 3} and B = {2, 1, 3}
d) A = {1, 2, 4} and B = {1, 2, 3}
View Answer

Answer: c
Explanation: Two set are equal if and only if they have the same elements.

8. The set of positive integers is _____________

a) Infinite
b) Finite
c) Subset
d) Empty
View Answer
Answer: a
Explanation: The set of positive integers is not finite.

9. What is the Cardinality of the Power set of the set {0, 1, 2}?
a) 8
b) 6
c) 7
d) 9
View Answer

Answer: a
Explanation: Power set P ({0, 1, 2}) is the set of all subsets of {0, 1, 2}. Hence, P({0, 1, 2}) =
{null, {0}, {1}, {2}, {0, 1}, {0,2}, {1, 2}, {0, 1, 2}}.
advertisement

10. The members of the set S = {x | x is the square of an integer and x < 100} is
________________
a) {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
b) {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
c) {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
d) {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}
View Answer

Answer: b
Explanation: The set S consists of the square of an integer less than 10.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Types of Set
» Next - Discrete Mathematics Questions and Answers – Set Operations – 1
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Types of Set
Discrete Mathematics Questions and Answers – Set Operations – 1
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Arrays

2. Electromagnetic Theory Questions and Answers
3. Engineering Mechanics Questions and Answers
4. Python Programming Examples
 5. C Programming Examples on Combinatorial Problems & Algorithms
6. C Programming Examples on Graph Problems & Algorithms
7. C++ Programming Examples on Graph Problems & Algorithms
8. C Programming Examples on Mathematical Functions
9. Simple Java Programs
10. C# Programming Examples on Mathematics
11. Engineering Mathematics Questions and Answers
12. C Programming Examples using Recursion
13. C Programming Examples on Bitwise Operations
14. Simple C Programs
15. Discrete Mathematics Questions and Answers
16. Discrete Mathematics Questions and Answers – Strong Induction and Well-Ordering
17. Discrete Mathematics Questions and Answers – Number Theory – Primes and
Greatest Common Divisors
18. Discrete Mathematics Questions and Answers – Counting – Division of Objects
19. Discrete Mathematics Questions and Answers – Set Operations – 2
20. Discrete Mathematics Questions and Answers – Cyclic Groups

advertisement

Discrete Mathematics Questions and

Answers – Set Operations – 1
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Set Operations – 1”.

1. The union of the sets {1, 2, 5} and {1, 2, 6} is the set _______________
a) {1, 2, 6, 1}
b) {1, 2, 5, 6}
c) {1, 2, 1, 2}
d) {1, 5, 6, 3}
View Answer

Answer: b
Explanation: The union of the sets A and B, is the set that contains those elements that are
either in A or in B.
advertisement

2. The intersection of the sets {1, 2, 5} and {1, 2, 6} is the set _____________
a) {1, 2}
b) {5, 6}
c) {2, 5}
d) {1, 6}
View Answer
Answer: a
Explanation: The intersection of the sets A and B, is the set containing those elements that are
in both A and B.

3. Two sets are called disjoint if there _____________ is the empty set.
a) Union
b) Difference
c) Intersection
d) Complement
View Answer

Answer: c
Explanation: By the definition of the disjoint set.

4. Which of the following two sets are disjoint?

a) {1, 3, 5} and {1, 3, 6}
b) {1, 2, 3} and {1, 2, 3}
c) {1, 3, 5} and {2, 3, 4}
d) {1, 3, 5} and {2, 4, 6}
View Answer

Answer: d
Explanation: Two sets are disjoint if the intersection of two sets is the empty set.

5. The difference of {1, 2, 3} and {1, 2, 5} is the set ____________

a) {1}
b) {5}
c) {3}
d) {2}
View Answer

Answer: c
Explanation: The difference of the sets A and B denoted by A-B, is the set containing those
elements that are in A not in B.
advertisement

6. The complement of the set A is _____________

a) A – B
b) U – A
c) A – U
d) B – A
View Answer

Answer: b
Explanation: The complement of the set A is the complement of A with respect to U.

7. The bit string for the set {2, 4, 6, 8, 10} (with universal set of natural numbers less than or
equal to 10) is ____________________
a) 0101010101
b) 1010101010
c) 1010010101
d) 0010010101
View Answer

Answer: a
Explanation: The bit string for the set has a one bit in second, fourth, sixth, eighth, tenth
positions, and a zero elsewhere.

8. Let Ai = {i, i+1, i+2, …..}. Then set {n, n+1, n+2, n+3, …..} is the _________ of the set
Ai.
a) Union
b) Intersection
c) Set Difference
d) Disjoint
View Answer

Answer: b
Explanation: By the definition of the generalized intersection of the set.

9. The bit strings for the sets are 1111100000 and 1010101010. The union of these sets is
___________
a) 1010100000
b) 1010101101
c) 1111111100
d) 1111101010
View Answer

Answer: d
Explanation: The bit string for the union is the bitwise OR of the bit strings.

10. The set difference of the set A with null set is __________
a) A
b) null
c) U
d) B
View Answer

Answer: a
Explanation: The set difference of the set A by the null set denoted by A – {null} is A.
advertisement

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Sets
» Next - Discrete Mathematics Questions and Answers – Set Operations – 2
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Sets
Discrete Mathematics Questions and Answers – Set Operations – 2
advertisement
advertisement

Recommended Posts:

1. Bachelor of Computer Applications Questions and Answers

2. C++ Programming Examples on Data-Structures
3. Java Programming Examples on Utility Classes
4. C Programming Examples
5. C Programming Examples on Strings
6. C Programming Examples on Linked List
7. C Tutorials
8. Python Questions and Answers
9. Python Programming Examples
10. Java Programming Examples on String Handling
11. Python Programming Examples on Linked Lists
12. C# Programming Examples on Mathematics
13. Engineering Mathematics Questions and Answers
14. Automata Theory Questions and Answers
15. C# Programming Examples on Strings
16. Java Programming Examples on Arrays
17. C Programming Examples on Bitwise Operations
18. C Programming Examples on Arrays
19. C++ Programming Examples on STL
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Set Operations – 2
« Prev
Next »

This set of Discrete Mathematics Interview Questions and Answers focuses on “Set
Operations – 2”.

1. Let the set A is {1, 2, 3} and B is {2, 3, 4}. Then the number of elements in A U B is?
a) 4
b) 5
c) 6
d) 7
View Answer
Answer: a
Explanation: AUB is {1, 2, 3, 4}.
advertisement

2. Let the set A is {1, 2, 3} and B is { 2, 3, 4}. Then number of elements in A ∩ B is?
a) 1
b) 2
c) 3
d) 4
View Answer

Answer: b
Explanation: A ∩ B is {2, 3}.

3. Let the set A is {1, 2, 3} and B is {2, 3, 4}. Then the set A – B is?
a) {1, -4}
b) {1, 2, 3}
c) {1}
d) {2, 3}
View Answer

Answer: c
Explanation: In A – B the common elements get cancelled.

4. In which of the following sets A – B is equal to B – A?

a) A = {1, 2, 3}, B = {2, 3, 4}
b) A = {1, 2, 3}, B = {1, 2, 3, 4}
c) A = {1, 2, 3}, B = {2, 3, 1}
d) A = {1, 2, 3, 4, 5, 6}, B = {2, 3, 4, 5, 1}
View Answer

Answer: c
Explanation: A- B= B-A = Empty set.

5. Let A be set of all prime numbers, B be the set of all even prime numbers, C be the set of
all odd prime numbers, then which of the following is true?
a) A ≡ B U C
b) B is a singleton set.
c) A ≡ C U {2}
d) All of the mentioned
View Answer

Answer: d
Explanation: 2 is the only even prime number.
advertisement

6. If A has 4 elements B has 8 elements then the minimum and maximum number of elements
in A U B are ____________
a) 4, 8
b) 8, 12
c) 4, 12
d) None of the mentioned
View Answer

Answer: b
Explanation: Minimum would be when 4 elements are same as in 8, maximum would be
when all are distinct.

7. If A is {{Φ}, {Φ, {Φ}}}, then the power set of A has how many element?
a) 2
b) 4
c) 6
d) 8
View Answer

Answer: b
Explanation: The set A has got 2 elements so n(P(A))=4.

8. Two sets A and B contains a and b elements respectively. If power set of A contains 16
more elements than that of B, value of ‘b’ and ‘a’ are _______
a) 4, 5
b) 6, 7
c) 2, 3
d) None of the mentioned
View Answer

Answer: a
Explanation: 32-16=16, hence a=5, b=4.

9. Let A be {1, 2, 3, 4}, U be set of all natural numbers, then U-A’(complement of A) is

given by set.
a) {1, 2, 3, 4, 5, 6, ….}
b) {5, 6, 7, 8, 9, ……}
c) {1, 2, 3, 4}
d) All of the mentioned
View Answer

Answer: c
Explanation: U – A’ ≡ A.
advertisement

10. Which sets are not empty?

a) {x: x is a even prime greater than 3}
b) {x : x is a multiple of 2 and is odd}
c) {x: x is an even number and x+3 is even}
d) { x: x is a prime number less than 5 and is odd}
View Answer

Answer: d
Explanation: Because the set is {3}.
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Interviews, here is complete set of 1000+
Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Set Operations – 1
» Next - Discrete Mathematics Questions and Answers – Sets – Venn Diagram
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Set Operations – 1
Discrete Mathematics Questions and Answers – Sets – Venn Diagram
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Arrays

2. C++ Programming Examples on Combinatorial Problems & Algorithms
3. Master of Computer Applications Questions and Answers
4. Bachelor of Computer Applications Questions and Answers
5. C Programming Examples on Combinatorial Problems & Algorithms
6. Java Programming Examples on Combinatorial Problems & Algorithms
7. Simple C Programs
8. Java Programming Examples on Mathematical Functions
9. Python Programming Examples
10. Mechanical Operations Questions and Answers
11. C# Programming Examples on Arrays
12. C Programming Examples on Mathematical Functions
13. C Programming Examples using Recursion
14. Engineering Mathematics Questions and Answers
15. Java Programming Examples on Numerical Problems & Algorithms
16. C Programming Examples on Bitwise Operations
17. C Programming Examples on Numerical Problems & Algorithms
18. C++ Programming Examples on Numerical Problems & Algorithms
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Sets – Venn Diagram
« Prev
Next »
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Sets – Venn Diagram”.

1. The shaded area of figure is best described by?

a) A ∩ B
b) A U B
c) A
d) B
View Answer

Answer: a
Explanation: The region is A intersection B.
advertisement

2. The shaded area of figure is best described by?

a) A‘ (Complement of A)
b) A U B -B
c) A ∩ B
d) B
View Answer

Answer: b
Explanation: The region is complement of B.

3. If n(A)=20 and n(B)=30 and n(A U B) = 40 then n(A ∩ B) is?

a) 20
b) 30
c) 40
d) 10
View Answer

Answer: d
Explanation: n(A U B) = n(A) + n(B) – n(A ∩ B).
4. The shaded area of figure is best described by?

a) A‘ (Complement of A)
b) B – (A ∩ B) – (C ∩ B)
c) A ∩ C ∩ B
d) B’ (Complement of B)
View Answer

Answer: b
Explanation: The region is difference B with A and C.

5. The relation between sets A, B, C as shown by venn diagram is __________

a) A is subset of B and B is subset of C
b) C is not a subset of A and A is subset of B
c) C is subset of B and B is subset of A
d) None of the mentioned
View Answer

Answer: c
Explanation: As set C is totally inside set B, set B is totally inside set A.
advertisement

6. Let A: All badminton player are good sportsperson.

B: All person who plays cricket are good sportsperson.
Let X denotes set of all badminton players, Y of all cricket players, Z of all good
sportsperson. Then which of the following statements is correct?
a) Z contains both X and Y
b) Z contains X and Y is outside
c) X contains Y and Z
d) None of the mentioned
View Answer

Answer: a
Explanation: X and Y are subset of Z.

7. If n(A)=10, n(B)=30,n(C)=50 and if set A, B, C are pairwise disjoint then which of the
following is correct?
a) n(A U B)=0
b) n(B U C)=0
c) n(A U B U C)=90
d) All of the mentioned
View Answer
Answer: d
Explanation: All the statements are true based on definition.

8. In the given figure the if n(A)=20,n(U)=50,n(C)=10 and n(A∩B)=5 then n(B)=?

a) 35
b) 20
c) 30
d) 10
View Answer

Answer: a
Explanation: Here n(B)= n(U) – n(A) + n(A∩B).

9. Let the students who likes table tennis be 12, the ones who like lawn tennis 10, those who
like only table tennis are 6, then number of students who likes only lawn tennis are, assuming
there are total of 16 students.
a) 16
b) 8
c) 4
d) 10
View Answer

Answer: c
Explanation: The students who only plays lawn tennis will be a total lawn tennis player –
those who play both the sports.
advertisement

10. The shaded area of figure is best described by?

a) A‘ (Complement of A)
b) A U B – (A ∩ B)
c) A – B
d) B
View Answer

Answer: b
Explanation: The region is complement of( A intersection B).
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Set Operations – 2
» Next - Discrete Mathematics Questions and Answers – Algebraic Laws on Sets
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Set Operations – 2
Discrete Mathematics Questions and Answers – Algebraic Laws on Sets
advertisement
advertisement

Recommended Posts:

1. Digital Signal Processing Questions and Answers

2. Signals & Systems Questions and Answers
3. Information Science Questions and Answers
4. Computer Science Questions and Answers
5. Information Technology Questions and Answers
6. Biotechnology Questions and Answers
7. Master of Computer Applications Questions and Answers
8. Bachelor of Computer Applications Questions and Answers
9. Engineering Mathematics Questions and Answers
10. C# Programming Examples on Mathematics
11. Discrete Mathematics Questions and Answers
12. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic
Series
13. Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
14. Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
15. Discrete Mathematics Questions and Answers – Special Sequences
16. Discrete Mathematics Questions and Answers – Logic Circuits
17. Discrete Mathematics Questions and Answers – Isomorphism in Graphs
18. Discrete Mathematics Questions and Answers – Minimization of Boolean Functions
19. Discrete Mathematics Questions and Answers – Different Path in a Graph
20. Discrete Mathematics Questions and Answers – Domain and Range of Functions

advertisement

Discrete Mathematics Questions and

Answers – Algebraic Laws on Sets
« Prev
Next »
This set of Discrete Mathematics test focuses on “Algebraic Laws on Sets”.

1. Let C and D be two sets then which of the following statements are true?

i) C U D = D U C
ii) C ∩ D = D ∩ C
advertisement

a) Both of the statements

b) Only i statement
c) Only ii statement
d) None of the statements
View Answer

Answer: a
Explanation: Commutative laws hold good in sets.

2. If set C is {1, 2, 3, 4} and C – D = Φ then set D can be ___________

a) {1, 2, 4, 5}
b) {1, 2, 3}
c) {1, 2, 3, 4, 5}
d) None of the mentioned
View Answer

Answer: c
Explanation: C ∩ D should be equivalent to C for C – D = Φ.

3. Let C and D be two sets then C – D is equivalent to __________

a) C’ ∩ D
b) C‘∩ D’
c) C ∩ D’
d) None of the mentioned
View Answer

Answer: c
Explanation: Set C-D will be having those elements which are in C but not in D.

4. For two sets C and D the set (C – D) ∩ D will be __________

a) C
b) D
c) Φ
d) None of the mentioned
View Answer

Answer: c
Explanation: C-D ≡ C ∩ D’, D ∩ D’ ≡ Φ.
advertisement

5. Which of the following statement regarding sets is false?

a) A ∩ A = A
b) A U A = A
c) A – (B ∩ C) = (A – B) U (A –C)
d) (A U B)’ = A’ U B’
View Answer

Answer: d
Explanation: (A U B)’ = A’ ∩ B’.

6. Let C = {1,2,3,4} and D = {1, 2, 3, 4} then which of the following hold not true in this
case?
a) C – D = D – C
b) C U D = C ∩ D
c) C ∩ D = C – D
d) C – D = Φ
View Answer

Answer: c
Explanation: C ∩ D = {1, 2, 3, 4} ≠ Φ.

7. If C’ U (D ∩ E’) is equivalent to __________

a) (C ∩ (D U E))’
b) (C ∩( D∩ E’))’
c) (C ∩( D’ U E))’
d) (C U ( D ∩ E’)’
View Answer

Answer: c
Explanation: (C’)’≡ C, (C∩ D)’ ≡ C’ U D’.

8. Let Universal set U is {1, 2, 3, 4, 5, 6, 7, 8}, (Complement of A) A’ is {2, 5, 6, 7}, A ∩ B

is {1, 3, 4} then the set B’ will surely have of which of the element?
a) 8
b) 7
c) 1
d) 3
View Answer

Answer: a
Explanation: The set A is {1,3,4,8} and thus surely B does not have 8 in it. Since 8 does not
belong to A ∩ B. For other element like 7 we can’t be sure.
advertisement

9. Let a set be A then A ∩ φ and A U φ are __________

a) φ, φ
b) φ, A
c) A, φ
d)None of the mentioned
View Answer

Answer: b
Explanation: By Domination Laws on sets.
10. If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements
and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?
a) 8
b) 14
c) 22
d) 15
View Answer

Answer: a
Explanation: For minimum elements set B and C have 8 elements each and all of the
elements are same, Also set A should have 7 elements which are already present in B and C.
Thus A U B U C ≡ A ≡ B.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for tests, here is complete set of 1000+ Multiple
Choice Questions and Answers.

advertisement

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Sets – Venn Diagram
» Next - Discrete Mathematics Questions and Answers – Cartesian Product of Sets
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Sets – Venn Diagram
Discrete Mathematics Questions and Answers – Cartesian Product of Sets
advertisement
advertisement

Recommended Posts:

1. Information Technology Questions and Answers

2. Biotechnology Questions and Answers
3. Simple C Programs
4. C Programming Examples on Arrays
5. Master of Computer Applications Questions and Answers
6. Cyber Security Questions and Answers
7. Electric Circuits Questions and Answers
8. C# Programming Examples on Arrays
9. Terms of Service
10. Java Programming Examples on Collections
11. C# Programming Examples on Sorting
12. C Programming Examples without using Recursion
13. C# Programming Examples on Matrix
14. Python Programming Examples on Linked Lists
15. Bachelor of Computer Applications Questions and Answers
 16. C Programming Examples using Recursion
17. Simple Java Programs
18. C# Programming Examples on Mathematics
19. Engineering Mathematics Questions and Answers
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Cartesian Product of Sets
« Prev
Next »

This set of Discrete Mathematics Quiz focuses on “Cartesian Product of Sets”.

1. Let set A = {1, 2} and C be {3, 4} then A X B (Cartesian product of set A and B) is?
a) {1, 2, 3, 4}
b) {(1, 3),(2, 4)}
c) {(1, 3), (2, 4), (1, 4), (2, 3)}
d) {(3, 1), (4, 1)}
View Answer

Answer: c
Explanation: In set A X B : {(c , d) |c ∈ A and d ∈ B}.
advertisement

2. If set A has 4 elements and B has 3 elements then set n(A X B) is?
a) 12
b) 14
c) 24
d) 7
View Answer

Answer: a
Explanation: The total elements in n(A X B) = n(A) * n(B).

3. If set A has 3 elements then number of elements in A X A X A are __________

a) 9
b) 27
c) 6
d) 19
View Answer

Answer: b
Explanation: n(A X A X A) = n(A)* n(A)* n(A).
4. Which of the following statements regarding sets is false?
a) A X B = B X A
b) A X B ≠ B X A
c) n(A X B) = n(A) * n(B)
d) All of the mentioned
View Answer

Answer: a
Explanation: The Cartesian product of sets is not commutative.

5. If n(A X B) = n(B X A) = 36 then which of the following may hold true?

a) n(A)=2, n(B)=18
b) n(A)=9, n(B)=4
c) n(A)=6, n(b)=6
d) None of the mentioned
View Answer

Answer: c
Explanation: n(A) should be equal to n(B) for n(A X B) = n(B x A).
advertisement

6. If C = {1} then C X (C X C) = (C X C) X C the given statement is true or false.

a) True
b) False
View Answer

Answer: b
Explanation: The Cartesian product is not associative, (C × C) × C = { ((1, 1), 1) } ≠ { (1,(1,
1)) } = C × (C × C).

7. Let the sets be A, B, C, D then (A ∩ B) X (C ∩ D) is equivalent to __________

a) (A X C) ∩ (B X D)
b) (A X D) U (B X C)
c) (A X C) U ( B X D)
d) None of the mentioned
View Answer

Answer: a
Explanation: (A ∩ B) X (C ∩ D) = (A X C) ∩ (B X D) but in case of unions this is not true.

8. If A ⊆ B then A X C ⊆ B X C the given statement is true or false.

a) True
b) False
View Answer

Answer: a
Explanation: Let an arbitrary element x ∈ A and y ∈ C, then x ∈ B (subset property), (x,y) ∈
AX C also (x,y) ∈ B X C. This implies A X C ⊆ B X C.
9. If set A and B have 3 and 4 elements respectively then the number of subsets of set (A X
B) is?
a) 1024
b) 2048
c) 512
d) 4096
View Answer

Answer: d
Explanation: The A X B has 12 elements, then the number of the subset are 2 12 = 4096.
advertisement

10. If set A X B=B X A then which of the following sets may satisfy?
a) A={1, 2, 3}, B={1, 2, 3, 4}
b) A={1, 2}, B={2, 1}
c) A={1, 2, 3}, B={2, 3, 4}
d) None of the mentioned
View Answer

Answer: b
Explanation: For set A X B = B X A, this is possible only when set A = B.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Quizzes, here is complete set of 1000+
Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Algebraic Laws on Sets
» Next - Discrete Mathematics Questions and Answers – Subsets
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Algebraic Laws on Sets
Discrete Mathematics Questions and Answers – Subsets
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Hard Graph Problems & Algorithms

2. C Programming Examples on Hard Graph Problems & Algorithms
3. Information Science Questions and Answers
4. Computer Science Questions and Answers
5. Information Technology Questions and Answers
6. Biotechnology Questions and Answers
7. Engineering Mechanics Questions and Answers
8. Master of Computer Applications Questions and Answers
 9. Bachelor of Computer Applications Questions and Answers
10. C# Programming Examples on Mathematics
11. Engineering Mathematics Questions and Answers
12. Discrete Mathematics Questions and Answers
13. Discrete Mathematics Questions and Answers – Operations on Matrices
14. Discrete Mathematics Questions and Answers – Logic Circuits
15. Discrete Mathematics Questions and Answers – Types of Matrices
16. Discrete Mathematics Questions and Answers – Sequences and Summations
17. Python Questions and Answers – Sets – 5
18. Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and
Partitions
19. Discrete Mathematics Questions and Answers – Number of Functions
20. Discrete Mathematics Questions and Answers – Domain and Range of Functions

advertisement

Discrete Mathematics Questions and

Answers – Subsets
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Subsets”.

1. If a set contains 3 elements then the number of subsets is?

a) 6
b) 3
c) 12
d) 8
View Answer

Answer: d
Explanation: For elements with n elements the number of subsets are 2n.
advertisement

2. The set containing all the collection of subsets is known as _________

a) Subset
b) Power set
c) Union set
d) None of the mentioned
View Answer

Answer: b
Explanation: Power set contains all the subsets as its elements.

3. If a set is empty then number of subsets will be _________

a) 1
b) 2
c) 0
d) 4
View Answer

Answer: a
Explanation: The set has zero elements so 2o = 1.

4. If the number of subsets of a set are 4 then the number of elements in that sets are
_________
a) 1
b) 2
c) 3
d) 4
View Answer

Answer: b
Explanation: The number of elements be x then x2 = 4 thus x=2.

5. The number of subsets of a set is 5.

a) True
b) False
View Answer

Answer: b
Explanation: The number of subsets will always be a power of 2.
advertisement

6. The number of subsets of a set can be odd or even.

a) True
b) False
View Answer

Answer: a
Explanation: The number of subsets will be odd in case of empty set otherwise even.

7. Let a set be A={1, 2, 3} then the number of subsets containing two elements will be
_________
a) 4
b) 3
c) 5
d) 8
View Answer

Answer: b
Explanation: The subsets will be {1, 2}, {2, 3}, {1, 3}.

8. Let the set be A= {a, b, c, {a,b}} then which of the following is false?
a) {a, b} Є A
b) a Є A
c) {a} Є A
d) b, c ЄA
View Answer

Answer: c
Explanation: Only elements belongs to a set, {a} is a subset of this set.

9. If A={1, 2, 3, 4}, then the number of the subsets of A that contain the element 2 but not 3,
is?
a) 16
b) 4
c) 8
d) 24
View Answer

Answer: b
Explanation: The subsets would be {1, 2, 4},{1, 2}, {2, 3}, {2}.
advertisement

10. Let A(1), A(2), A(3),…….., A(100) be 100 sets such that number of elements in A(i)=i+1
and A(1) is subset of A(2), A(2)is subset of A(3),….., A(99) is subset of A(100). The number
of elements in union of the all the sets are: n(A(1) U A(2) U A(3) …..U A(100)).
a) 99
b) 100
c) 101
d) 102
View Answer

Answer: c
Explanation: Since all sets are subsets of A(100) therefore in union only elements of
A(100)will come.A(100) contains 101 elements.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Cartesian Product of Sets
» Next - Discrete Mathematics Questions and Answers – Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Cartesian Product of Sets
Discrete Mathematics Questions and Answers – Functions
advertisement
advertisement

Recommended Posts:
 1. C Programming Examples on Hard Graph Problems & Algorithms
2. Simple C Programs
3. Python Programming Examples
4. Python Programming Examples on Linked Lists
5. Computer Science Questions and Answers
6. Information Science Questions and Answers
7. Information Technology Questions and Answers
8. C Programming Examples on Arrays
9. Biotechnology Questions and Answers
10. Java Programming Examples on Arrays
11. Master of Computer Applications Questions and Answers
12. Bachelor of Computer Applications Questions and Answers
13. Engineering Mathematics Questions and Answers
14. C Programming Examples on Combinatorial Problems & Algorithms
15. C++ Programming Examples on Combinatorial Problems & Algorithms
16. C# Programming Examples on Mathematics
17. Java Programming Examples on Combinatorial Problems & Algorithms
18. Home
19. Discrete Mathematics Questions and Answers
20. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series

advertisement

Discrete Mathematics Questions and

Answers – Functions
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Functions”.

1. A function is said to be ______________ if and only if f(a) = f(b) implies that a = b for all
a and b in the domain of f.
a) One-to-many
b) One-to-one
c) Many-to-many
d) Many-to-one
View Answer

Answer: b
Explanation: A function is one-to-one if and only if f(a)≠f(b) whenever a≠b.
advertisement

2. The function f(x)=x+1 from the set of integers to itself is onto. Is it True or False?
a) True
b) False
View Answer
Answer: a
Explanation: For every integer “y” there is an integer “x ” such that f(x) = y.

3. The value of ⌊1/2.⌊5/2⌋ ⌋ is ______________

a) 1
b) 2
c) 3
d) 0.5
View Answer

Answer: a
Explanation: The value of ⌊5/2⌋ is 2 so, the value of ⌊1/2.2⌋ is 1.

4. Which of the following function f: Z X Z → Z is not onto?

a) f(a, b) = a + b
b) f(a, b) = a
c) f(a, b) = |b|
d) f(a, b) = a – b
View Answer

Answer: c
Explanation: The function is not onto as f(a)≠b.

5. The domain of the function that assign to each pair of integers the maximum of these two
integers is ___________
a) N
b) Z
c) Z +
d) Z+ X Z+
View Answer

Answer: d
Explanation: The domain of the integers is Z+ X Z+.
advertisement

6. Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and
g(x) = 3x + 4. Then the composition of f and g is ____________
a) 6x + 9
b) 6x + 7
c) 6x + 6
d) 6x + 8
View Answer

Answer: a
Explanation: The composition of f and g is given by f(g(x)) which is equal to 2(3x + 4) + 1.

7. __________ bytes are required to encode 2000 bits of data.

a) 1
b) 2
c) 3
d) 8
View Answer

Answer: b
Explanation: Two bytes are required to encode 2000 (actually with 2 bytes you can encode up
to and including 65,535.

8. The inverse of function f(x) = x3 + 2 is ____________

a) f -1 (y) = (y – 2) 1/2
b) f -1 (y) = (y – 2) 1/3
c) f -1 (y) = (y) 1/3
d) f -1 (y) = (y – 2)
View Answer

Answer: b
Explanation: To find the inverse of the function equate f(x) then find the value of x in terms
of y such that f -1 (y) = x.

9. The function f(x) = x3 is bijection from R to R. Is it True or False?

a) True
b) False
View Answer

Answer: a
Explanation: The function f(x) = x3 is one to one as no two values in domain are assigned the
same value of the function and it is onto as all R of the co domain is images of elements in
the domain.
advertisement

10. The g -1({0}) for the function g(x)= ⌊x⌋ is ___________

a) {x | 0 ≤ x < 1}
b) {x | 0 < x ≤ 1}
c) {x | 0 < x < 1}
d) {x | 0 ≤ x ≤ 1}
View Answer

Answer: d
Explanation: g({0}) for the function g(x) is {x | 0 ≤ x ≤ 1}. Put g(x) = y and find the value of
x in terms of y such that ⌊x⌋ = y.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Subsets
» Next - Discrete Mathematics Questions and Answers – The Growth of Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Subsets
Discrete Mathematics Questions and Answers – The Growth of Functions
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Bitwise Operations

2. Master of Computer Applications Questions and Answers
3. Electric Circuits Questions and Answers
4. C Programming Examples using Recursion
5. Network Theory Questions and Answers
6. Bachelor of Computer Applications Questions and Answers
7. Control Systems Questions and Answers
8. C Programming Examples on Numerical Problems & Algorithms
9. Digital Image Processing Questions and Answers
10. C++ Programming Examples on Numerical Problems & Algorithms
11. Simple C Programs
12. Java Programming Examples on Numerical Problems & Algorithms
13. C# Programming Examples on Mathematics
14. C# Programming Examples on Functions
15. Java Programming Examples on Mathematical Functions
16. Digital Signal Processing Questions and Answers
17. Signals & Systems Questions and Answers
18. Engineering Mathematics Questions and Answers
19. C Programming Examples on Mathematical Functions
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – The Growth of Functions
« Prev
Next »

This set of Discrete Mathematics Multiple Choice s & Answers (MCQs) focuses on “Growth
of Functions”.

1. If f(x) = (x3 – 1) / (3x + 1) then f(x) is?

a) O(x2)
b) O(x)
c) O(x2 / 3)
d) O(1)
View Answer
Answer: a
Explanation: 0 < (x3 – 1) / (3x + 1) < x2.
advertisement

2. If f(x) = 3x2 + x3logx, then f(x) is?

a) O(x2)
b) O(x3)
c) O(x)
d) O(1)
View Answer

Answer: b
Explanation: 0 < 3x2 < x3, it follows that 0 < 3x2 + x3logx < x3. Consequently, f(x) = O(x3).

3. The big-O notation for f(n) = (nlogn + n2)(n3 + 2) is?

a) O(n2)
b) O(3n)
c) O(n4)
d) O(n5)
View Answer

Answer: d
Explanation: 0 < n3 + 2 < n3, it follows that (nlogn + n2)(n3 + 2) is less than equal to n5.

4. The big-theta notation for function f(n) = 2n3 + n – 1 is?

a) n
b) n2
c) n3
d) n4
View Answer

Answer: c
Explanation: 2n3 + n – 1 is less than equal to n3.

5. The big-theta notation for f(n) = nlog(n2 + 1) + n2logn is?

a) n2logn
b) n2
c) logn
d) nlog(n2)
View Answer

Answer: a
Explanation: n2logn < n3, it follows that nlog(n2 + 1) + n2logn is less than n3 and greater than
n2logn.
advertisement

5. The big-omega notation for f(x, y) = x5y3 + x4y4 + x3y5 is?

a) x5y3
b) x5y5
c) x3y3
d) x4y4
View Answer

Answer: c
Explanation: x5y3, x4y4 and x3y5 is greater than or equal to x3y3.

6. If f1(x) is O(g(x)) and f2(x) is o(g(x)), then f1(x) + f2(x) is?

a) O(g(x))
b) o(g(x))
c) O(g(x)) + o(g(x))
d) None of the mentioned
View Answer

Answer: a
Explanation: f2(x) is less than O(g(x)). So, f1(x) + f2(x) upper bound is O(g(x)).

7. The little-o notation for f(x) = xlogx is?

a) x
b) x3
c) x2
d) xlogx
View Answer

Answer: c
Explanation: Find the limit for xlogx / x2 as x tends to infinity.

8. The big-O notation for f(n) = 2log(n!) + (n2 + 1)logn is?

a) n
b) n2
c) nlogn
d) n2logn
View Answer

Answer: d
Explanation: log(n!) < n2logn, it follows that 2log(n!) + (n2 + 1)logn is less than or equal
n2logn.
advertisement

9. The big-O notation for f(x) = 5logx is?

a) 1
b) x
c) x2
d) x3
View Answer

Answer: b
Explanation: logx < x, it follows that 5logx < x.

10. The big-Omega notation for f(x) = 2x4 + x2 – 4 is?

a) x2
b) x3
c) x
d) x4
View Answer

Answer: d
Explanation: 2x4 + x2 – 4 is greater than or equal to x4.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

advertisement

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Functions
» Next - Discrete Mathematics Questions and Answers – Domain and Range of Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Functions
Discrete Mathematics Questions and Answers – Domain and Range of Functions
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on Conversions

2. C# Programming Examples on Functions
3. C# Programming Examples on Mathematics
4. C Programming Examples on Mathematical Functions
5. Engineering Mathematics Questions and Answers
6. Java Programming Examples on Mathematical Functions
7. Discrete Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples
9. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic
Series
10. Discrete Mathematics Questions and Answers – Number Theory and Cryptography –
Rules of Exponents
11. Discrete Mathematics Questions and Answers – Sets
12. Discrete Mathematics Questions and Answers – Floor and Ceiling Function
13. Discrete Mathematics Questions and Answers – Set Operations – 2
14. Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
15. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
16. Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
17. Discrete Mathematics Questions and Answers – Types of Relations
 18. Discrete Mathematics Questions and Answers – Trees – Interconversion for Prefix
Postfix Infix Notations
19. Discrete Mathematics Questions and Answers – Harmonic Sequences
20. Discrete Mathematics Questions and Answers – Domain and Range of Functions

advertisement

Discrete Mathematics Questions and

Answers – Domain and Range of Functions
« Prev
Next »

This set of Discrete Mathematics MCQs focuses on “Domain and Range of Functions”.

1. What is the domain of a function?

a) the maximal set of numbers for which a function is defined
b) the maximal set of numbers which a function can take values
c) it is a set of natural numbers for which a function is defined
d) none of the mentioned
View Answer

Answer: a
Explanation: Domain is the set of all the numbers on which a function is defined. It may be
real as well.
advertisement

2. What is domain of function f(x)= x1/2?

a) (2, ∞)
b) (-∞, 1)
c) [0, ∞)
d) None of the mentioned
View Answer

Answer: c
Explanation: A square root function is not defined for negative real numbers.

3. What is the range of a function?

a) the maximal set of numbers for which a function is defined
b) the maximal set of numbers which a function can take values
c) it is set of natural numbers for which a function is defined
d) none of the mentioned
View Answer

Answer: b
Explanation: Range is the set of all values which a function may take.
4. What is domain of function f(x) = x-1 for it to be defined everywhere on domain?
a) (2, ∞)
b) (-∞, ∞) – {0}
c) [0, ∞)
d) None of the mentioned
View Answer

Answer: b
Explanation: Function x-1 is not defined for x=0, otherwise it defined for every real number.

5. The range of function f(x) = sin(x) is (-∞, ∞).

a) True
b) False
View Answer

Answer: b
Explanation: A sine function takes values between -1 and 1,thus range is [-1, 1].
advertisement

6. Codomain is the subset of range.

a) True
b) False
View Answer

Answer: b
Explanation: Range is the subset of codomain, that is every value in the range is in codomain
but vice-versa it is not true.

7. What is range of function f(x) = x-1 which is defined everywhere on its domain?
a) (-∞, ∞)
b) (-∞, ∞) – {0}
c) [0, ∞)
d) None of the mentioned
View Answer

Answer: a
Explanation: Function x-1 may take any real number hence it’s range is all real numbers.

8. If f(x) = 2x then range of the function is?

a) (-∞, ∞)
b) (-∞, ∞) – {0}
c) (0, ∞)
d) None of the mentioned
View Answer

Answer: c
Explanation: The function cannot take negative values,hence range is (0, ∞).

9. If f(x) = x2 + 4 then range of f(x) is given by?

a) [4, ∞)
b) (-∞, ∞) – {0}
c) (0, ∞)
d) None of the mentioned
View Answer

Answer: a
Explanation: Since minimum value of x2 is 0, thus x2 +4 may take any value between [4,∞).
advertisement

10. Let f(x)=sin2(x) + log(x) then domain of f(x) is (-∞, ∞).

a) True
b) False
View Answer

Answer: b
Explanation: Domain is (0, ∞), since log(x) is not defined for negative numbers and zero.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice MCQs on all areas of Discrete Mathematics, here is complete set of 1000+
Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – The Growth of Functions
» Next - Discrete Mathematics Questions and Answers – Number of Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – The Growth of Functions
Discrete Mathematics Questions and Answers – Number of Functions
advertisement
advertisement

Recommended Posts:

1. Python Programming Examples

2. Bachelor of Computer Applications Questions and Answers
3. C Programming Examples on Searching and Sorting
4. C# Programming Examples on Arrays
5. Digital Image Processing Questions and Answers
6. Simple Java Programs
7. C# Basic Programming Examples
8. C# Programming Examples
9. C Programming Examples on Numerical Problems & Algorithms
10. C++ Programming Examples on Numerical Problems & Algorithms
11. Java Programming Examples on Numerical Problems & Algorithms
12. Digital Signal Processing Questions and Answers
13. Signals & Systems Questions and Answers
 14. Simple C Programs
15. Engineering Mathematics Questions and Answers
16. C# Programming Examples on Functions
17. Java Programming Examples on Mathematical Functions
18. C Programming Examples on Mathematical Functions
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number of Functions
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Number of Functions”.

1. An injection is a function which is?

a) many-one
b) one-one
c) onto
d) none of the mentioned
View Answer

Answer: b
Explanation: One-One functions are also known as injection.
advertisement

2. A mapping f : X → Y is one one if __________

a) f(x1) ≠ f(x2) for all x1, x2 in X
b) If f(x1) = f(x2) then x1 = x2 for all x1, x2 in X
c) f(x1) = f(x2) for all x1, x2 in X
d) None of the mentioned
View Answer

Answer: b
Explanation: In one one function every element in A should have unique image in B,thus if
two image are equal this means there preimages are same.

3. A function is defined by mapping f : A → B such that A contains m elements and B

contains n elements and m ≤ n then number of one one functions are _________
a) nCm x m!
b) nCm x n!
c) 0
d) none of the mentioned
View Answer
Answer: a
Explanation: From n elements in B we need to select m elements and then arrange them in all
ways, thus answer=nCm x m!.

4. A function is defined by mapping f : A -> B such that A contains m elements and B

contains n elements and m>n then number of one one functions are ________
a) nCm x m!
b) nCm x n!
c) 0
d) none of the mentioned
View Answer

Answer: c
Explanation: Since for function to be defined every element should have a image, since m > n
atleast one element need to have same image, thus we can’t form any unique images and
hence the number of one one function are zero.

5. For an onto function range is equivalent to codomain.

a) True
b) False
View Answer

Answer: a
Explanation: Since in onto function every image should have preimage thus all the elements
in codomain should have preimages.
advertisement

6. Onto function are known as injection.

a) True
b) False
View Answer

Answer: b
Explanation: Onto functions are known as surjection.

7. Set A has 3 elements and set B has 4 elements then number of injections defined from A to
B are?
a) 12
b) 24
c) 36
d) 48
View Answer

Answer: b
Explanation:Injections will be 4C3 x 3!=24.

8. A function is defined by mapping f : A → B such that A contains m elements and B

contains n elements and 1≤n≤m then number of onto functions are ________
a) r=1∑r=n nCr (-1)n-r rm
b) r=1∑r=n nCr (-1)n-r rn
c) r=1∑r=n nCr (-1)m-r rn
d) None of the mentioned
View Answer

Answer: a
Explanation: The number of onto function is equal tpo the coffecient of xm in m!(ex – 1)n.

9. A function is defined by mapping f:A→B such that A contains m elements and B contains
n elements and m > n then number of bijections are ________
a) nCm x m!
b) nCm x n!
c) 0
d) none of the mentioned
View Answer

Answer: c
Explanation: Since we can’t define any one one function in such case so number of
bujections will be zero.
advertisement

10. A bijection is a function which is many-one and onto.

a) True
b) False
View Answer

Answer: b
Explanation: A bijection is a function which is one-one(injection) and onto(surjection).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Domain and Range of Functions
» Next - Discrete Mathematics Questions and Answers – Floor and Ceiling Function
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Domain and Range of Functions
Discrete Mathematics Questions and Answers – Floor and Ceiling Function
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Linked List

2. Java Programming Examples on Arrays
 3. VHDL Questions and Answers
4. C Programming Examples on Searching and Sorting
5. Network Theory Questions and Answers
6. IC Engine Questions and Answers
7. C Programming Examples on Arrays
8. CSS Questions and Answers
9. Digital Image Processing Questions and Answers
10. SQL Server Questions and Answers
11. C# Programming Examples on Arrays
12. C Programming Examples
13. C# Programming Examples
14. Python Questions and Answers
15. C# Programming Examples on Mathematics
16. C Programming Examples on Mathematical Functions
17. Java Programming Examples on Mathematical Functions
18. Engineering Mathematics Questions and Answers
19. C# Programming Examples on Functions
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Floor and Ceiling Function
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Floor and Ceiling Function”.

1. A floor function map a real number to ___________

a) smallest previous integer
b) greatest previous integer
c) smallest following integer
d) none of the mentioned
View Answer

Answer: b
Explanation: Floor function f(x) is the largest integer not greater than x.
advertisement

2. A ceil function map a real number to __________

a) smallest previous integer
b) greatest previous integer
c) smallest following integer
d) none of the mentioned
View Answer
Answer: c
Explanation: Ceil function f(x) is the smallest integer not less than x.

3. A function f(x) is defined as f(x) = x – [x], where [.] represents GIF then __________
a) f(x) will be intergral part of x
b) f(x) will be fractional part of x
c) f(x) will always be 0
d) none of the mentioned
View Answer

Answer: b
Explanation: A integral part of a number is subtracted from that number we are left with the
fractional part of that number.

4. Floor(2.4) + Ceil(2.9) is equal to __________

a) 4
b) 6
c) 5
d) none of the mentioned
View Answer

Answer: c
Explanation: Floor(2.4) = 2, Ceil(2.9) = 3, 2 + 3 = 5.

5. For some integer n such that x < n < x + 1, ceil(x) < n.

a) True
b) False
View Answer

Answer: b
Explanation: If x < n < x + 1 then ceil(x) = n.
advertisement

6. For some number x, Floor(x) <= x <= Ceil(x).

a) True
b) False
View Answer

Answer: a
Explanation: Floor function f(x) is the largest integer not greater than x and ceil function f(x)
is the smallest integer not less than x.

7. If x, and y are positive numbers both are less than one, then maximum value of floor(x + y)
is?
a) 0
b) 1
c) 2
d) -1
View Answer
Answer: b
Explanation: Since x < 1 and y < 1 this implies x + y < 2 which means maximium value of
floor(x + y) is 1.

8. If x, and y are positive numbers both are less than one, then maximum value of ceil(x + y)
is?
a) 0
b) 1
c) 2
d) -1
View Answer

Answer: c
Explanation: Since x < 1 and y < 1 this implies x + y < 2 which means maximum value of
ceil(x + y) is 2.

9. If X = Floor(X) = Ceil(X) then __________

a) X is a fractional number
b) X is a Integer
c) X is less than 1
d) none of the mentioned
View Answer

Answer: b
Explanation: Only in case of integers X = Floor(X) = Ceil(X) holds good.
advertisement

10. Let n be some integer greater than 1,then floor((n-1)/n) is 1.

a) True
b) False
View Answer

Answer: b
Explanation: Since (n-1)/n will always be less than one thus f floor((n-1)/n) is 0.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number of Functions
» Next - Discrete Mathematics Questions and Answers – Inverse of a Function
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number of Functions
Discrete Mathematics Questions and Answers – Inverse of a Function
 advertisement
advertisement

Recommended Posts:

1. Python Programming Examples on Trees

2. C++ Programming Examples on Combinatorial Problems & Algorithms
3. Python Programming Examples
4. Java Programming Examples on Combinatorial Problems & Algorithms
5. C Programming Examples on Combinatorial Problems & Algorithms
6. Simple C Programs
7. Python Programming Examples on Searching and Sorting
8. C Programming Examples using Recursion
9. C++ Programming Examples on Numerical Problems & Algorithms
10. Java Programming Examples on Numerical Problems & Algorithms
11. C Programming Examples on Numerical Problems & Algorithms
12. C# Programming Examples on Sorting
13. Java Programming Examples on Arrays
14. C Programming Examples on Strings
15. C Programming Examples on Arrays
16. Engineering Mathematics Questions and Answers
17. C Programming Examples on Searching and Sorting
18. C Programming Examples on Bitwise Operations
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Inverse of a Function
« Prev
Next »

This set of Discrete Mathematics Questions and Answers for Entrance exams focuses on
“Inverse of a Function”.

1. For an inverse to exist it is necessary that a function should be __________

a) injection
b) bijection
c) surjection
d) none of the mentioned
View Answer

Answer: b
Explanation: Inverse exist only for those functions which are one one and onto.
advertisement
2. If f(x) = y then f-1(y) is equal to __________
a) y
b) x
c) x2
d) none of the mentioned
View Answer

Answer: b
Explanation: On giving inverse, image the function returns preimage thus f-1 (y) = x.

3. A function f(x) is defined from A to B then f -1 is defined __________

a) from A to B
b) from B to A
c) depends on the inverse of function
d) none of the mentioned
View Answer

Answer: b
Explanation: Inverse associate each element in B with corresponding element in A.

4. If f is a function defined from R to R, is given by f(x) = 3x – 5 then f –1(x) is given by

__________
a) 1/(3x-5)
b) (x+5)/3
c) does not exist since it is not a bijection
d) none of the mentioned
View Answer

Answer: b
Explanation: y = 3x-5, x = (y+5)/3, f -1(x) = (x+5)/3.

5. For some bijective function inverse of that function is not bijective.

a) True
b) False
View Answer

Answer: b
Explanation: If f(x) is a bijection than f -1(x) is also a bijection.
advertisement

6. f(x) is a bijection than f -1(x) is a mirror image of f(x) around y = x.

a) True
b) False
View Answer

Answer: a
Explanation: Inverse of a function is the mirror image of function in line y = x.

7. If f is a function defined from R to R, is given by f(x) = x2 then f -1(x) is given by?

a) 1/(3x-5)
b) (x+5)/3
c) does not exist since it is not a bijection
d) none of the mentioned
View Answer

Answer: c
Explanation: It is not a one one function hence Inverse does not exist.

8. For any function fof -1(x) is equal to?

a) x
b) 1
c) x2
d) none of the mentioned
View Answer

Answer: a
Explanation:Compostion of a function with its inverse gives x.

9. The solution to f(x) = f -1(x) are __________

a) no solutions in any case
b) same as solution to f(x) = x
c) infinite number of solution for every case
d) none of the mentioned
View Answer

Answer: b
Explanation: Inverse of a function is the mirror image of function in line y = x.
advertisement

10. Let f(x) = x then number of solution to f(x) = f -1(x) is zero.

a) True
b) False
View Answer

Answer: b
Explanation: Since inverse of a function is the mirror image of function in line y = x,
therefore in this case infinte solution will exist.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Entrance exams, here is complete set of
1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Floor and Ceiling Function
» Next - Discrete Mathematics Questions and Answers – Arithmetic Sequences
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Floor and Ceiling Function
Discrete Mathematics Questions and Answers – Arithmetic Sequences
advertisement
advertisement

Recommended Posts:

1. Network Theory Questions and Answers

2. Digital Image Processing Questions and Answers
3. Numerical Methods Questions and Answers
4. Python Programming Examples on Trees
5. C# Programming Examples on Mathematics
6. C Programming Examples on Trees
7. Engineering Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers – Discrete Probability – Generating
Functions
10. Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples
11. Digital Signal Processing Questions and Answers – FIR Least Squares Inverse Filters
12. Discrete Mathematics Questions and Answers – Groups – Subgroups
13. Digital Signal Processing Questions and Answers – Inverse Systems and
Deconvolution
14. Discrete Mathematics Questions and Answers – Applications of Number Theory
15. Discrete Mathematics Questions and Answers – Permutation Groups
16. Discrete Mathematics Questions and Answers – Number Theory and Cryptography –
Rules of Exponents
17. Discrete Mathematics Questions and Answers – Groups – Cosets
18. Discrete Mathematics Questions and Answers – Groups – Closure and Associativity
19. Discrete Mathematics Questions and Answers – Group Axioms
20. Discrete Mathematics Questions and Answers – Properties of Matrices

advertisement

Discrete Mathematics Questions and

Answers – Arithmetic Sequences
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Arithmetic Sequences”.

1. Let the sequence be 1, 3, 5, 7, 9……… then this sequence is ____________

a) An arithmetic sequence
b) A geometric progression
c) A harmonic sequence
d) None of the mentioned
View Answer

Answer: a
Explanation: The difference in any term with the previous term is same.
advertisement

2. In the given AP series find the number of terms?

5, 8, 11, 14, 17, 20.........50.

a) 11
b) 13
c) 15
d) None of the mentioned
View Answer

Answer: d
Explanation: nth term = first_term + (number_of_terms – 1)common_differnce., 50 = 5 + (n-
1)3, n=16.

3. In the given AP series the term at position 11 would be?

5, 8, 11, 14, 17, 20.........50.

a) 35
b) 45
c) 25
d) None of the mentioned
View Answer

Answer: a
Explanation: nth term = a + (n – 1)d, nth term = 5+(11-1)3 = 35.
advertisement

4. For the given Arithmetic progression find the position of first negative term?

50, 47, 44, 41,............

a) 17
b) 20
c) 18
d) None of the mentioned
View Answer

Answer: c
Explanation: Let nth term=0, the next term would be first negative term.
0 = 50 + (n-1) – 3, n = 17.66.. therfore at n = 18 the first negative term would occur.

5. For the given Arithmetic progression find the first negative term?
50, 47, 44, 41,............

a) -1
b) -2
c) -3
d) None of the mentioned
View Answer

Answer: a
Explanation: Let nth term = 0, the next term would be first negative term.
0 = 50 +(n-1)- 3, n = 17.66.. therfore at n=18 the first negative term would occur. Nth term =
50 + (18-1) – 3 = -1.
advertisement

6. A series can either be AP only or GP only or HP only but not all at the same time.
a) True
b) False
View Answer

Answer: b
Explanation: 1, 1, 1, 1, 1…….. is AP, GP and HP series.

7. In the given Arithmetic progression, ’25’ would be a term in it.

5, 8, 11, 14, 17, 20.........50.

a) True
b) False
View Answer

Answer: b
Explanation: nth term = a + (n-1)d, 25 = 5 + (n-1)3, n = 23/3, n = 7.666 not an integer. Thus
25 is not a term in this series.

8. Which of the following sequeces in AP will have common difference 3, where n is an

Integer?
a) an = 2n2 + 3n
b) an = 2n2 + 3
c) an = 3n2 + 3n
d) an = 5 + 3n
View Answer

Answer: d
Explanation: an = 5 + 3n it is a linear expression with coefficient of as 3. So it is AP with
common difference 3.
advertisement

9. If a, b, c are in AP then relation between a, b, c can be _________

a) 2b = 2a + 3c
b) 2a = b + c
c) 2b = a + c
d) 2c = a + c
View Answer

Answer: c
Explanation: The term b should be the airthmetic mean of of term a and c.

10. Let the sum of the 3 consecutive terms in AP be 180 then midlle of those 3 terms would
be ________
a) 60
b) 80
c) 90
d) 179
View Answer

Answer: a
Explanation: Let a1, b1, c1 be three terms, then a1 + b1 + c1 = 180, a1 + c1 = 2b1(A M
property), 3b1 = 180, b1=60.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Inverse of a Function
» Next - Discrete Mathematics Questions and Answers – Geometric Sequences
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Inverse of a Function
Discrete Mathematics Questions and Answers – Geometric Sequences
advertisement
advertisement

Recommended Posts:

1. Terms of Service
2. Simple Java Programs
3. Engineering Mathematics Questions and Answers
4. C Programming Examples on Mathematical Functions
5. C# Programming Examples on Mathematics
6. Discrete Mathematics Questions and Answers
7. C++ Program to Demonstrate the Use of Arithmetic Operators
8. Java Program to implement Longest Arithmetic Progression Algorithm
9. Discrete Mathematics Questions and Answers – Counting – Division of Objects
10. Discrete Mathematics Questions and Answers – Advanced Counting Techniques –
Recurrence Relation
11. Discrete Mathematics Questions and Answers – Cardinality of Sets
 12. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial
Expansion
13. Discrete Mathematics Questions and Answers – Boolean Algebra
14. Java Program to Find the Longest Subsequence Common to All Sequences in a Set of
Sequences
15. How Pointer Arithmetic on Structures Differs from Pointer Arithmetic on Arrays in C
Programming
16. Discrete Mathematics Questions and Answers – Domain and Range of Functions
17. Discrete Mathematics Questions and Answers – Logics and Proofs – De-Morgan’s
Laws
18. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
19. Length of the Longest Arithmetic Progression Problem – Dynamic Programming
Solutions
20. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series

advertisement

Discrete Mathematics Questions and

Answers – Geometric Sequences
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Geometric Sequences”.

1. Let the sequence be 2, 8, 32, 128,……… then this sequence is _______________

a) An arithmetic sequence
b) A geometic progression
c) A harmonic sequence
d) None of the mentioned
View Answer

Answer: b
Explanation: The ratio of any term with previous term is same.
advertisement

2. In the given Geometric progression find the number of terms.

32, 256, 2048, 16384,.........,250.

a) 11
b) 13
c) 15
d) None of the mentioned
View Answer

Answer: d
Explanation: nth term = first term(ration – 1)., 250 = 25(23(n-1)), n=15. This implies 16th term.
3. In the given Geometric progression the term at position 11 would be ___________

32, 256, 2048, 16384,.........,250.

a) 235
b) 245
c) 35
d) None of the mentioned
View Answer

Answer: a
Explanation: nth term = first term(ration – 1)., gn = 25(23(n-1)), n=11. This implies 235.
advertisement

4. For the given Geometric progression find the position of first fractional term?

250, 247, 244,.........

a) 17
b) 20
c) 18
d) None of the mentioned
View Answer

Answer: c
Explanation: Let nth term=1, the next term would be first fractional term.
Gn = 1 = 250(23(-n+1)), n=17.66.. therfore at n = 18 the first fractional term would occur.

5. For the given geometric progression find the first fractional term?

250, 247, 244,.........

a) 2-1
b) 2-2
c) 2-3
d) None of the mentioned
View Answer

Answer: a
Explanation: Let nth term=1, the next term would be first fractional term.
Gn = 1 = 250( 2 3(-n+1)), n=17.66. Therefore at n=18 the first fractional term would occur. Gn =
250( 2 3(-n+1)), G18 = 2-1.

6. State whether the given statement is true or false.

1, 1, 1, 1, 1........ is a GP series.
advertisement

a) True
b) False
View Answer
Answer: a
Explanation: The ratio of any term with previous term is same.

7. In the given Geometric progression, ‘225‘ would be a term in it.

32, 256, 2048, 16384,.........,250.

a) True
b) False
View Answer

Answer: b
Explanation: nth term = first term(ration – 1)., gn = 225 = 25 (2 3(n-1)), n=23/3, n=7.666 not an
integer. Thus 225 is not a term in this series.

8. Which of the following sequeces in GP will have common ratio 3, where n is an Integer?
a) gn = 2n2 + 3n
b) gn = 2n2 + 3
c) gn = 3n2 + 3n
d) gn = 6(3n-1)
View Answer

Answer: d
Explanation: gn = 6( 3n-1) it is a geometric expression with coefficient of constant as 3n-1.So it
is GP with common ratio 3.

9. If a, b, c are in GP then relation between a, b, c can be ___________

a) 2b = 2a + 3c
b) 2a = b+c
c) b =(ac)1/2
d) 2c = a + c
View Answer

Answer: c
Explanation: The term b should be the geometric mean of of term a and c.
advertisement

10. Let the multiplication of the 3 consecutive terms in GP be 8 then midlle of those 3 terms
would be _______
a) 2
b) 3
c) 4
d) 179
View Answer

Answer: a
Explanation: Let a, b, c be three terms, then a/r * a * ar = 8, b = (ac)1/2 (G M property), b3 = 8,
b = 2.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Arithmetic Sequences
» Next - Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Arithmetic Sequences
Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
advertisement
advertisement

Recommended Posts:

1. Engineering Mathematics Questions and Answers

2. Terms of Service
3. C# Programming Examples on Mathematics
4. C Programming Examples on Mathematical Functions
5. Discrete Mathematics Questions and Answers
6. Discrete Mathematics Questions and Answers – Inverse of Matrices
7. Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
8. Java Program to Find the Longest Subsequence Common to All Sequences in a Set of
Sequences
9. Discrete Mathematics Questions and Answers – Counting – Division of Objects
10. Discrete Mathematics Questions and Answers – Advanced Counting Techniques –
Recurrence Relation
11. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial
Expansion
12. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
13. Discrete Mathematics Questions and Answers – Floor and Ceiling Function
14. Power Systems Questions and Answers – Geometric Mean Distance and Geometric
Mean Radius – 2
15. C Program to Find the Sum of G.P Series
16. Power Systems Questions and Answers – Geometric Mean Distance and Geometric
Mean Radius – 1
17. Discrete Mathematics Questions and Answers – Discrete Probability – Generating
Functions
18. Discrete Mathematics Questions and Answers – Geometric Probability
19. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
20. Discrete Mathematics Questions and Answers – Sequences and Summations

advertisement
Discrete Mathematics Questions and
Answers – Arithmetic and Geometric Mean
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers focuses on
“Arithmetic and Geometric Mean”.

1. Let A1, A2, be two AM’s and G1, G2 be two GM’s between a and b,then (A1 + A2) / G1G2
is equal to _______
a) (a+b) / 2ab
b) 2ab/(a+b)
c) (a+b)/(ab)
d) None of the mentioned
View Answer

Answer: c
Explanation: A1 + A2 = a + b, G1G2 = ab.
advertisement

2. The series a,(a+b)/2, b is in _______

a) AP
b) GP
c) HP
d) None of the mentioned
View Answer

Answer: a
Explanation: (a+b)/2 is AM between a, b. Hence series is in AP.

3. The series a, (ab)1/2, b is in _______

a) AP
b) GP
c) HP
d) None of the mentioned
View Answer

Answer: b
Explanation: (ab)1/2 is GM between a, b. Hence series is in GP.

4. If A and G be the A.M and G.M between two positive number then the numbers are A +
(A2 – G2)1/2, A – (A2 – G2)1/2.
a) True
b) False
View Answer
Answer: a
Explanation: The equation having its roots as given equation is
x2 – 2Ax + G2 = 0 which implies
x = A + (A2 – G2)1/2, A – (A2 – G2)1/2.

5. If one geometric mean G and two airthmetic mean A1, A2 are inserted between two
numbers, then (2A1 – A2) (2A2 – A1) is equal to _______
a) 2G
b) G
c) G2
d) None of the mentioned
View Answer

Answer: c
Explanation: Let a and b be two numbers then, G = (ab)1/2, A1 = (2a+b)/3, A2 = (a+2b)/3,
(2A1 – A2) = a, (2A2 – A1) = b, (2A1 – A2)(2A2 – A1) = G2.
advertisement

6. State whether the given statement is true or false.

AM ≤ GM.
a) True
b) False
View Answer

Answer: b
Explanation: Airthmetic Mean is always greater or equal to the geometric mean.

7. If between two numbers which are root of given equation. x2 – 18x + 16 = 0, a GM is

inserted then the value of that GM is?
a) 4
b) 5
c) 6
d) 16
View Answer

Answer: a
Explanation: x2 – 2Ax + G2 = 0, here G2 = 16 and therefore G = 4.

8. If a1, a2, a3 are in airthemetic as well as geometric progression then which of the following
is/are correct?
a) 2a2 = a1 + a3
b) a2 = (a1a3)1/2
c) a2 – a1 = a3 -a2
d) All of the mentioned are correct
View Answer

Answer: d
Explanation: a2 is AM, GM between a1, a3, also the series is in AP so common difference
should be same.
9. If a1, a2, a3 are in GP then 1/a1, 1/a2, 1/a3 are in ___________
a) AP
b) GP
c) HP
d) None of the mentioned
View Answer

Answer: b
Explanation: Let the terms be ar, a, a/r then reciprocals are 1/(ar), 1/a, r/a. Still the terms are
in GP.
advertisement

10. If a1, a2, a3…….. are in AP then if a7 = 15, then the value of common difference that
would make a2 a7 a12 greatest is?
a) 2
b) 0
c) 4
d) 9
View Answer

Answer: b
Explanation: Let d be common difference of the AP. Then,
a2 a7 a12 = (15 – 5d)(15)(15 + 5d) = 375(9 – d2)
For maximum value d=0.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Geometric Sequences
» Next - Discrete Mathematics Questions and Answers – Special Sequences
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Geometric Sequences
Discrete Mathematics Questions and Answers – Special Sequences
advertisement
advertisement

Recommended Posts:

1. Engineering Mathematics Questions and Answers

2. C# Programming Examples on Mathematics
3. Discrete Mathematics Questions and Answers
4. Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
5. Discrete Mathematics Questions and Answers – Closure on Relations
 6. Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
7. Discrete Mathematics Questions and Answers – Inverse of a Function
8. Discrete Mathematics Questions and Answers – Discrete Probability – Bayes
Theorem
9. Discrete Mathematics Questions and Answers – Discrete Probability – Generating
Functions
10. Discrete Mathematics Questions and Answers – Inverse of Matrices
11. Discrete Mathematics Questions and Answers – Special Sequences
12. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of
Inclusion Exclusion
13. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and
Variance of Random Variables
14. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic
Series
15. Discrete Mathematics Questions and Answers – Set Operations – 2
16. Discrete Mathematics Questions and Answers – Cardinality of Sets
17. Discrete Mathematics Questions and Answers – Types of Matrices
18. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
19. Power Systems Questions and Answers – Geometric Mean Distance and Geometric
Mean Radius – 2
20. Power Systems Questions and Answers – Geometric Mean Distance and Geometric
Mean Radius – 1

advertisement

Discrete Mathematics Questions and

Answers – Special Sequences
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Special Sequences”.

1. Let the sequence be 1×2, 3×22, 5×23, 7×24, 9×25……… then this sequence is _________
a) An arithmetic sequence
b) A geometic progression
c) Arithmetico-geometric progression
d) None of the mentioned
View Answer

Answer: c
Explanation: If a1, a2……… are in AP and b1, b2………. are in GP then a2b2, a2b2,……… are
in AGP.
advertisement

2. Let the sequence be 1×2, 3×22, 5×23, 7×24, 9×25……… then the next term of this AGP is
given by _________
a) 10×26
b) 10×27
c) 11×26
d) None of the mentioned
View Answer

Answer: c
Explanation: Since here a1, a2……… are in AP and b1, b2………. are in GP then a2b2,
a2b2,……… are in AGP thus an = 11 and bn = 26.

3. The sum of the first n natural numbers is given by _________

a) n(n+1)/2
b) n(n-1)/2
c) n2(n+1)/2
d) None of the mentioned
View Answer

Answer: a
Explanation: 1 + 2 + 3 + 4 +……n = (n/2)(1 + n) Since this is AP.

4. The sum of square of the first n natural numbers is given by _________

a) n(n+1)(2n+1)/6
b) n(n-1)/2(2n+1)
c) n2(n+1)(2n+1)/6
d) None of the mentioned
View Answer

Answer: a
Explanation: 12 + 22 + 32 + 42 +……n2 = n(1+n)(2n+1)/6.

5. The sum of cubes of the first n natural numbers is given by _________

a) {n(n+1)/2}2
b) {n(n-1)/2}2
c) {n2(n+1)/2}2
d) None of the mentioned
View Answer

Answer: a
Explanation: 13 + 23 + 33 + 43 +……+ n3 = {n(n+1)/2}2.
advertisement

6. The series 1, 1, 1, 1, 1…….. is not an AGP.

a) True
b) False
View Answer

Answer: b
Explanation: Since 1, 1, 1, 1, 1…….. is in Ap and in Gp as well, Therefore the given
sequence is also an AGP.
7. If in an AGP the common ratio of GP is 1 then that sequence becomes an AP sequence.
a) True
b) False
View Answer

Answer: a
Explanation: In AGP sequence if r = 1, then terms are ab, (a+d)b, (a+2d)b…. and so on thus
it is AP with common differnce bd.

8. The sequence 1, 1, 1, 1, 1…. is?

a) Absolutely summable
b) Is not absolutely summable
c) Can’t say
d) None of the mentioned
View Answer

Answer: b
Explanation: For limit n tending to infinity the sum also tends to infinity and thus it is not
summable.

9. Which of the following is a Triangular number series?

a) 1, 3, 6, 9, 12, 15…..
b) 1, 3, 6, 10, 15, 21……
c) 1, 6, 12, 18, 24…..
d) none of the mentioned
View Answer

Answer: b
Explanation: In triangular number sequence ith term is previous term+i, with first term as 1.
advertisement

10. Which of the following is a fibonacci series?

a) 0, 1, 2, 3, 4…….
b) 0, 1, 1, 2, 3, 5……
c) 10, 12, 14, 16…….
d) none of the mentioned
View Answer

Answer: b
Explanation: Fibonacci series is formed by adding previous two term starting from 0 and 1.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
» Next - Discrete Mathematics Questions and Answers – Harmonic Sequences
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
Discrete Mathematics Questions and Answers – Harmonic Sequences
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Combinatorial Problems & Algorithms

2. C Programming Examples on Combinatorial Problems & Algorithms
3. C Programming Examples on Mathematical Functions
4. C# Programming Examples on LINQ
5. Engineering Mathematics Questions and Answers
6. C# Programming Examples on Mathematics
7. Discrete Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers – Floor and Ceiling Function
9. Discrete Mathematics Questions and Answers – Groups – Subgroups
10. Discrete Mathematics Questions and Answers – Relations – Partial Orderings
11. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and
Variance of Random Variables
12. Discrete Mathematics Questions and Answers – Cardinality of Sets
13. Discrete Mathematics Questions and Answers – Number Theory – Highest Common
Factors
14. Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
15. Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples
16. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of
Inclusion Exclusion
17. Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
18. Discrete Mathematics Questions and Answers – Set Operations – 2
19. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
20. Discrete Mathematics Questions and Answers – Domain and Range of Functions

advertisement

Discrete Mathematics Questions and

Answers – Harmonic Sequences
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Harmonic Sequences”.

1. If a1, a2……… are in AP then a1-1, a2-1……… are in __________

a) An airthmetic sequence
b) A geometic progression
c) Airthmetico-geometric progression
d) None of the mentioned
View Answer

Answer: d
Explanation: If a1, a2……… are in AP, then a1-1, a2-1……… are in Harmonic Progression.
advertisement

2. The ninth term of 1⁄3, 1⁄7, 1⁄11, 1⁄15, 1⁄19,……… is given by?
a) 1⁄35
b) 1⁄36
c) 1⁄39
d) None of the mentioned
View Answer

Answer: a
Explanation: Since here a1-1, a2-1……… are in AP thus a9 = 3 + (9-1)4 = 35, 1⁄35 is h9 term of
the series.

3. If for some number a and d, if first term is 1⁄a, second term is 1/(a+d), thrid term is 1/(a+2d)
and so on, then 5th term of the sequence is?
a) a+4d
b) a-4d
c) 1/(a+4d)
d) none of the mentioned
View Answer

Answer: c
Explanation: The given sequence will form HP, thus 5th term will be (a+(5-1)d) – 1.

4. If a, b, c are in hp then a-1, b-1, c-1 are in _________

a) GP
b) HP
c) AP
d) None of the mentioned
View Answer

Answer: c
Explanation: If a1, a2……… are in AP then a1-1, a2-1……… are in Harmonic Progression.

5. If a, b, c are in hp, then b is related with a and c as _________

a) 2(1⁄b) = (1⁄a + 1⁄c)
b) 2(1⁄c) = (1⁄b + 1⁄c)
c) 2(1⁄a) = (1⁄a + 1⁄b)
d) None of the mentioned
View Answer

Answer: a
Explanation: 1⁄a, 1⁄b, 1⁄c willl be in airthmentic series and 1⁄b will be the AM of a, c.
 advertisement

6. For number A, C if H is harmonic mean, G is geometric mean then H>=G.

a) True
b) False
View Answer

Answer: b
Explanation: Geometric mean is always greater than or equal to the harmonic mean.

7. For number B, C if H is harmonic mean, A is the airthmetic mean then H>=A.

a) True
b) False
View Answer

Answer: b
Explanation: Airthmetic mean is always greater than or equal to harmonic mean.

8. Which of the following gives the right inequality for AM, GM, HM?
a) AM>=HM>=GM
b) GM>=AM>=HM
c) AM>=GM>=HM
d) GM>=HM>=AM
View Answer

Answer: c
Explanation: Airthmetic mean is always greater than or equal to geometric mean,geometric
mean is always greater than or equal to harmonic mean.

9. For two number a,b HM between them is given by?

a) (2b+2a )/3b
b) 2ab/(a+b)
c) (a+b)/2ab
d) 2b/(a+b)
View Answer

Answer: b
Explanation: Let c be the hm, 2⁄c = 1⁄a + 1⁄b (AM property), c = 2b/(a+b).
advertisement

10. If A, G, H are the AM, GM, HM between a and b respectively then?

a) A, G, H are in hp
b) A, G, H are in gp
c) A, G, H are in ap
d) None of the mentioned
View Answer

Answer: b
Explanation: A = (a+b)/2, G = (ab)1/2, H = 2b/(a+b), clearly AxH = G2 thus A, G, H are in gp.
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Special Sequences
» Next - Discrete Mathematics Questions and Answers – Cardinality of Sets
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Special Sequences
Discrete Mathematics Questions and Answers – Cardinality of Sets
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on Mathematics

2. Engineering Mathematics Questions and Answers
3. C Programming Examples on Mathematical Functions
4. Discrete Mathematics Questions and Answers
5. Discrete Mathematics Questions and Answers – Properties of Matrices
6. Discrete Mathematics Questions and Answers – Geometric Probability
7. Machine Kinematics Questions and Answers – Simple Harmonic Motion
8. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
9. Discrete Mathematics Questions and Answers – Inverse of Matrices
10. Discrete Mathematics Questions and Answers – Cardinality of Sets
11. Discrete Mathematics Questions and Answers – Number Theory and Cryptography –
Rules of Exponents
12. Machine Kinematics Questions and Answers – Differential Equation of Simple
Harmonic Motion
13. Machine Kinematics Questions and Answers – Velocity and Acceleration of a Particle
Moving with Simple Harmonic Motion
14. Power Electronics Questions and Answers – Harmonic Reduction
15. Java Program to Generate Harmonic Series
16. Discrete Mathematics Questions and Answers – Discrete Probability – Generating
Functions
17. C++ Program to Calculate Sum of Geometric Progression
18. C Program to Find the Sum of H.P Series
19. Discrete Mathematics Questions and Answers – Sequences and Summations
20. Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean

advertisement
Discrete Mathematics Questions and
Answers – Cardinality of Sets
« Prev
Next »

This set of Discrete Mathematics Questions and Answers for Aptitude test focuses on
“Cardinality of Sets”.

1. The cardinality of the set A = {1, 2, 3, 4, 6} is?

a) 5
b) 6
c) Integer
d) None of the mentioned
View Answer

Answer: a
Explanation: 5, it is a number of elements in the sets.
advertisement

2. For two equal sets there ___________

a) Cardinality is same
b) Cardinality is different
c) May be same or different
d) None of the mentioned
View Answer

Answer: a
Explanation: Two equal sets should have the same number of elements.

3. If A is a subset of B then _______

a) The cardinality of A is greater than B
b) The cardinality of B is greater than A
c) Can’t say
d) None of the mentioned
View Answer

Answer: b
Explanation: B contains all the elements of A, as well as other elements.

4. If there is a bijection between two sets A and B then _______

a) Cardinality of A is greater than B
b) Cardinality of B is greater than A
c) Cardinality of B is equal to A
d) None of the mentioned
View Answer
Answer: c
Explanation: If there is bijection then two sets A and B will be equinumerous and thus will
have same cardinality.

5. Let a set E ={0,2,4,6,8….} of non-negative even numbers and O = {1, 3, 5, 7, 9,…..} of

non-negative odd numbers then?
a) Cardinality of set E is greater than that of O
b) Cardinality of set O is greater than that of E
c) Cardinality of set E is equal to that of O
d) None of the mentioned
View Answer

Answer: c
Explanation: There is bijection then two sets E and O and they will be equinumerous and thus
will have same cardinality.
advertisement

6. Cardinality of the set of lower letter english alphabets is 26.

a) True
b) False
View Answer

Answer: a
Explanation: From a, b, c…z there will be 26 elements.

7. Cardinality of the set of even prime number under 10 is 4.

a) True
b) False
View Answer

Answer: b
Explanation: Since 2 is only even prime thus cardinality should be 1.

8. If for sets A and B there exists an injective function but not bijective function from A to B
then?
a) Cardinality of A is strictly greater than B
b) Cardinality of B is strictly greater than A
c) Cardinality of B is equal to A
d) None of the mentioned
View Answer

Answer: b
Explanation: If there doesnot exist a bijective function from A to B that means there are some
elements in B whose preimage is not in A, thus cardinality of B is strictly greater than A.

9. If cardinality of (A U B) = cardinality of A+ cardinality of B. This means ____________

a) A is a subset of B
b) B is a subset of A
c) A and B are disjoint
d) None of the mentioned
View Answer

Answer: c
Explanation: Thus if the cardinality of (A U B) = cardinality of A+ cardinality of B, it means
they don’t have any element in common, n(A∩B) = 0.
advertisement

10. If A is a subset of B and B is a subset of C, then cardinality of A U B U C is equal to

____________
a) Cardinality of C
b) Cardinality of B
c) Cardinality of A
d) None of the mentioned
View Answer

Answer: a
Explanation: A U B U C = C, since a, b are subsets to C.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Aptitude test, here is complete set of 1000+
Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Harmonic Sequences
» Next - Discrete Mathematics Questions and Answers – Types of Matrices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Harmonic Sequences
Discrete Mathematics Questions and Answers – Types of Matrices
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Hard Graph Problems & Algorithms

2. C# Programming Examples
3. Simple C Programs
4. C Programming Examples on Hard Graph Problems & Algorithms
5. Computer Science Questions and Answers
6. Digital Signal Processing Questions and Answers
7. Information Science Questions and Answers
8. Information Technology Questions and Answers
9. C Programming Examples on Numerical Problems & Algorithms
10. Biotechnology Questions and Answers
11. Master of Computer Applications Questions and Answers
 12. C++ Programming Examples on Numerical Problems & Algorithms
13. Signals & Systems Questions and Answers
14. Java Programming Examples on Numerical Problems & Algorithms
15. Python Questions and Answers
16. Bachelor of Computer Applications Questions and Answers
17. Probability and Statistics Questions and Answers
18. C# Programming Examples on Mathematics
19. Engineering Mathematics Questions and Answers
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Types of Matrices
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Types of Matrices”.

1. If a matrix A = [A11 A12 ⋯ A1n A21 A2n ⋮ ⋮ An1 An2 ⋯ Ann], order(nxn) Aii = 1, Aij = 0 for i
≠ j. Then that matrix is known as ________
a) Identity matrix
b) Null matrix
c) Singular matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: In unit matrix all diagonal elements are 1 and all other 0.
advertisement

2. A symmetric matrix is a one in which?

a) All diagonal elements are zero
b) All diagonal elements are 1
c) A = AT
d) A = -AT
View Answer

Answer: c
Explanation: For symmetric matrices, matrix remains same even after transpose.

3. An anti-symmetric matrix is a one in which?

a) All diagonal elements are zero
b) All diagonal elements are 1
c) A = AT
d) A = -AT
View Answer

Answer: d
Explanation: Foran anti-symmetric matrix, matrix changes it sign after transpose.

4. A matrix having one row and many columns is known as?

a) Row matrix
b) Column matrix
c) Diagonal matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: In row matrix there is only one row.

5. A matrix having many rows and one column is known as?

a) Row matrix
b) Column matrix
c) Diagonal matrix
d) None of the mentioned
View Answer

Answer: b
Explanation: In column matrix there is only one column.
advertisement

6. The trace of the matrix is defined as _______

a) Sum of all the elements of the matrix
b) Sum of all the elements of leading diagonal of matrix
c) Sum of all non-zero elements of matrix
d) None of the mentioned
View Answer

Answer: b
Explanation: Trace is the sum of the elements of leading diagonal of matrix.

7. A square matrix A = [aij ]nxn, if aij = 0 for i > j then that matrix is known as _______
a) Upper triangular matrix
b) Lower triangular matrix
c) Unit matrix
d) Null matrix
View Answer

Answer: a
Explanation: In upper triangular matrix A = [ aij ]nxn, if aij = 0 for i > j.

8. A square matrix A = [aij ]nxn, if aij = 0 for i < j then that matrix is known as _______
a) Upper triangular matrix
b) Lower triangular matrix
c) Unit matrix
d) Null matrix
View Answer

Answer: b
Explanation: In lower triangular matrix A = [aij ]nxn, if aij = 0 for i < j.

9. Two matrix can be added if _______

a) rows of both the matrices are same
b) columns of both the matrices are same
c) both rows and columns of both the matrices are same
d) number of rows of first matrix should be equal to number of column of second
View Answer

Answer: c
Explanation: Order of two matrices must be same.
advertisement

10. For matrix A if AAT = I, I is identity matrix then A is?

a) Orthagonal matrix
b) Nilpotent matrix
c) Idempotent matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: For orthagonal matrices AAT = I = AT A.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Cardinality of Sets
» Next - Discrete Mathematics Questions and Answers – Operations on Matrices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Cardinality of Sets
Discrete Mathematics Questions and Answers – Operations on Matrices
advertisement
advertisement

Recommended Posts:

1. Numerical Methods Questions and Answers

2. Bioinformatics Questions and Answers
 3. Java Programming Examples on Utility Classes
4. Distillation Design Questions and Answers
5. C++ Programming Examples on Combinatorial Problems & Algorithms
6. C++ Algorithms, Problems & Programming Examples
7. Signals & Systems Questions and Answers
8. Structural Analysis Questions and Answers
9. C# Programming Examples on Mathematics
10. Java Programming Examples
11. C# Programming Examples
12. Java Programming Examples on Numerical Problems & Algorithms
13. C Programming Examples on Numerical Problems & Algorithms
14. C++ Programming Examples on Numerical Problems & Algorithms
15. C Programming Examples
16. Engineering Mathematics Questions and Answers
17. Java Programming Examples on Arrays
18. Discrete Mathematics Questions and Answers
19. Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and
Partitions
20. C Program to Calculate the Sum & Difference of the Matrices

advertisement

Discrete Mathematics Questions and

Answers – Operations on Matrices
« Prev
Next »

This set of Discrete Mathematics online test focuses on “Operations on Matrices”.

1. Let A and B be two matrices of same order, then state whether the given statement is true
or false.

A + B = B + A
advertisement

a) True
b) False
View Answer

Answer: a
Explanation: Matrix addition is commutative.

2. Let A and B be two matrices of same order, then state whether the given statement is true
or false.

AB = BA
a) True
b) False
View Answer

Answer: b
Explanation: Matrix multiplication is not commutative.

3. Let A order(axb) and Border(cxd) be two matrices, then for AB to exist, correct relation is
given by?
a) a = d
b) b = c
c) a = b
d) c = d
View Answer

Answer: b
Explanation: Matrix multiplication exists only when column of first matrix is same as rows of
second i.e b = c.
advertisement

4. Let A order(axb) and Border(cxd) be two matrices, then if AB exists, the order of AB is?
a) axd
b) bxc
c) axb
d) cxd
View Answer

Answer: a
Explanation: Matrix multiplication exists only when column of first matrix is same as rows of
second i.e b = c also resultant matrix will have number of rows equal to first matrix and
column equal to the second matrix.

5. Let A=[aij ] be an mxn matrix and k be a scalar then kA is equal to __________

a) [kaij ]mxn
b) [aij/k ]mxn
c) [k2 aij]mxn
d) None of the mentioned
View Answer

Answer: a
Explanation: The scalar is multiplied with each of the element of matrix A.

6. The matrix multiplication is distrbutive over matrix addition.

a) True
b) False
View Answer

Answer: a
Explanation: For matrix A, B, C, A(B+C) = AB + AC.
7. If for a square matrix A, A2 = A then such a matrix is known as _________
a) Idempotent matrix
b) Orthagonal matrix
c) Null matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: A sqaure matrix is called an Idempotent matrix, if A2 = A.
advertisement

8. For matrix A, B.(A+B)T = AT + BT and (AB)T = ATBT if the orders of matrices are
appropriate.
a) True
b) False
View Answer

Answer: b
Explanation: (A+B)T = AT + BT is correct but (AB)T = BTAT(reversal law).

9. For matrix A, B if A – B = O, where O is a null matrix then?

a) A = O
b) B = O
c) A = B
d) None of the mentioned
View Answer

Answer: c
Explanation: If subtraction of B from A results in the null matrix this means that A is
equivalent to B.

10. All the diagonal elements of a skew-symmetric matrix is?

a) 0
b) 1
c) 2
d) Any integer
View Answer

Answer: a
Explanation: Since for a skew symmetric matrix aij = -aij, this implies all diagonal elements
should be zero.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

advertisement

To practice all areas of Discrete Mathematics for online tests, here is complete set of 1000+
Multiple Choice Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Types of Matrices
» Next - Discrete Mathematics Questions and Answers – Properties of Matrices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Types of Matrices
Discrete Mathematics Questions and Answers – Properties of Matrices
advertisement
advertisement

Recommended Posts:

1. Python Programming Examples

2. Signals & Systems Questions and Answers
3. Bachelor of Computer Applications Questions and Answers
4. Structural Analysis Questions and Answers
5. Numerical Methods Questions and Answers
6. Heat Transfer Operations Questions and Answers
7. C Programming Examples on Bitwise Operations
8. Mechanical Operations Questions and Answers
9. C++ Programming Examples on Combinatorial Problems & Algorithms
10. C Programming Examples using Recursion
11. C# Programming Examples
12. Java Programming Examples on Numerical Problems & Algorithms
13. C# Programming Examples on Mathematics
14. C++ Programming Examples on Numerical Problems & Algorithms
15. Java Programming Examples on Arrays
16. C Programming Examples on Numerical Problems & Algorithms
17. Engineering Mathematics Questions and Answers
18. C# Programming Examples on Matrix
19. Discrete Mathematics Questions and Answers
20. C Program to Perform Matrix Multiplication

advertisement

Discrete Mathematics Questions and

Answers – Properties of Matrices
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Properties of Matrices”.

1. The determinant of identity matrix is?

a) 1
b) 0
c) Depends on the matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: In identity matrix aii = 1, and all other elements = 0, hence the determinant is 1.
advertisement

2. If determinant of a matrix A is Zero than __________

a) A is a Singular matrix
b) A is a non-Singular matrix
c) Can’t say
d) None of the mentioned
View Answer

Answer: a
Explanation: Determinant of singular matrices are zero.

3. For a skew symmetric even ordered matrix A of integers, which of the following will not
hold true?
a) det(A) = 9
b) det(A) = 81
c) det(A) = 7
d) det(A) = 4
View Answer

Answer: c
Explanation: Determinant of a skew symmetric even ordered matrix A is a perfect square.

4. For a skew symmetric odd ordered matrix A of integers, which of the following will hold
true?
a) det(A) = 9
b) det(A) = 81
c) det(A) = 0
d) det(A) = 4
View Answer

Answer: c
Explanation: Determinant of a skew symmetric odd ordered matrix A is always 0.

5. Let A = [kaij]nxn, B = [aij]nxn, be an nxn matrices and k be a scalar then det(A) is equal to
_________
a) Kdet(B)
b) Kndet(B)
c) K3det(b)
d) None of the mentioned
View Answer
Answer: b
Explanation: The scalar is multiplied with each of the element of matrix A then determinant
is multiplied, the number of row times to the scalar i.e. Kndet(B).
advertisement

6. The Inverse exist only for non-singular matrices.

a) True
b) False
View Answer

Answer: a
Explanation: Since for singular matrix det(A)=0.Hence Inverse does not exist.

7. If for a square matrix A and B, null matrix O, AB = O implies BA=O.

a) True
b) False
View Answer

Answer: b
Explanation: Let A = [0 1 0 0], B = [1 0 0 0]AB=O and BA is not equal to O.

8. If for a square matrix A and B,null matrix O, AB = O implies A=O and B=O.
a) True
b) False
View Answer

Answer: b
Explanation: Let A = [0 1 0 0], B = [1 0 0 0]AB=O and B, A is not equal to O.

9. Let A be a nilpotent matrix of order n then?

a) An = O
b) nA = O
c) A = nI, I is Identity matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: n is the smallest possible number such that An = O.
advertisement

10. Which of the following property of matrix multiplication is correct?

a) Multiplication is not commutative in general
b) Multiplication is associative
c) Multiplication is distributive over addition
d) All of the mentioned
View Answer

Answer: d
Explanation: Matrix multiplication is associative, distributive, but not commutative.
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Operations on Matrices
» Next - Discrete Mathematics Questions and Answers – Transpose of Matrices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Operations on Matrices
Discrete Mathematics Questions and Answers – Transpose of Matrices
advertisement
advertisement

Recommended Posts:

1. Information Technology Questions and Answers

2. Biotechnology Questions and Answers
3. C++ Programming Examples on Combinatorial Problems & Algorithms
4. Signals & Systems Questions and Answers
5. Structural Analysis Questions and Answers
6. C Algorithms, Problems & Programming Examples
7. C Programming Examples using Recursion
8. Master of Computer Applications Questions and Answers
9. Bachelor of Computer Applications Questions and Answers
10. Java Programming Examples on Arrays
11. Home
12. C# Programming Examples
13. C# Programming Examples on Mathematics
14. Java Programming Examples on Numerical Problems & Algorithms
15. Engineering Mathematics Questions and Answers
16. C Programming Examples on Numerical Problems & Algorithms
17. C++ Programming Examples on Numerical Problems & Algorithms
18. C# Programming Examples on Matrix
19. C Programming Examples on Matrix
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Transpose of Matrices
« Prev
Next »
This set of Discrete Mathematics Problems focuses on “Transpose of Matrices”.

1. For a matrix A, if a matrix B is obtained by changing its rows into columns and column
into rows, then relation between A and B is?
a) A2 = B
b) AT = B
c) Depends on the matrix
d) None of the mentioned
View Answer

Answer: b
Explanation: A = [aij] and B = [aji], B = AT.
advertisement

2. For matrix A, (AT)T is equals to ___________

a) A
b) AT
c) Can’t say
d) None of the mentioned
View Answer

Answer: a
Explanation: Transpose of a transposed matrix results in same matrix.

3. For matrix Aand a scalar k, (kA)T is equal to _________

a) k(A)
b) k(A)T
c) k2(A)
d) k2(A)T
View Answer

Answer: b
Explanation: Scalar has no effect on transpose.

4. If A is a lower triangular matrix then AT is a _________

a) Lower triangular matrix
b) Upper triangular matrix
c) Null matrix
d) None of the mentioned
View Answer

Answer: b
Explanation: By transpose a lower triangular matrix will turn to upper triangular matrix and
vice – versa.

5. If matrix A and B are symmetric and AB = BA iff _________

a) AB is symmetric matrix
b) AB is an anti-symmetric matrix
c) AB is a null matrix
d) None of the mentioned
View Answer

Answer: a
Explanation: For two symmetric matrices A and B, AB is a symmetric matrix if and only if
AB = BA.
advertisement

6. A matrix can be expressed as sum of symmetric and anti-symmetric matrices.

a) True
b) False
View Answer

Answer: a
Explanation: Since A = (1⁄2)(A + AT) + ((1⁄2)(A – AT)

7. The determinant of a diagonal matrix is the product of leading diagonal’s element.

a) True
b) False
View Answer

Answer: a
Explanation: Since in diagonal matrix all element other than diagonal are zero.

8. If for a square matrix A and B,null matrix O, (AB)T = O implies AT = O and BT = O.

a) True
b) False
View Answer

Answer: b
Explanation: Let A=[0 1 0 0 ], B=[1 0 0 0 ] AB=O and B, AT, BT is not equal to O.

9. Let A = [aij] given by abij = (i-j)3 is a _________

a) Symmetric matrix
b) Anti-Symmetric matrix
c) Identity matrix
d) None of the mentioned
View Answer

Answer: b
Explanation: aji =(j-i3) = -aij, A is Anti-symmetric matrix.
advertisement

10. Trace of the matrix of odd ordered anti-symmetric matrix is _________

a) 0
b) 1
c) 2
d) All of the mentioned
View Answer
Answer: a
Explanation: Since in odd ordered anti-symmetric matrix all diagonal matrix are zero.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics Problems, here is complete set of 1000+
Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Properties of Matrices
» Next - Discrete Mathematics Questions and Answers – Inverse of Matrices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Properties of Matrices
Discrete Mathematics Questions and Answers – Inverse of Matrices
advertisement
advertisement

Recommended Posts:

1. Biotechnology Questions and Answers

2. Information Technology Questions and Answers
3. Information Science Questions and Answers
4. Structural Analysis Questions and Answers
5. Master of Computer Applications Questions and Answers
6. Java Programming Examples
7. Java Programming Examples on Numerical Problems & Algorithms
8. Bachelor of Computer Applications Questions and Answers
9. C Programming Examples on Numerical Problems & Algorithms
10. Signals & Systems Questions and Answers
11. C++ Programming Examples on Numerical Problems & Algorithms
12. Home
13. C# Programming Examples on Mathematics
14. C# Programming Examples
15. Finite Element Method Questions and Answers
16. Engineering Mathematics Questions and Answers
17. Java Programming Examples on Arrays
18. Discrete Mathematics Questions and Answers
19. C Programming Examples on Matrix
20. C++ Program to Find Transpose of a Graph Matrix

advertisement

Discrete Mathematics Questions and

Answers – Inverse of Matrices
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Inverse of Matrices”.

1. For a matrix A, B and identity matrix I, if a matrix AB=I=BA then?

a) B is inverse of A
b) A is inverse of B
c) A-1 = B, B-1 = A
d) All of the mentioned
View Answer

Answer: d
Explanation: Since AB = I, A = B-1 Similarly A is the inverse of B.
advertisement

2. For matrix A,(A3) = I, A-1 is equals to _________

a) A2
b) A-2
c) Can’t say
d) None of the mentioned
View Answer

Answer: a
Explanation: A(A2) = I this implies A-1 = A2.

3. Let A = [0 1 0 0 ], A-1 is equal to _________

a) Null matrix
b) Identity matrix
c) Does not exist
d) None of the mentioned
View Answer

Answer: c
Explanation: Since A is singular matrix, inverse does not exists.

4. If A is an invertible square matrix then _________

a) (AT)-1 = (A-1)T
b) (AT)T = (A-1)T
c) (AT)-1 = (A-1)-1
d) None of the mentioned
View Answer

Answer: a
Explanation: For invertible matrix A, AT is also inveritble.

5. If matrix A, B and C are invertible matrix of same order then (ABC)-1 = _________
a) CBA
b) C-1 B-1 A-1
c) CT B-1 AT
d) None of the mentioned
View Answer

Answer: b
Explanation: Reversal rule holds for inverse multiplication of the matrices.
advertisement

6. If A is non singular matrix then AB = AC implies B = C.

a) True
b) False
View Answer

Answer: a
Explanation: Pre-multipliying by A-1 we get B = C.

7. For a matrix A of order n, the det(adj(A)) = (det(A))n, where adj() is adjoint of matrix.
a) True
b) False
View Answer

Answer: b
Explanation: For a matrix A of order n, the det(adj(A)) = (det(A))n-1.

8. For a non-singular matrix A, A-1 is equal to _________

a) (adj(A))/det(A)
b) det(A)*(adj(A))
c) det(A)*A
d) none of the mentioned
View Answer

Answer: a
Explanation: A(adj(A)) = det(A)I, I = A(adj(A))/det(A) which implies A-1 = (adj(A))/det(A).

9. Let I3 be the Identity matrix of order 3 then (I3)-1 is equal to _________

a) 0
b) 3I3
c) I3
d) None of the mentioned
View Answer

Answer: c
Explanation: Idenity matrices are self invertible that is I3 x I3 = I3.
advertisement

10. If for a square matrix A(non-singular) and B, null matrix O, AB = O then?

a) B is a null matrix
b) B is a non singular matrix
c) B is a identity matrix
d) All of the mentioned
View Answer

Answer: a
Explanation: Given det(A) is not equal to zero. A-1 exists, A-1(AB) = O, B = O.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Transpose of Matrices
» Next - Discrete Mathematics Questions and Answers – Sequences and Summations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Transpose of Matrices
Discrete Mathematics Questions and Answers – Sequences and Summations
advertisement
advertisement

Recommended Posts:

1. Signals & Systems Questions and Answers

2. Numerical Methods Questions and Answers
3. Java Programming Examples on Arrays
4. Java Programming Examples on Numerical Problems & Algorithms
5. C++ Programming Examples on Numerical Problems & Algorithms
6. C# Programming Examples on Mathematics
7. C Programming Examples on Numerical Problems & Algorithms
8. C# Programming Examples
9. C# Programming Examples on Matrix
10. Engineering Mathematics Questions and Answers
11. C Programming Examples on Matrix
12. Discrete Mathematics Questions and Answers
13. C++ Program to Find if a Matrix is Invertible or Not
14. Discrete Mathematics Questions and Answers – Cyclic Groups
15. C++ Program to Find Inverse of a Graph Matrix
16. Discrete Mathematics Questions and Answers – Group Axioms
17. Java Program to Find Inverse of a Matrix
18. Linear Algebra Questions and Answers – Finding Inverse and Rank of Matrix
19. Discrete Mathematics Questions and Answers – Number Theory and Cryptography –
Rules of Exponents
20. Discrete Mathematics Questions and Answers – Groups – Cosets

advertisement
Discrete Mathematics Questions and
Answers – Sequences and Summations
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Sequences and Summations”.

1. For the sequence 1, 7, 25, 79, 241, 727 … simple formula for {an} is ____________
a) 3n+1 – 2
b) 3n – 2
c) (-3)n + 4
d) n2 – 2
View Answer

Answer: b
Explanation: The ratio of consecutive numbers is close to 3. Comparing these terms with the
sequence of {3n} which is 3, 9, 27 …. Comparing these terms with the corresponding terms
of sequence {3n} and the nth term is 2 less than the corresponding power of 3.
advertisement

2. For the sequence 0, 1, 2, 3 an is ____________

a) ⌈n/2⌉+⌊n/2⌋
b) ⌈n/2⌉+⌈n/2⌉
c) ⌊n/2⌋+⌊n/2⌋
d) ⌊n/2⌋
View Answer

Answer: a
Explanation: Expand the sequence ⌈n/2⌉+⌊n/2⌋ where a1 is ⌊0.5⌋+⌈0.5⌉ = 1+0 = 1, a2 is
⌊1⌋+⌈1⌉ = 1 + 1 = 2 and so on.

3. The value of∑(k=50)100 k2 is __________

a) 338, 350
b) 297, 900
c) 297, 925
d) 290, 025
View Answer

Answer: c
Explanation: Using the formula. ∑(k=1)n k2 = (n(n + 1)(2n + 1)) / 6.

4. The sets A and B have same cardinality if and only if there is ___________ from A to B.
a) One-to-one
b) One-to-many
c) Many-to-many
d) Many-to-one
View Answer

Answer: a
Explanation: If there is one-to-one correspondence then they have same cardinality.

5. For the sequence an = ⌊√2n+ 1/2⌋, a7is ____________

a) 1
b) 7
c) 5
d) 4
View Answer

Answer: d
Explanation: a7 = ⌊√14+1/2⌋ which is ⌊4.24⌋ = 4.
advertisement

6. The value of ∑(i=1)3 ∑(h=0)2 i is _________

a) 10
b) 17
c) 15
d) 18
View Answer

Answer: d
Explanation: The value of ∑(i=1)3 ∑(h=0)2 i = 1+1+1+2+2+2+3+3+3 = 18.

7. For the sequence an = 6. (1/3)n, a4 is _________

a) 2/25
b) 2/27
c) 2/19
d) 2/13
View Answer

Answer: b
Explanation: Put n = 4 in the sequence.

8. The value of ∑(i=0)4i! is __________

a) 32
b) 30
c) 34
d) 35
View Answer

Answer: c
Explanation: First five term of the sequence n! is given by 1, 1, 2, 6, 24.

9. Set of all integers is counter.

a) True
b) False
View Answer

Answer: a
Explanation: There is one-to-one correspondence between set of positive integers and set of
all integers.
advertisement

10. The value of ∏(k=1)100(-1) k is _________

a) 0
b) 1
c) -1
d) 2
View Answer

Answer: b
Explanation: The product of a1, a2, a3 …… an is represented by ∏(i=1)n ai.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Inverse of Matrices
» Next - Discrete Mathematics Questions and Answers – Algorithms
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Inverse of Matrices
Discrete Mathematics Questions and Answers – Algorithms
advertisement
advertisement

Recommended Posts:

1. Terms of Service
2. Bachelor of Computer Applications Questions and Answers
3. Simple Java Programs
4. Simple C Programs
5. C Programming Examples on Mathematical Functions
6. C# Programming Examples on Mathematics
7. Engineering Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of
Inclusion Exclusion
10. Discrete Mathematics Questions and Answers – Advanced Counting Techniques –
Recurrence Relation
 11. Discrete Mathematics Questions and Answers – Strong Induction and Well-Ordering
12. Discrete Mathematics Questions and Answers – Graphs – Lattices
13. Discrete Mathematics Questions and Answers – Number of Relations
14. Discrete Mathematics Questions and Answers – Properties of Matrices
15. Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and
Partitions
16. Discrete Mathematics Questions and Answers – Logics – Nested Quantifiers
17. Discrete Mathematics Questions and Answers – Number Theory – Primes and
Greatest Common Divisors
18. Discrete Mathematics Questions and Answers – Number Theory – Highest Common
Factors
19. Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples
20. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series

advertisement

Discrete Mathematics Questions and

Answers – Algorithms
« Prev
Next »

This set of Discrete Mathematics Multiple Choice s & Answers (MCQs) focuses on
“Algorithms”.

1. An algorithm is a _________ set of precise instructions for performing computation.

a) Infinite
b) Finite
c) Constant
d) None of the mentioned
View Answer

Answer: b
Explanation: By the definition of an algorithm.
advertisement

2. Out of the following which property algorithms does not share?

a) Input
b) Finiteness
c) Generality
d) Constancy
View Answer

Answer: d
Explanation: All the others are the properties of algorithms.

3. In ________ search each element is compared with x till not found.

a) Binary
b) Sequential
c) Merge
d) None of the mentioned
View Answer

Answer: b
Explanation: In linear or sequential search entire list is searched sequentially for x.

4. If the entire list is searched sequentially without locating x in linear search, the solution is
__________
a) 0
b) -1
c) 1
d) 2
View Answer

Answer: a
Explanation: If the element is not found in the entire list, then the solution is 0.

5. To sort a list with n elements, the insertion sort begins with the __________ element.
a) First
b) Second
c) Third
d) Fourth
View Answer

Answer: b
Explanation: The insertion sort compares the second element with the first element to start
sorting.
advertisement

6. __________ comparisons required to sort the list 1, 2, 3…….n using insertion sort.
a) (n2 + n + 2) / 2
b) (n3 + n – 2) / 2
c) (n2 + n – 2) / 2
d) (n2 – n – 2) / 2
View Answer

Answer: c
Explanation: 2+3+4+….6n = (n2 + n – 2) / 2.

7. The Worst case occurs in linear search algorithm when ____________

a) Item is somewhere in the middle of the array
b) Item is not in the array at all
c) Item is the last element in the array
d) Item is the last element in the array or is not there at all
View Answer
Answer: d
Explanation: The Worst case occur in linear search algorithm when Item is the last element in
the array or is not there at all.

8. List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is ___________

a) 1, 2, 4, 3, 5
b) 1, 2, 3, 4, 5
c) 1, 5, 4, 3, 2
d) 3, 5, 4, 1, 2
View Answer

Answer: b
Explanation: The selection sort begins with finding the least element in the list. This element
is moved to front and then the least element among the remaining elements. Is found and put
into the second position and so on.

9. The operation of processing each element in the list is known as _________

a) Sorting
b) Merging
c) Inserting
d) Traversal
View Answer

Answer: d
Explanation: The operation of processing each element in the list is known as Traversal.
advertisement

10. The complexity of Bubble sort algorithm is _________

a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer

Answer: c
Explanation: The complexity of Bubble sort algorithm is O(n2).

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Sequences and Summations
» Next - Discrete Mathematics Questions and Answers – Algorithms – Types
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Sequences and Summations
Discrete Mathematics Questions and Answers – Algorithms – Types
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Numerical Problems & Algorithms

2. C++ Programming Examples on Hard Graph Problems & Algorithms
3. C Programming Examples on Set & String Problems & Algorithms
4. C++ Programming Examples on Computational Geometry Problems & Algorithms
5. Java Programming Examples on Computational Geometry Problems & Algorithms
6. C Programming Examples on Computational Geometry Problems & Algorithms
7. C Algorithms, Problems & Programming Examples
8. C++ Programming Examples on Graph Problems & Algorithms
9. Java Programming Examples on Graph Problems & Algorithms
10. Java Algorithms, Problems & Programming Examples
11. C Programming Examples on Graph Problems & Algorithms
12. Discrete Mathematics Questions and Answers
13. Data Structures & Algorithms II – Questions and Answers
14. C# Programming Examples on Sorting
15. C++ Programming Examples on Combinatorial Problems & Algorithms
16. Discrete Mathematics Questions and Answers – Transpose of Matrices
17. Database Questions and Answers – Sorting
18. Quicksort Multiple Choice Questions and Answers (MCQs) – 1
19. C++ Algorithms, Problems & Programming Examples
20. C++ Program to Compare Binary and Sequential Search

advertisement

Discrete Mathematics Questions and

Answers – Algorithms – Types
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Algorithms – Types”.

1. An Algorithm is ___________
a) A procedure for solving a problem
b) A problem
c) A real life mathematical problem
d) None of the mentioned
View Answer

Answer: a
Explanation: An algorithm is a stepwise solution to the problem.
advertisement
2. An algorithm in which we divide the problem into subproblem and then we combine the
subsolutions to form solution to the original problem is known as _________
a) Brute Force
b) Divide and Conquer
c) GreedyAlgorithm
d) None of the mentioned
View Answer

Answer: b
Explanation: In Divide and Conquer we divide the problem and then recombine the solution.

3. An algorithm which uses the past results and uses them to find the new results is
_________
a) Brute Force
b) Divide and Conquer
c) Dynamic programming algorithms
d) None of the mentioned
View Answer

Answer: c
Explanation: In Dynamic programming algorithms we utilize previous results for new ones.

4. A Complexity of algorithm depends upon _________

a) Time only
b) Space only
c) Both Time and Space
d) None of the mentioned
View Answer

Answer: c
Explanation: For Complexity, we calculate both time and space consumed.

5. An algorithm which tries all the possibilities unless results are satisfactory is and generally
is time-consuming is _________
a) Brute Force
b) Divide and Conquer
c) Dynamic programming algorithms
d) None of the mentioned
View Answer

Answer: a
Explanation: In Brute force, all the possibilities are tried.
advertisement

6. For a recursive algorithm _________

a) a base case is necessary and is solved without recursion.
b) a base case is not necessary
c) doesnot solve a base case directly
d) none of the mentioned
View Answer
Answer: b
Explanation: Base case ends recursion and therefore it is necessary for finite recursion.

7. Optimization of algorithm means _________

a) making that algorithm fast by time and compact by space
b) making that algorithm slow by time and large by space
c) making that algorithm fast by time and large by space
d) making that algorithm slow by time and compact by space
View Answer

Answer: a
Explanation: An Algorithm should be fast and compact.

8. For an algorithm which is the most important characteristic that makes it acceptable
_________
a) Fast
b) Compact
c) Correctness and Precision
d) None of the mentioned
View Answer

Answer: c
Explanation: An algorithm should be correct otherwise it’s of no use even if it is fast and
compact.

9. An algorithm: can be represented through _________

a) flow charts
b) pseudo codes
c) instructions in common language
d) all of the mentioned
View Answer

Answer: d
Explanation: Algorithm is represented through pseudo codes, normal language sentences or
flow charts.
advertisement

10. There are two algorithms suppose A takes 1.41 milli seconds while B takes 0.9
milliseconds, which one of them is better considering all other things the same?
a) A is better than B
b) B is better than A
c) Both are equally good
d) None of the mentioned
View Answer

Answer: b
Explanation: B takes less time than A for the same task.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Algorithms
» Next - Discrete Mathematics Questions and Answers – Algorithms – Complexity-1
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Algorithms
Discrete Mathematics Questions and Answers – Algorithms – Complexity-1
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Hard Graph Problems & Algorithms

2. C Programming Examples on Hard Graph Problems & Algorithms
3. Java Programming Examples on Graph Problems & Algorithms
4. C Algorithms, Problems & Programming Examples
5. C Programming Examples on Graph Problems & Algorithms
6. C++ Programming Examples on Numerical Problems & Algorithms
7. C Programming Examples on Numerical Problems & Algorithms
8. Java Programming Examples on Numerical Problems & Algorithms
9. C++ Programming Examples on Combinatorial Problems & Algorithms
10. Java Algorithms, Problems & Programming Examples
11. C Programming Examples on Combinatorial Problems & Algorithms
12. Java Programming Examples on Set & String Problems & Algorithms
13. C++ Programming Examples on Set & String Problems & Algorithms
14. Java Programming Examples on Combinatorial Problems & Algorithms
15. Discrete Mathematics Questions and Answers
16. C Programming Examples on Set & String Problems & Algorithms
17. C++ Algorithms, Problems & Programming Examples
18. Discrete Mathematics Questions and Answers – Logics – Types of Statements
19. Discrete Mathematics Questions and Answers – Number Theory – Highest Common
Factors
20. Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples

advertisement

Discrete Mathematics Questions and

Answers – Algorithms – Complexity-1
« Prev
Next »
This set of Discrete Mathematics Multiple Choice s & Answers (MCQs) focuses on
“Algorithms – Complexity-1”.

1. Which of the following case does not exist in complexity theory?

a) Best case
b) Worst case
c) Average case
d) Null case
View Answer

Answer: d
Explanation: Null case does not exist in complexity Theory.
advertisement

2. The complexity of linear search algorithm is _________

a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer

Answer: a
Explanation: The worst case complexity of linear search is O(n).

3. The complexity of Binary search algorithm is _________

a) O(n)
b) O(log)
c) O(n2)
d) O(n log n)
View Answer

Answer: b
Explanation: The compexity of binary search is O(logn).

4. The complexity of merge sort algorithm is _________

a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer

Answer: d
Explanation: The worst case complexity for merge sort is O(nlogn).

5. The complexity of Bubble sort algorithm is _________

a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer
Answer: c
Explanation: The worst case complexity for Bubble sort is O(n2) and best case is O(n).
advertisement

6. The Worst case occur in linear search algorithm when _________

a) Item is somewhere in the middle of the array
b) Item is not in the array at all
c) Item is the last element in the array
d) Item is the last element in the array or is not there at all
View Answer

Answer: d
Explanation: The Worst case occur in linear search algorithm when Item is the last element in
the array or is not there at all.

7. The worst case complexity for insertion sort is _________

a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer

Answer: c
Explanation: In worst case nth comparison are required to insert the nth element into correct
position.

8. The complexity of Fibonacci series is _________

a) O(2n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer

Answer: a
Explanation: Fibonacci is f(n) = f(n-1) + f(n-2), f(0) = 0, f(1) = 1. Let g(n) = 2n. Now prove
inductively that f(n) > = g(n).

9. The worst case occurs in quick sort when _________

a) Pivot is the median of the array
b) Pivot is the smallest element
c) Pivot is the middle element
d) None of the mentioned
View Answer

Answer: b
Explanation: This happens when the pivot is the smallest (or the largest) element. Then one
of the partitions is empty, and we repeat recursively the procedure for N-1 elements.
advertisement
10. The worst case complexity of quick sort is _________
a) O(n)
b) O(log n)
c) O(n2)
d) O(n log n)
View Answer

Answer: c
Explanation: The worst case complexity of quick sort is O(n2).

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Algorithms – Types
» Next - Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Algorithms – Types
Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Computational Geometry Problems & Algorithms

2. C Programming Examples on Numerical Problems & Algorithms
3. C++ Programming Examples on Computational Geometry Problems & Algorithms
4. C++ Programming Examples on Set & String Problems & Algorithms
5. C Programming Examples on Computational Geometry Problems & Algorithms
6. C Programming Examples on Set & String Problems & Algorithms
7. Java Programming Examples on Graph Problems & Algorithms
8. C++ Programming Examples on Graph Problems & Algorithms
9. C Programming Examples using Recursion
10. Java Algorithms, Problems & Programming Examples
11. C Programming Examples on Graph Problems & Algorithms
12. C++ Algorithms, Problems & Programming Examples
13. Discrete Mathematics Questions and Answers
14. Data Structures & Algorithms II – Questions and Answers
15. C# Programming Examples on Sorting
16. Python Programming Examples on Searching and Sorting
17. C++ Programming Examples on Combinatorial Problems & Algorithms
18. Java Programming Examples on Combinatorial Problems & Algorithms
19. C Programming Examples on Searching and Sorting
20. C Programming Examples on Combinatorial Problems & Algorithms
 advertisement

Discrete Mathematics Questions and

Answers – Algorithms – Complexity-2
« Prev
Next »

This set of Discrete Mathematics Questions and Answers for Freshers focuses on
“Algorithms – Complexity-2”.

1. Which is used to measure the Time complexity of an algorithm Big O notation?

a) describes limiting behaviour of the function
b) characterises a function based on growth of function
c) upper bound on growth rate of the function
d) all of the mentioned
View Answer

Answer: d
Explanation: Big O notation describes limiting behaviour, and also gives upper bound on
growth rate of a function.
advertisement

2. If for an algorithm time complexity is given by O(1) then the complexity of it is

____________
a) constant
b) polynomial
c) exponential
d) none of the mentioned
View Answer

Answer: a
Explanation: The growth rate of that function will be constant.

3. If for an algorithm time complexity is given by O(log2n) then complexity will be

___________
a) constant
b) polynomial
c) exponential
d) none of the mentioned
View Answer

Answer: d
Explanation: The growth rate of that function will be logarithmic therefore complexity will
be logarithmic.

4. If for an algorithm time complexity is given by O(n) then the complexity of it is

___________
a) constant
b) linear
c) exponential
d) none of the mentioned
View Answer

Answer: b
Explanation: The growth rate of that function will be linear.

5. If for an algorithm time complexity is given by O(n2) then complexity will ___________
a) constant
b) quadratic
c) exponential
d) none of the mentioned
View Answer

Answer: b
Explanation: The growth rate of that function will be quadratic therefore complexity will be
quadratic.
advertisement

6. If for an algorithm time complexity is given by O((3⁄2)n) then complexity will be

___________
a) constant
b) quardratic
c) exponential
d) none of the mentioned
View Answer

Answer: c
Explanation: The growth rate of that function will be exponential therefore complexity will
be exponential.

7. The time complexity of binary search is given by ___________

a) constant
b) quardratic
c) exponential
d) none of the mentioned
View Answer

Answer: d
Explanation: It is O(log2n), therefore complexity will be logarithmic.

8. The time complexity of the linear search is given by ___________

a) O(log2n)
b) O(1)
c) exponential
d) none of the mentioned
View Answer
Answer: d
Explanation: It is O(n), therefore complexity will be linear.

9. Which algorithm is better for sorting between bubble sort and quicksort?
a) bubble sort
b) quick sort
c) both are equally good
d) none of the mentioned
View Answer

Answer: b
Explanation: Running time of quicksort is logarithmic whereas for bubble sort it is quadratic.
advertisement

10. Time complexity of the binary search algorithm is constant.

a) True
b) False
View Answer

Answer: b
Explanation: It is O(log2n), therefore complexity will be logarithmic.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Freshers, here is complete set of 1000+
Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Algorithms – Complexity-1
» Next - Discrete Mathematics Questions and Answers – Integers and Algorithms
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Algorithms – Complexity-1
Discrete Mathematics Questions and Answers – Integers and Algorithms
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Computational Geometry Problems & Algorithms

2. C Programming Examples on Searching and Sorting
3. Python Programming Examples on Searching and Sorting
4. C++ Programming Examples on Computational Geometry Problems & Algorithms
5. C++ Programming Examples on Set & String Problems & Algorithms
6. Java Programming Examples on Set & String Problems & Algorithms
7. C++ Programming Examples on Numerical Problems & Algorithms
8. Java Programming Examples on Numerical Problems & Algorithms
 9. C Programming Examples on Set & String Problems & Algorithms
10. C++ Programming Examples on Graph Problems & Algorithms
11. C Programming Examples on Numerical Problems & Algorithms
12. Java Programming Examples on Graph Problems & Algorithms
13. C Programming Examples on Graph Problems & Algorithms
14. Java Algorithms, Problems & Programming Examples
15. C++ Programming Examples on Combinatorial Problems & Algorithms
16. Java Programming Examples on Combinatorial Problems & Algorithms
17. Data Structures & Algorithms II – Questions and Answers
18. C Programming Examples on Combinatorial Problems & Algorithms
19. C++ Algorithms, Problems & Programming Examples
20. Discrete Mathematics Questions and Answers – Number Theory – Modular
Exponentiation

advertisement

Discrete Mathematics Questions and

Answers – Integers and Algorithms
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Integers and Algorithms”.

1. The binary notation of 231 is ___________

a) (11010111)2
b) (10111011)2
c) (11100011)2
d) (11100111)2
View Answer

Answer: d
Explanation: By binary Expansion of 11100111 is 1*20 + 1*21 + 1*22 + 1*25 + 1*26 + 1*27 is
equal to 231.
advertisement

2. The decimal notation of 101010101 is ___________

a) 34010
b) 34110
c) 34210
d) 31510
View Answer

Answer: b
Explanation: (101010101)2 = 1*20 + 1*22 + 1*24 + 1*26 + 1*28 = 341.

3. The binary notation of ABBA is ___________

a) 1010 1011 1011 1010
b) 1010 1001 1011 1011
c) 1011 1000 1010 1001
d) 1001 1000 1000 1111
View Answer

Answer: a
Explanation: By the base conversion algorithm.

4. The hexadecimal notation of (1011 0111 1011)2 is ___________

a) (B2B)16
b) (B5B)16
c) (B7B)16
d) (A7B)16
View Answer

Answer: c
Explanation: (1011)2 = 11 and (0111)2 = 7, 11 in hexadecimal notation represents B. So it is
(B7B)16.

5. The octal expansion of (10 1011 1011)2 is ___________

a) (1245)8
b) (1276)8
c) (1275)8
d) (1273)8
View Answer

Answer: d
Explanation: (10 1011 1011)2 = (699)10. Using base conversion algorithm, (699)10 = (1273)8.
advertisement

6. The hexadecimal expansion of (177130)10 is ___________

a) (2B3EB)16
b) (2B3EA)16
c) (2C3AA)16
d) (2B2AA)16
View Answer

Answer: b
Explanation: Successively divide 177130 by 16 to obtain remainder they are (2B3EA)16.

7. The greatest common divisor of 414 and 662 is?

a) 4
b) 5
c) 2
d) 6
View Answer

Answer: c
Explanation: By using Euclid Lemma.
8. The greatest common divisor of 12 and 18 is?
a) 2
b) 3
c) 4
d) 6
View Answer

Answer: d
Explanation: By using Euclid Lemma, 6 divides 12 and 18.

9. The decimal expansion of (2AE0B)16 is?

a) (175627)10
b) (175624)10
c) (178566)10
d) (175622)10
View Answer

Answer: a
Explanation: (2AE0B)16 = 2*164 + 10*163 + 14*162 + 0*16+11 = (175627)10.
advertisement

10. The greatest common divisor of 7 and 5 is?

a) 1
b) 2
c) 5
d) 7
View Answer

Answer: a
Explanation: Two numbers 7 and 5 are relatively prime, so gcd(7, 5) = 1.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
» Next - Discrete Mathematics Questions and Answers – Algorithms – Integers and Division
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
Discrete Mathematics Questions and Answers – Algorithms – Integers and Division
advertisement
advertisement

Recommended Posts:
 1. C Programming Examples on Hard Graph Problems & Algorithms
2. Java Programming Examples on Hard Graph Problems & Algorithms
3. C++ Programming Examples on Set & String Problems & Algorithms
4. C Programming Examples on Set & String Problems & Algorithms
5. C++ Algorithms, Problems & Programming Examples
6. C++ Programming Examples on Hard Graph Problems & Algorithms
7. C Algorithms, Problems & Programming Examples
8. Java Programming Examples on Graph Problems & Algorithms
9. Data Structures & Algorithms II – Questions and Answers
10. Java Algorithms, Problems & Programming Examples
11. Java Programming Examples on Combinatorial Problems & Algorithms
12. C++ Programming Examples on Combinatorial Problems & Algorithms
13. C Programming Examples on Graph Problems & Algorithms
14. C Programming Examples on Combinatorial Problems & Algorithms
15. C++ Programming Examples on Graph Problems & Algorithms
16. C Programming Examples on Numerical Problems & Algorithms
17. Java Programming Examples on Numerical Problems & Algorithms
18. C++ Programming Examples on Numerical Problems & Algorithms
19. C# Programming Examples on Conversions
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Algorithms – Integers and
Division
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Algorithms – Integers and Division”.

1. The quotient when 19 is divided by 6 is?

a) 1
b) 2
c) 3
d) 0
View Answer

Answer: c
Explanation: According to the Division Algorithm 19 = 6(3) + 1. Hence, quotient when 19
divided by 6 is 3 = 19 div 6.
advertisement

2. The remainder when 111 is divided by 12 is?

a) 0
b) 1
c) 2
d) 3
View Answer

Answer: d
Explanation: According to the Division Algorithm 111 = 12(9) + 3. Hence, remainder when
111 divided by 12 is 3 = 111 mod 12.

3. The quotient and remainder when -1 is divided by 3 is?

a) -1 and -1
b) -1 and 2
c) 1 and 2
d) -1 and -2
View Answer

Answer: b
Explanation: According to the Division Algorithm -1 = 3(-1) + 2. Hence, quotient when -1
divided by 3 is -1 = -1 div 3 and remainder when -1 divided by 3 is 2 = -1 mod 3.

4. The value of 12 mod 3 is?

a) 0
b) 1
c) 2
d) 3
View Answer

Answer: a
Explanation: By the Division algorithm 12 = 3(4) + 0. Where remainder is 12 mod 3.

5. The value of 155 mod 9 is?

a) 0
b) 1
c) 2
d) 3
View Answer

Answer: c
Explanation: By the Division algorithm 155 = 9(17) + 2. Where remainder is 155 mod 9.
advertisement

6. Is 17 congruent to 4 modulo 6.
a) True
b) False
View Answer

Answer: b
Explanation: 6 does not divide 17 – 4 = 13.

7. If a|b and a|c, then?

a) a|bc
b) c|a
c) a|(b+c)
d) b|a
View Answer

Answer: c
Explanation: If a|b and a|c then b = am and c = an for some integer m and n. Hence, b + c =
a(m + n). Therefore, a|(b+c).

8. Is 102 congruent to 6 modulo 16.

a) True
b) False
View Answer

Answer: a
Explanation: 16 divide 102 – 6 = 96.

9. The quotient and remainder when 18 is divided by 5 is?

a) 2 and 3
b) 1 and 2
c) 3 and 2
d) 3 and 3
View Answer

Answer: d
Explanation: According to the Division Algorithm 18 = 5(3) + 3. Hence, quotient when 18
divided by 5 is 3 = 18 div 5 and remainder when 18 divided by 5 is 3 = 18 mod 5.
advertisement

10. The value of 15 mod 11 is?

a) 1
b) 2
c) 3
d) 4
View Answer

Answer: d
Explanation: By the Division algorithm 15 = 11(1) + 4. Where the remainder is 15 mod 11.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Integers and Algorithms
» Next - Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Integers and Algorithms
Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Combinatorial Problems & Algorithms

2. C Programming Examples on Hard Graph Problems & Algorithms
3. C++ Programming Examples on Graph Problems & Algorithms
4. C Programming Examples on Computational Geometry Problems & Algorithms
5. C++ Programming Examples on Numerical Problems & Algorithms
6. C++ Programming Examples on Computational Geometry Problems & Algorithms
7. C Programming Examples on Combinatorial Problems & Algorithms
8. Java Programming Examples on Graph Problems & Algorithms
9. Java Programming Examples on Computational Geometry Problems & Algorithms
10. Java Programming Examples on Combinatorial Problems & Algorithms
11. C Programming Examples on Numerical Problems & Algorithms
12. Java Programming Examples on Numerical Problems & Algorithms
13. Java Programming Examples on Set & String Problems & Algorithms
14. C Programming Examples on Graph Problems & Algorithms
15. C++ Programming Examples on Hard Graph Problems & Algorithms
16. C++ Programming Examples on Set & String Problems & Algorithms
17. C++ Algorithms, Problems & Programming Examples
18. C Programming Examples on Set & String Problems & Algorithms
19. Java Algorithms, Problems & Programming Examples
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Prime
Numbers
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Number Theory – Prime Numbers”.

1. The number of factors of prime numbers are ___________

a) 2
b) 3
c) Depends on the prime number
d) None of the mentioned
View Answer
Answer: a
Explanation: A prime number is only divisible by 1 and itself.
advertisement

2. What is the number ‘ 1’?

a) Prime number
b) Composite number
c) Neither Prime nor Composite
d) None of the mentioned
View Answer

Answer: c
Explanation: 1 is neither prime number nor composite.

3. All prime numbers are odd.

a) True
b) False
View Answer

Answer: b
Explanation: 2 is even as well as prime.

4. 3 is the smallest prime number possible.

a) True
b) False
View Answer

Answer: b
Explanation: 2 is also a prime number.

5. How many prime numbers are there between 1 to 20?

a) 5
b) 6
c) 7
d) None of the mentioned
View Answer

Answer: d
Explanation: The prime numbers between 1 to 20 are 2, 3, 5, 7, 11, 13, 17, 19.
advertisement

6. There are finite number of prime numbers.

a) True
b) False
View Answer

Answer: b
Explanation: There are infinite numbers of primes.
7. Sum of two different prime number is a ____________
a) Prime number
b) Composite number
c) Either Prime or Composite
d) None of the mentioned
View Answer

Answer: c
Explanation: Eg:- 2 + 3 = 5 a prime, 3 + 7 = 10 a composite.

8. Difference of two distinct prime numbers is?

a) Odd and prime
b) Even and composite
c) None of the mentioned
d) All of the mentioned
View Answer

Answer: c
Explanation: 3 – 2 = 1 is neither prime nor composite.

9. If a, b, c, d are distinct prime numbers with an as smallest prime then a * b * c * d is a

___________
a) Odd number
b) Even number
c) Prime number
d) None of the mentioned
View Answer

Answer: b
Explanation: Since a is 2, 2 * b * c * d = Even number.
advertisement

10. If a, b are two distinct prime number than a highest common factor of a, b is
___________
a) 2
b) 0
c) 1
d) ab
View Answer

Answer: c
Explanation: HCF of two prime numbers is 1.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Algorithms – Integers and Division
» Next - Discrete Mathematics Questions and Answers – Number Theory – Quadratic
Residue and Pseudo Prime
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Algorithms – Integers and Division
Discrete Mathematics Questions and Answers – Number Theory – Quadratic Residue and
Pseudo Prime
advertisement
advertisement

Recommended Posts:

1. Theory of Machines Questions and Answers

2. Automata Theory Questions and Answers
3. Electromagnetic Theory Questions and Answers
4. C Programming Examples on Strings
5. Python Programming Examples
6. C# Programming Examples
7. C Programming Examples on Arrays
8. Java Programming Examples on Arrays
9. C# Basic Programming Examples
10. Java Programming Examples on Mathematical Functions
11. Java Programming Examples on Numerical Problems & Algorithms
12. Simple C Programs
13. C Programming Examples on Numerical Problems & Algorithms
14. C# Programming Examples on LINQ
15. C Programming Examples on Mathematical Functions
16. C++ Programming Examples on Numerical Problems & Algorithms
17. Engineering Mathematics Questions and Answers
18. C Programming Examples using Recursion
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Quadratic
Residue and Pseudo Prime
« Prev
Next »

This set of Discrete Mathematics online quiz focuses on “Number Theory – Quadratic
Residue and Pseudo Prime”.
1. If there exist an integer x such that x2 ≡ q (mod n). then q is called ______________
a) Quadratic Residue
b) Linear Residue
c) Pseudoprime
d) None of the mentioned
View Answer

Answer: a
Explanation: q is called quadratic residue if it is congruent to a perfect square modulo n.
advertisement

2. If there exist no integer x such that x2 ≡ q (mod n). then q is called __________
a) Quadratic Residue
b) Quadratic Nonresidue
c) Pseudoprime
d) None of the mentioned
View Answer

Answer: b
Explanation: q is called quadratic nonresidue if it is not congurent to a perfect square modulo
n.

3. The Fermat’s little theorem for odd prime p and coprime number a is?
a) ap-1 ≡ 1 (mod p)
b) ap-1 ≡ 7 (mod p)
c) ap(2)-1 ≡ 1 (mod p)
d) none of the mentioned
View Answer

Answer: a
Explanation: According to Fermat’s little theorem ap-1 ≡ 1 (mod p).

4. 5 is quardratic non-residue of 7.
a) True
b) False
View Answer

Answer: a
Explanation: Since there exists no number which gives 5 modulo 7 when squared.

5. 4 is quardratic residue of 7.
a) True
b) False
View Answer

Answer: a
Explanation: Since 25 ≡ 4(mod)7, 4 is quardratic residue of 7.
advertisement
6. 8 is quardratic residue of 17.
a) True
b) False
View Answer

Answer: a
Explanation: Since 25 ≡ 8(mod)17.

7. 8 is quardratic residue of 11.

a) True
b) False
View Answer

Answer: b
Explanation: Since x2 ≡ 8(mod)17 has no solutions.

8. Which of the following is a quardratic residue of 11?

a) 4
b) 5
c) 9
d) All of the mentioned
View Answer

Answer: d
Explanation: Since 4, 16, 32 satisfies the criteria, all are quardratic residue of 11.

9. What is pseudo prime number?

a) is a probable prime and is not a prime number
b) is a prime number
c) does not share any property with prime number
d) none of the mentioned
View Answer

Answer: a
Explanation: A pseudo prime number is an integer that shares a property common to all
prime number and is not a prime number.
advertisement

10. Pseudo prime are classified based on property which they satisfy, which of the following
are classes of pseudoprimes?
a) Fermat pseudoprime
b) Fibonacci pseudoprime
c) Euler pseudoprime
d) All of the mentioned
View Answer

Answer: d
Explanation: Fermat pseudoprime, Fibonacci pseudoprime, Euler pseudoprime are different
classes of pseudoprimes.
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for online Quizzes, here is complete set of
1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
» Next - Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
Discrete Mathematics Questions and Answers – Number Theory – Least Common Multiples
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Data-Structures

2. Java Programming Examples on Numerical Problems & Algorithms
3. C Programming Examples on Data-Structures
4. Theory of Machines Questions and Answers
5. Network Theory Questions and Answers
6. Automata Theory Questions and Answers
7. Electromagnetic Theory Questions and Answers
8. C++ Programming Examples on Numerical Problems & Algorithms
9. C Programming Examples on Numerical Problems & Algorithms
10. Java Programming Examples on Mathematical Functions
11. C Programming Examples on Mathematical Functions
12. Engineering Mathematics Questions and Answers
13. C# Programming Examples on Mathematics
14. Discrete Mathematics Questions and Answers
15. Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
16. VLSI Questions and Answers – Pseudo-Random Test Patterns-2
17. C Program to Implement Sieve of eratosthenes to Generate Prime Numbers Between
Given Range
18. Discrete Mathematics Questions and Answers – Number Theory and Cryptography –
Rules of Exponents
19. Discrete Mathematics Questions and Answers – Permutation Groups
20. C Program to Implement the Rabin-Miller Primality Test to Check if a Given Number
is Prime

advertisement
Discrete Mathematics Questions and
Answers – Number Theory – Least
Common Multiples
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Number Theory – Least Common Multiples”.

1. A Least Common Multiple of a, b is defined as __________

a) It is the smallest integer divisible by both a and b
b) It is the greatest integer divisible by both a and b
c) It is the sum of the number a and b
d) None of the mentioned
View Answer

Answer: a
Explanation: Definition of LCM(a, b)-smallest multiple of a and b.
advertisement

2. The LCM of two number 1, b(integer) are _________

a) b + 2
b) 1
c) b
d) None of the mentioned
View Answer

Answer: c
Explanation: Since b is the smallest integer divisible by 1 and b.

3. If a, b are integers such that a > b then lcm(a, b) lies in _________

a) a>lcm(a, b)>b
b) a>b>lcm(a, b)
c) lcm(a, b)>=a>b
d) none of the mentioned
View Answer

Answer: c
Explanation: LCM of number is either equal to the biggest number or greater than all.

4. LCM of 6, 10 is?
a) 60
b) 30
c) 10
d) 6
View Answer
Answer: b
Explanation: Since 30 is the smallest integer divisible by 6 and 10.

5. The product of two numbers are 12 and their Greatest common divisor is 2 then LCM is?
a) 12
b) 2
c) 6
d) None of the mentioned
View Answer

Answer: c
Explanation: The lcm of two number a and b is given by
lcm(a, b) = ab/(GCD(a, b)).
advertisement

6. If LCM of two number is 14 and GCD is 1 then the product of two numbers is?
a) 14
b) 15
c) 7
d) 49
View Answer

Answer: a
Explanation: The lcm of two number a and b is given by
lcm(a, b) = ab/(GCD(a, b)), this implies ab = lcm(a, b) * gcd(a, b).

7. If a number is 22 x 31 x 50 and b is 21 x 31 x 51 then lcm of a, b is?

a) 22 x 31 x 51
b) 22 x 32 x 52
c) 23 x 31 x 50
d) 22 x 32 x 50
View Answer

Answer: a
Explanation: Lcm is the product of sets having highest exponent value among a and b.

8. State whether the given statement is True or False.

LCM (a, b, c, d) = LCM(a,(LCM(b,(LCM(c, d)))).
a) True
b) False
View Answer

Answer: a
Explanation: LCM function can be reursively defined.

9. LCM(a, b) is equals to _________

a) ab/(GCD(a, b))
b) (a+b)/(GCD(a, b))
c) (GCD(a, b))/ab
d) none of the mentioned
View Answer

Answer: a
Explanation: ab = lcm(a, b)*gcd(a, b), which implies
LCM(a,b) = ab/(GCD(a,b)).
advertisement

10. The lcm of two prime numbers a and b is _________

a) a⁄b
b) ab
c) a + b
d) 1
View Answer

Answer: b
Explanation: LCM(a, b) = ab/(GCD(a, b)), Since (GCD(a, b)) = 1 therfore LCM(a, b) = ab.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Quadratic
Residue and Pseudo Prime
» Next - Discrete Mathematics Questions and Answers – Number Theory – Highest Common
Factors
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Quadratic Residue and
Pseudo Prime
Discrete Mathematics Questions and Answers – Number Theory – Highest Common Factors
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples
2. C++ Programming Examples on Numerical Problems & Algorithms
3. C++ Programming Examples on Combinatorial Problems & Algorithms
4. C Programming Examples on Numerical Problems & Algorithms
5. C Programming Examples on Searching and Sorting
6. Java Programming Examples on Combinatorial Problems & Algorithms
7. Electromagnetic Theory Questions and Answers
8. Python Programming Examples
9. C# Basic Programming Examples
 10. C Programming Examples on Combinatorial Problems & Algorithms
11. C Programming Examples on Bitwise Operations
12. C# Programming Examples on LINQ
13. Java Programming Examples on Arrays
14. C Programming Examples on Arrays
15. Engineering Mathematics Questions and Answers
16. Simple Java Programs
17. C Programming Examples using Recursion
18. Simple C Programs
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Highest
Common Factors
« Prev
Next »

This set of Discrete Mathematics Questions and Answers for Campus interviews focuses on
“Number Theory – Highest Common Factors”.

1. A Highest Common Factor of a, b is defined as ___________

a) It is the smallest integer divisible by both a and b
b) It is the greatest integer divisor of both a and b
c) It is the sum of the number a and b
d) None of the mentioned
View Answer

Answer: b
Explanation: Defination of HCF(a, b)-greatest integer divisor of both a and b.
advertisement

2. The HCF of two number 1, b(integer) are _________

a) b + 2
b) 1
c) b
d) None of the mentioned
View Answer

Answer: b
Explanation: Since 1 is the greatest integer divisor of both 1 and b.

3. If a,b are integers such that a > b then hcf(a, b) lies in _________
a) a> hcf(a, b)>b
b) a>b> = hcf(a, b)
c) hcf(a, b)> = a>b
d) None of the mentioned
View Answer

Answer: b
Explanation: Hcf of number is either equal to smallest number or is least among all.

4. HCF of 6, 10 is?
a) 60
b) 30
c) 10
d) 2
View Answer

Answer: d
Explanation: Since 2 is the greatest integer divisor of both 6 and 10.

5. The product of two numbers are 12 and there LCM is 6 then HCF is?
a) 12
b) 2
c) 6
d) None of the mentioned
View Answer

Answer: b
Explanation: The hcf of two number a and b is given by
(hcf(a, b)) = ab/ lcm(a, b).
advertisement

6. If LCM of two number is 10 and GCD is 5 then the product of two numbers is?
a) 45
b) 50
c) 7
d) 49
View Answer

Answer: b
Explanation: The lcm of two number a and b is given by
lcm(a,b) = ab/(GCD(a, b)), this implies ab = lcm(a, b) * gcd(a, b).

7. If a number is 22 x 31 x 50 and b is 22 x 31 x 51 then hcf of a, b is?

a) 22 x 31 x 51
b) 22 x 32 x 52
c) 21 x 31 x 50
d) 22 x 32 x 50
View Answer

Answer: c
Explanation: Hcf is the product of sets having least exponent value among a and b.
8. State whether the given statement is True or False.

HCF (a, b, c, d) = HCF(a,(HCF(b,(HCF(c, d)))).

a) True
b) False
View Answer

Answer: a
Explanation: HCF function can be reursively defined.
advertisement

9. HCF(a, b) is equals to _________

a) ab/(LCM(a, b))
b) (a + b)/(LCM(a, b))
c) (LCM(a, b))/ab
d) None of the mentioned
View Answer

Answer: a
Explanation: ab = lcm(a, b)*hcf(a, b), which implies
HCF(a,b) = ab/(LCM(a, b)).

10. The HCF of two prime numbers a and b is _________

a) a⁄b
b) ab
c) a + b
d) 1
View Answer

Answer: d
Explanation: Since they doesnot have any factor in common other than 1.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics for Campus Interviews, here is complete set of
1000+ Multiple Choice Questions and Answers.

advertisement

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Least Common
Multiples
» Next - Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Least Common Multiples
Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
advertisement
advertisement

Recommended Posts:

1. Automata Theory Questions and Answers

2. Network Theory Questions and Answers
3. Bachelor of Computer Applications Questions and Answers
4. Theory of Machines Questions and Answers
5. Java Programming Examples on Numerical Problems & Algorithms
6. C Programming Examples on Arrays
7. C++ Programming Examples on Numerical Problems & Algorithms
8. C Programming Examples on Numerical Problems & Algorithms
9. C# Programming Examples
10. C Programming Examples without using Recursion
11. Electromagnetic Theory Questions and Answers
12. Simple Java Programs
13. C Programming Examples on Bitwise Operations
14. C# Programming Examples on LINQ
15. C# Basic Programming Examples
16. C Programming Examples using Recursion
17. Engineering Mathematics Questions and Answers
18. Simple C Programs
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Base
Conversion
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Number Theory – Base Conversion”.

1. Which of the number is not allowed in Binary representation of a number?

a) 0
b) 1
c) 2
d) None of the mentioned
View Answer

Answer: c
Explanation: Binary numbers are formed with a combination of 0 & 1 only.
 advertisement

2. Which of the number is not allowed in Octal representation of a number?

a) 0
b) 4
c) 8
d) None of the mentioned
View Answer

Answer: c
Explanation: Octal numbers are formed with a combination of 0 to 7 only.

3. Hexadecimal number equivalent of decimal 10 is?

a) 10
b) A
c) F
d) None of the mentioned
View Answer

Answer: b
Explanation: In hexadecimal representation A is represented as decimal 10.

4. Decimal equivalent of binary number 1010 is?

a) 11
b) A
c) 10
d) None of the mentioned
View Answer

Answer: c
Explanation: 0X1 + 1X2 + 0X4 + 1X8 = 10 in decimal.

5. Decimal 13 in base 8 can be represented as _________

a) 15
b) 12
c) 22
d) None of the mentioned
View Answer

Answer: a
Explanation: 1X8 + 5X1 = 12, 15 is the octal representation of 13.
advertisement

6. F in hexadecimal representation is equivalent to 9 in decimal.

a) True
b) False
View Answer

Answer: b
Explanation: F in hexadecimal representation is equivalent to 15 in decimal.
7. Octal number may contain digits from 1 to 8.
a) True
b) False
View Answer

Answer: b
Explanation: Octal number contains digits from 0 to 7, * is not allowed.

8. For some base r, the digits which are allowed in its representation are?
a) Digits from 1 to r
b) Digits from 0 to r-1
c) Digits from 1 to r-1
d) None of the mentioned
View Answer

Answer: b
Explanation: A base r number may contain digits from 0 to r-1.

9. The binary number 100110 in octal is represented by _______________

a) 45
b) 10012
c) 46
d) 58
View Answer

Answer: c
Explanation: Pairing 3 numbers from right hand side we get 110 as 6 and 100 as 4 in octal so
the number is 46.
advertisement

10. A number greater than 32 would require a minimum of how may bits in binary
representation?
a) 5
b) 6
c) 4
d) 10
View Answer

Answer: b
Explanation: Since through 5 bits we can only represent numbers till 31 since 25 = 32 we
need greater than 5 bits, so minimum would be 6.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Highest Common
Factors
» Next - Discrete Mathematics Questions and Answers – Number Theory – Complement of a
Number
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Highest Common Factors
Discrete Mathematics Questions and Answers – Number Theory – Complement of a Number
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Data-Structures

2. C Programming Examples on Searching and Sorting
3. C++ Programming Examples on Numerical Problems & Algorithms
4. Python Programming Examples
5. Digital Signal Processing Questions and Answers
6. C Programming Examples
7. C# Programming Examples on Functions
8. C Programming Examples without using Recursion
9. Computer Fundamentals Questions and Answers
10. Engineering Mathematics Questions and Answers
11. C# Programming Examples
12. C Programming Examples on Bitwise Operations
13. C# Basic Programming Examples
14. C Programming Examples using Recursion
15. C# Programming Examples on Mathematics
16. Simple Java Programs
17. Discrete Mathematics Questions and Answers
18. Java Programming Examples on Mathematical Functions
19. Simple C Programs
20. C# Programming Examples on Conversions

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Complement
of a Number
« Prev
Next »

This set of Discrete Mathematics Question Bank focuses on “Number Theory – Complement
of a Number”.
1. One’s complement in binary is defined as _________
a) Flipping each binary bit
b) Adding one to the binary number
c) Flipping only bits having zero in it
d) None of the mentioned
View Answer

Answer: a
Explanation: While taking 1’s complement we replace 1 with zero and vice versa.
advertisement

2. What is the one’s complement of the number 1010110?

a) 1111111
b) 0101001
c) 1100110
d) None of the mentioned
View Answer

Answer: b
Explanation: While taking 1’s complement we replace 1 with zero and vice versa.

3. One’s complement of a number x is y, then one’s complement of y is?

a) y
b) x
c) x + y
d) None of the mentioned
View Answer

Answer: b
Explanation: Complement of Complement of number gives the same number.

4. Nine’s complement of a number is formed by _________

a) replacing each digit by 9 minus that digit
b) replacing each digit by 1plus that digit
c) replacing each digit by 8 minus that digit
d) None of the mentioned
View Answer

Answer: a
Explanation: Nine’s complement of a number is formed by replacing each digit by 9 minus
that digit.

5. Radix complement can be obtained fromdiminished radix’s complement by _________

a) Adding one to diminished radox’s complement
b) Subtracting one to diminished radox’s complement
c) Both are same things
d) None of the mentioned
View Answer
Answer: a
Explanation: Radix complement = diminished radix complement +1.
advertisement

6. In binary signed representation if most significant bit is one then that number is positive.
a) True
b) False
View Answer

Answer: b
Explanation: In signed representation, if the most significant bit is one then that number is
negative, for positive numbers msb = 0.

7. In signed representation 5 is represented in binary as 0101.

a) True
b) False
View Answer

Answer: a
Explanation: Here msb is the signed bit which is zero, 101 evaluates to 5 hence it is +5.

8. The two’s complement of 101110100 is represented as?

a) 010001100
b) 101110101
c) 010001100
d) None of the mentioned
View Answer

Answer: a
Explanation: 2’s complement = 1’s complement +1, 1’s complement = 010001011.

9. 9’s complement of 23456 is?

a) 87654
b) 76543
c) 12345
d) none of the mentioned
View Answer

Answer: b
Explanation: Nine’s complement of a number is formed by replacing each digit by 9 minus
that digit.
advertisement

10. Decimal equivalent of one’s complement of 11111001 is?

a) 5
b) 6
c) 4
d) 10
View Answer
Answer: b
Explanation: One’s complement of that number is 00000110 which is 6 in decimal.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice Discrete Mathematics Question Bank, here is complete set of 1000+ Multiple
Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
» Next - Discrete Mathematics Questions and Answers – Number Theory and Cryptography
– Rules of Exponents
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
Discrete Mathematics Questions and Answers – Number Theory and Cryptography – Rules
of Exponents
advertisement
advertisement

Recommended Posts:

1. C Programming Examples
2. Bachelor of Computer Applications Questions and Answers
3. Theory of Machines Questions and Answers
4. Network Theory Questions and Answers
5. Electromagnetic Theory Questions and Answers
6. C# Programming Examples on Conversions
7. Java Programming Examples on Combinatorial Problems & Algorithms
8. Signals & Systems Questions and Answers
9. C Programming Examples on Combinatorial Problems & Algorithms
10. Digital Signal Processing Questions and Answers
11. Simple Java Programs
12. C++ Programming Examples on Combinatorial Problems & Algorithms
13. Simple C Programs
14. Automata Theory Questions and Answers
15. C# Programming Examples
16. Engineering Mathematics Questions and Answers
17. Python Programming Examples on Searching and Sorting
18. C# Programming Examples on Sorting
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement
Discrete Mathematics Questions and
Answers – Number Theory and
Cryptography – Rules of Exponents
« Prev
Next »

This set of Basic Discrete Mathematics Questions and Answers focuses on “Number Theory
and Cryptography – Rules of Exponents”.

1. For some number b, (1⁄b)-n is equal to _________

a) -bn
b) nb
c) bn
d) none of the mentioned
View Answer

Answer: c
Explanation: b-1 reciprocal of b.
advertisement

2. If ab = 1, where a and b are real numbers then?

a) a = b-1
b) b = a
c) a = b = 2
d) none of the mentioned
View Answer

Answer: a
Explanation: This means that a is inverse of b or b is inverse of a.

3. If a is a real number than a0 is defined as _________

a) 0
b) a
c) 1
d) -1
View Answer

Answer: a
Explanation: Any number to the power zero is one.

4. For some number a, b and c, ca x cb is equal to _________

a) ca-b
b) ca+b
c) c
d) none of the mentioned
View Answer
Answer: b
Explanation: If base are same then exponenents powers are added.

5. For some number a, b and c, ca/cb is equal to _________

a) ca-b
b) ca+b
c) c
d) None of the mentioned
View Answer

Answer: a
Explanation: If base are same then exponenents powers are added, 1/cb = c-b.
advertisement

6. State whether the given statement is true or false.

Exponentiation is commutative.
a) True
b) False
View Answer

Answer: b
Explanation: Ab is not equal to bA, exponentiation is not commutative.

7. State whether the given statement is true or false.

Exponentiation is associative.
a) True
b) False
View Answer

Answer: b
Explanation: Exponentiation is not associative.

8. If 2a-b = 1 then the value of a-b is equal to _________

a) 1
b) 0
c) 2
d) none of the mentioned
View Answer

Answer: b
Explanation: 1 = 20, so a-b = 0.

9. For some number a, b and c, ac x bc is equal to _________

a) (ab)c
b) (ac)b
c) (cb)a
d) None of the mentioned
View Answer
Answer: a
Explanation: If power are same then bases are multiplied.
advertisement

10. If 0a is not equal to zero then which of the values a cannot take _________
a) 1
b) 2
c) -1
d) 0
View Answer

Answer: d
Explanation: a0 = 1, for any real number.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice basic questions and answers on all areas of Discrete Mathematics, here is
complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Complement of a
Number
» Next - Discrete Mathematics Questions and Answers – Applications of Number Theory
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Complement of a Number
Discrete Mathematics Questions and Answers – Applications of Number Theory
advertisement
advertisement

Recommended Posts:

1. Information Science Questions and Answers

2. Computer Science Questions and Answers
3. Information Technology Questions and Answers
4. Biotechnology Questions and Answers
5. Master of Computer Applications Questions and Answers
6. Network Theory Questions and Answers
7. Automata Theory Questions and Answers
8. C++ Programming Examples on Numerical Problems & Algorithms
9. Theory of Machines Questions and Answers
10. Bachelor of Computer Applications Questions and Answers
11. Electromagnetic Theory Questions and Answers
12. Cryptography and Network Security Questions and Answers
13. C# Programming Examples on Mathematics
14. Engineering Mathematics Questions and Answers
15. Discrete Mathematics Questions and Answers
 16. Discrete Mathematics Questions and Answers – Operations on Matrices
17. Discrete Mathematics Questions and Answers – Applications of Number Theory
18. Discrete Mathematics Questions and Answers – Floor and Ceiling Function
19. Discrete Mathematics Questions and Answers – Cryptography – Encryption
20. Discrete Mathematics Questions and Answers – Cryptography – Decryption

advertisement

Discrete Mathematics Questions and

Answers – Applications of Number Theory
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Applications of Number Theory”.

1. The linear combination of gcd(252, 198) = 18 is?

a) 252*4 – 198*5
b) 252*5 – 198*4
c) 252*5 – 198*2
d) 252*4 – 198*4
View Answer

Answer: a
Explanation: By using the Euclidean algorithm.
advertisement

2. The inverse of 3 modulo 7 is?

a) -1
b) -2
c) -3
d) -4
View Answer

Answer: b
Explanation: By using the Euclidean algorithm, 7 = 2*3 + 1. From this we see that -2*3 +
1*7 = 1. This show that -2 is an inverse.

3. The integer 561 is a Carmichael number.

a) True
b) False
View Answer

Answer: a
Explanation: By using the Fermat’s theorem, it follows that b560 is congruent to 1 (mod 561).
4. The linear combination of gcd(117, 213) = 3 can be written as _________
a) 11*213 + (-20)*117
b) 10*213 + (-20)*117
c) 11*117 + (-20)*213
d) 20*213 + (-25)*117
View Answer

Answer: a
Explanation: By using the Euclidean algorithm.

5. The inverse of 7 modulo 26 is?

a) 12
b) 14
c) 15
d) 20
View Answer

Answer: c
Explanation: By using the Euclidean algorithm.
advertisement

6. The inverse of 19 modulo 141 is?

a) 50
b) 51
c) 54
d) 52
View Answer

Answer: d
Explanation: By using the Euclidean algorithm.

7. The integer 2821 is a Carmichael number.

a) True
b) False
View Answer

Answer: a
Explanation: By using the Fermat’s theorem, it follows that b2820 is congruent to 1 (mod
2821).

8. The solution of the linear congruence 4x = 5(mod 9) is?

a) 6(mod 9)
b) 8(mod 9)
c) 9(mod 9)
d) 10(mod 9)
View Answer

Answer: b
Explanation: The inverse of 5 modulo 9 is -2. Multiply by (-2) on both sides in equation 4x =
5(mod 9), it follows that x is congruent to 8(mod 9).
9. The linear combination of gcd(10, 11) = 1 can be written as _________
a) (-1)*10 + 1*11
b) (-2)*10 + 2*11
c) 1*10 + (-1)*11
d) (-1)*10 + 2*11
View Answer

Answer: a
Explanation: By using the Euclidean theorem, it follows that 1 = (-1)*10 + 1*11.
advertisement

10. The value of 52003 mod 7 is?

a) 3
b) 4
c) 8
d) 9
View Answer

Answer: a
Explanation: By using the Fermat’s theorem.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory and Cryptography –
Rules of Exponents
» Next - Discrete Mathematics Questions and Answers – Number Theory – Primes and
Greatest Common Divisors
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory and Cryptography – Rules
of Exponents
Discrete Mathematics Questions and Answers – Number Theory – Primes and Greatest
Common Divisors
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Graph Problems & Algorithms

2. Java Programming Examples on Hard Graph Problems & Algorithms
3. C Programming Examples on Hard Graph Problems & Algorithms
4. Signals & Systems Questions and Answers
5. C++ Programming Examples on Hard Graph Problems & Algorithms
 6. Python Programming Examples on Searching and Sorting
7. Java Algorithms, Problems & Programming Examples
8. Java Programming Examples on Numerical Problems & Algorithms
9. C Programming Examples on Numerical Problems & Algorithms
10. C++ Algorithms, Problems & Programming Examples
11. C# Programming Examples on Mathematics
12. Electromagnetic Theory Questions and Answers
13. Theory of Machines Questions and Answers
14. Master of Computer Applications Questions and Answers
15. Bachelor of Computer Applications Questions and Answers
16. Automata Theory Questions and Answers
17. Network Theory Questions and Answers
18. C++ Programming Examples on Numerical Problems & Algorithms
19. Engineering Mathematics Questions and Answers
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Primes and
Greatest Common Divisors
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Number Theory – Primes and Greatest Common Divisors”.

1. The prime factorization of 7007 is __________

a) 73.11.13
b) 72.11.13
c) 7.11.13
d) 7.113.13
View Answer

Answer: b
Explanation: Perform successive division beginning with 2.
advertisement

2. Out of following which one is Mersenne Primes?

a) 3
b) 7
c) 2047
d) 31
View Answer

Answer: c
Explanation: 2047 = 23.89 also not in form of 2b-1 form.
3. Out of the following which of these integers is not prime?
a) 21
b) 35
c) 71
d) 101
View Answer

Answer: b
Explanation: 35 = 5.7 which is the product of two prime numbers.

4. The prime factorization of 1001 is __________

a) 73.11.13
b) 72.11.13
c) 7.11.13
d) 7.113.13
View Answer

Answer: c
Explanation: Perform successive division beginning with 2.

5. Which positive integer less than 21 are relatively prime to 21?

a) 18
b) 19
c) 21
d) 24
View Answer

Answer: b
Explanation: gcd(19,21) = 1. According to the definition of relatively prime gcd of two
numbers is 1.
advertisement

6. Is 7, 8, 9, 11 are pairwise relatively prime.

a) True
b) False
View Answer

Answer: a
Explanation: gcd(7, 9) = gcd(8, 9) = gcd(9, 11) = gcd(11, 7) = 1. The numbers 7 and 11 are
prime and numbers 8 and 9 are relatively prime.

7. The greatest common divisor of 313.517 and 212.35 is __________

a) 30
b) 31
c) 33
d) 35
View Answer

Answer: d
Explanation: gcd(a, b) = 3min(13, 5).5min(17, 0).2min(12, 0).
8. The greatest common divisor of 0 and 5 is ___________
a) 0
b) 1
c) 2
d) 5
View Answer

Answer: b
Explanation: gcd(0, 5) = 0min(1, 0).5min(0, 1).

9. The lcm of 3 and 21 is ________ if gcd(3,21)=3.

a) 3
b) 12
c) 21
d) 42
View Answer

Answer: c
Explanation: 3 * lcm(3, 21) = 63 hence, lcm(3, 21) = 63 / 3 = 21.
advertisement

10. The least common multiple of 41.42 and 42.41 is ____________

a) 42
b) 41
c) 84
d) 41.42
View Answer

Answer: d
Explanation: lcm(41 * 42, 42 * 42) = 41.42.42.41 / 41.42 = 41.42.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Applications of Number Theory
» Next - Discrete Mathematics Questions and Answers – Number Theory – Modular
Exponentiation
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Applications of Number Theory
Discrete Mathematics Questions and Answers – Number Theory – Modular Exponentiation
advertisement
advertisement
Recommended Posts:

1. Python Programming Examples

2. Signals & Systems Questions and Answers
3. Bachelor of Computer Applications Questions and Answers
4. Theory of Machines Questions and Answers
5. Electromagnetic Theory Questions and Answers
6. Automata Theory Questions and Answers
7. Network Theory Questions and Answers
8. C Programming Examples without using Recursion
9. C Programming Examples on Mathematical Functions
10. Java Programming Examples on Mathematical Functions
11. Java Programming Examples on Numerical Problems & Algorithms
12. Simple C Programs
13. C Programming Examples on Numerical Problems & Algorithms
14. C++ Programming Examples on Numerical Problems & Algorithms
15. C# Programming Examples on LINQ
16. C# Basic Programming Examples
17. Engineering Mathematics Questions and Answers
18. C Programming Examples using Recursion
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Number Theory – Modular
Exponentiation
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Number Theory – Modular Exponentiation”.

1. If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true?
a) GCD(53,21) = 1
b) GCD(53,21) = 29
c) GCD(53,21) = 53
d) GCD(53,21) = 12
View Answer

Answer: a
Explanation: The multiplicative inverse of “a modulo m” can be found out by extended
Euler’s GCD algorithm, and the time complexity of this method is O(logm). We know that
the multiplicative inverse of “x modulo n” exists if and only if x and n are relatively prime
(i.e., if gcd(a, m) = 1). So, in this case GCD(53,21) = 1.
 advertisement

2. A multiplicative monoid defines the property of exponentiation with ________

a) integer exponents
b) fractional exponents
c) rational exponents
d) negative integer exponents
View Answer

Answer: a
Explanation: Exponentiation with integer exponents is termed in any multiplicative monoid.
Exponentiation is described inductively by 1) h0 = 1 for all h ∈ S, hn+1 = hn h and non-
negative integers n, If n is a negative integer then hn is only defined if h has an inverse in S.
Monoids define many structures including groups and rings (under multiplication).

3. Which of the following algorithms has better computational complexity than standard
division algorithms?
a) Montgomery algorithm
b) Classical modular exponentiation algorithm
c) ASM algorithm
d) FSM algorithm
View Answer

Answer: b
Explanation: To multiply m and n, they are converted to Montgomery form: mR mod X and
nR mod X. When multiplied, these produce mnR2 mod X, and the Montgomery reduction
produces abR mod N which is the Montgomery form of the desired product. After that, the
low bits are discarded which gives a result less than 2X. One final subtraction reduces this to
less than X. Hence, this procedure can have a better computational complexity than standard
division algorithms.

4. Which of the following methods uses the concept that exponentiation is computationally
inexpensive in the finite field?
a) Diffie-HEllman key exchange
b) RSA key exchange
c) Arithmetic key exchange
d) FSM method
View Answer

Answer: a
Explanation: Exponentiation in the finite fields has its many applications in the public key
cryptography system. Now, the Diffie–Hellman key exchange can have the concept that
exponentiation is computationally inexpensive in the finite fields and the discrete logarithm
which is the inverse of exponentiation, can be computationally expensive.

5. If there is a unique prime number p1 then a finite field F has the property of
______________
a) p1x = 0 for all x in F
b) f(x) = f(xp1) for all x in F
c) p1 = y for all y in F
d) xy + p1 for all x, y in F
View Answer

Answer: a
Explanation: A field can be defined as an algebraic structure in which multiplication,
addition, subtraction, and division are well-defined and satisfy similar properties. If there is a
unique prime number p1 then a finite field F has the property of p1x = 0, for all x in F and this
prime number is called the characteristics of the field.
advertisement

6. Evaluate the expression 6359 mod 320.

a) 681
b) 811
c) 3781
d) 279
View Answer

Answer: d
Explanation: By definition, we can have 6359 ≡ 279 (mod320), hence the answer is 279.

7. The time complexity to perform the modular exponentiation of a ≡ cg (mod m).

a) O(m+a)
b) O(a*g)
c) O(gm)
d) O(g)
View Answer

Answer: d
Explanation: The modular exponentiation completely depends on the operating system
environment and the processor for its performance. The above said method requires a time
complexity of O(g) for its completion.

8. According to congruence relation, find the remainder of 56 mod 24.

a) 10
b) 12
c) 6
d) 4
View Answer

Answer: c
Explanation: According to congruence relation, 56 ≡ 6 (mod 24), because 56 − 32 = 24,
which is a multiple of 24. So, the remainder is 6.

9. In cryptography system, the value of z in x ≡ ze (mod m) should be at least ______

a) 1024 bits
b) 1GB
c) 596 bits
d) 54 Bytes
View Answer
Answer: a
Explanation: In cryptography system, the value of z in x ≡ ze (mod m) should be at least 1024
bits.
advertisement

10. Determine the value of x, where y = 7, e = 12 and n = 566 using modular exponentiation
method (x ≡ ye (mod n)).
a) 735
b) 321
c) 872
d) 487
View Answer

Answer: d
Explanation: Given y = 5, e = 12, and n = 566 and so x ≡ 512 (mod 566). Now 512 comes out
to 244140625 and taking this value modulo 566, x is determined to be 487.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Primes and
Greatest Common Divisors
» Next - Discrete Mathematics Questions and Answers – Cryptography – Encryption
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Primes and Greatest
Common Divisors
Discrete Mathematics Questions and Answers – Cryptography – Encryption
advertisement
advertisement

Recommended Posts:

1. Python Programming Examples on Graphs

2. C Programming Examples on Mathematical Functions
3. C Programming Examples using Recursion
4. Java Programming Examples on Combinatorial Problems & Algorithms
5. Java Programming Examples on Mathematical Functions
6. Electromagnetic Theory Questions and Answers
7. Cryptography and Network Security Questions and Answers
8. Network Theory Questions and Answers
9. Java Programming Examples on Set & String Problems & Algorithms
10. C++ Programming Examples on Set & String Problems & Algorithms
11. C Programming Examples on Set & String Problems & Algorithms
 12. Engineering Mathematics Questions and Answers
13. Java Programming Examples on Numerical Problems & Algorithms
14. C Programming Examples on Combinatorial Problems & Algorithms
15. C Programming Examples on Numerical Problems & Algorithms
16. C# Programming Examples on Mathematics
17. C# Basic Programming Examples
18. Automata Theory Questions and Answers
19. C++ Programming Examples on Numerical Problems & Algorithms
20. C++ Program to Implement Fermat’s Little Theorem

advertisement

Discrete Mathematics Questions and

Answers – Cryptography – Encryption
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Cryptography – Encryption”.

1. How many bytes of the secret key is generated using Diffie-Hellman encryption/decryption
scheme?
a) 256
b) 871
c) 1024
d) 962
View Answer

Answer: a
Explanation: Diffie-Hellman encryption/decryption scheme generates 256 bytes shared a
secret key. This secret key then is used by AES key to encrypt this data.
advertisement

2. In which of the following systems, encryption slower than decryption?

a) elliptic curve cryptography
b) parabolic curve cryptography
c) symmetric cryptography
d) antisymmetric cryptography
View Answer

Answer: b
Explanation: It is known that performing encryption using the public key takes more time
than performing decryption using the private key in elliptic curve cryptography (ECC) and
the key consists of 60 bytes.

3. If there are 256 cipher texts per plain text and a total of 218 plaintexts of length 18 exists.
Then determine the number of distinct ciphertexts?
a) 761
b) 274
c) 186
d) 289
View Answer

Answer: b
Explanation: If there are 256 cipher texts per plain text and a total of 218 plaintexts of length
18 exists which will all decrypt to the same plaintext, and this holds for every plaintext. There
are a total of 256 plaintexts of length 56. Now, there must be 256. 218 = 274 distinct ciphertexts
which all decrypt to plaintexts of length 56. If all those ciphertexts are the same length, they
must be at least 74 bits long.

4. TEA cipher uses which of the following structure?

a) standard cipher structure
b) pseudo random structure
c) feistel structure
d) block structure
View Answer

Answer: c
Explanation: The Feistel structure system TEA operates on two 32-bit unsigned integer
numbers. It uses a 128-bit key that can be used to build a simple key schedule by mixing all
of the key elements.

5. Let A’s public key is n=6, 736, 180, 7817, 961, 456, 267 and e = 5 and B sends the
ciphertext. c = 456, 871, 122, 391, 882, 538 to A. Determine B’s message in numeric format?
a) 235813
b) 57971.89
c) 770190.04
d) 687651.9
View Answer

Answer: c
Explanation: It is known that to get original message m after decrypting we can have the
formula m=c1/e. In this case: (456,871,122,391,882,538)1/3 = 770190.04 and this is the
required answer.
advertisement

6. In encryption, which of the following is the best text encoding technique?

a) ASCII encoding
b) Hex-encoding
c) Unicode technique
d) Base64 encoding
View Answer

Answer: c
Explanation: Base64 and hex encoding scheme encode characters(or only bytes). First, we
need to encode the characters as bytes and after that encode the bytes. In terms of
compactness and simplicity, the best technique is Unicode scheme.
7. _______ are used as the base of the Public Key Infrastructure.
a) SSL certificates
b) TLS certificates
c) X.509 certificates
d) HAS certificates
View Answer

Answer: c
Explanation: The X.509 certificates may be used as a base of the Public Key Infrastructure.
PKIX is a tree structure where a Certificate Authority can be used to give trust to end entity
certificates. X.509 certificates cannot directly use symmetric cryptography.

8. The default key size of RC2 Feistel cipher is _______

a) 64GB
b) 64 bits
c) 64 bytes
d) 64KB
View Answer

Answer: c
Explanation: RC2 is a 64-bit source-heavy Feistel cipher system with a default key size of 64
bits. It is a complex cipher which uses secret indices and performs bitwise rotations, logical
operations(AND, NOT, and OR) and modular addition.

9. How many combinations of keys can be constructed from a 72 ciphertext stream cipher?
a) 4271
b) 7345
c) 3291
d) 2556
View Answer

Answer: d
Explanation: For stream cipher, if there are n ciphertexts then there are n*(n−1)/2
combination of keys to be made.
= \(72*\frac{72-1}{2}\)
= 72*35.5
= 2556.
advertisement

10. What is the block size of RC6 Feistel block cipher?

a) 5013 bits
b) 128 bits
c) 596 bits
d) 1768 bits
View Answer

Answer: b
Explanation: The RC6 Feistel block cipher is a 20-round cipher scheme which includes a
fixed block size of 128 bits and it supports 128, 192, and 256-bit keys for encryption of
messages.
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number Theory – Modular
Exponentiation
» Next - Discrete Mathematics Questions and Answers – Cryptography – Decryption
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number Theory – Modular Exponentiation
Discrete Mathematics Questions and Answers – Cryptography – Decryption
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Numerical Problems & Algorithms

2. C Programming Examples on Numerical Problems & Algorithms
3. C++ Programming Examples on Numerical Problems & Algorithms
4. Operating System Questions and Answers
5. C# Programming Examples on Mathematics
6. Engineering Mathematics Questions and Answers
7. Computer Fundamentals Questions and Answers
8. C# Programming Examples on Strings
9. C Programming Examples on Bitwise Operations
10. Data Structures & Algorithms II – Questions and Answers
11. Java Programming Examples on Set & String Problems & Algorithms
12. Digital Communication Questions and Answers
13. C++ Programming Examples on Set & String Problems & Algorithms
14. C Programming Examples on Set & String Problems & Algorithms
15. Discrete Mathematics Questions and Answers
16. Cryptography Questions and Answers – Public Keys and X.509 Certificates-II
17. Symmetric Ciphers Questions and Answers – The Data Encryption Standard (DES)
and It’s Strength – II
18. Symmetric Ciphers Questions and Answers – DES Modes of Operation – I
19. Cryptography Questions and Answers – Overview – III
20. Cryptography Questions and Answers – Symmetric Key Distribution – II

advertisement

Discrete Mathematics Questions and

Answers – Cryptography – Decryption
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Cryptography – Decryption”.

1. Suppose that there are two primes, P1 = 229 and p2 = 61. Find the value of z and Φ.
a) 13969, 13680
b) 5853, 23452
c) 7793, 34565
d) 17146, 69262
View Answer

Answer: a
Explanation: We know that, z = p1*p2 = 229*61 = 13969 and Φ = (p1 – 1)(p2 – 1) = (229 –
1)(61 – 1) = 228*60 = 13680.
advertisement

2. ________ can decrypt traffic to make it available to all other network security functions
such as web proxies.
a) SSL visibility appliances
b) RSA appliances
c) Rodriguez cipher system
d) Standard cipher system
View Answer

Answer: a
Explanation: In the data loss prevention systems, Web proxies and antivirus network security
functions, SSL visibility appliances decrypt traffic to make it available for all networks.

3. The ROT13 caesar cipher system has an offset of ___________

a) 13
b) 45
c) 71
d) 37
View Answer

Answer: a
Explanation: The ROT13 Caesar cipher system has an offset of 13 and it is one of the
comprehensive cipher scheme. However, the Vigenere cipher employs Caesar cipher as one
element of the encryption process.

4. In a public key system, the cipher text received is C = 10 if RSA encryption used with a
public key(e = 11, n = 77) to deduce the plain text. Determine the value of ϕ(n)?
a) 49
b) 60
c) 123
d) 70
View Answer
Answer: b
Explanation: Given n = 77, that means p and q must be 7 and 11 that is they must be co-prime
to each other. Now we know that ϕ(n) = (p – 1) (q – 1)
ϕ(n) = (7 – 1) (11 – 1)
ϕ(n) = 6*10
ϕ(n) = 60.

5. To encrypt a message _______ is used on the character’s positions.

a) boolean algebra
b) bijective function
c) inverse function
d) surjective function
View Answer

Answer: b
Explanation: We have a mathematical notion that a bijective function can be used on the
characters’ positions to encrypt a message and an inverse function is used to decrypt the
message.
advertisement

6. The public key of given user, in an RSA encryption system is e = 57 and n = 3901. What is
the value of Euler’s totient function ϕ(n) for calculating the private key of the user?
a) 4369
b) 3772
c) 871
d) 7892
View Answer

Answer: b
Explanation: Given that n=3901 and e=31. We know that n = p∗q where p and q are prime
numbers, which gives 3901 = 47*83. Now, ϕ(n) is Euler’s totient function i.e., ϕ(n) =
(p−1)∗(q−1)
ϕ(n) = (47−1)∗(83−1)
ϕ(n) = 46*82 = 3772.

7. Using RSA algorithm what is the value of cipher test c if the plain text e = 7 and P = 5, q =
16 & n = 832. Determine the Euler’s totient function for the plain text?
a) 47
b) 584
c) 428
d) 60
View Answer

Answer: d
Explanation: Given plain text (m) = 7, P = 5, Q = 16, where P and Q are two prime integer
n = P * Q ⇒ n = 5*16 = 80 ⇒ Z = (P-1)*(Q-1) ⇒ Z = (5-1)*(16-1) = 4*15 = 60.

8. There are 67 people in a company where they are using secret key encryption and
decryption system for privacy purpose. Determine the number of secret keys required for this
purpose?
a) 887
b) 6529
c) 2211
d) 834
View Answer

Answer: c
Explanation: Since every two employee have their own secret key encryption and decryption.
Both users have to agree on a secret key to communicate using symmetric cryptography.
After that, each message is encrypted with that key it is transmitted and decrypted with the
same key. Here, key distribution must be secret. For n = 67 we would need \(\frac{n(n-1)}{2}
= \frac{67(67-1)}{2}\) = 2211 keys.

9. In a transposition cipher, the plaintext is constructed by the ________ of the ciphertext.

a) permutation
b) combination
c) sequence
d) series
View Answer

Answer: a
Explanation: In cryptography, a method of encryption where the positions of plaintext held
by units are shifted according to a regular system so that the ciphertext constructs a
permutation of the plaintext is termed as transposition cipher.
advertisement

10. How many bits of message does the Secure Hash Algorithm produce?
a) 160 bits
b) 1035 bits
c) 621 bits
d) 3761 bits
View Answer

Answer: a
Explanation: The Secure Hash Algorithm or SHA is based on MD4 encryption system. This
algorithm gives an output of a longer 160-bit message that is why it is harder to construct
another message that yields the same resultant message.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Cryptography – Encryption
» Next - Discrete Mathematics Questions and Answers – Cryptography – Ciphers
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Cryptography – Encryption
Discrete Mathematics Questions and Answers – Cryptography – Ciphers
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on Strings

2. C Programming Examples on Searching and Sorting
3. Python Programming Examples on Graphs
4. C++ Programming Examples on Numerical Problems & Algorithms
5. Computer Fundamentals Questions and Answers
6. C++ Algorithms, Problems & Programming Examples
7. Java Programming Examples on Numerical Problems & Algorithms
8. C Programming Examples on Numerical Problems & Algorithms
9. C# Programming Examples on Mathematics
10. Digital Communication Questions and Answers
11. Engineering Mathematics Questions and Answers
12. Data Structures & Algorithms II – Questions and Answers
13. C Programming Examples on Bitwise Operations
14. Java Programming Examples on Set & String Problems & Algorithms
15. C++ Programming Examples on Set & String Problems & Algorithms
16. Discrete Mathematics Questions and Answers
17. C Programming Examples on Set & String Problems & Algorithms
18. Cryptography and Network Security Questions and Answers
19. Digital Communications Questions and Answers – Public Key Cryptosystems – 2
20. Atbash Cipher Multiple Choice Questions and Answers (MCQs)

advertisement

Discrete Mathematics Questions and

Answers – Cryptography – Ciphers
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Cryptography – Ciphers”.

1. _______ is an example of asymmetric ciphers.

a) Block cipher
b) RSA encryption
c) AES encryption
d) Advanced cryptology
View Answer

Answer: b
Explanation: The asymmetric ciphers use asymmetric algorithms that use one key to encrypt
data and a different key to decrypt ciphers. These algorithms are used in RSA encryption and
public-key cryptography in which the public key is used to encrypt data and the private key is
used to decrypt data.
advertisement

2. There is no secret key in case of ____________

a) Symmetric ciphers
b) Asymmetric ciphers
c) RSA encryption
d) Alpha-numeric cryptography
View Answer

Answer: a
Explanation: A symmetric algorithm uses the same key to encrypt data as well as to decrypt
data. For example, a symmetric algorithm will use the key to encrypt some plaintext
information like a password into a ciphertext. Then, it uses again to take that ciphertext and
turn it back into the password.

3. Suppose in order to get a message across enemy lines, we need to choose an initial secret
key say, 100110. What will be the decrypted cipher when the original message is 010010011.
a) 110100
b) 1001011
c) 0011010
d) 011011
View Answer

Answer: a
Explanation: In order to decrypt the given cipher text, we need to XOR each bit with the
corresponding bit in the secret key. As, the cipher text is longer than the secret key, wrap
around the remaining cipher text and begin again at the starting. When there will be a chance
to decrypt the 7th bit of the cipher text, XOR it with the first bit of the secret key. Hence, after
decrypting every bit in the cipher text, the original message will be 110100.

4. Electronic Code Book process is used in ________

a) caesar cipher
b) antisymmetric cipher
c) block cipher
d) stream cipher
View Answer

Answer: c
Explanation: The block cipher takes a plaintext in the chuck of bits and the bits of key are
used to produce bits of ciphertext. They operate on blocks of bits at a time and so it is termed
as block ciphers. TIn current cryptomeric systems, the messages that are larger than one
block long that need to be split up into smaller messages by using a process called Electronic
Code Book (ECB).

5. ______ uses the concept of pseudo-random sequence.

a) Stream cipher
b) DES encryption
c) Caesar cipher
d) Block cipher
View Answer

Answer: a
Explanation: The stream cipher is the one-time pad that uses the XOR function on the
plaintext with a pseudo-random sequence. The input plaintext is encrypted one byte at a time
incrementally. As the random sequence is not possible, a pseudo-random sequence is used.
These pseudo-random sequence are the outputs of a generator given an initial seed which is a
number used to initialize a pseudo-random number generator.
advertisement

6. How many bits are there for random bits and error detection bits in the case of DES block
ciphers?
a) 72, 1024
b) 56, 8
c) 104, 45
d) 32, 198
View Answer

Answer: b
Explanation: DES is a symmetric system that uses block ciphers which consist of 56 random
bits, and 8 more bits are used for error detection. First the data is sent into the system and
then divided into two 32-bit blocks. Those two blocks are sent through the entire system
using criss-cross which is known as the Feistel system. There are 16 layers in DES. At each
layer, one half of the data passes through the Fiestel function and after its completion, it is
XORd with the other half of the data. Each layer has its own subkey which is derived from
the main 56-bit key by using a key scheduler.

7. What are the steps in the Feistel function?

a) expansion, mixing, substitution, permutation
b) extract, transform, load
c) extract, load, transform
d) expansion, divide, mixing, permutation
View Answer

Answer: a
Explanation: The Feistel function which occurs in every block has 3 steps
i) Expansion:- The incoming 32-bit block has half of its bits duplicated, making it a 48-bit
block.
ii) Mixing:- The new, 48-bit input block is put through an XOR gate with this round’s unique
subkey.
iii) Substitution:- The mixed, 48-bit block is divided into 8 6-bit pieces. Each of these 8
pieces is put through an S-block which will output only 4-bits using non-linear-
transformation. Permutation: The 32 output bits are then arranged in a specific permutation
that ensures that they will be distributed among different S-blocks in the next round. This is
the most important part of security in DES and it helps to avoid simple, algebra-based
attacks.
8. What type of algorithm does AES encryption use?
a) Stream cipher
b) Symmetric block cipher
c) Asymmetric caesar cipher
d) DES encryption
View Answer

Answer: b
Explanation: AES encryption uses symmetric block ciphers to encrypt the messages. It is at
least 6 times faster than 3 DES. AES uses a substitution-permutation network and this
network is a series of operations that either replaces input with output bits (substitution) or
shuffles the bits (permutation). It uses 128-bit input plaintext and it operates on bytes rather
than bits. Here, the input is represented as 16 bytes (because 128 bits = 16 bytes) and is
arranged in a 4 x 4 matrix.

9. What is the block size of blowfish block cipher?

a) 64 bits
b) 128 bits
c) 1043 bits
d) 10 bits
View Answer

Answer: a
Explanation: Blowfish symmetric block cipher was created after DES but before AES. Its
block size is 64 bits, and it can use key lengths from 32 up to 448 bits. It is a 16-round Feistel
cipher and unlike in DES it’s S-boxes are key-dependent and so they are generated
dynamically.
advertisement

10. In which cipher each letter of the plaintext is substituted by any other letter to form the
cipher message?
a) Shift cipher
b) DES encryption
c) Block cipher
d) AES encryption
View Answer

Answer: a
Explanation: Shift cipher is a mono-alphabetic cipher in which each letter of the plaintext is
substituted by another letter to form the ciphertext. It is the simplest form of substitution
cipher scheme wherein the concept is to replace each alphabet by another alphabet which is
‘shifted’ by some fixed number between 0 and 25. In this scheme, both sender and receiver
agree on a secret shift number for shifting the alphabet and this number lies between 0 and 25
becomes the key to the encryption. Occasionally, Caesar cipher is used to describe the Shift
cipher when the ‘shift of three’ is used.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Cryptography – Decryption
» Next - Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Cryptography – Decryption
Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
advertisement
advertisement

Recommended Posts:

1. MATLAB Questions and Answers

2. Java Programming Examples on Exception Handling
3. Java Algorithms, Problems & Programming Examples
4. C Programming Examples on Numerical Problems & Algorithms
5. Computer Fundamentals Questions and Answers
6. C Programming Examples on Strings
7. C++ Programming Examples on STL
8. Engineering Mathematics Questions and Answers
9. C Programming Examples on Bitwise Operations
10. Data Structures & Algorithms II – Questions and Answers
11. C++ Programming Examples on Combinatorial Problems & Algorithms
12. Java Programming Examples on Set & String Problems & Algorithms
13. Java Programming Examples on Combinatorial Problems & Algorithms
14. C# Programming Examples on Mathematics
15. Digital Communication Questions and Answers
16. C Programming Examples on Combinatorial Problems & Algorithms
17. C++ Programming Examples on Set & String Problems & Algorithms
18. C Programming Examples on Set & String Problems & Algorithms
19. Discrete Mathematics Questions and Answers
20. Cryptography and Network Security Questions and Answers

advertisement

Discrete Mathematics Questions and

Answers – Principle of Mathematical
Induction
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Principle of Mathematical Induction”.
1. What is the base case for the inequality 7n > n3, where n = 3?
a) 652 > 189
b) 42 < 132
c) 343 > 27
d) 42 <= 431
View Answer

Answer: c
Explanation: By the principle of mathematical induction, we have 73 > 33 ⇒ 343 > 27 as a
base case and it is true for n = 3.
advertisement

2. In the principle of mathematical induction, which of the following steps is mandatory?

a) induction hypothesis
b) inductive reference
c) induction set assumption
d) minimal set representation
View Answer

Answer: a
Explanation: The hypothesis of Step is a must for mathematical induction that is the
statement is true for n = k, where n and k are any natural numbers, which is also called
induction assumption or induction hypothesis.

3. For m = 1, 2, …, 4m+2 is a multiple of ________

a) 3
b) 5
c) 6
d) 2
View Answer

Answer: d
Explanation: For n = 1, 4 * 1 + 2 = 6, which is a multiple of 2. Assume that 4m+2 is true for
m=k and so 4k+2 is true based on the assumption. Now, to prove that 4k+2 is also a multiple
of 2 ⇒ 4(k+1)+2 ⇒ 2 * 4k – 4k + 6 ⇒ 2*4k+4 – 4k+2 ⇒ 2(4k+2) – 2(2k+1). Here, the first
term 2(4k+2) is true as per assumption and the second term 2(4k+2) is must to be a multiple
of 2. Hence, 4(k+1)+2 is a multiple of 2. So, by induction hypothesis, (4m+2) is a multiple of
2, for m = 1,2,3,…

4. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________
a) m2+3
b) m+1
c) mm
d) 3m2+4
View Answer

Answer: a
Explanation: The required answer is m2+3. Now, by induction assumption, we have to prove
2+4+6+…+4(k+1) = (k+1)2+3 also can be true, 2+4+6+…+4(k+1) = 2+4+6+⋯+(4k+4) and
by the subsequent steps, we can prove that (m+1)2+3 also holds for m=k. So, it is proved.
5. For every natural number k, which of the following is true?
a) (mn)k = mknk
b) m*k = n + 1
c) (m+n)k = k + 1
d) mkn = mnk
View Answer

Answer: a
Explanation: In the first step, for k = 1, (mn)1 = m1n1 = mn, hence it is true. Let us assume the
statement is true for k = l, Now by induction assumption, (mn)1 = m1n1 is true. So, to prove,
(mn)l+1 = ml + 1nl+1, we have (mn)l = mlnl and multiplying both sides by (mn) ⇒
(mn)1(mn)=(m1n1)(mn)
⇒ (mn)l+1 = (mm1)(nn1) ⇒ (mn)l+1 = (ml+1nl+1). Hence, it is proved. So, (mn)k = mknk is true
for every natural number k.
advertisement

6. By induction hypothesis, the series 12 + 22 + 32 + … + p2 can be proved equivalent to

____________
a) \(\frac{p^2+2}{7}\)
b) \(\frac{p*(p + 1)*(2p + 1)}{6}\)
c) \(\frac{p*(p+1)}{4}\)
d) p+p2
View Answer

Answer: b
Explanation: By principle of mathematical induction, we now assume that p (b) is true 12 + 22
+ 32 + … + b2 = \(\frac{b (b + 1) (2b + 1)}{6}\)
so to prove P(b+1): 12 + 22 + 32 + … + b2 + (b + 1)2 = \(\frac{b (b + 1) (2b + 1)}{6}\) + (b +
1)2
By induction assumption it is shown that 12 + 22 + 32 + … + b2 + (b + 1)2 = \(\frac{(b + 1) [(b
+ 2) (2b + 3)]}{6}\). Hence it is proved that 12 + 22 + 32 + … + p2 = \(\frac{p*(p + 1)*(2p +
1)}{6}\).

7. For any positive integer m ______ is divisible by 4.

a) 5m2 + 2
b) 3m + 1
c) m2 + 3
d) m3 + 3m
View Answer

Answer: d
Explanation: The required answer is, m3 + 3m. Now, by induction hypothesis, we have to
prove for m=k, k3+3k is divisible by 4. So, (k + 1)3 + 3 (k + 1) = k3 + 3 k2 + 6 k + 4
= [k3 + 3 k] + [3 k2 + 3 k + 4] = 4M + (12k2 + 12k) – (8k2 + 8k – 4), both the terms are
divisible by 4. Hence (k + 1)3 + 3 (k + 1) is also divisible by 4 and hence it is proved for any
integer m.

8. According to principle of mathematical induction, if P(k+1) = m(k+1) + 5 is true then _____

must be true.
a) P(k) = 3m(k)
b) P(k) = m(k) + 5
c) P(k) = m(k+2) + 5
d) P(k) = m(k)
View Answer

Answer: b
Explanation: By the principle of mathematical induction, if a statement is true for any number
m = k, then for its successor m = k + 1, the statement also satisfies, provided the statement is
true for m = 1. So, the required answer is p(k) = mk + 5.

9. Which of the following is the base case for 4n+1 > (n+1)2 where n = 2?
a) 64 > 9
b) 16 > 2
c) 27 < 91
d) 54 > 8
View Answer

Answer: a
Explanation: Statement By principle of mathematical induction, for n=2 the base case of the
inequation 4n+1 > (n+1)2 should be 64 > 9 and it is true.
advertisement

10. What is the induction hypothesis assumption for the inequality m ! > 2m where m>=4?
a) for m=k, k+1!>2k holds
b) for m=k, k!>2k holds
c) for m=k, k!>3k holds
d) for m=k, k!>2k+1 holds
View Answer

Answer: b
Explanation: By the induction hypothesis, assume that p (k) = k! > 2k is true, for m=k and we
need to prove this by the principle of mathematical induction.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Cryptography – Ciphers
» Next - Discrete Mathematics Questions and Answers – Strong Induction and Well-Ordering
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Cryptography – Ciphers
Discrete Mathematics Questions and Answers – Strong Induction and Well-Ordering
advertisement
advertisement
Recommended Posts:

1. Electrical Machines Questions and Answers

2. Engineering Mathematics Questions and Answers
3. C# Programming Examples on Mathematics
4. Probability and Statistics Questions and Answers
5. Java Programming Examples on Mathematical Functions
6. C Programming Examples on Mathematical Functions
7. Discrete Mathematics Questions and Answers – Probability Distribution
8. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
9. Discrete Mathematics Questions and Answers – Counting – Derangements
10. Discrete Mathematics Questions and Answers – Addition Theorem on Probability
11. Discrete Mathematics Questions and Answers
12. Discrete Mathematics Questions and Answers – Multiplication Theorem on
Probability
13. Discrete Mathematics Questions and Answers – Logics and Proofs – De-Morgan’s
Laws
14. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial
Expansion
15. Best Reference Books – Discrete Mathematical Structures
16. Discrete Mathematics Questions and Answers – Logics – Implication and Double
Implications
17. Discrete Mathematics Questions and Answers – Discrete Probability – Generating
Functions
18. Discrete Mathematics Questions and Answers – Discrete Probability – Bayes
Theorem
19. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and
Variance of Random Variables
20. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic
Series

advertisement

Discrete Mathematics Questions and

Answers – Strong Induction and Well-
Ordering
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Strong Induction and Well-Ordering”.

1. A polygon with 7 sides can be triangulated into ________

a) 7
b) 14
c) 5
d) 10
View Answer

Answer: c
Explanation: A simple polygon with n sides can be triangulated into n-2 triangles, where n >
2.
advertisement

2. Every simple polynomial has an interior diagonal.

a) True
b) False
View Answer

Answer: a
Explanation: By using Strong Induction.

3. A polygon with 12 sides can be triangulated into _______

a) 7
b) 10
c) 5
d) 12
View Answer

Answer: b
Explanation: A simple polygon with n sides can be triangulated into n-2 triangles, where n >
2.

4. Let P(n) be the statement that postage of n cents can be formed using just 3-cents stamps
and 5-cents stamps. Is the statements P(8) and P(10) are Correct?
a) True
b) False
View Answer

Answer: a
Explanation: We can form 8 cent of postage with one 3-cent stamp and one 5-cent stamp.
P(10) is true because we can form it using two 5-cent stamps.

5. Which amount of postage can be formed using just 4-cent and 11-cent stamps?
a) 2
b) 5
c) 30
d) 10
View Answer

Answer: d
Explanation: We can form 30 cent of postage with two 4-cent stamp and two 11-cent stamp.
advertisement

6. 22-cent of postage can be produced with two 4-cent stamp and one 11-cent stamp.
a) True
b) False
View Answer

Answer: b
Explanation: By using two 4-cent stamp and one 11-cent stamp, 27-cent postage is produced.

7. Which amount of postage can be formed using just 3-cent stamp and 10-cent stamps?
a) 27
b) 20
c) 11
d) 5
View Answer

Answer:a
Explanation: We can form 27 cent of postage with nine 3-cent stamp and 20-cent postage can
be formed by using two 10-cent stamps.

8. Suppose that P(n) is a propositional function. Determine for which positive integers n the
statement P(n) must be true if: P(1) is true; for all positive integers n, if P(n) is true then
P(n+2) is true.
a) P(3)
b) P(2)
c) P(4)
d) P(6)
View Answer

Answer: a
Explanation: By induction we can prove that P(3) is true but we can’t conclude about P(2),
p(6) and P(4).

9. Suppose that P(n) is a propositional function. Determine for which positive integers n the
statement P(n) must be true if: P(1) and P(2) is true; for all positive integers n, if P(n) and
P(n+1) is true then P(n+2) is true.
a) P(1)
b) P(2)
c) P(4)
d) P(n)
View Answer

Answer: d
Explanation: By induction, we can prove that P(n) is true.
advertisement

10. A polygon with 25 sides can be triangulated into _______

a) 23
b) 20
c) 22
d) 21
View Answer
Answer: a
Explanation: A simple polygon with n sides can be triangulated into n-2 triangles, where n >
2.

Sanfoundry Global Education & Learning Series – Discrete Mathematics

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
» Next - Discrete Mathematics Questions and Answers – Recursion
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
Discrete Mathematics Questions and Answers – Recursion
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Computational Geometry Problems & Algorithms

2. C++ Programming Examples on Computational Geometry Problems & Algorithms
3. C Programming Examples using Recursion
4. C# Programming Examples on Gaming
5. Java Programming Examples on Mathematical Functions
6. Simple C Programs
7. Electrical Machines Questions and Answers
8. Engineering Mathematics Questions and Answers
9. Simple Java Programs
10. C# Programming Examples on Mathematics
11. C Programming Examples on Mathematical Functions
12. Discrete Mathematics Questions and Answers
13. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of
Inclusion Exclusion
14. Discrete Mathematics Questions and Answers – Floor and Ceiling Function
15. Discrete Mathematics Questions and Answers – Logics – Implication and Double
Implications
16. Discrete Mathematics Questions and Answers – Types of Set
17. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
18. Discrete Mathematics Questions and Answers – Logics – Propositions
19. Discrete Mathematics Questions and Answers – Predicate Logic Quantifiers
20. Discrete Mathematics Questions and Answers – Logics – Types of Statements

advertisement
Discrete Mathematics Questions and
Answers – Recursion
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Recursion”.

1. Which of the following is contained in a recursive grammar?

a) semantic rules
b) production rules
c) recursive language
d) recursive function
View Answer

Answer: b
Explanation: In natural language semantics, recursive grammar plays a vital role as well as in
syntax. A recursive grammar in a context free language is a formal grammar which consists
of recursive production rules.
advertisement

2. ________ is the consequence of dynamic programming.

a) Bellman equation
b) Frobenius equation
c) Linear equation
d) Boolean expression
View Answer

Answer: a
Explanation: Dynamic programming can lead to recursive optimization that can restate a
multistep optimization problem in its recursive form. The Bellman equation that writes the
value of the optimization problem at an earlier time in terms of its value at a later time is the
result of dynamic programming.

3. How many types of self-referential recursive data are there in computer programs?
a) 6
b) 2
c) 10
d) 4
View Answer

Answer: b
Explanation: There are two types of self-referential definitions and these are inductive and
coinductive definitions. An inductively defined recursive data definition must have to specify
how to construct instances of the data. For example, linked lists are defined as an inductively
recursive data definition.
4. _______ recursion consists of multiple self-references.
a) binary recursion
b) single recursion
c) multiple recursion
d) coinductive recursion
View Answer

Answer: c
Explanation: A recursion which consists of multiple self-references and requires exponential
time and space is called multiple recursion. Multiple recursions include tree traversal of a
graph, such as in a depth-first search. However, single recursion is more efficient than
multiple recursion.

5. The argument of each recursive call is the content of a field of the original output. This
definite characteristic belongs to which of the following function?
a) Structurally recursive function
b) Generativity recursive function
c) General function
d) Indirect recursive function
View Answer

Answer: a
Explanation: A structurally recursive function has a characteristic that the argument to each
recursive call is the content of a field of the original input. This recursion function includes
mostly all tree traversals which includes binary tree creation and search, XML processing etc.
advertisement

6. The mutual recursion is also termed as ______

a) indirect recursion
b) constructive recursion
c) generative recursion
d) definitive recursion
View Answer

Answer: a
Explanation: When a function is not called by itself but by another function which it has
called either directly or indirectly is termed as Indirect recursion. Mutual recursion is a more
symmetric term of Indirect recursion.

7. In which of the following problems recurrence relation holds?

a) Optimal substructure
b) Tower of Hanoi
c) Hallmark substitution
d) Longest common subsequence
View Answer

Answer: b
Explanation: We can have recurrence relation for tower of hanoi and that is hn = 2 hn-1 + 1h1
= 1, for n number of disks in one peg.
8. Which of the following functions generates new data at each step of a method?
a) corecursive function
b) structural recursive function
c) unirecursive function
d) indirect function
View Answer

Answer: a
Explanation: The generatively recursive functions or corecursive functions is defined as
generation of the new data at each step that is successive approximation in Regula Falsi
method. In terms of loop variants, there is no such loop variant, and termination depends on
error of approximation.

9. Every recursive algorithm must have the problem of ________

a) overhead of repeated function calls
b) collision of different function calls
c) searching for all duplicate elements
d) make only two recursive calls
View Answer

Answer: a
Explanation: Due to the overhead of repeated function calls and returns, recursive algorithms
may be inefficient for small data. Any recursion can be replaced by iteration with an explicit
call stack whereas iteration can be replaced with tail recursion.
advertisement

10. If the height of a binary tree is 54, how many null pointers are there as children?
a) 1267
b) 358
c) 56
d) 255
View Answer

Answer: d
Explanation: Depth-first search (DFS) algorithm of a binary tree, is a trivial example of short-
circuiting. We can have a standard recursive algorithm in case of DFS. Now, a perfect binary
tree of height h has 2h+1 Null pointers as children.
h = 54
254+1
255.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Strong Induction and Well-Ordering
» Next - Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Strong Induction and Well-Ordering
Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Stacks & Queues

2. C++ Programming Examples on Numerical Problems & Algorithms
3. C# Programming Examples on Data Structures
4. C++ Programming Examples on Graph Problems & Algorithms
5. Python Programming Examples on Graphs
6. C Programming Examples on Trees
7. C++ Algorithms, Problems & Programming Examples
8. Data Structures & Algorithms II – Questions and Answers
9. C Programming Examples on Searching and Sorting
10. Java Programming Examples on Graph Problems & Algorithms
11. Java Programming Examples on Mathematical Functions
12. Python Programming Examples on Linked Lists
13. Python Programming Examples on Searching and Sorting
14. Python Programming Examples on Trees
15. C Programming Examples on Graph Problems & Algorithms
16. C Programming Examples
17. C Programming Examples on Linked List
18. Discrete Mathematics Questions and Answers
19. Data Structure Questions and Answers – Search an Element in an Array using
Recursion – 1
20. C Program for Level Order Traversal of a Tree using Recursion

advertisement

Discrete Mathematics Questions and

Answers – Fundamental Principle of
Counting
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Fundamental Principle of Counting”.

1. How many even 4 digit whole numbers are there?

a) 1358
b) 7250
c) 4500
d) 3600
View Answer

Answer: c
Explanation: The thousands digit cannot be zero, so there are 9 choices. There are 10
possibilities for the hundreds digit and 10 possibilities for the tens digit. The units digit can
be 0, 2, 4, 6 or 8, so there are 5 choices. By the basic counting principle, the number of even
five digit whole numbers is 9 × 10 × 10 × 5 = 45,00.
advertisement

2. In a multiple-choice question paper of 15 questions, the answers can be A, B, C or D. The

number of different ways of answering the question paper are ________
a) 65536 x 47
b) 194536 x 45
c) 23650 x 49
d) 11287435
View Answer

Answer: a
Explanation: There are 415 = 65536 x 47 different ways of answering the exam paper of 15
MCQs.

3. How many words with seven letters are there that start with a vowel and end with an A?
Note that they don’t have to be real words and letters can be repeated.
a) 45087902
b) 64387659
c) 12765800
d) 59406880
View Answer

Answer: d
Explanation: The first letter must be a vowel, so there are 5 choices. The second letter can be
any one of 26, the third letter can be any one of 26, the fourth letter can be any one of 26 and
fifth and sixth letters can be any of 26 choices. The last letter must be an A, so there is only 1
choice. By the basic counting principle, the number of ‘words’ is 5 × 26 × 26 × 26 × 26 × 26
× 1 = 59406880.

4. Neela has twelve different skirts, ten different tops, eight different pairs of shoes, three
different necklaces and five different bracelets. In how many ways can Neela dress up?
a) 50057
b) 14400
c) 34870
d) 56732
View Answer

Answer: b
Explanation: By the basic counting principle, the number of different ways = 12 × 10 × 8 × 3
× 5 = 14400. Note that shoes come in pairs. So she must choose one pair of shoes from ten
pairs, not one shoe from twenty.
5. How many five-digit numbers can be made from the digits 1 to 7 if repetition is allowed?
a) 16807
b) 54629
c) 23467
d) 32354
View Answer

Answer: a
Explanation: 75 = 16807 ways of making the numbers consisting of five digits if repetition is
allowed.
advertisement

6. For her English literature course, Ruchika has to choose one novel to study from a list of
ten, one poem from a list of fifteen and one short story from a list of seven. How many
different choices does Rachel have?
a) 34900
b) 26500
c) 12000
d) 10500
View Answer

Answer: d
Explanation: By the Basic Counting Principle, the number of different choices is 10 × 15 × 7
= 10500.

7. There are two different Geography books, five different Natural Sciences books, three
different History books and four different Mathematics books on a shelf. In how many
different ways can they be arranged if all the books of the same subjects stand together?
a) 353450
b) 638364
c) 829440
d) 768700
View Answer

Answer: c
Explanation: There are four groups of books which can be arranged in 4! different ways.
Among those books, two are Geography books, five are Natural Sciences books, three are
History books and four are Mathematics books. Therefore, there are 4! × 2! × 5! × 3! × 4! =
829440 ways to arrange the books.

8. The code for a safe is of the form PPPQQQQ where P is any number from 0 to 9 and Q
represents the letters of the alphabet. How many codes are possible for each of the following
cases? Note that the digits and letters of the alphabet can be repeated.
a) 874261140
b) 537856330
c) 549872700
d) 456976000
View Answer
Answer: d
Explanation: 103 × 264 = 456976000 possible codes are formed for the safe with the
alphanumeric digits.

9. Amit must choose a seven-digit PIN number and each digit can be chosen from 0 to 9.
How many different possible PIN numbers can Amit choose?
a) 10000000
b) 9900000
c) 67285000
d) 39654900
View Answer

Answer: a
Explanation: By the basic counting principle, the total number of PIN numbers Amit can
choose is 10 × 10 × 10 × 10 × 10 × 10 × 10 = 10,000000.

10. A head boy, two deputy head boys, a head girl and 3 deputy head girls must be chosen out
of a student council consisting of 14 girls and 16 boys. In how many ways can they are
chosen?
a) 98072
b) 27384
c) 36428
d) 44389
View Answer

Answer: b
Explanation: There are 16 × 15 × 14 + 14 × 13 × 12 × 11 = 27384 ways to choose from a
student council.
advertisement

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Recursion
» Next - Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Recursion
Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
advertisement
advertisement

Recommended Posts:
 1. C Programming Examples on File Handling
2. Simple Java Programs
3. C# Programming Examples
4. C Programming Examples on Bitwise Operations
5. C Programming Examples on Strings
6. C Programming Examples without using Recursion
7. Professional Communication Questions & Answers
8. C# Programming Examples on LINQ
9. C Programming Examples using Recursion
10. Python Programming Examples
11. Java Programming Examples on File Handling
12. Python Programming Examples on Linked Lists
13. C++ Programming Examples on Combinatorial Problems & Algorithms
14. Simple C Programs
15. Java Programming Examples on Combinatorial Problems & Algorithms
16. C Programming Examples on Combinatorial Problems & Algorithms
17. Best Reference Books – Technology, Engineering and Sciences
18. Engineering Mathematics Questions and Answers
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers

advertisement

Discrete Mathematics Questions and

Answers – Counting – Pigeonhole Principle
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Counting – Pigeonhole Principle”.

1. A drawer contains 12 red and 12 blue socks, all unmatched. A person takes socks out at
random in the dark. How many socks must he take out to be sure that he has at least two blue
socks?
a) 18
b) 35
c) 28
d) 14
View Answer

Answer: d
Explanation: Given 12 red and 12 blue socks so, in order to take out at least 2 blue socks, first
we need to take out 12 shocks (which might end up red in worst case) and then take out 2
socks (which would be definitely blue). Thus we need to take out total 14 socks.
advertisement

2. The least number of computers required to connect 10 computers to 5 routers to guarantee

5 computers can directly access 5 routers is ______
a) 74
b) 104
c) 30
d) 67
View Answer

Answer: c
Explanation: Since each 5 computer need directly connected with each router. So 25
connections + now remaining 5 computer, each connected to 5 different routers, so 5
connections = 30 connections. Hence,
c1->r1, r2, r3, r4, r5
c2->r1, r2, r3, r4, r5
c3->r1, r2, r3, r4, r5
c4->r1, r2, r3, r4, r5
c5->r1, r2, r3, r4, r5
c6->r1
c7->r2
c8->r3
c9->r4
c10->r5

Now, any pick of 5 computers will have a direct connection to all the 5 routers.

3. In a group of 267 people how many friends are there who have an identical number of
friends in that group?
a) 266
b) 2
c) 138
d) 202
View Answer

Answer: b
Explanation: Suppose each of the 267 members of the group has at least 1 friend. In this case,
each of the 267 members of the group will have 1 to 267-1=266 friends. Now, consider the
numbers from 1 to n-1 as holes and the n members as pigeons. Since there is n-1 holes and n
pigeons there must exist a hole which must contain more than one pigeon. That means there
must exist a number from 1 to n-1 which would contain more than 1 member. So, in a group
of n members there must exist at least two persons having equal number of friends. A similar
case occurs when there exist a person having no friends.

4. When four coins are tossed simultaneously, in _______ number of the outcomes at most
two of the coins will turn up as heads.
a) 17
b) 28
c) 11
d) 43
View Answer

Answer: c
Explanation: The question requires you to find number of the outcomes in which at most 2
coins turn up as heads i.e., 0 coins turn heads or 1 coin turns head or 2 coins turn heads. The
number of outcomes in which 0 coins turn heads is 4C0 = 1 outcome. The number of
outcomes in which 1 coin turns head is 4C1 = 6 outcomes. The number of outcomes in which
2 coins turn heads is,
4
C2 = 15 outcomes. Therefore, total number of outcomes = 1 + 4 + 6 = 11 outcomes.
advertisement

5. How many numbers must be selected from the set {1, 2, 3, 4} to guarantee that at least one
pair of these numbers add up to 7?
a) 14
b) 5
c) 9
d) 24
View Answer

Answer: b
Explanation: With 2 elements pairs which give sum as 7 = {(1,6), (2,5), (3,4), (4,3)}. So
choosing 1 element from each group = 4 elements (in worst case 4 elements will be either
{1,2,3,4} or {6,5,4,3}). Now using pigeonhole principle = we need to choose 1 more element
so that sum will definitely be 7. So Number of elements must be 4 + 1 = 5.

6. During a month with 30 days, a cricket team plays at least one game a day, but no more
than 45 games. There must be a period of some number of consecutive days during which the
team must play exactly ______ number of games.
a) 17
b) 46
c) 124
d) 24
View Answer

Answer: d
Explanation: Let a1 be the number of games played until day 1, and so on, ai be the no games
played until i. Consider a sequence like a1,a2,…a30 where 1≤ai≤45, ∀ai. Add 14 to each
element of the sequence we get a new sequence a1+14, a2+14, … a30+14 where, 15 ≤ ai+14
≤ 59, ∀ai. Now we have two sequences 1. a1, a2, …, a30 and 2. a1+14, a2+14, …, a30+14.
having 60 elements in total with each elements taking a value ≤ 59. So according to pigeon
hole principle, there must be at least two elements taking the same value ≤59 i.e., ai = aj + 14
for some i and j. Therefore, there exists at least a period such as aj to ai, in which 14 matches
are played.

7. In how many ways can 8 different dolls be packed in 5 identical gift boxes such that no
box is empty if any of the boxes hold all of the toys?
a) 2351
b) 365
c) 2740
d) 1260
View Answer

Answer: d
Explanation: Dolls are different but the boxes are identical. If none of the boxes is to remain
empty, then we can pack the dolls in one of the following ways:
Case i. 2, 2, 2, 1, 1
Case ii. 3, 3, 1, 1
Case i: Number of ways of achieving the first option 2, 2, 2, 1, 1. Two dolls out of the 8 can
be selected in 8C2 ways, another 2 out of the remaining 6 can be selected in 6C2 ways, another
2 out of the remaining 4 can be selected in 4C2 ways and the last two dolls can be selected in
1
C1 ways each. However, as the boxes are identical, the two different ways of selecting which
box holds the first two dolls and which one holds the second set of two dolls will look the
same. Hence, we need to divide the result by 2. Therefore, total number of ways of achieving
the 2, 2, 2, 1, 1 is = (8C2 * 6C2 * 4C2 * 1C1 * 1C1) / 2 = 1260.

8. A group of 20 girls plucked a total of 200 oranges. How many oranges can be plucked one
of them?
a) 24
b) 10
c) 32
d) 7
View Answer

Answer: a
Explanation: Suppose all of them plucked the different number of oranges. A girl can pluck at
least 0 oranges and the number of oranges plucks by each student is distinct. So, total number
of plucked oranges should be less than 100. But 0+1+2…..+19+20 = 210>200 a
contradiction.
Thus there exist two girls who plucked the same number of oranges. If thus there exist two
girls who plucked the same number of oranges. It means each girl of remaining 18 students
plucked different number of oranges. Number of oranges Plucked by 18 students =
0+1+2+3…+17 = 153 oranges. Number of oranges plucked by remaining 2 student = 200 –
153 = 47. Both students plucked same number of oranges. So, Number of oranges plucked by
one of them = 47/2=24.
advertisement

9. In a get-together party, every person present shakes the hand of every other person. If there
were 90 handshakes in all, how many persons were present at the party?
a) 15
b) 14
c) 16
d) 17
View Answer

Answer: b
Explanation: Let the total number of persons present at the party be m, Then, [{x *(x−1)}/2]
= 90.
x = 14.

10. A bag contains 25 balls such as 10 balls are red, 7 are white and 8 are blue. What is the
minimum number of balls that must be picked up from the bag blindfolded (without replacing
any of it) to be assured of picking at least one ball of each colour?
a) 10
b) 18
c) 63
d) 35
View Answer

Answer: b
Explanation: Consider three buckets red, white and blue and we want the total number of
balls such that each bucket contain at least one ball. Now consider the state of picking up a
ball without replacement : (normally you consider the worst case scenario in these cases)
Starting 10 balls all are red and thus goes to bucket name Red. Now again picking up the ball
gives 7 balls which are of same colour and put all of them in a bucket named White. The next
pick will definitely be of different colour thus: we picked 10 + 7 + 1 = 18.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

advertisement

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
» Next - Discrete Mathematics Questions and Answers – Counting – Linear Permutation
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
Discrete Mathematics Questions and Answers – Counting – Linear Permutation
advertisement
advertisement

Recommended Posts:

1. Dynamic Programming Problems and Solutions

2. Online Training – SAN, C, Linux Kernel & Device Drivers Training
3. Contact
4. C# Programming Examples on Mathematics
5. Engineering Mathematics Questions and Answers
6. Course Registration – 2
7. Discrete Mathematics Questions and Answers
8. Automata Theory Questions and Answers – Applications of Pumping
Lemma/Pigeonhole principle
9. Discrete Mathematics Questions and Answers – Permutation Groups
10. Discrete Mathematics Questions and Answers – Group Theory
11. Discrete Mathematics Questions and Answers – Geometric Probability
12. Discrete Mathematics Questions and Answers – Groups – Subgroups
13. Discrete Mathematics Questions and Answers – Multiplication Theorem on
Probability
14. Discrete Mathematics Questions and Answers – Advanced Counting Techniques –
Recurrence Relation
 15. Discrete Mathematics Questions and Answers – Counting – Number of Equations
Solution
16. Discrete Mathematics Questions and Answers – Counting – Number and Sum of
Divisors
17. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial
Expansion
18. Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
19. Discrete Mathematics Questions and Answers – Discrete Probability – Bayes
Theorem
20. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient

advertisement

Discrete Mathematics Questions and

Answers – Counting – Linear Permutation
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Counting – Linear Permutation”.

1. How many substrings (of all lengths inclusive) can be formed from a character string of
length 8? (Assume all characters to be distinct)
a) 14
b) 21
c) 54
d) 37
View Answer

Answer: d
Explanation: Let’s consider the given string is CLEAN, so set of string of length 1 =
{C,L,E,A,N} ; cardinality of set = 5 set of string of length 2 = {CL,EE,EA,NN}, set of string
of length 3 = {CLE,LEE,EAN}, set of strings of length 4 = {CLEN,LEAN}, set of strings of
length 5 = {CLEAN} and set of string of length 0 = {} and we cannot have any substring of
length 6 as given string has only 5 length. So total no of substrings are possible = 0 length
substring + 1 length substring + 2 length substrings +3 length substrings + 4 length substrings
+ 5 length substrings = 1 + 5 + 4 + 3 + 2 + 1 = 16 means for 1 length string to n length
substrings it will sum of the n natural no from 1 to n.
so 1+2+3+…+n = \(\frac{n(n+1)}{2}\) so total no substrings possible = 0 length strings +
\(\frac{n(n+1)}{2}\) = 1+ \([\frac{n(n+1)}{2}]\) so total no of substrings possible in n length
string (All length inclusive )= 1 + \([\frac{n(n+1)}{2}] = \frac{8(8+1)}{2}\) = 37.
advertisement

2. The number of diagonals can be drawn in a hexagon is ______

a) 9
b) 32
c) 16
d) 21
View Answer

Answer: a
Explanation: A hexagon has 6 sides. We obtain the diagonals by joining the vertices in pairs.
Total number of sides and diagonals = 6C2 = \(\frac{6 * 5}{2 * 1}\) = 5×3 = 15. This includes
its 6 sides also. So, Diagonals = 15 – 6 = 9. Hence, the number of diagonals is 9.

3. The number of binary strings of 17 zeros and 8 ones in which no two ones are adjacent is
___________
a) 43758
b) 24310
c) 32654
d) 29803
View Answer

Answer: a
Explanation: First place 17 zeroes side by side _ 0 _ 0 _ 0 … 0 _ and 8 1’s can be placed in
any of the (17+1) available gaps hence the number of ways = n+1Ck = 43758.

4. How many words that can be formed with the letters of the word ‘SWIMMING’ such that
the vowels do not come together? Assume that words are of with or without meaning.
a) 430
b) 623
c) 729
d) 1239
View Answer

Answer: c
Explanation: The word ‘SWIMMING contains 8 letters. Of which, I occurs twice and M
occurs twice. Therefore, the number of words formed by this word = \(\frac{8!}{2!*2!}\) =
10080. In order to find the number of permutations that can be formed where the two vowels
I and I come together, we group the letters that should come together and consider that group
as one letter. So, the letters are S, W, M, M, N, G, (I, I). So, the number of letters are 7 the
number of ways in which 7 letters can be arranged is 7! = 5040. In I and I, the number of
ways in which I and I can be arranged is 2!. Hence, the total number of ways in which the
letters of the ‘SWIMMING’ can be arranged such that vowels are always together are
\(\frac{7!}{2!*2!}\) = 5040 ways. The number of words in which the vowels do not come
together is = (10080 – 5040) = 5040.

5. A number lock contains 6 digits. How many different zip codes can be made with the
digits 0–9 if repetition of the digits is allowed upto 3 digits from the beginning and the first
digit is not 0?
a) 254307
b) 453600
c) 458760
d) 972340
View Answer
Answer: b
Explanation: For the first position, there are 9 possible choices (since 0 is not allowed). After
that number is chosen, there are 10 possible choices (since 0 is now allowed) for the second
digit, for the third digit there are 10 possible choices, 9 possible choices for the fourth digit
and 8 possible choices for the fifth digit and 7 possible choices for the sixth digit. The count
of number locks = 453600.
advertisement

6. Let M be a sequence of 9 distinct integers sorted in ascending order. How many distinct
pairs of sequences, N and O are there such that i) each are sorted in ascending order, ii) N has
5 and O has 4 elements, and iii) the result of merging N and O gives that sequence?
a) 84
b) 35
c) 194
d) 138
View Answer

Answer: a
Explanation: Selecting any 3 elements from given 9 elements gives 9C3 = 84 number of
distinct pairs of sequences.

7. 14 different letters of alphabet are given, words with 6 letters are formed from these given
letters. How many number of words are there which have at least one letter repeated?
a) 892742
b) 999988
c) 213216
d) 786730
View Answer

Answer: b
Explanation: Number of words which have at least one letter replaced = total number of
words – total number of words in which no letter is repeated, => 106 – 12P6 => 1000000 − 924
= 999988.

8. In how many ways can 10 boys be seated in a row having 28 seats such that no two friends
occupy adjacent seats?
a) 13P5
b) 9P29
c) 19P10
d) 15P7
View Answer

Answer: c
Explanation: First let us take the 18 unoccupied seats. They create 19 slots i.e., one on the left
of each seat and one on the right of the last one. So we can place the 10 boys in any of these
19 slots that are, 19P10 ways.

9. In how many ways can the letters of the word SANFOUNDRY be rearranged such that the
vowels always appear together?
a) \(\frac{(8 + 3)!}{2!}\)
b) \(\frac{6!}{2!}\)
c) 8!*3!
d) \(\frac{4!}{8!}\)
View Answer

Answer: c
Explanation: Take AOU together and treat it like 1 entity and arrange SNFNDRY in 8! Ways.
Then, the AOU can be arranged in 3! ways. So, total arrangements = 8! * 3! = 40320 * 6 =
241920.
advertisement

10. How many ways can 8 prizes be given away to 7 students, if each student is eligible for
all the prizes?
a) 40325
b) 40320
c) 40520
d) 40720
View Answer

Answer: b
Explanation: Now the first student is eligible to receive any of the 8 available prizes (so 8
ways), the second student will receive a prize from rest 7 available prizes (so 7 ways), the
third student will receive his prize from the rest 6 prizes available(so 6 ways) and so on. So
total ways would be 8! = 8*7*6*5*4*3*2*1 = 40320. Hence, the 7 prizes can be distributed
in 40320 ways.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
» Next - Discrete Mathematics Questions and Answers – Counting – Circular Permutations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
Discrete Mathematics Questions and Answers – Counting – Circular Permutations
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Combinatorial Problems & Algorithms

2. C# Programming Examples on Conversions
3. C++ Programming Examples on Combinatorial Problems & Algorithms
4. C# Programming Examples on Mathematics
 5. C Programming Examples without using Recursion
6. Engineering Mathematics Questions and Answers
7. Linear Integrated Circuits Questions and Answers
8. C Programming Examples on Matrix
9. Professional Communication Questions & Answers
10. Python Programming Examples
11. Discrete Mathematics Questions and Answers
12. Java Programming Examples on String Handling
13. C Programming Examples on Strings
14. C# Programming Examples on Strings
15. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and
Variance of Random Variables
16. Discrete Mathematics Questions and Answers – Counting – Number of Equations
Solution
17. Discrete Mathematics Questions and Answers – Properties of Tree
18. Discrete Mathematics Questions and Answers – Counting – Number and Sum of
Divisors
19. Discrete Mathematics Questions and Answers – Multiplication Theorem on
Probability
20. Discrete Mathematics Questions and Answers – Number Theory – Complement of a
Number

advertisement

Discrete Mathematics Questions and

Answers – Counting – Circular
Permutations
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Counting – Circular Permutations”.

1. In a playground, 3 sisters and 8 other girls are playing together. In a particular game, how
many ways can all the girls be seated in a circular order so that the three sisters are not seated
together?
a) 457993
b) 3386880
c) 6544873
d) 56549
View Answer

Answer: b
Explanation: There are 3 sisters and 8 other girls in total of 11 girls. The number of ways to
arrange these 11 girls in a circular manner = (11– 1)! = 10!. These three sisters can now
rearrange themselves in 3! ways. By the multiplication theorem, the number of ways so that 3
sisters always come together in the arrangement = 8! × 3!. Hence, the required number of
ways in which the arrangement can take place if none of the 3 sisters is seated together: 10! –
(8! × 3!) = 3628800 – (40320 * 6) = 3628800 – 241920 = 3386880.
advertisement

2. How many numbers of three digits can be formed with digits 1, 3, 5, 7 and 9?
a) 983
b) 120
c) 345
d) 5430
View Answer

Answer: b
Explanation: Here number of digits, n = 5 and number of places to be filled-up r = 3. Hence,
the required number is 5P3 = 5!/2!*3! = 120.

3. The size of a multiset is 6 which is equal to the number of elements in it with counting
repetitions (a multiset is an unordered collection of elements where the elements may repeat
any number of times). Determine the number of multisets can be grouped from n distinct
elements so that at least one element occurs exactly twice?
a) 326
b) 28
c) 45
d) 62
View Answer

Answer: c
Explanation: There are six places to be filled in the multiset using the n distinct elements. At
least one element has to occur exactly twice and that would leave 4 more places in the
multiset means that at most four elements can occur exactly once. Thus there are two
mutually exclusive cases as follows: 1) Exactly one element occurs exactly twice and select
this element in n ways. Fill up the remaining four spots using 5 distinct elements from the
remaining n−1 elements in n-1C4 ways. 2) Exactly four elements that occur at least once each.
Hence, the total number of ways to form the multiset is
n
C2 + n * n-1C4 = 6C2 + 6 * 6-1C4 = 45.

4. How many words can be formed with the letters of the word ‘CASTLE’ when ‘O’ and ‘A’
occupying end places.
a) 217
b) 48
c) 75
d) 186
View Answer

Answer: b
Explanation: When ‘O’ and ‘A’ are occupying end-places => A.S.T.L. (CE). We can see that
(CE) are fixed, hence A, S, T, L can be arranged in 4! Ways and (C, E) can be arranged
themselves is 2! ways. So, the number of words formed = 4! x 2! = 48 ways.
5. Determine the number of ways of choosing a cricket team (consists of 11 players) out of 18
players if a particular player is never chosen.
a) 12798
b) 22800
c) 31824
d) 43290
View Answer

Answer: c
Explanation: If a particular player is never chosen that would mean 11 players are selected
out of 18 players. Hence, required number of ways = 18C11 = 31824.
advertisement

6. How many different choices can be made from 5 roses, 4 marigold and 8 sunflowers if at
least one flower is to be chosen for making of garland?
a) 269
b) 270
c) 281
d) 320
View Answer

Answer: a
Explanation: Number of ways of selecting roses = (5+1) = 6 ways, number of ways of
selecting marigold = (4+1) = 5 ways, and the number of ways of selecting sunflowers = (8+1)
= 9 ways. Total number of ways of selecting flowers= 6 * 5 * 9 = 270. But this includes when
no flowers or zero flowers is selected (There is no flowers of a different type, hence n=0 =>
2n = 20 = 1). Hence, the number of ways of selecting at least one fruit = 270 – 1 = 269.

7. In how many ways 6 pens can be selected from 15 identical black pens?
a) 9*3!
b) 21
c) 14!
d) 1
View Answer

Answer: d
Explanation: Here the pens are identical, the total number of ways of selecting 6 pens is 1.

8. Determine the number of ways of selecting one or more letters from the letters BBBBBB?
a) 6
b) 73
c) 23
d) 56
View Answer

Answer: a
Explanation: The number of ways of selecting one ‘B’s = 1, selecting two ‘B’s = 1, selecting
three ‘B’s = 1, selecting four ‘B’s = 1, selecting five ‘B’s = 1 and selecting six ‘B’s = 1.
Hence, the required number of ways = 6.
9. Determine the number of ways such that 5 men and 5 women be seated at a round table if
no two women are seated together.
a) 654870
b) 144521
c) 362160
d) 5634
View Answer

Answer: c
Explanation: The men and women can be seated alternately so that no two women will sit
together. Hence, 4 women can be seated on alternate seats at a round table in (4 – 1)! or 6
ways. Now, the 5 men can be seated in the remaining seats in 5! or 120 ways. Therefore the
total number of ways in this case will be (10-1)! – (120 * 6) = 362160.
advertisement

10. Find the number of ways in which 4 people E, F, G, H, A, C can be seated at a round
table, such that E and F must always sit together.
a) 32
b) 290
c) 124
d) 48
View Answer

Answer: d
Explanation: E and F can sit together in all arrangements in 2! Ways. Now, the arrangement
of the 5 people in a circle can be done in (5 – 1)! or 24 ways. Therefore, the total number of
ways will be 24 x 2 = 48.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Linear Permutation
» Next - Discrete Mathematics Questions and Answers – Counting – Combinations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Linear Permutation
Discrete Mathematics Questions and Answers – Counting – Combinations
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Trees

2. C Programming Examples on Searching and Sorting
 3. Python Programming Examples on Linked Lists
4. C Programming Examples on Linked List
5. C++ Programming Examples on Combinatorial Problems & Algorithms
6. Java Programming Examples on Combinatorial Problems & Algorithms
7. Java Programming Examples on Collections
8. C# Programming Examples on Mathematics
9. C Programming Examples on Combinatorial Problems & Algorithms
10. C Programming Examples on Arrays
11. Engineering Mathematics Questions and Answers
12. C# Programming Examples on Sorting
13. C# Programming Examples on Matrix
14. Java Programming Examples on Arrays
15. C# Programming Examples on Arrays
16. C++ Programming Examples on STL
17. Discrete Mathematics Questions and Answers
18. Discrete Mathematics Questions and Answers – Cartesian Product of Sets
19. Probability and Statistics Questions and Answers – Permutations and Combinations
20. Discrete Mathematics Questions and Answers – Algebraic Laws on Sets

advertisement

Discrete Mathematics Questions and

Answers – Counting – Combinations
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Counting – Combinations”.

1. There are 6 equally spaced points A, B, C, D, E and F marked on a circle with radius R.
How many convex heptagons of distinctly different areas can be drawn using these points as
vertices?
a) 7! * 6
b) 7C5
c) 7!
d) same area
View Answer

Answer: d
Explanation: Since all the points are equally spaced; hence the area of all the convex
heptagons will be the same.
advertisement

2. There are 2 twin sisters among a group of 15 persons. In how many ways can the group be
arranged around a circle so that there is exactly one person between the two sisters?
a) 15 *12! * 2!
b) 15! * 2!
c) 14C2
d) 16 * 15!
View Answer

Answer: a
Explanation: We know that n objects can be arranged around a circle in \(\frac{(n−1)!}{2}\).
If we consider the two sisters and the person in between the brothers as a block, then there
will 12 others and this block of three people to be arranged around a circle. The number of
ways of arranging 13 objects around a circle is in 12! ways. Now the sisters can be arranged
on either side of the person who is in between the sisters in 2! ways. The person who sits in
between the two sisters can be any of the 15 in the group and can be selected in 15 ways.
Therefore, the total number of ways 15 *12! * 2!.

3. The number of words of 4 consonants and 3 vowels can be made from 15 consonants and 5
vowels, if all the letters are different is ________
a) 3! * 12C5
b) 16C4 * 4C4
c) 15! * 4
d) 15C4 * 5C3 * 7!
View Answer

Answer: d
Explanation: There are 4 consonants out of 15 can be selected in 15C4 ways and 3 vowels can
be selected in 5C3 ways. Therefore, the total number of groups each containing 4 consonants
and 3 vowels = 15C4 * 4C3. Each group contains 7 letters which can be arranged in 7! ways.
Hence, required number of words = 15C4 * 5C3 * 7!.

4. How many ways are there to arrange 7 chocolate biscuits and 12 cheesecake biscuits into a
row of 19 biscuits?
a) 52347
b) 50388
c) 87658
d) 24976
View Answer

Answer: b
Explanation: Consider the situation as having 19 spots and filling them with 7 chocolate
biscuits and 19 cheesecake biscuits. Then we just choose 7 spots for the chocolate biscuits
and let the other 10 spots have cheesecake biscuits. The number of ways to do this job is 19C7
= 50388.

5. If a, b, c, d and e are five natural numbers, then find the number of ordered sets(a, b, c, d,
e) possible such that a+b+c+d+e=75.
a) 65C5
b) 58C6
c) 72C7
d) 74C4
View Answer

Answer: d
Explanation: Let assumes that there are 75 identical balls which are to be arranged in 5
different compartments (Since a, b, c, d, e are distinguishable). If the balls are arranged in the
row. We have 74 gaps where we can place a ball in each gap since we need 5 compartments
we need to place only 4 balls. We can do this in 74C4 ways.
advertisement

6. There are 15 people in a committee. How many ways are there to group these 15 people
into 3, 5, and 4?
a) 846
b) 2468
c) 658
d) 1317
View Answer

Answer: d
Explanation: The number of ways to choose 3 people out of 9 is 15C3. Then, number of ways
to choose 5 people out of (15-3) = 12 is 12C5. Finally, the number of ways to choose 4 people
out of (12-4) = 8 is 8C4. Hence, by the rule of product, 15C3 + 12C5 + 8C4 = 1317.

7. There are six movie parts numbered from 1 to 6. Find the number of ways in which they be
arranged so that part-1 and part-3 are never together.
a) 876
b) 480
c) 654
d) 237
View Answer

Answer: b
Explanation: The total number of ways in which 6 part can be arranged = 6! = 720. The total
number of ways in which part-1 and part-3 are always together: = 5!*2! = 240. Therefore, the
total number of arrangements, in which they are not together is = 720 − 240 = 480.

8. How many ways are there to divide 4 Indian countries and 4 China countries into 4 groups
of 2 each such that at least one group must have only Indian countries?
a) 6
b) 45
c) 12
d) 76
View Answer

Answer: a
Explanation: The number of ways to divide 4+4=8 countries into 4 groups of 2 each is as
follows: (10C2 * 10C2 * 10C2 * 10C2)/4! = 30. Since it is required that at least one group must
have only Indian countries, we need to subtract 30 from the number of possible groupings
where all 4 groups have 1 Indian country and 1 China country each. This is equivalent to the
number of ways to match each of the 4 Indian countries with one China country: 4! = 24.
Therefore, the answer is 30 – 24 = 6.

9. Find the number of factors of the product 58 * 75 * 23 which are perfect squares.
a) 47
b) 30
c) 65
d) 19
View Answer

Answer: b
Explanation: Any factor of this number should be of the form 5a * 7b * 2c. For the factor to be
a perfect square a, b, c has to be even. a can take values 0, 2, 4, 6, 8, b can take values 0, 2, 4
and c can take values 0, 2. Total number of perfect squares = 5 * 3 * 2 = 30.
advertisement

10. From a group of 8 men and 6 women, five persons are to be selected to form a committee
so that at least 3 women are there on the committee. In how many ways can it be done?
a) 686
b) 438
c) 732
d) 549
View Answer

Answer: a
Explanation: We may have (2 men and 3 women) or (1 men and 4 woman) or (5 women
only). The Required number of ways = (8C2 × 6C3) + (8C1 × 6C4) + (6C5) = 686.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Circular Permutations
» Next - Discrete Mathematics Questions and Answers – Counting – Number and Sum of
Divisors
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Circular Permutations
Discrete Mathematics Questions and Answers – Counting – Number and Sum of Divisors
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Classes

2. Geotechnical Engineering I Questions and Answers
3. Engineering Mathematics Questions and Answers
4. C# Programming Examples on Mathematics
5. Discrete Mathematics Questions and Answers
6. Discrete Mathematics Questions and Answers – Relations – Partial Orderings
7. Discrete Mathematics Questions and Answers – Logics – Nested Quantifiers
 8. Discrete Mathematics Questions and Answers – Isomorphism in Graphs
9. Discrete Mathematics Questions and Answers – Addition Theorem on Probability
10. Discrete Mathematics Questions and Answers – Discrete Probability – Bayes
Theorem
11. Discrete Mathematics Questions and Answers – Groups – Subgroups
12. Discrete Mathematics Questions and Answers – Advanced Counting Techniques –
Recurrence Relation
13. Discrete Mathematics Questions and Answers – Counting – Number of Equations
Solution
14. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial
Expansion
15. Discrete Mathematics Questions and Answers – Counting – Number and Sum of
Divisors
16. Probability and Statistics Questions and Answers – Permutations and Combinations
17. Discrete Mathematics Questions and Answers – Multiplication Theorem on
Probability
18. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of
Inclusion Exclusion
19. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
20. Discrete Mathematics Questions and Answers – Counting – Division of Objects

advertisement

Discrete Mathematics Questions and

Answers – Counting – Number and Sum of
Divisors
« Prev
Next »

This set of Advanced Discrete Mathematics Questions and Answers focuses on “Counting –
Number and Sum of Divisors”.

1. Calculate sum of divisors of n = 1900.

a) 6530
b) 5346
c) 3387
d) 4123
View Answer

Answer: d
Explanation: The prime factorization of 1800 is 19 * 22 * 52 and
S(22) = 1 + 2 + 4 = 7
S(52) = 1 + 5 + 25 = 31
Therefore, S(1800) = 19 * 7 * 31 = 4123.
advertisement
2. Given the factorization of a number n, then the sum of divisors can be computed in
_______
a) linear time
b) polynomial time
c) O(logn)
d) o(n+1)
View Answer

Answer: b
Explanation: The exact number of running time depends on the computational model. When
analyzing arithmetic with large numbers, we usually count either bit operations or arithmetic
operations of size O(logn) (where n is the input size). Now, given the factorization of a
number n, then the sum of divisors can be computed in polynomial time.

3. Calculate the sum of divisors of N = 9600.

a) 23250
b) 47780
c) 54298
d) 31620
View Answer

Answer: d
Explanation: The prime factorization of 1800 is 3 * 27 * 52 and
S(3) = 1 + 3 = 4
S(22) = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 = 255
S(52) = 1 + 5 + 25 = 31
Therefore, S(1800) = 4 * 255 * 31 = 31620.

4. Find the number of odd positive integers of the number 456.

a) 54
b) 27
c) 16
d) 8
View Answer

Answer: d
Explanation: To find the number of odd factors (which includes 1), we can exclude any
power of 2 and do the same. So, for 456, we have (3 + 1)(1 + 1) = 8 odd positive factors.

5. The number of even positive integers of 3200 is _______

a) 24
b) 32
c) 164
d) 209
View Answer

Answer: a
Explanation: To find the number of even factors, we can multiply the number of even factors
by the power of 2. For 3200, we have (5 + 1)(1 + 1)(2) = 24 even factors.
advertisement
6. What is the sum of divisors of the number 1872?
a) 12493
b) 5438
c) 45862
d) 654
View Answer

Answer: a
Explanation: The prime factorization of 1872 is 13 * 32 * 24 and S(24) = 1 + 2 + 4 + 8 + 16 =
31, S(52) = 1 + 5 + 25 = 31. Therefore, S(1872) = 31 * 31 * 13 = 12493.

7. Find the odd positive integer of the number 6500.

a) 43
b) 17
c) 12
d) 87
View Answer

Answer: c
Explanation: To find the number of odd factors, we can exclude any power of 2 and do the
same. So, for 6500, we have (5 + 1)(1 + 1) = 6 * 2 = 12 odd positive factors.

8. How many even positive integers are there in the number 7362?
a) 16
b) 58
c) 35
d) 165
View Answer

Answer: a
Explanation: To find the number of even factors, we can multiply the number of even factors
by the power of 2. For 5065, we have (3 + 1)(1 + 1)(2) = 4 * 2 * 2 = 16 even factors.

9. Calculate sum of divisors of n = 8620.

a) 7549
b) 54201
c) 18102
d) 654
View Answer

Answer: c
Explanation: The prime factorization of 1800 is 431 * 22 * 5 and
S(22) = 1 + 2 + 4 = 7
S(52) = 1 + 5 = 6
Therefore, S(1800) = 6 * 7 * 431 = 18102.
advertisement

10. Find the odd positive integer of the number 4380.

a) 108
b) 48
c) 75
d) 8
View Answer

Answer: b
Explanation: To find the number of odd factors, we can exclude any power of 2 and do the
same. So, for 6500, we have (5 + 1)(3 + 1)(1 + 1) = 6 * 4 * 2 = 48 odd positive factors.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice advanced questions and answers on all areas of Discrete Mathematics, here is
complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Combinations
» Next - Discrete Mathematics Questions and Answers – Counting – Division of Objects
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Combinations
Discrete Mathematics Questions and Answers – Counting – Division of Objects
advertisement
advertisement

Recommended Posts:

1. Python Programming Examples

2. C++ Programming Examples on Numerical Problems & Algorithms
3. Engineering Mathematics Questions and Answers
4. C Programming Examples using Recursion
5. Java Programming Examples on Numerical Problems & Algorithms
6. C Programming Examples on Numerical Problems & Algorithms
7. C Programming Examples on Mathematical Functions
8. C# Programming Examples on Mathematics
9. Discrete Mathematics Questions and Answers
10. T-Primes Problem – Dynamic Programming Solutions
11. Discrete Mathematics Questions and Answers – Advanced Counting Techniques –
Recurrence Relation
12. Discrete Mathematics Questions and Answers – Counting – Number of Equations
Solution
13. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial
Expansion
14. Discrete Mathematics Questions and Answers – Counting – Circular Permutations
15. Discrete Mathematics Questions and Answers – Counting – Linear Permutation
16. Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
17. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
18. Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants
and Essentials
 19. Discrete Mathematics Questions and Answers – Counting – Derangements
20. Discrete Mathematics Questions and Answers – Logics – Types of Statements

advertisement

Discrete Mathematics Questions and

Answers – Counting – Division of Objects
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on
“Counting – Division of Objects”.

1. For a gaming competition, 8 girls are planning on splitting up into 3 (non-empty) groups.
How many ways can they split up into these groups?
a) 465
b) 1056
c) 966
d) 3215
View Answer

Answer: c
Explanation: Using the inclusion-exclusion principle, the total number of ways of splitting
the girls into 3 groups is 38 + 3.(28) + 3.(18). However, since the three groups are identical we
need to divide by 3!. Hence, the answer is 966.
advertisement

2. In a picnic with 20 persons where 6 chocolates will be given to the top 8 children(the
chocolates are distinct: first, second). How many ways can this be done?
a) 18C6
b) 20P6
c) 25C4 * 6!
d) 19P5
View Answer

Answer: b
Explanation: This is a permutation problem since the chocolates are distinct. The answer is
P(20, 6) -> the number of ways to arrange 20 things taken 6 at a time -> which is
\(\frac{20!}{(20-6)!}\) = 20*19*18*17*16*15.

3. How many ways can one choose 20 cookies from 45 different types (assuming there are at
least 20 of each type)?
a) 64C21 * 15
b) 64C20
c) 44C20 * 2!
d) 65C22
View Answer
Answer: b
Explanation: Imagine the 20 cookies one is choosing are indistinguishable dots. The 45
different types of cookies are like 45 distinguishable boxes and so the answer is C(45 + 20-1,
20) = 64C20.

4. Assume that it is an afternoon. What is the time on the 24 hour clock after 146 hours?
a) 12:10 pm
b) 8:30 am
c) 3 am
d) 2 pm
View Answer

Answer: d
Explanation: Divide 146 with 24. The remainder is the time on the 24 hour clock. So, 146 =
6*24 + 2 and the result is 2pm.

5. There are 28 identical oranges that are to be distributed among 8 distinct girls. How many
ways are there to distribute the oranges?
a) 22P7
b) 34C6
c) 35C7
d) 28C8
View Answer

Answer: c
Explanation: By the definition of star and bar problem, there are n+r-1Cr-1 possible
distributions of n identical objects among r distinct bins. Now, there are n = 28 identical
objects and r = 8 distinct bins. Using the formula above, there are 35C7 ways to distribute the
oranges.
advertisement

6. There are 5 distinct fruits. How many ways can they be planted into identical fruit plants?
a) 87
b) 52
c) 76
d) 128
View Answer

Answer: b
Explanation: These fruits can be placed into 1, 2, 3, 4 or 5 fruit plants. The number of
distributions of fruits into fruit plants will thus be the sum of Stirling numbers of the second
kind: S(5,1) + S(5,2) + S(5,3) + S(5,4) + S(5,5) = 1 + 15 + 25 + 10 + 1 = 52.

7. A woman has 14 identical pens to distribute among a group of 10 distinct students. How
many ways are there to distribute the 14 pens such that each student gets at least one pencil?
a) 15C10
b) 10C5 * 11
c) 15C8 * 4!
d) 13C9
View Answer
Answer: d
Explanation: For this type of problem, n>=r must be true and so according to stars and bars
model, the number of possible arrangements of stars and bars is n-1Cr-1 or equivalently,
there are n-1Cr-1 distributions of n identical objects into r distinct non-empty bins. In this
example, there are n = 14 identical objects to be distributed among r=10 distinct bins. Using
the above formula, the number of possible distributions is 13C9.

8. Suppose that M is the product of k distinct primes. Find the number of ways to write N as
the product of positive integers(>1), where the order of terms does not matter.
a) MCN-k
b) NCM
c) N * Bk
d) Bk
View Answer

Answer: d
Explanation: To solve the problem first find the prime factorization of each term of the
product, and place the factors of each term into a box. Then, since N is the product of distinct
prime factors, each prime factor appears in a unique box. Since the product of all of these
terms is N, each prime factor must be in a box. Conversely, for any arrangement of these n
distinct primes into r identical boxes, multiply the primes in a box to create a term and the
product of these terms results in N. This establishes the bijection and the number of ways is
Bk which is Bell number.

9. How many ways are there to place 7 differently colored toys into 5 identical urns if the
urns can be empty? Note that all balls have to be used.
a) 320
b) 438
c) 1287
d) 855
View Answer

Answer: d
Explanation: The problem can be described as distinct objects into any number of identical
bins and this number can be found with B7 = ∑S(7,k), where S(7,k) is the number of
distributions of 5 distinct objects into k identical non-empty bins, so that S(7,1) = 1, S(7,2) =
63, S(7,3) = 301, S(7,4) = 350 and S(7,5) = 140. These values can be found using the
recurrence relation identity for Stirling numbers of the second kind. Thus, B7 = 1 + 63 + 301
+ 350 + 140 = 855.
advertisement

10. Suppose, there are 7 of your friends who want to eat pizza (8 distinct people in total). You
order a 16-cut pizza (16 identical slices). How many distributions of pizza slices are there if
each person gets at least one slice of pizza?
a) 346
b) 6435
c) 3214
d) 765
View Answer
Answer: b
Explanation: This problem can be viewed as identical objects distributed into distinct non-
empty bins. Using the formula for these kind of distributions n-1Cr-1 = 15C7 = 6435. Thus,
there are distributions of the pizza slices.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice
Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our
social networks below and stay updated with latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Number and Sum of
Divisors
» Next - Discrete Mathematics Questions and Answers – Counting – Number of Equations
Solution
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Number and Sum of Divisors
Discrete Mathematics Questions and Answers – Counting – Number of Equations Solution
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Mathematical Functions

2. Probability and Statistics Questions and Answers
3. Python Programming Examples
4. C Programming Examples on Numerical Problems & Algorithms
5. Engineering Mathematics Questions and Answers
6. Java Programming Examples on Computational Geometry Problems & Algorithms
7. C++ Programming Examples on Computational Geometry Problems & Algorithms
8. C# Programming Examples on LINQ
9. C# Programming Examples on Mathematics
10. Discrete Mathematics Questions and Answers
11. Discrete Mathematics Questions and Answers – Cyclic Groups
12. Discrete Mathematics Questions and Answers – Number Theory – Primes and
Greatest Common Divisors
13. Discrete Mathematics Questions and Answers – Algorithms – Integers and Division
14. C++ Program to Implement First Fit Decreasing for 1-D Objects and M Bins
15. C Program to Implement First Fit Decreasing for 1-D Objects and M Bins
16. Discrete Mathematics Questions and Answers – Sets
17. Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants
and Essentials
18. Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
19. Discrete Mathematics Questions and Answers – Counting – Number of Equations
Solution
20. Discrete Mathematics Questions and Answers – Set Operations – 2
 advertisement

Discrete Mathematics Questions and

Answers – Counting – Number of
Equations Solution
« Prev
Next »

This set of Discrete Mathematics Questions & Answers for Exams focuses on “Counting –
Number of Equations Solution”.

1. The linear system Cx = d is known as _________ if d! = 0.

a) homogeneous
b) heterogeneous
c) nonhomogeneous
d) augmented system
View Answer

Answer: c
Explanation: A linear system Cx = d is known as a homogeneous system if d! = 0. The
homogeneous linear system Ax = 0 is called its corresponding homogeneous linear system.
advertisement

2. Every linear equation determines a _______ in n-dimensional space for n variables.

a) shipshape
b) hyperplane
c) cone
d) pyramid
View Answer

Answer: b
Explanation: In an m-dimensional space, every linear equation produces a hyperplane for n
variables. The solution set is the intersection of these hyperplanes and is planar which may
have any dimension smaller than m.

3. Determine all possibilities for the number of solutions of the system of 7 equations in 5
unknowns and it has x1 = 0, x2 = −6, and x3 = 4 as a solution.
a) unique or infinitely many
b) unique
c) finitely many
d) zero
View Answer

Answer: a
Explanation: Let i be the number of equations and j be the number of unknowns in the given
system. Since i> j, the system has at least one solution x1 = 0, x2 = −6, and x3 = 4 and so it is
consistent. Thus, it results in either a unique solution or infinitely many solutions.
4. Determine all possibilities for the solution set of the homogeneous system that has y1 = 6,
y2 = −4, y3 = 0 as a solution.
a) zero
b) infinitely many
c) finitely many
d) only one
View Answer

Answer: b
Explanation: Since m<n, the system is either inconsistent or has infinitely many solutions.
Since y1 = 6, y2 = −4, y3 = 0 is a solution of the system, the system is not inconsistent. Thus
the only possibility is infinitely many solutions.

5. Determine all possibilities for the solution set of the homogeneous system of 5 equations in
3 unknowns and the rank of the system is 3.
a) more than two
b) only one
c) zero
d) infinite
View Answer

Answer: c
Explanation: Since the rank of this homogeneous system(which is always consistent) and the
number of unknowns are equal, the only possible solution is zero and it is a unique solution.
advertisement

6. Determine all possibilities for the solution set of a homogeneous system that has y1 = 5, y2
= −3, y3 = 2 as a solution.
a) one
b) finitely many
c) infinitely many
d) either one or infinitely many
View Answer

Answer: c
Explanation: The possibilities for the solution set for any homogeneous system is either a
unique solution or infinitely many solutions. Since the homogeneous system has the zero
solution and y1 = 5, y2 = −3, y3 = 2 is another solution, it has at least two distinct solution.
Thus the only possibility is infinitely many solutions.

7. Determine all possibilities for the solution set of the system of 2 equations in 3 unknowns
that has x1 = 4, x2 = −7, x3 = 0 as a solution.
a) one or finitely many
b) infinite
c) finite
d) zero
View Answer
Answer: b
Explanation: Since m1 = 4, x2 = −7, x3 = 0 is a solution of the system, the system is not inconsistent. Thus the only possibility is
infinitely many solutions.

8. Determine all possibilities for the solution set of a homogeneous system of 4 equations in 4 unknowns.
a) only one
b) finitely many or zero
c) zero
d) one or infinitely many
View Answer

Answer: b
Explanation: Here the number of equations and the number of unknowns are equal and the system is homogeneous, so it may have the zero
solution or infinitely many solutions.

9. Determine all possibilities for the solution set of a homogeneous system of 6 equations in 5 unknowns.
a) only one
b) zero
c) one or infinitely many
d) finitely many
View Answer

Answer: c
Explanation: Since the system is homogeneous and there are more equations than the number of unknowns, so the possibilities are either a
unique solution or infinitely many solutions. However, if the rank r of the system is 5, then it can be a unique solution as well as if r<5, then
there are infinitely many solutions.
advertisement

10. Determine all possibilities for the solution set of a homogeneous system of 5 equations in 4 unknowns and the rank of the system is 3.
a) finite
b) zero or finitely many
c) only one
d) infinite
View Answer

Answer: d
Explanation: A homogeneous system is consistent. The rank is r = 3 and the number of variables is n = 4. Hence there is n – r = 1 free
variable. Thus there are infinitely many solutions.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all exam questions on Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Division of Objects
» Next - Discrete Mathematics Questions and Answers – Counting – Derangements
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Division of Objects
Discrete Mathematics Questions and Answers – Counting – Derangements
advertisement
advertisement

Recommended Posts:

1. Control Systems Questions and Answers

2. Java Programming Examples on Numerical Problems & Algorithms
3. C# Programming Examples on Mathematics
4. C++ Programming Examples on Numerical Problems & Algorithms
5. Dynamic Programming Problems and Solutions
6. C Programming Examples on Numerical Problems & Algorithms
7. Numerical Methods Questions and Answers
8. Engineering Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers
10. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
11. Discrete Mathematics Questions and Answers – Counting – Combinations
12. Ordinary Differential Equations Questions and Answers – Bernoulli Equations
13. Linear Algebra Questions and Answers – System of Equations and their Consistencies
14. Ordinary Differential Equations Questions and Answers – First Order Linear Differential Equations
15. Discrete Mathematics Questions and Answers – Counting – Linear Permutation
16. Discrete Mathematics Questions and Answers – Counting – Number and Sum of Divisors
17. Discrete Mathematics Questions and Answers – Counting – Division of Objects
18. Ordinary Differential Equations Questions and Answers – Separable and Homogeneous Equations
19. Discrete Mathematics Questions and Answers – Counting – Circular Permutations
20. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient

advertisement

Discrete Mathematics Questions and Answers – Counting –

Derangements
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Counting – Derangements”.

1. Determine the number of derangements of (2, 4, 6, 1, 3, 5) that end with integer 2, 4 and 6 in some order?
a) 128
b) 29
c) 54
d) 36
View Answer

Answer: d
Explanation: The place of 2, 4, 6 is specified i.e. each of them will get their place out of the last 3 places only. So 1, 3, 5 will automatically
get one of the places in the first 3 places. This must ensure that 2, 4 and 6 occupies one of the last 3 places each and 1, 3 and 5 one of 1st 3
places each. Hence, 1, 3 and 5 can be arranged in 3! ways and 2, 4 and 6 also in 3! Ways. So, no of such derangements = 3! * 3! = 6 * 6 =
36.
advertisement

2. A nursery teacher has 5 pencil boxes to give out to her five students. Determine the probability that at least one student gets their name
tag?
a) \(\frac{19}{30}\)
b) \(\frac{26}{47}\)
c) \(\frac{123}{537}\)
d) \(\frac{12}{79}\)
View Answer

Answer: a
Explanation: There are 5!= 120 ways to give out the pencil boxes. By using complementary probability, the number of ways where nobody
gets their pencil boxes is
5!(\(\frac{1}{0!} – \frac{1}{1!} + … – \frac{1}{5!}\))
= 44. Hence, the required probability is \(\frac{120 – 44}{120} = \frac{19}{30}\).

3. Farhan has received 9 gifts from 9 different people. In how many ways can Farhan receives the gifts such that no one gives him real gifts?
a) 133496
b) 326654
c) 218744
d) 745331
View Answer

Answer: a
Explanation: By the derangements formula, the number of possible derangements should be 9!(\(\frac{1}{0!} – \frac{1}{1!} + … –
\frac{1}{9!}\)) = 133496. Hence, there are a total of ways to give the gifts to him such that no one distributes the real gifts.

4. There are 7 groups in a picnic who has brought their own lunch box, and then the 7 lunch box are exchanged within those groups.
Determine the number of ways that they can exchange the lunch box such that none of them can get their own.
a) 655
b) 328
c) 1854
d) 3765
View Answer

Answer: c
Explanation: This can be solved by the derangement formula:
!n = n!(1 – \(\frac{1}{1!} + \frac{1}{2!} – \frac{1}{3!} + … + \frac{(-1)^n1}{n!}\)) ⇒ 7! = 1854.

5. Computational complexity of derangements is of __________

a) NP-complete
b) NP-hard
c) NP
d) P
View Answer
Answer: a
Explanation: Computational complexity of derangements is NP-complete in order to determine whether a given permutation group consists
of any derangements or not.
advertisement

6. There are 5 different-colored boxes in a room each with a distinct cover. Find out the number of ways so that these covers can be put on
the boxes such that none of the boxes can have right covers on it? (Assume that all the covers must be on the boxes).
a) 208
b) 137
c) 239
d) 24
View Answer

Answer: d
Explanation: Let the box covers be A, B, C, D and E. The possible ways for the covers to not be in the exact order of A, B, C, D, E are: 4! =
24 ways. (Since correct order i.e., A, B, C, D and E must be eliminated from such arrangements).

7. A postman can put 12 letters into their respective envelopes such that exactly 5 will go into the right envelope. Find the number of ways
of doing this work.
a) 2984300
b) 1610496
c) 5322167
d) 3768650
View Answer

Answer: b
12
Explanation: The number of ways in which the 5 correct envelopes can be selected = C5 = 864
Derangement of the remaining 7 envelopes & letters = 1864 (derangement value for 7 is 1864)
Total No of ways of arrangement = 1864 * 864 = 1610496.

8. Determine the number of ways In a single competition a singing couple from 5 boys and 5 girls can be formed so that no girl can sing a
song with their respective boy?
a) 123
b) 44
c) 320
d) 21
View Answer

Answer: b
Explanation: This is a case of derangement of 5 boys and 5 girls. The required number of ways can be described as D = 5! (1 –
\(\frac{1}{1!} + \frac{1}{2!} – \frac{1}{3!} + \frac{1}{4!} – \frac{1}{5!}) = 120(\frac{11}{30})\) = 44 ways.

9. What is the sum of all 6 digit numbers which can be formed using the digits 2, 3, 5, 6 and 9 exactly once?
a) 986546600
b) 25611866
c) 433338798
d) 319999680
View Answer
Answer: d
Explanation: Note that sum of all possible numbers = (n-1)!(sum of the digits involved)(1111…n times), where n is the number of digits.
Here n = 6, we have (6-1)!(2+3+5+6+9)(111111) = 5!*(24)*(111111) = 319999680.
advertisement

10. Determine the average of all four digit numbers that can be made using all the digits 2, 3, 5, 7 and 11 exactly once?
a) 3993
b) 1555
c) 5486
d) 1347
View Answer

Answer: b
Explanation: First we need to find the sum of all possible numbers and then divide it by the total such numbers possible to gain an average
of all the numbers. So, we have (n-1)!(sum of digits)(1111…n times)/n!. Here n = 4. Therefore, (5-1)!(2+3+5+7+11)(1111)/5! = 1555.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Number of Equations Solution
» Next - Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Number of Equations Solution
Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Mathematical Functions

2. C Programming Examples on Numerical Problems & Algorithms
3. C Programming Examples on Arrays
4. C++ Programming Examples on Combinatorial Problems & Algorithms
5. Java Programming Examples on Combinatorial Problems & Algorithms
6. C# Programming Examples on Functions
7. C# Programming Examples on LINQ
8. C Programming Examples on Combinatorial Problems & Algorithms
9. Simple Java Programs
10. Python Programming Examples
11. Java Programming Examples on Arrays
12. C Programming Examples on Matrix
13. Engineering Mathematics Questions and Answers
14. C# Basic Programming Examples
15. C Programming Examples using Recursion
 16. C# Programming Examples on Conversions
17. Simple C Programs
18. Dynamic Programming Problems and Solutions
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Counting – Terms

in Binomial Expansion
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Counting – Terms in Binomial Expansion”.

1. In a blindfolded game, a boy can hit the target 8 times out of 12. If he fired 8 shots, find out the probability of more than 4 hits?
a) 2.530
b) 0.1369
c) 0.5938
d) 3.998
View Answer

Answer: c
Explanation: Here, n = 8, p = 0.6, q = 0.4. Suppose X = number of hits x0 = 0 number of hits, x1 = 1 hit, x2 = 2 hits, and so on.
8 5 3 8 6 2 8 7 1 8 8 0
So, (X) = P(x5) + P(x6) + P(x7) + P(x8) = C5(0.6) (0.4) + C5(0.6) (0.4) + C7(0.6) (0.4) + C8(0.6) (0.4) = 0.5938.
advertisement

2. A fair coin is tossed 15 times. Determine the probability in which no heads turned up.
-3
a) 2.549 * 10
b) 0.976
-5
c) 3.051 * 10
d) 5.471
View Answer

Answer: c
Explanation: According to the null hypothesis it is a fair coin and so in that case the probability of flipping at least 59% tails is =
15 15 -5
C0(0.5) = 3.051 * 10 .

3. When a programmer compiles her code there is a 95% chance of finding a bug every time. It takes three hours to rewrite her code when
she finds out a bug. Determine the probability such that she will finish her coding by the end of her workday. (Assume, a workday is 7
hours)
a) 0.065
b) 0.344
c) 0.2
d) 3.13
View Answer
Answer: c
Explanation: A success is a bug-free compilation, and a failure is the finding out of a bug. The programmer has 0, 1, 2, or 3 failures and so
0 0 0
her probability of finishing the program is : Pr(X=0) + Pr(X=1) + Pr(X=2) + Pr(X=3) = (0.95) (0.05) + (0.95) (0.05) + (0.95) (0.05) +
0
(0.95) (0.05) = 0.2.

4. Determine the probability when a die is thrown 2 times such that there are no fours and no fives occur?
a) \(\frac{4}{9}\)
b) \(\frac{56}{89}\)
c) \(\frac{13}{46}\)
d) \(\frac{3}{97}\)
View Answer

Answer: a
Explanation: In this experiment, throwing a die anything other than a 4 is a success and rolling a 4 is failure. Since there are two trials, the
required probability is
2 2 0
b(2; 2, \(\frac{5}{6}\)) = C2 * (\(\frac{4}{6}\)) * (\(\frac{2}{6}\)) = \(\frac{4}{9}\).

5. In earlier days, there was a chance to make a telephone call would be of 0.6. Determine the probability when it could make 11 successes
in 20 attempts of phone call.
a) 0.2783
b) 0.2013
c) 0.1597
d) 3.8561
View Answer

Answer: c
Explanation: Probability of success p=0.6 and q=0.4. X=success in making a telephone call. Hence, the probability of 11 successes in 20
20 11 20
attempts = P(X=11) = C11(0.6) (0.4) – 11 = 0.1597.
advertisement

6. By the expression \(\left(\frac{x}{3} + \frac{1}{x}\right)^5\), evaluate the middle term in the expression.
5
a) 10*(x )
b) \(\frac{1}{5}*(\frac{x}{4})\)
c) 10*(\(\frac{x}{3}\))
3
d) 6*(x )
View Answer

Answer: c
Explanation: By using Binomial theorem,the expression \(\left(\frac{x}{3} + \frac{1}{x}\right)^5\) can be expanded as \(\left(\frac{x}{3} +
\frac{1}{x}\right)^5 = ^5C_0(\frac{x}{3})^5 + ^5C_1(\frac{x}{3})^4(\frac{1}{x})^1 + ^5C_2(\frac{x}{3})^3(\frac{1}{x})^2\)
\(+ ^5C_3(\frac{x}{3})^2(\frac{1}{x})^3 + ^5C_4(\frac{x}{3})^1(\frac{1}{x})^4 \) = \((\frac{x}{3})^5 + 5.(\frac{x}{3}) +
10.(\frac{x}{3}) + 10.(\frac{1}{3x}) + 5(\frac{1}{3x^3})\). Hence, the middle term is 10*(\(\frac{x}{3}\)).

4 4
7. Evaluate the expression (y+1) – (y-1) .
2 5
a) 3y + 2y
4 2
b) 7(y + y + y)
3 1
c) 8(y + y )
2 3
d) y + y + y
View Answer
Answer: c
4 4 4 4 4 4 3 4 2 4 1
Explanation: By using Binomial theorem,the expression (y+1) – (y-1) can be expanded as = (y+1) = C0y + C1y + C2y + C3y
4 0 4 4 4 4 3 4 2 4 1 4 0 4 4 4 4 4 3 4 2 4 1 4 0
+ C4y and (y-1) = C0y – C1y + C2y – C3y + C4y . Now, (y+1) – (y-1) = ( C0y + C1y + C2y + C3y + C4y ) –
4 4 4 3 4 2 4 1 4 0 4 3 4 1 3 1
( C0y – C1y + C2y – C3y + C4y ) = 2( C1y + C3y ) = 8(y + y ).

7 9
8. Find the coefficient of x in (x+4) .
a) 523001
b) 428700
c) 327640
d) 129024
View Answer

Answer: d
th n n n-r r 7
Explanation: It is known that (r+1) term, in the binomial expansion of (a+b) is given by, Tr+1 = Cra b . Assuming that x occurs in
th 9 4
the (r+1) term of the expansion (x+4) , we obtain Tr+1 = 129024x .

12
9. Determine the 7th term in the expansion of (x-2y) .
7
a) 6128y
6
b) 59136y
6
c) 52632x
5
d) 39861y
View Answer

Answer: b
7 th 12 n n-r r 12 6 6
Explanation: By assuming that x occurs in the (r+1) term of the expansion (x-2y) , we obtain Tr+1 = Cra b = C6 x (2y) =
6
59136y .
advertisement

8
10. What is the middle term in the expansion of (x/2 + 6y) ?
4
a) 45360x
3
b) 34210x
4
c) 1207x
5
d) 3250x
View Answer

Answer: a
n th
Explanation: We know that in the expansion of (x+y) , if n is even then the middle term is (n/2 + 1) term. Hence, the middle term in the
8 th th
expansion of (x/2 + 6y) is (8/2+1) = 5 term.
5 th 8 n n-r r 8 4 4 4
Now, assuming that x occurs in the (r+1) term of the expansion (x/2+6y) , we obtain Tr+1 = Crx y = C4(x/2) (6y) = 45360x .

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Derangements
» Next - Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Derangements
Best Reference Books – Crystal Growth
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Numerical Problems & Algorithms

2. C# Programming Examples on Mathematics
3. Probability and Statistics Questions and Answers
4. C Programming Examples on Numerical Problems & Algorithms
5. Engineering Mathematics Questions and Answers
6. Terms of Service
7. Discrete Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
9. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 1
10. Discrete Mathematics Questions and Answers – Addition Theorem on Probability
11. Discrete Mathematics Questions and Answers – Geometric Probability
12. Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability
13. Discrete Mathematics Questions and Answers – Counting – Combinations
14. Discrete Mathematics Questions and Answers – Probability Distribution
15. Discrete Mathematics Questions and Answers – Counting – Circular Permutations
16. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion
17. Discrete Mathematics Questions and Answers – Counting – Linear Permutation
18. Discrete Mathematics Questions and Answers – Counting – Division of Objects
19. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
20. Discrete Mathematics Questions and Answers – Counting – Number of Equations Solution

advertisement

Discrete Mathematics Questions and Answers – Counting –

Binomial Coefficient
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Counting – Binomial Coefficient”.

8
1. Calculate the value of C5.
a) 79
b) 43
c) 120
d) 56
View Answer

Answer: d
n 8
Explanation: We can use the formula Ck = \(\frac{n!}{k!(n-k)!}\) to calculate the value of C5 = \(\frac{8!}{5!(8-5)!}\) = 56.
 advertisement

2. In how many ways can you select 9 cupcakes from a box containing 17 cupcakes?
a) 42769
b) 45398
c) 24310
d) 36214
View Answer

Answer: c
17
Explanation: The number of ways to choose 9 cupcakes out of a set of 17 is C9 = \(\frac{17!}{9!(17-9)!}\) = 24,310.

3. How many 4-digit numbers can be formed by using 2, 4, 6, 8, 10, 12 without repetition of digits?
a) 15
b) 42
c) 70
d) 127
View Answer

Answer: a
Explanation: Here making a 4-digit number is equivalent to filling 4 places with 6 numbers. So, the number of ways of filling all the four
6
places is C4 = 15. Hence, the total possible 4-digit numbers from the above 6 numbers are 15.

9 14
4. What is the coefficient of x in the expansion of (x+5) ?
14
a) 5! * C6
14
b) C5
14
c) 54 * C5
11
d) 34 * C5
View Answer

Answer: c
a a a-i i 9
Explanation: the binomial theorem is (x+y) = Σ Ci x y . In order to get the coefficient of x , we need to have a-i=9. Since a=14, i=5.
a 4 4 14
Thus, the answer is C5 * y = 5 * C5.

7 2 12
5. Determine the independent term of x in the expansion of (3x + 4) .
6
a) 220 * 4
b) 230
c) 548* 3!
6 6
d) 220 * 3 * 4
View Answer

Answer: d
n k k n-k 0 0 n 1 1 n-1 2 2 n-2 n n 0 k
Explanation: By using Binomial theorem = ∑k=0 (n ) x y =n x y +n x y +n x y + … + n x y , where (n ) =
n n-r r 12 12-6 6 26 6 6 6
\(\frac{n!}{k!(n−k)!}\). Now, Tr+1 = Cra b , T9+1 = C6a b = 220 * (3x ) * (4) = 220 * 3 * 4 . Hence the coefficient is 220 *
6 6
3 *4 .
advertisement

6. In a game, a fair coin is tossed 6 times. Each time the coin comes up tails, A will pay Rs. 15 but if each time heads come up, A will pay
nothing. Determine the probability that A will win Rs. 45 by playing the game?
a) \(\frac{5}{16}\)
b) \(\frac{4}{31}\)
c) \(\frac{3}{7}\)
d) \(\frac{12}{65}\)
View Answer

Answer: a
Explanation: By using the binomial distribution, to calculate how likely to win Rs. 45 (or equivalently, the likelihood the coin comes up tails
3 times). The possible outcomes of this game are to win Rs. 45. Therefore, the required probability is \(\frac{^6C_3}{26} = \frac{5}{16}\).

8 11
7. Find the coefficient of x in the expansion of (x+2) .
a) 640
b) 326
c) 1320
d) 456
View Answer

Answer: c
th 11 th 3 8 8
Explanation: The coefficient of the 8 term is C8 = 165. Hence, the 8 term of the expansion is 165 * 2 * x = 1320x , where the
coefficient is 1320.

5 7 12
8. Determine the coefficient of the x y term in the polynomial expansion of (m+n) .
a) 792
b) 439
c) 382
d) 630
View Answer

Answer: a
5 7
Explanation: Note that, the “x” in the binomial has to be chosen 5 times out of 12. Thus, the coefficient of the term x y must be equal to
12
the number of combinations of 5 objects out of 12: C5 = 792.

51 51
9. The last digit of the number ((\(\sqrt{51}\) + 1) – \(\sqrt{51}\) – 1) is _______
a) 32
b) 8
c) 51
d) 1
View Answer

Answer: b
71 71
Explanation: Consider the binomial expansion of (m+1) and (m-1) which gives these two
51 51 50 51 49 51 48 51 1 51 0
expressions below respectively: 1) m + C1m + C2m + C3m + … + C50m + C51m
51 51 50 51 49 51 48 51 1 51 0
2) m – C1m + C2m – C3m + … + C50m – C51m .
51 50 51 48 51 46 51 2 51 0
By taking the difference we have, 2( C1m + C3m – C5m + … + C50m – C51m ).
51 50 51 48 51 46 51 2 51 0
In this case, m = \(\sqrt{51}\) and 2( C1m + C3m – C5m + … + C50m – C51m ).
n n 51 51 51 51
Consider, module 10 on the powers(for any natural number n): (51) ≡ (51 mod 10 ) ≡ 1 gives 2( C1 + C3 + C5 + … + C50 +
51 st 51 51 (51 mod 4) 3
C51). Now, by adding the odd terms of the 51 row of the Pascal Triangle 2.(\(\frac{1}{2}\) * 2 ) = 2 = 2 = 2 = 8.
advertisement

6
10. The independent term of x is 80000 in the expansion of (3x+b/x) , where b is a positive constant. What the value of b?
a) 3.97
b) 6.87
c) 8.3
d) 5.2
View Answer

Answer: d
6 6-n n
Explanation: By using the Binomial Theorem, the terms are of the form Cn * (4x) * (b/x) .
6-n n 0 6-n n 0 6-n -n 0
For the term to be independent of x, we need x (1/x) = x ⇒ x (x-1) = x ⇒ x x = x ⇒ 6 – n = n ⇒ 2n = 6 and n = 3. Thus, we
6 3 3
have a constant term of C3 * 3 * b = 8000
3
20 * 27 * b = 80000
3
540 * b = 80000
3
b = 148.14 ⇒ b= 5.2.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
» Next - Discrete Mathematics Questions and Answers – Advanced Counting Techniques – Recurrence Relation
Categories Discrete Mathematics MCQs Post navigation
Best Reference Books – Consumer Electronics
Discrete Mathematics Questions and Answers – Advanced Counting Techniques – Recurrence Relation
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on LINQ

2. Java Programming Examples on Mathematical Functions
3. C++ Programming Examples on Data-Structures
4. Simple C Programs
5. Java Programming Examples on Data-Structures
6. Engineering Mathematics Questions and Answers
7. C# Programming Examples on Mathematics
8. Discrete Mathematics Questions and Answers
9. Probability and Statistics Questions and Answers – Binomial Distribution
10. Discrete Mathematics Questions and Answers – Arithmetic Sequences
11. Discrete Mathematics Questions and Answers – Number Theory – Complement of a Number
12. Discrete Mathematics Questions and Answers – Counting – Number of Equations Solution
13. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 1
14. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
15. Discrete Mathematics Questions and Answers – Discrete Probability – Bayes Theorem
16. Discrete Mathematics Questions and Answers – Counting – Circular Permutations
17. Discrete Mathematics Questions and Answers – Counting – Number and Sum of Divisors
18. Discrete Mathematics Questions and Answers – Advanced Counting Techniques – Recurrence Relation
 19. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
20. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle

advertisement

Discrete Mathematics Questions and Answers – Advanced Counting

Techniques – Recurrence Relation
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Advanced Counting Techniques – Recurrence
Relation”.

1. Consider the recurrence relation a1=4, an=5n+an-1. The value of a64 is _________
a) 10399
b) 23760
c) 75100
d) 53700
View Answer

Answer: a
Explanation: an=5n+an-1
= 5n + 5(n-1) + … + an-2
= 5n + 5(n-1) + 5(n − 2) +…+ a1
= 5n + 5(n-1) + 5(n − 2) +…+ 4 [since, a1=4]
= 5n + 5(n-1) + 5(n − 2) +…+ 5.1 – 1
= 5(n + (n − 1)+…+2 + 1) – 1
= 5 * n(n+1)/ 2 – 1
an = 5 * n(n+1)/ 2 – 1
Now, n=64 so the answer is a64 = 10399.
advertisement

2. Determine the solution of the recurrence relation Fn=20Fn-1 − 25Fn-2 where F0=4 and F1=14.
n-1
a) an = 14*5
n n
b) an = 7/2*2 −1/2*6
n n+1
c) an = 7/2*2 −3/4*6
n n
d) an = 3*2 −1/2*3
View Answer

Answer: b
2
Explanation: The characteristic equation of the recurrence relation is → x −20x+36=0
So, (x-2)(x-18)=0. Hence, there are two real roots x1=2 and x2=18. Therefore the solution to the recurrence relation will have the form:
n n 0 0
an=a2 +b18 . To find a and b, set n=0 and n=1 to get a system of two equations with two unknowns: 4=a2 +b18 =a+b and
1 1
3=a2 +b6 =2a+6b. Solving this system gives b=-1/2 and a=7/2. So the solution to the recurrence relation is,
n n
an = 7/2*2 −1/2*6 .

3. What is the recurrence relation for 1, 7, 31, 127, 499?

a) bn+1=5bn-1+3
b) bn=4bn+7!
c) bn=4bn-1+3
d) bn=bn-1+1
View Answer

Answer: c
Explanation: Look at the differences between terms: 1, 7, 31, 124,…. and these are growing by a factor of 4. So, 1⋅4=4, 7⋅4=28, 31⋅4=124,
and so on. Note that we always end up with 3 less than the next term. So, bn=4bn-1+3 is the recurrence relation and the initial condition is
b0=1.

4. If Sn=4Sn-1+12n, where S0=6 and S1=7, find the solution for the recurrence relation.
n n
a) an=7(2 )−29/6n6
n n
b) an=6(6 )+6/7n6
n+1
c) an=6(3 )−5n
n
d) an=nn−2/6n6
View Answer

Answer: b
2
Explanation: The characteristic equation of the recurrence relation is → x −4x-12=0
n n
So, (x-6)(x+2)=0. Only the characteristic root is 6. Therefore the solution to the recurrence relation will have the form: an=a.6 +b.n.6 . To
0 0 1 1
find a and b, set n=0 and n=1 to get a system of two equations with two unknowns: 6=a6 +b.0.6 =a and 7=a6 +b.1.6 =2a+6b. Solving this
n n
system gives a=6 and b=6/7. So the solution to the recurrence relation is, an=6(6 )−6/7n6 .

5. Find the value of a4 for the recurrence relation an=2an-1+3, with a0=6.
a) 320
b) 221
c) 141
d) 65
View Answer

Answer: c
Explanation: When n=1, a1=2a0+3, Now a2=2a1+3. By substitution, we get a2=2(2a0+3)+3.
Regrouping the terms, we get a4=141, where a0=6.
advertisement

6. The solution to the recurrence relation an=an-1+2n, with initial term a0=2 are _________
a) 4n+7
b) 2(1+n)
2
c) 3n
d) 5*(n+1)/2
View Answer

Answer: b
Explanation: When n=1, a1=a0+2. By substitution we get, a2=a1+2 ⇒ a2=(a0+2)+2 and so on. So the solution to the recurrence relation,
subject to the initial condition should be an=2+2n=2(1+n).

7. Determine the solution for the recurrence relation bn=8bn-1−12bn-2 with b0=3 and b1=4.
n n
a) 7/2*2 −1/2*6
n n
b) 2/3*7 -5*4
n
c) 4!*6
 n
d) 2/8
View Answer

Answer: a
2
Explanation: Rewrite the recurrence relation bn-8bn-1+12bn-2=0. Now from the characteristic equation: x −8x+12=0 we have x:
n n
(x−2)(x−6)=0, so x=2 and x=6 are the characteristic roots. Therefore the solution to the recurrence relation will have the form: bn=b2 +c6 .
0 0 1 1
To find b and c, set n=0 and n=1 to get a system of two equations with two unknowns: 3=b2 +c6 =b+c, and 4=b2 +c6 =2b+6c. Solving
n n
this system gives c=-1/2 and b=7/2. So the solution to the recurrence relation is, bn=7/2*2 −1/2*6 .

8. What is the solution to the recurrence relation an=5an-1+6an-2?

2
a) 2n
b) 6n
c) (3/2)n
d) n!*3
View Answer

Answer: b
Explanation: Check for the left side of the equation with all the options into the recurrence relation. Then, we get that 6n is the required
solution to the recurrence relation an=5an-1 + 6an-2.

9. Determine the value of a2 for the recurrence relation an = 17an-1 + 30n with a0=3.
a) 4387
b) 5484
c) 238
d) 1437
View Answer

Answer: d
Explanation: When n=1, a1=17a0+30, Now a2=17a1+30*2. By substitution, we get a2=17(17a0+30)+60. Then regrouping the terms, we get
a2=1437, where a0=3.
advertisement

10. Determine the solution for the recurrence relation an = 6an-1−8an-2 provided initial conditions a0=3 and a1=5.
n n
a) an = 4 * 2 – 3
n n
b) an = 3 * 7 – 5*3
n
c) an = 5 * 7
n
d) an = 3! * 5
View Answer

Answer: b
2 2
Explanation: The characteristic polynomial is x −6x+8. By solving the characteristic equation, x −6x+8=0 we get x=2 and x=4, these are
n n
the characteristic roots. Therefore we know that the solution to the recurrence relation has the form an=a*2 +b*4 , for some constants a and
n
b. Now, by using the initial conditions a0 and a1 we have: a=7/2 and b=-1/2. Therefore the solution to the recurrence relation is: an = 4 * 2
n n n
– 1*3 = 7/2 * 2 – 1/2*3 .

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
» Next - Discrete Mathematics Questions and Answers – Addition Theorem on Probability
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
Discrete Mathematics Questions and Answers – Addition Theorem on Probability
advertisement
advertisement

Recommended Posts:

1. Dynamic Programming Problems and Solutions

2. Numerical Methods Questions and Answers
3. Advanced Machining Processes Questions and Answers
4. C# Programming Examples on Mathematics
5. Engineering Mathematics Questions and Answers
6. Discrete Mathematics Questions and Answers
7. Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and Partitions
8. Discrete Mathematics Questions and Answers – Number of Relations
9. Digital Signal Processing Questions and Answers – Discrete Time Systems Described by Difference Equations
10. Discrete Mathematics Questions and Answers – Closure on Relations
11. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
12. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
13. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
14. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
15. Discrete Mathematics Questions and Answers – Counting – Linear Permutation
16. Discrete Mathematics Questions and Answers – Counting – Circular Permutations
17. Discrete Mathematics Questions and Answers – Counting – Number and Sum of Divisors
18. Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
19. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
20. Discrete Mathematics Questions and Answers – Counting – Derangements

advertisement

Discrete Mathematics Questions and Answers – Addition Theorem

on Probability
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Addition Theorem on Probability”.

1. Neha has 4 yellow t-shirts, 6 black t-shirts, and 2 blue t-shirts to choose from for her outfit today. She chooses a t-shirt randomly with
each t-shirt equally likely to be chosen. Find the probability that a black or blue t-shirt is chosen for the outfit.
a) \(\frac{8}{13}\)
b) \(\frac{5}{6}\)
c) \(\frac{1}{2}\)
d) \(\frac{7}{12}\)
View Answer

Answer: c
Explanation: Define the events A and B as follows: A=Neha chooses a black t-shirt. B= Neha chooses a blue skirt. Neha cannot choose both
a black t-shirt and a blue t-shirt, so the addition theorem of probability applies:
P(A U B) = P(A) + P(B) = \((\frac{6}{12}) + (\frac{2}{12}) = \frac{3}{6} = \frac{1}{2}\).
advertisement

2. If a fair 15-sided dice is rolled, then is the probability that the roll is an odd number or prime number or both?
a) \(\frac{3}{20}\)
b) \(\frac{4}{19}\)
c) \(\frac{9}{20}\)
d) \(\frac{17}{20}\)
View Answer

Answer: c
Explanation: There are 7 even numbers on the 20-sided dice: 1, 3, 5, 7, 9, 13, 15. There are 6 prime numbers on the 20-sided dice: 2, 3, 5, 7,
11, 13. There are 4 numbers that are both odd and prime: 3, 5, 7, 13. By the rule of sum, the probability that an odd or prime number is
rolled is \((\frac{7}{20}) + (\frac{6}{20}) – (\frac{4}{20}) = \frac{9}{20}\).

3. There are a total of 50 distinct books on a shelf such as 20 math books, 16 physics books, and 14 chemistry books. Find is the probability
of getting a book that is not a chemistry book or not a physics book.
a) \(\frac{4}{17}\)
b) \(\frac{43}{50}\)
c) \(\frac{12}{31}\)
d) 1
View Answer

Answer: d
Explanation: The probability of not getting chemistry book = 1 – (probability of chemistry book)
= 1 – \(\frac{14}{30} = \frac{16}{30}\) and the probability of not getting chemistry book = 1 – (probability of physics book) = 1 –
\(\frac{16}{30} = \frac{14}{30}\). So, the required probability is = \(\frac{16}{30} + \frac{14}{30}\) = 1.

4. A number is selected from the first 20 natural numbers. Find the probability that it would be divisible by 3 or 7?
a) \(\frac{19}{46}\)
b) \(\frac{24}{67}\)
c) \(\frac{12}{37}\)
d) \(\frac{7}{20}\)
View Answer

Answer: d
Explanation: Let X be the event that the number selected would be divisible by 3 and Y be the event that the selected number would be
divisible by 7. Then A u B denotes the event that the number would be divisible by 3 or 7. Now, X = {3, 9, 12, 15, 18} and Y = {7, 14}
whereas S = {1, 2, 3, …,20}. Since A n B = Null set, so that the two events A and B are mutually exclusive and as such we have,
P(A u B) = P(A) + P(B) ⇒ P(A u B) = \(\frac{5}{20} + \frac{2}{20}\)
Therefore, P(A u B) = \(\frac{7}{20}\).
5. There are 24 red marbles in a bag 68 marbles, and 8 of those marbles are both red and white striped. 27 marbles are white striped and of
those marbles, the same 8 marbles would be both red and white striped). Find the probability of drawing out a marble from the bag that is
either red or white striped.
a) \(\frac{12}{35}\)
b) \(\frac{43}{68}\)
c) \(\frac{26}{68}\)
d) \(\frac{32}{55}\)
View Answer

Answer: b
Explanation: The “or” indicates finding the probability of a union of events. Let R be the event that a red marble is drawn and W be the
event that a striped marble is drawn. R U W is the event that a marble that is either a red and a white striped is drawn. By the rule of sum of
probability,
P(R U W) = P(R) + P(W) – p(R ⋂ W) = \(\frac{24}{68} + \frac{27}{68} – \frac{8}{68} = \frac{43}{68}\).
Hence, the probability of drawing a red or white striped marble is \(\frac{43}{68}\).
advertisement

6. If spinner has 3 equal sectors colored yellow, blue and red, then the probability of landing on red or yellow after spinning this spinner is
_______
a) \(\frac{2}{3}\)
b) \(\frac{4}{7}\)
c) \(\frac{6}{17}\)
d) \(\frac{23}{47}\)
View Answer

Answer: a
Explanation: We can have, P(red) = \(\frac{1}{3}\), P(yellow) = \(\frac{1}{3}\), P(red or yellow) = P(red) + P(yellow) = \(\frac{1}{3} +
\frac{1}{3} = \frac{2}{3}\).

7. In a secondary examination, 75% of the students have passed in History and 65% in Mathematics, while 50% passed in both History and
Mathematics. If 35 candidates failed in both the subjects, what is the total number of candidates sit for that exam?
a) 658
b) 398
c) 764
d) 350
View Answer

Answer: d
Explanation: 50% passed in both the subjects, (75-50)% or 25% passed only in History and (65-50)% or 15% passed only in Mathematics,
(50 + 25 + 15)% or 90% passed in both the subjects and 10% failed in both subjects. From the question, 10% of total candidates = 35. So,
total candidates = 350.

8. In a Press Conference, there are 450 foreign journalists. 275 people can speak German, 250 people can speak English, 200 people can
speak Chinese and 260 people can speak Japanese. Find the maximum number of foreigners who cannot speak at least one language.
a) 401
b) 129
c) 324
d) 415
View Answer
Answer: d
Explanation: The total number of journalists = 350.People who speak German = 275 -> people who do not speak German = 75, people who
speak English = 250-> people who do not speak English = 100,people who speak Chinese = 200 -> people who do not speak Chinese = 150,
people who speak Japanese = 260 -> people who do not speak Japanese = 90. The total number of people who do not know at least one
language will be maximum when the sets of people not knowing a particular language are mutually exclusive. Hence, the maximum number
of people who do not know at least one language = 75 + 100 + 150 + 90 = 415.

9. There is a class of 40 students out of which 16 are girls. There are 27 students who are right-handed. How many minimum numbers of
girls who are left-handed in this class?
a) 17
b) 56
c) 23
d) 3
View Answer

Answer: d
Explanation: Number of girls in the class is 16. Number of left-handed pupils + Number of right-handed pupils = 40. So, Number of left-
handed pupils + 27 = 40, Number of left-handed pupils = 13. Therefore, the minimum number of right-handed girls is 16 – 13 = 3.
advertisement

10. How many positive integers less than or equal to 100 are divisible by 2, 4 or 5?
a) 12.3
b) 87.2
c) 45.3
d) 78.2
View Answer

Answer: d
Explanation: To count the number of integers = \(\frac{100}{2} + \frac{100}{4} + \frac{100}{5} – \frac{100}{8} – \frac{100}{20} +
\frac{100}{100}\)
= 50 + 25 + 20 – 12.8 – 5 + 1 = 78.2.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Advanced Counting Techniques – Recurrence Relation
» Next - Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Advanced Counting Techniques – Recurrence Relation
Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability
advertisement
advertisement

Recommended Posts:
 1. Instrumentation Engineering Questions and Answers
2. Electrical Engineering Questions and Answers
3. Electrical & Electronics Engineering Questions and Answers
4. Chemical Engineering Questions and Answers
5. Computer Science Questions and Answers
6. Civil Engineering Questions and Answers
7. Aeronautical Engineering Questions and Answers
8. Information Science Questions and Answers
9. Information Technology Questions and Answers
10. Biotechnology Questions and Answers
11. Metallurgical Engineering Questions and Answers
12. Aerospace Engineering Questions and Answers
13. Agricultural Engineering Questions and Answers
14. Marine Engineering Questions and Answers
15. Bachelor of Computer Applications Questions and Answers
16. Mining Engineering Questions and Answers
17. C# Programming Examples on Mathematics
18. Engineering Mathematics Questions and Answers
19. Probability and Statistics Questions and Answers
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Multiplication

Theorem on Probability
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Multiplication Theorem on Probability”.

1. How many ways are there to select exactly four clocks from a store with 10 wall-clocks and 16 stand-clocks?
a) 325
b) 468
c) 398
d) 762
View Answer

Answer: a
Explanation: To choose any clock for the first pick, there are 10+16=26 options. For the second choice, we have 25 clocks left to choose
from and so on. Thus, by the rule of product, there are 26 * 25 * 24 * 23 = 650 possible ways to choose exactly four clocks. However, we
have counted every clock combination twice. Hence, the correct number of possible ways are 650/2 = 325.
advertisement

2. If a 12-sided fair die is rolled twice, find the probability that both rolls have a result of 8.
a) \(\frac{2}{19}\)
b) \(\frac{3}{47}\)
c) \(\frac{1}{64}\)
d) \(\frac{2}{9}\)
View Answer

Answer: c
Explanation: Each die roll is independent, that is, if the first die roll result is 8, it will not affect the probability of the second die roll
resulting in 8. The probability of rolling one die is \(\frac{1}{8}\). Now, P (1st roll is 8 ∩ 2nd roll is 8). By using the rule of product:
\(\frac{1}{8} * \frac{1}{8}\). Hence, the probability that both die rolls are 8 is \(\frac{1}{64}\).

5 3
3. How many positive divisors does 4000 = 2 5 have?
a) 49
b) 73
c) 65
d) 15
View Answer

Answer: d
x y
Explanation: Any positive divisor of 4000 must be of the form 2 5 , where x and y are integers satisfying o<=x<=5 and 0<=y<=3. There
are 5 possibilities for x and 3 possibilities for y and hence there are 3*5 = 15(rule of product) positive divisors of 4000.

4. Mina has 6 different skirts, 3 different scarfs and 7 different tops to wear. She has exactly one orange scarf, exactly one blue skirt, and
exactly one black top. If Mina randomly selects each item of clothing, find the probability that she will wear those clothings for the outfit.
a) \(\frac{1}{321}\)
b) \(\frac{1}{126}\)
c) \(\frac{4}{411}\)
d) \(\frac{2}{73}\)
View Answer

Answer: b
Explanation: There is a \(\frac{1}{3}\) probability that Mina would randomly select the orange scarf, a \(\frac{1}{6}\) probability to select
the blue skirt, and a \(\frac{1}{7}\) probability to select the black top. These events are independent, that is, the selection of the scarf does
not affect the selection of the tops and so on. Hence, the probability that she selects the clothings of her choice is \(\frac{1}{3} *
\frac{1}{6} * \frac{1}{7}\) = 126.

5. There are 6 possible routes (1, 2, 3, 4, 5, 6) from Chennai to Kochi and 4 routes (7, 8, 9, 10) from the Kochi to the Trivendrum. If each
th th
path is chosen at random, what is the probability that a person can travel from the Chennai to the via the 4 and 9 road?
a) \(\frac{3}{67}\)
b) \(\frac{5}{9}\)
c) \(\frac{2}{31}\)
d) \(\frac{1}{24}\)
View Answer

Answer: d
th th
Explanation: There is a \(\frac{1}{6}\) chance of choosing the 4 path, and there is a \(\frac{1}{4}\) chance of choosing the 9 path. The
selection of the path to the Kochi is independent of the selection of the path to the Trivendrum. Hence, by the rule of product, there is a
th th
\(\frac{1}{6} * \frac{1}{4} = \frac{1}{24}\) chance of choosing the 4 -9 path.
advertisement

6. If two 14-sided dice one is red and one is blue are rolled, find the probability that a 3 on the red die, a 5 on the blue die are rolled.
a) \(\frac{4}{167}\)
b) \(\frac{3}{197}\)
c) \(\frac{5}{216}\)
d) \(\frac{1}{196}\)
View Answer

Answer: b
Explanation: Using the rule of product, there are 196 possible combinations of rolls. Since having the red die = 3 and the blue die = 5 are
one of the 196 combinations, the required probability is \(\frac{1}{14}*\frac{1}{14} = \frac{1}{196}\).

7. Suraj wants to go to Delhi. He can choose from bus services or train services to downtown Punjab. From there, he can choose from 4 bus
services or 7 train services to head to Delhi. The number of ways to get to Delhi is?
a) 51
b) 340
c) 121
d) 178
View Answer

Answer: c
Explanation: Since Suraj can either take a bus or a train downtown and he has 4+7=11 ways to head downtown (Rule of sum). After that, he
can either take a bus or a train to Delhi and hence he has another 4 * 7 = 11 ways to head to Delhi(Rule of sum). Thus, he has 11 * 11 = 121
ways to head from home to Delhi(Rule of product).

8. Two cards are chosen at random from a standard deck of 52 playing cards. What is the probability of selecting a jack and a Spade from
the deck?
a) \(\frac{4}{13}\)
b) \(\frac{1}{13}\)
c) \(\frac{4}{13}\)
d) \(\frac{1}{52}\)
View Answer

Answer: d
Explanation: The required probability is : P(Jack or spade) = P(Jack) * P(spade) = \(\frac{4}{52} * \frac{13}{52} = \frac{1}{52}\).

9. If I throw 3 standard 7-sided dice, what is the probability that the sum of their top faces equals to 21? Assume both throws are
independent to each other.
a) \(\frac{1}{273}\)
b) \(\frac{2}{235}\)
c) \(\frac{1}{65}\)
d) \(\frac{2}{9}\)
View Answer

Answer: a
Explanation: To obtain a sum of 21 from three 7-sided dice is that 3 die will show 7 face up. Therefore, the probability is simply
\(\frac{1}{7} * \frac{1}{7} * \frac{1}{7} = \frac{1}{273}\).
advertisement

10. A box consists of 5 yellow, 12 red and 8 blue balls. If 5 balls are drawn from this box one after the other without replacement, find the
probability that the 5 balls are all yellow balls.
a) \(\frac{5}{144}\)
b) \(\frac{6}{321}\)
c) \(\frac{4}{67}\)
d) \(\frac{1}{231}\)
View Answer

Answer: a
Explanation: The total number of the balls in the box is 25. Let events Y: drawing black balls,
R: drawing red balls, B: drawing green balls. Now the balls are drawn without replacement. For the first draw, there are 25 balls to choose
from, for the second draw it is 25 − 1 = 24 and 23 for the third draw. Then, the probability that the three balls are all yellow = P(Y1) P(Y2 |
Y1) P(Y3 | Y1 ∩ Y2) = \(\frac{5}{24} * \frac{12}{24} * \frac{8}{24} = \frac{5}{144}\).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Addition Theorem on Probability
» Next - Discrete Mathematics Questions and Answers – Geometric Probability
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Addition Theorem on Probability
Discrete Mathematics Questions and Answers – Geometric Probability
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Numerical Problems & Algorithms

2. Contact
3. C# Programming Examples on Mathematics
4. Course Registration – 2
5. Engineering Mathematics Questions and Answers
6. Probability and Statistics Questions and Answers
7. Discrete Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
9. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
10. Probability and Statistics Questions and Answers – Sampling Distribution – 2
11. Discrete Mathematics Questions and Answers – Counting – Division of Objects
12. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
13. Discrete Mathematics Questions and Answers – Counting – Derangements
14. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
15. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
16. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
17. Probability and Statistics Questions and Answers – Baye’s Theorem
18. Discrete Mathematics Questions and Answers – Probability Distribution
19. Discrete Mathematics Questions and Answers – Counting – Combinations
20. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series

advertisement
Discrete Mathematics Questions and Answers – Geometric
Probability
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Geometric Probability”.

1. Suppose, R is a random real number between 5 and 9. What is the probability R is closer to 5 than it is to 6?
a) 12.5%
b) 18%
c) 73%
d) 39.8%
View Answer

Answer: a
Explanation: Since there are infinitely many possible outcomes for the value of X we will take the equally likely outcomes as random points
along the number line from 5 to 9. R will be closer to 5 than it is to 6 if R<5.5. We can easily see it by drawing a probability line. Here, P(R
is closer to 5 than to 6) = (length of segment where 5<R<5.5)/(length of segment where (5<R<9) = 0.5/4 = 0.125 = 12.5%.
advertisement

2. A ball is thrown at a circular bin such that it will land randomly over the area of the bin. Find the probability that it lands closer to the
center than to the edge?
a) 51%
b) 25%
c) 72%
d) 34%
View Answer

Answer: b
Explanation: The set of outcomes are all of the points on the bin, which make up an area of where is the radius of the circle. The points
which are closer to the center than to the edge are those that lie within the circle of radius around the center. Hence, the area of the success
2 2 2 2
outcomes is π(r/2) = πr /4. Thus, P(closer to center than edge)=(area of the desired outcome)/(area of the total outcome) = πr /4 /πr = 1/4
= 0.25 = 25%.

3. A programmer has a 95% chance of finding a bug every time she compiles his code, and it takes her three hours to rewrite the code every
time she discovers a bug. Find the probability that she will finish her program by the end of her workday. (Assume that a workday is 9
hours)
a) 76%
b) 44%
c) 37%
d) 28%
View Answer

Answer: d
Explanation: In this instance, a success is a bug-free compilation, and a failure is the discovery of a bug. The programmer needs to have 0, 1
0 1 2
or 2 failures, so her probability of finishing the program is: P(X=0) + P(X=1) + P(X=2) = (0.95) (0.1) + (0.95) (0.1) + (0.95) (0.1) = 0.28%
= 28%.
4. A football player has a 45% chance of getting a hit on any given pitch. What is the probability that the player earns a hit ignoring the balls
before he strikes out (that requires four strikes)?
a) 0.36
b) 0.95
c) 0.67
d) 0.59
View Answer

Answer: b
Explanation: IA success is a hit and a failure is a strike. The player requires either 0, 1, 2 or 3 failures in order to get a hit before striking out,
so the probability of a hit is:
0 1 2 3
P(X=0) + P(X=1) + P(X=2) + P(X=3) = (0.45) (0.55) + (0.45) (0.55) + (0.45) (0.55) + (0.45) (0.55) = 0.95.

5. What is variance of a geometric distribution having parameter p=0.72?

a) 54%
b) 76%
c) 13%
d) 69%
View Answer

Answer: a
Explanation: The variance of a geometric distribution with parameter p is \(\frac{1-p}{p^2} = \frac{(1-0.72)}{0.722}\) = 0.54 or 54%.
However, the variance of the geometric distribution and the variance of the shifted geometric distribution are identical.
advertisement

6. The probability that it rains tomorrow is 0.72. Find the probability that it does not rain tomorrow?
a) 65%
b) 43%
c) 28%
d) 32%
View Answer

Answer: c
Explanation: we know that the sum of the probability that it rains and the probability that it does not rain must be 1. To determine the
probability that it does not rain, calculate 1 – 0.72 = 0.28.

7. Suppose a rectangle edges equals i = 4.7 and j = 8.3. Now, a straight line drawn through randomly selected two points K and L in adjacent
rectangle edges. Find the condition for the probability such that the drawn triangle area is smaller than c = 9.38.
a) K-L≤18.76
b) K+L≤18.76
c) KL≤18.76
d) K/L≤18.76
View Answer

Answer: c
Explanation: The random sides of the triangle are K and L. These are the uniform random variables with uniform distributions on [0,8.3] and
[0,4.7] respectively. They are independent and their joint distribution is uniform on the rectangle R = [0,8.3]∗[0,4.7]. The condition is
KL/2≤9.38 ⇒ KL≤18.76. The probability that one needs is the ratio between the area under the hyperbola inside R and the area of R.
8. Find the expectation for how many bacteria there are per field if there are 2350 bacteria are randomly distributed over 340 fields (all
having the same size) next to each other.
a) 4.98
b) 3.875
c) 6.91
d) 7.37
View Answer

Answer: c
Explanation: The probability to land in a field for a bacterium is p = 1/340 and since we have n = 2350 bacteria. So, the expectation is m =
np = 2350/340 = 6.91.

2
9. What is the possibility such that the inequality x + b > ax is true, when a=32.4 and b=76.5 and x∈[0,30].
a) 1.91
b) 4.3
c) 2.94
d) 6.1
View Answer

Answer: a
2 2
Explanation: x2+76.5>32.4x is equivalent to x −32.4x+76.5 > 0. By completing the square, x − 32.4x + 266.44 – 266.44 + 76.5 =
2 2
(x−16.2) − 189.94>0, which is the same as (x−16.2) > 189.94, which implies that either x−16.2 > 13.78 ⇒ x > 29.98, or x−16.2 < −2.42
⇒ x < 13.78. Assume that it is a uniform distribution. So, the probability that x > 29.98 is 30 − 29.98 = 0.02 and the probability that x <
189.94 is 1.89. The desired probability is 0.02 + 1.89 = 1.91.
advertisement

10. In a bucket there are 5 purple, 15 grey and 25 green balls. If the ball is picked up randomly, find the probability that it is neither grey nor
purple?
a) \(\frac{5}{9}\)
b) \(\frac{12}{13}\)
c) \(\frac{51}{43}\)
d) \(\frac{2}{7}\)
View Answer

Answer: a
Explanation: If the ball is neither grey nor purple then it must be blue. There are 45 balls in total of which 25 are green and so the probability
of picking a purple ball is \(\frac{25}{45} = \frac{5}{9}\).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability
» Next - Discrete Mathematics Questions and Answers – Probability Distribution
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability
Discrete Mathematics Questions and Answers – Probability Distribution
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on Mathematics

2. Engineering Mathematics Questions and Answers
3. Discrete Mathematics Questions and Answers
4. Probability and Statistics Questions and Answers
5. Probability and Statistics Questions and Answers – F-Distribution
6. Probability and Statistics Questions and Answers – Gamma Distribution
7. Probability and Statistics Questions and Answers – Mean and Variance of Distribution
8. Probability and Statistics Questions and Answers – Theorem of Total Probability
9. Probability and Statistics Questions and Answers – Poisson Distribution
10. Statistical Quality Control Questions and Answers – Modeling Process Quality – Discrete Distributions – 1
11. Probability and Statistics Questions and Answers – Hypergeometric Distributions
12. Probability and Statistics Questions and Answers – Exponential Distribution
13. Statistical Quality Control Questions and Answers – Modeling Process Quality – Discrete Distributions – 2
14. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
15. Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
16. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
17. Discrete Mathematics Questions and Answers – Geometric Sequences
18. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
19. Discrete Mathematics Questions and Answers – Addition Theorem on Probability
20. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion

advertisement

Discrete Mathematics Questions and Answers – Probability

Distribution
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Probability Distribution”.

1. Two fair coins are flipped. As a result of this, tails and heads runs occurred where a tail run is a consecutive occurrence of at least one
head. Determine the probability function of number of tail runs.
a) \(\frac{1}{2}\)
b) \(\frac{5}{6}\)
c) \(\frac{32}{19}\)
d) \(\frac{6}{73}\)
View Answer

Answer: a
Explanation: The sample space of the experiment is S = {HH, HT, TH, TT}. Let X is the number of tails and It takes up the values 0, 1 and
2. Now, P(no tail) = p(0) = \(\frac{1}{4}\), P(one tail) = p(1) = \(\frac{2}{4}\) and P(two tails) = p(2) = \(\frac{1}{4}\). So, X is the number
of tail runs and it takes up the values 0 and 1. P(X = 0) = p(0) = \(\frac{2}{4} = \frac{1}{4}\).
advertisement

2. The length of alike metals produced by a hardware store is approximated by a normal distribution model having a mean of 7 cm and a
standard deviation of 0.35 cm. Find the probability that the length of a randomly chosen metal is between 5.36 and 6.14 cm?
a) 0.562
b) 0.2029
c) 3.765
d) 1.576
View Answer

Answer: b
Explanation: Let L be the random variable that represents the length of the component. It has a mean of 7 cm and a standard deviation of
0.35 cm. To find P( 5.36 < x < 6.14). For x = 5.36, z = \(\frac{5.36 – 6}{0.35}\) = -1.82. For x = 6.14, z = \(\frac{6.14 – 6}{0.35}\) = 0.4 ⇒
P(5.36 < x < 6.14) = P( -1.82 < z < 0.4) = 0.2029.

3. A personal computer has the length of time between charges of the battery is normally distributed with a mean of 66 hours and a standard
deviation of 20 hours. What is the probability when the length of time will be between 58 and 75 hours?
a) 0.595
b) 3.44
c) 0.0443
d) 1.98
View Answer

Answer: c
Explanation: Suppose x be the random variable that represents the length of time. It has a mean of 66 and a standard deviation of 20. Find
the probability that x is between 70 and 90 or P(70 < x < 90). For x = 70, z = \(\frac{58 – 66}{20}\) = -4. For x = 75, z = \(\frac{75 –
66}{20}\) = 0.45. P(70 < x < 90) = P(-4 < z < 0.75) = [area to the left of z = 0.75] – [area to the left of z = -4] = 0.0443. The required
probability when the length of time between 58 and 75 hours is 0.0443.

4. The length of life of an instrument produced by a machine has a normal distribution with a mean of 9.4 months and a standard deviation
of 3.2 months. What is the probability that an instrument produced by this machine will last between 6 and 11.6 months?
a) 0.642
b) 0.4098
c) 0.16
d) 0.326
View Answer

Answer: d
Explanation: We have to find P(6 < x < 11.6). Now, for x = 6, z becomes -1.062 and for z = 11.6, z = 0.687. So, P(6 < x < 11.6) = P(-1.062
< z < 0.687) = 0.326.

5. The speeds of a number of bicycles have a normal distribution model with a mean of 83 km/hr and a standard deviation of 9.4 km/hr. Find
the probability that a bicycle picked at random is travelling at more than 95 km/hr?
a) 0.1587
b) 0.38
c) 0.49
d) 0/278
View Answer
Answer: b
Explanation: Let x be the random variable that represents the speed of bicycle. x has μ = 90 and σ = 9.5. We have to find the probability that
x is higher than 95 or P(x > 95). For x = 95, z = \(\frac{95 – 83}{9.4}\) = 1.27, P(x > 95) = P(z > 1.27) = [total area] – [area to the left of z =
1] = 1 – 0.620 = 0.38. The probability that a car selected at a random has a speed greater than 100 km/hr is equal to 0.38.
advertisement

6. Let us say that X is a normally distributed variable with mean(μ) of 43 and standard deviation (σ) of 6.4. Determine the probability of
X<32.
a) 0.341
b) 0.962
c) 6.231
d) 0.44
View Answer

Answer: a
Explanation: The area is defined as the area under the standard normal curve.Now, for x = 32, z becomes \(\frac{32 – 43}{6.4}\) = -1.71.
Hence, the required probability is P(x < 32) = P(z < -1.71) = 0.341.

7. The time taken to assemble a machine in a certain plant is a random variable having a normal distribution of 32 hours and a standard
deviation of 3.6 hours. What is the probability that a machine can be assembled at this plant in less than 25.4 hours?
a) 0.61
b) 0.674
c) 0.298
d) 1.823
View Answer

Answer: c
Explanation: We have to find P(x < 25.4). Now, for x = 25.4, z becomes \(\frac{25.4 – 32}{3.6}\) = -1.83. Hence, P(z < -1.83) = 0.298.

8. The scores on an admission test are normally distributed with a mean of 640 and a standard deviation of 105.7. A student wants to be
admitted to this university. He takes the test and scores 755. What is the probability of him to be admitted to this university?
a) 65.9%
b) 84.6%
c) 40.9%
d) 54%.
View Answer

Answer: b
Explanation: Let k be the random variable that represents the scores. k is normally distributed with a mean of 640 and a standard deviation
of 124.7. The total area under the normal curve represents the total number of students who take the test. If we multiply the values of the
areas under the curve by 124.7, we obtain percentages. Now, for k = 755, z = \(\frac{755 – 640}{105.7}\) = 1.087. The proportion of the
students who scored below 755 is given by, P = [area to the left of z = 1.087] = 0.846. Hence, the required probability is 84.6 %.

9. The annual salaries of workers in a large manufacturing factory are normally distributed with a mean of Rs. 48,000 and a standard
deviation of Rs. 1500. Find the probability of workers who earn between Rs. 35,000 and Rs. 52,000.
a) 64%
b) 76.2%
c) 42.1%
d) 20%
View Answer
Answer: c
Explanation: For x = 45000, z = -2 and for x = 52000, z = 0.375. Now, area between z = -2 and z = 0.375 is equal to 0.421 or 42.1% earn
between Rs. 45,000 and Rs. 52,000.
advertisement

10. Discrete probability distribution depends on the properties of ___________

a) data
b) machine
c) discrete variables
d) probability function
View Answer

Answer: a
Explanation: We know that discrete probability function largely depends on the properties and types of data such as Binomial distribution
can lead to model binary data such as flipping of coins.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Geometric Probability
» Next - Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Geometric Probability
Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
advertisement
advertisement

Recommended Posts:

1. Bachelor of Computer Applications Questions and Answers

2. C Questions and Answers
3. C Programming Examples on Mathematical Functions
4. Statistical Quality Control Questions and Answers
5. Course Registration – 2
6. Java Programming Examples on Numerical Problems & Algorithms
7. C# Programming Examples on Mathematics
8. C Programming Examples on Numerical Problems & Algorithms
9. Engineering Mathematics Questions and Answers
10. C++ Programming Examples on Numerical Problems & Algorithms
11. Discrete Mathematics Questions and Answers
12. Probability and Statistics Questions and Answers
13. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
14. C++ Program to Generate Random Numbers Using Probability Distribution Function
15. Java Program to Generate Random Numbers Using Probability Distribution Function
 16. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
17. Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion
18. Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability
19. Probability and Statistics Questions and Answers – Exponential Distribution
20. Probability and Statistics Questions and Answers – Sampling Distribution of Means

advertisement

Discrete Mathematics Questions and Answers – Discrete Probability

– Mean and Variance of Random Variables
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Discrete Probability – Mean and Variance of
Random Variables”.

1. Two t-shirts are drawn at random in succession without replacement from a drawer containing 5 red t-shirts and 8 white t-shirts. Find the
probabilities of all the possible outcomes.
a) 1
b) 13
c) 40
d) 346
View Answer

Answer: a
Explanation: Let X denote the number of red t-shirts in the outcome. Here, x1 = 2, x2 = 1, x3 = 1, x4 = 1, x5 = 0. Probability of first t-shirt
being red = \(\frac{5}{13}\).
Probability of second t-shirt being red = \(\frac{4}{12}\).
So: P(x1) = \(\frac{5}{13} × \frac{4}{12} = \frac{20}{146}\). Likewise, for the probability of red first followed by black is
\(\frac{8}{12}\) (as there are 8 red t-shirts still in the drawer and 12 t-shirts all together).
So, P(x2) = \(\frac{5}{13} *\frac{8}{12} = \frac{40}{146}\). Similarly for white then red: P(x3) = \(\frac{8}{13} × \frac{4}{12} =
\frac{32}{146}\). Finally, for 2 black balls: P(x4) = \(\frac{8}{13} × \frac{7}{12} = \frac{56}{146}\). So, \(\frac{20}{146} +
\frac{40}{146} + \frac{32}{146} + \frac{40}{146} = 1\). Hence, all the t-shirts have been found.
advertisement

2. A jar of pickle is picked at random using a filling process in which an automatic machine is filling pickle jars with 2.5 kg of pickle in each
jar. Due to few faults in the automatic process, the weight of a jar could vary from jar to jar in the range 1.7 kg to 2.9 kg excluding the latter.
Let X denote the weight of a jar of pickle selected. Find the range of X.
a) 3.7 ≤ X < 3.9
b) 1.6 ≤ X < 3.2
c) 1.7 ≤ X < 2.9
d) 1 ≤ X < 5
View Answer

Answer: c
Explanation: Possible outcomes should be 1.7 ≤ X < 2.9. That is the probable range of X for the answer.
3. A probability density function f(x) for the continuous random variable X is denoted as _______
a) ∫ f(x)dx = ∞, -1<=x<=1
b) ∫ f(x)dx = 1, -∞<=x<=∞
c) ∫ f(x)dx = 0, -∞<=x<=∞
d) ∫ f(x+2)dx = .5, -∞<=x<=∞
View Answer

Answer: b
Explanation: A probability density function f(x) for the continuous random variable X is denoted as ∫ f(x)dx = 1, -∞<=x<=∞. The area under
the curve between any two ordinates x = a and x = b is a probability that X lies between a and b. So, ∫f(x)dx = P(a≤X≤b).

4. Let X is denoted as the number of heads in three tosses of a coin. Determine the mean and variance for the random variable X.
a) 4.8
b) 6
c) 3.2
d) 1.5
View Answer

Answer: d
Explanation: Let H represents a head and T be a tail. X denotes the number of heads in three tosses of a coin. X can take the value 0, 1, 2, 3.
P(X = 0) = \(\frac{1}{8}\), P(X = 1) = \(\frac{3}{8}\), P(X = 2) = \(\frac{3}{8}\), P(X = 3) = \(\frac{1}{8}\). The probability distribution of
X is E(X) = Σixipi = 1 × \(\frac{3}{8} + 2 × \frac{3}{8} + 3 × \frac{1}{8}\) = 1.5. E(X2) = \(12 × \frac{3}{8} + 22 × \frac{3}{8} + 32 ×
2 2
\frac{1}{8}\) = 3. So, Variance of X = V(X) = E(X ) – [E(X)] = 3 – 1.5 = 1.5.

5. A football player makes 75% of his 5-point shots and 25% his 7-point shots. Determine the expected value for a 7-point shot of the
player.
a) 4.59
b) 12.35
c) 5.25
d) 42.8
View Answer

Answer: c
Explanation: Multiply the outcome by its probability, so the expected value becomes 0.75 * 7 points = 5.25.
advertisement

6. In a card game Reena wins 3 Rs. if she draws a king or a spade and 7 Rs. if a heart or a queen from an pack of 52 playing cards. If she
pays a certain amount of money each time she will lose the game. What will be the amount so that the game will come out a fair game?
a) 15
b) 6
c) 23
d) 2
View Answer

Answer: d
Explanation: We know that E(X) = ∑{xi * P(xi)} = 3 * \(\frac{2}{13} + 7 * \frac{2}{13} − x * \frac{10}{13} = \frac{20}{13} −
\frac{10x}{13}\). Suppose the expected value should be 0 Rs. for the game to be fair. So \(\frac{20}{13} − \frac{10x}{13}\) = 0 ⇒ x=2. So
she should pay Rs.2 for it to be a fair game.
7. A Random Variable X can take only two values, 4 and 5 such that P(4) = 0.32 and P(5) = 0.47. Determine the Variance of X.
a) 8.21
b) 12
c) 3.7
d) 4.8
View Answer

Answer: c
2 2
Explanation: Expected Value: μ = E(X) = ∑x * P(x) = 4 × 0.32 + 5 × 0.47 = 3.63. Next find ∑x * P(x): ∑x * P(x) = 16 × 0.32 + 25 × 0.47
2 2
= 16.87. Therefore, Var(X) = ∑x P(x) − μ = 16.87 − 13.17 = 3.7.

8. A 6-sided die is biased. Now, the numbers one to four are equally likely to happen, but five and six is thrice as likely to land face up as
each of the other numbers. If X is the number shown on the uppermost face, determine the expected value of X when 6 is shown on the
uppermost face.
a) \(\frac{13}{4}\)
b) \(\frac{3}{5}\)
c) \(\frac{2}{7}\)
d) \(\frac{21}{87}\)
View Answer

Answer: a
Explanation: Let P(1) = P(2) = P(3) = P(4) = p; P(5) = P(6) = 2p. We know that the sum of all probabilities must be 1 ⇒ p + p + p + p + 2p +
2p = 1
⇒ 8p = 1 ⇒ p = \(\frac{1}{8}\)
Expected Value:
μ = E(X) = ∑x * P(x) = \(1 * \frac{1}{8} + 2 * \frac{1}{8} + 3 * \frac{1}{8} + 4 * \frac{1}{8} + 5 * \frac{2}{8} + 6 * \frac{2}{8} =
\frac{13}{4}\).

9. A fair cubical die is thrown twice and their scores summed up. If the sum of the scores of upper side faces by throwing two times a die is
an event. Find the Expected Value of that event.
a) 48
b) 76
c) 7
d) 132
View Answer

Answer: c
Explanation: Sample space = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}.Suppose: P(2) = \(\frac{1}{36}\), P(3) = \(\frac{2}{36}\), P(4) =
\(\frac{3}{36}\), P(5) = \(\frac{4}{36}\), P(6) = \(\frac{5}{36}\), P(7) = \(\frac{6}{36}\), P(8) = \(\frac{5}{36}\), P(9) = \(\frac{4}{36}\),
P(10) = \(\frac{3}{36}\), P(11) = \(\frac{2}{36}\) and P(12) = \(\frac{1}{36}\). Now, Expected Value:
μ = E(A) = ∑x * P(x) = \(2 * \frac{1}{36} + 3 * \frac{2}{36} + 4 * \frac{3}{36} + 5 * \frac{4}{36} + 6 * \frac{5}{36} \)
\(+ 7 * \frac{6}{36} + 8 * \frac{5}{36} + 9 * \frac{4}{36} + 10 * \frac{3}{36} + 11 * \frac{2}{36} + 12 * \frac{1}{36} =
\frac{252}{36}\) = 7.
advertisement

10. A random variable X can take only two values, 2 and 4 i.e., P(2) = 0.45 and P(4) = 0.97. What is the Expected value of X?
a) 3.8
b) 2.9
c) 4.78
d) 5.32
View Answer

Answer: c
Explanation: We know that E(X) = ∑ x*P(x) = 2 × 0.45 + 4 × 0.97 = 4.78, where x={2,4}.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Probability Distribution
» Next - Discrete Mathematics Questions and Answers – Discrete Probability – Bayes Theorem
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Probability Distribution
Discrete Mathematics Questions and Answers – Discrete Probability – Bayes Theorem
advertisement
advertisement

Recommended Posts:

1. Artificial Intelligence Questions and Answers

2. C# Programming Examples on Mathematics
3. Java Programming Examples on Numerical Problems & Algorithms
4. C++ Programming Examples on Numerical Problems & Algorithms
5. C Programming Examples on Numerical Problems & Algorithms
6. Engineering Mathematics Questions and Answers
7. C# Programming Examples on Gaming
8. Discrete Mathematics Questions and Answers
9. Probability and Statistics Questions and Answers
10. Engineering Mathematics Questions and Answers – Limits and Derivatives of Several Variables – 2
11. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
12. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
13. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
14. Probability and Statistics Questions and Answers – Set Theory of Probability – 2
15. Probability and Statistics Questions and Answers – Probability Distributions – 2
16. C Program to Generate Random Numbers Using Probability Distribution Function
17. C++ Program to Generate Random Numbers Using Probability Distribution Function
18. Java Program to Generate Random Numbers Using Probability Distribution Function
19. Probability and Statistics Questions and Answers – Probability Distributions – 1
20. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions

advertisement
Discrete Mathematics Questions and Answers – Discrete Probability
– Bayes Theorem
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Discrete Probability – Bayes Theorem”.

1. A single card is drawn from a standard deck of playing cards. What is the probability that the card is a face card provided that a queen is
drawn from the deck of cards?
a) \(\frac{3}{13}\)
b) \(\frac{1}{3}\)
c) \(\frac{4}{13}\)
d) \(\frac{1}{52}\)
View Answer

Answer: b
Explanation: The probability that the card drawn is a queen = \(\frac{4}{52}\), since there are 4 queens in a standard deck of 52 cards. If the
event is “this card is a queen” the prior probability P(queen) = \(\frac{4}{52} = \frac{1}{13}\). The posterior probability P(queen|face) can
be calculated using Bayes theorem: P(king|face) = P(face|king)/P(face)*P(king). Since every queen is also a face card, P(face|queen) = 1.
The probability of a face card is P(face) = (\(\frac{3}{13}\)). [since there are 3 face cards in each suit (Jack, Queen, King)]. Using Bayes
theorem gives P(queen|face) = \(\frac{13}{3}*\frac{1}{13} = \frac{1}{3}\).
advertisement

2. Naina receives emails that consists of 18% spam of those emails. The spam filter is 93% reliable i.e., 93% of the mails it marks as spam
are actually a spam and 93% of spam mails are correctly labelled as spam. If a mail marked spam by her spam filter, determine the
probability that it is really spam.
a) 50%
b) 84%
c) 39%
d) 63%
View Answer

Answer: a
Explanation: 18% email are spam and 82% email are not spam. Now, 18% of mail marked as spam is spam and 82% mail marked as spam
are not spam. By Bayes theorem the probability that a mail marked spam is really a spam = (Probability of being spam and being detected as
spam)/(Probability of being detected as spam) = (0.18 * 0.82)/(0.18 * 0.82) + (0.18 * 0.82) = 0.5 or 50%.

3. A meeting has 12 employees. Given that 8 of the employees is a woman, find the probability that all the employees are women?
a) \(\frac{11}{23}\)
b) \(\frac{12}{35}\)
c) \(\frac{2}{9}\)
d) \(\frac{1}{8}\)
View Answer

Answer: c
Explanation: Assume that the probability of an employee being a man or woman is (\(\frac{1}{2}\)). By using Bayes’ theorem: let B be the
event that the meeting has 3 employees who is a woman and let A be the event that all employees are women. We want to find P(A|B) =
\(\frac{P(B|A)*P(A)}{P(B)}\). P(B|A) = 1, P(A) = \(\frac{1}{12}\) and P(B) = \(\frac{8}{12}\). So, P(A|B) =
\(\frac{1*\frac{1}{12}}{\frac{8}{12}} = \frac{1}{8}\).

4. A cupboard A has 4 red carpets and 4 blue carpets and a cupboard B has 3 red carpets and 5 blue carpets. A carpet is selected from a
cupboard and the carpet is chosen from the selected cupboard such that each carpet in the cupboard is equally likely to be chosen.
Cupboards A and B can be selected in \(\frac{1}{5}\) and \(\frac{3}{5}\) ways respectively. Given that a carpet selected in the above
process is a blue carpet, find the probability that it came from the cupboard B.
a) \(\frac{2}{5}\)
b) \(\frac{15}{19}\)
c) \(\frac{31}{73}\)
d) \(\frac{4}{9}\)
View Answer

Answer: b
Explanation: The probability of selecting a blue carpet = \(\frac{1}{5} * \frac{4}{8} + \frac{3}{5} * \frac{5}{8} = \frac{4}{40} +
\frac{15}{40} = \frac{19}{40}\). Probability of selecting a blue carpet from cupboard, P(B) = \(\frac{3}{5} * \frac{5}{8} =
\frac{15}{40}\). Given that a carpet selected in the above process is a blue carpet, the probability that it came from the cupboard A is =
\(\frac{\frac{15}{40}}{\frac{19}{40}} = \frac{15}{19}\).

5. Mangoes numbered 1 through 18 are placed in a bag for delivery. Two mangoes are drawn out of the bag without replacement. Find the
probability such that all the mangoes have even numbers on them?
a) 43.7%
b) 34%
c) 6.8%
d) 9.3%
View Answer

Answer: c
Explanation: The events are not independent. There will be a \(\frac{10}{18} = \frac{5}{9}\) chance that any of the mangoes in the bag is
even. The probability that the first one is even is \(\frac{1}{2}\), for the second mango, given that the first one was even, there are only 9
even numbered balls that could be drawn from a total of 17 balls, so the probability is \(\frac{9}{17}\). For the third mango, since the first
two are both odd, there are 8 even numbered mangoes that could be drawn from a total of 16 remaining balls and so the probability is
\(\frac{8}{16}\) and for fourth mango, the probability is = \(\frac{7}{15}\). So the probability that all 4 mangoes are even numbered is
\(\frac{10}{18}*\frac{9}{17}*\frac{8}{16}*\frac{7}{16}\) = 0.068 or 6.8%.
advertisement

6. A family has two children. Given that one of the children is a girl and that she was born on a Monday, what is the probability that both
children are girls?
a) \(\frac{13}{27}\)
b) \(\frac{23}{54}\)
c) \(\frac{12}{19}\)
d) \(\frac{43}{58}\)
View Answer

Answer: a
Explanation: We let Y be the event that the family has one child who is a girl born on Tuesday and X be the event that both children are
boys, and apply Bayes’ Theorem. Given that there are 7 days of the week and there are 49 possible combinations for the days of the week
the two girls were born on and 13 of these have a girl who was born on a Monday, so P(Y|X) = \(\frac{13}{49}\). P(X) remains unchanged
at \(\frac{1}{4}\). To calculate P(Y), there are 142 = 196 possible ways to select the gender and the day of the week the child was born on.
There are 132 = 169 ways which do not have a girl born on Monday and which 196 – 169 = 27 which do, so P(Y) = \(\frac{27}{196}\). This
gives is that P(X|Y) = \(\frac{\frac{13}{19}*\frac{1}{4}}{\frac{27}{196}} = \frac{13}{27}\).

7. Suppose a fair eight-sided die is rolled once. If the value on the die is 1, 3, 5 or 7 the die is rolled a second time. Determine the probability
that the sum of values that turn up is at least 8?
a) \(\frac{32}{87}\)
b) \(\frac{12}{43}\)
c) \(\frac{6}{13}\)
d) \(\frac{23}{64}\)
View Answer

Answer: d
Explanation: Sample space consists of 8*8=64 events. While (8) has \(\frac{1}{8}\) probability of occurrence, (1,7) has only
\(\frac{1}{64}\) probability. So, the required probability = \(\frac{1}{6} + (9 * \frac{1}{64}) = \frac{69}{192} = \frac{23}{64}\).

8. A jar containing 8 marbles of which 4 red and 4 blue marbles are there. Find the probability of getting a red given the first one was red
too.
a) \(\frac{4}{13}\)
b) \(\frac{2}{11}\)
c) \(\frac{3}{7}\)
d) \(\frac{8}{15}\)
View Answer

Answer: c
Explanation: Suppose, P (A) = getting a red marble in the first turn, P (B) = getting a black marble in the second turn. P (A) =
\(\frac{4}{8}\) and P (B) = \(\frac{3}{7}\) and P (A and B) = \(\frac{4}{8}*\frac{3}{7} = \frac{3}{14}\) P(B/A) = \(\frac{P(A \,and
\,B)}{P(A)} = \frac{\frac{3}{14}}{\frac{1}{2}} = \frac{3}{7}\).

9. A bin contains 4 red and 6 blue balls and three balls are drawn at random. Find the probability such that both are of the same color.
a) \(\frac{10}{28}\)
b) \(\frac{1}{5}\)
c) \(\frac{1}{10}\)
d) \(\frac{4}{7}\)
View Answer

Answer: b
10
Explanation: Total no of balls = 10. Number of ways drawing 3 balls at random out of 10 = C3 = 120. Probability of drawing 3 balls of
4 6
same colour = C3 + C3 = 24. Hence, the required probability is \(\frac{24}{120} = \frac{1}{5}\).
advertisement

10. A bucket contains 6 blue, 8 red and 9 black pens. If six pens are drawn one by one without replacement, find the probability of getting
all black pens?
a) \(\frac{8}{213}\)
b) \(\frac{8}{4807}\)
c) \(\frac{5}{1204}\)
d) \(\frac{7}{4328}\)
View Answer

Answer: b
Explanation: Total number of pens = 23, number of pens we have chosen = 6, total number of black pens = 9. According to the combination
 n
probability formula it states that Cr = \(\frac{n!}{r! (n-r)!}\),
where n = total number of outcomes, r = random selection, P = \(\frac{^9C_6}{^{23}C_6} = \frac{8}{4807}\).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
» Next - Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
advertisement
advertisement

Recommended Posts:

1. Contact
2. C# Programming Examples on Mathematics
3. Online Training – SAN, C, Linux Kernel & Device Drivers Training
4. Course Registration – 2
5. Engineering Mathematics Questions and Answers
6. Probability and Statistics Questions and Answers
7. Discrete Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers – Counting – Derangements
9. Probability and Statistics Questions and Answers – Hypergeometric Distributions
10. Probability and Statistics Questions and Answers – Sampling Distribution – 2
11. Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
12. Probability and Statistics Questions and Answers – Set Theory of Probability – 1
13. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
14. Probability and Statistics Questions and Answers – Random Variables
15. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
16. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
17. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
18. Discrete Mathematics Questions and Answers – Probability Distribution
19. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
20. Probability and Statistics Questions and Answers – Theorem of Total Probability

advertisement

Discrete Mathematics Questions and Answers – Discrete Probability

– Generating Functions
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Discrete Probability – Generating Functions”.

2 3 5 6
1. What is the sequence depicted by the generating series 4 + 15x + 10x + 25x + 16x +⋯?
a) 10, 4, 0, 16, 25, …
b) 0, 4, 15, 10, 16, 25,…
c) 4, 0, 15, 10, 25, 16,…
d) 4, 10, 15, 25,…
View Answer

Answer: c
n
Explanation: Consider the coefficients of each x term. So a0=4, since the coefficient of x0 is 4 (x0=1 so this is the constant term). Since 15
2
is the coefficient of x , so 15 is the term a2 of the sequence. To find a1 check the coefficient of x1 which in this case is 0. So a1=0.
Continuing with these we have a2=15, a3=10, a4=25, and a5=16. So we have the sequence 4, 0, 15, 10, 25, 16,…
advertisement

2. What is the generating function for the sequence 1, 6, 16, 216,….?

a) \(\frac{(1+6x)}{x^3}\)
b) \(\frac{1}{(1-6x)}\)
c) \(\frac{1}{(1-4x)}\)
2
d) 1-6x
View Answer

Answer: b
Explanation: For the sequence 1, 6, 36, 216,… the generating function must be \(\frac{1}{(1-6x}\), when basic generating function:
\(\frac{1}{1-x}\).

3. What is the generating function for generating series 1, 2, 3, 4, 5,… ?

a) \(\frac{2}{(1-3x)}\)
b) \(\frac{1}{(1+x)}\)
c) \(\frac{1}{(1−x)^2}\)
d) \(\frac{1}{(1-x2)}\)
View Answer

Answer: c
2 3
Explanation: Basic generating function is \(\frac{1}{1-x}\). If we differentiate term by term in the power series, we get (1 + x + x + x
2 3
+⋯)′ = 1 + 2x + 3x + 4x +⋯ which is the generating series for 1, 2, 3, 4,….

4. What is the generating function for the generating sequence A = 1, 9, 25, 49,…?
2
a) 1+(A-x )
b) (1-A)-1/x
2
c) (1-A)+1/x
3
d) (A-x)/x
View Answer

Answer: b
Explanation: The generating function for the sequence A. Using differencing:
2 3
A = 1 + 9x + 25x + 49x + ⋯(1)
 2 3 4
−xA = 0 + x + 9x + 25x + 49x + ⋯(2)
2 3 2 3 2
(1−x)A = 1 + 8x + 16x + 24x +⋯. Since 8x + 16x + 24x + ⋯ = (1-x)A-1 ⇒ 8 + 16x + 24x +…= (1-A)-1/x.

5. What is the recurrence relation for the sequence 1, 3, 7, 15, 31, 63,…?
a) an = 3an-1−2an+2
b) an = 3an-1−2an-2
c) an = 3an-1−2an-1
d) an = 3an-1−2an-3
View Answer

Answer: b
Explanation: The recurrence relation for the sequence 1, 3, 7, 15, 31, 63,… should be an = 3an-1−2an-2. The solution for A: A=1/1 − 3x +
2
2x .
advertisement

6. What is multiplication of the sequence 1, 2, 3, 4,… by the sequence 1, 3, 5, 7, 11,….?

a) 1, 5, 14, 30,…
b) 2, 8, 16, 35,…
c) 1, 4, 7, 9, 13,…
d) 4, 8, 9, 14, 28,…
View Answer

Answer: a
Explanation: The first constant term is 1⋅1, next term will be 1⋅3 + 2⋅1 = 5, the next term: 1⋅5 + 2⋅3 + 3⋅1 = 14, another one: 1⋅7 + 2⋅5 + 3⋅3
+ 4⋅1 = 30. The resulting sequence is 1, 5, 14, 30,…

2
7. What will be the sequence generated by the generating function 4x/(1-x) ?
a) 12, 16, 20, 24,…
b) 1, 3, 5, 7, 9,…
c) 0, 4, 8, 12, 16, 20,…
d) 0, 1, 1, 3, 5, 8, 13,…
View Answer

Answer: c
2
Explanation: The sequence should be 0, 4, 8, 12, 16, 20,…for the generating function 4x/(1-x) , when basic generating function: 1/(1-x).

n n
8. What is the generating function for the sequence with closed formula an=4(7 )+6(−2) ?
a) (4/1−7x)+6!
b) (3/1−8x)
c) (4/1−7x)+(6/1+2x)
d) (6/1-2x)+8
View Answer

Answer: c
Explanation: For the given sequence after evaluating the formula the generating formula will be (4/1−7x)+(6/1+2x).

9. Suppose G is the generating function for the sequence 4, 7, 10, 13, 16, 19,…, the find a generating function (in terms of G) for the
sequence of differences between terms.
a) (1−x)G−4/x
3
b) (1−x)G−4/x
c) (1−x)G+6/x
2
d) (1−x)G−x
View Answer

Answer: a
2 3
Explanation: (1−x)G = 4 + 3x + 6x + 9x +⋯ which can be accepted. We can compute it like this:
2
3 + 6x + 9x + ⋯ = (1−x)G−4/x.
advertisement

2 4 2
10. Find the sequence generated by 1/1−x −x .,assume that 1, 1, 2, 3, 5, 8,… has generating function 1/1−x−x .
a) 0, 0, 1, 1, 2, 3, 5, 8,…
b) 0, 1, 2, 3, 5, 8,…
c) 1, 1, 2, 2, 4, 6, 8,…
d) 1, 4, 3, 5, 7,…
View Answer

Answer: a
2 4
Explanation: Based on the given generating function, the sequence will be 0, 0, 1, 1, 2, 3, 5, 8,… which is generated by 1/1−x −x .

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Discrete Probability – Bayes Theorem
» Next - Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Discrete Probability – Bayes Theorem
Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Numerical Problems & Algorithms

2. Java Programming Examples on Combinatorial Problems & Algorithms
3. C Programming Examples on Numerical Problems & Algorithms
4. C Algorithms, Problems & Programming Examples
5. Java Programming Examples on Numerical Problems & Algorithms
6. C Programming Examples on Combinatorial Problems & Algorithms
7. C# Programming Examples on Mathematics
8. Engineering Mathematics Questions and Answers
9. Java Programming Examples on Mathematical Functions
10. C Programming Examples on Mathematical Functions
11. C# Programming Examples on Functions
12. Probability and Statistics Questions and Answers
 13. Discrete Mathematics Questions and Answers
14. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
15. Discrete Mathematics Questions and Answers – The Growth of Functions
16. Discrete Mathematics Questions and Answers – Boolean Functions
17. Discrete Mathematics Questions and Answers – Sequences and Summations
18. Discrete Mathematics Questions and Answers – Geometric Sequences
19. Discrete Mathematics Questions and Answers – Special Sequences
20. Discrete Mathematics Questions and Answers – Number of Functions

advertisement

Discrete Mathematics Questions and Answers – Discrete Probability

– Principle of Inclusion Exclusion
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Discrete Probability – Principle of Inclusion
Exclusion”.

1. There are 70 patients admitted in a hospital in which 29 are diagnosed with typhoid, 32 with malaria, and 14 with both typhoid and
malaria. Find the number of patients diagnosed with typhoid or malaria or both.
a) 39
b) 17
c) 47
d) 53
View Answer

Answer: c
Explanation: By using the inclusion-exclusion principle: |T ∪ M| = |T| + |M| – |T ∩ M| = (29 + 32) – (14) = 47. Thus 47 patients are
diagnosed with either typhoid or malaria.
advertisement

2. At a software company, skilled workers have been hired for a project. Out of 75 candidates, 48 of them were software engineer; 35 of
them were hardware engineer; 42 of them were network engineer; 18 of them had skills in all three jobs and all of them had skills in at least
one of these jobs. How many candidates were hired who were skilled in exactly 2 jobs?
a) 69
b) 14
c) 32
d) 8
View Answer

Answer: b
Explanation: Since 18 are skilled in all 3. Subtract 18 from all three to get a total with single skilled and double skilled workers including the
duplicates. Software engineers = 48 – 18 = 30, Hardware engineers = 35 – 18 = 17, Network engineers = 42 – 18 = 24 making a total of 71
and this is a total set of single and double skilled workers including duplicates. Out of 75 candidates, 18 were skilled in three areas. So, 75 –
18 = 57 (actual no of workers skilled with single and both skills) Now the difference between the number without duplicates (57) and with
duplicates (71), 71 – 57 = 14. So, 14 are skilled in exactly two jobs.
3. The numbers between 1 and 520, including both, are divisible by 2 or 6 is _______
a) 349
b) 54
c) 213
d) 303
View Answer

Answer: d
Explanation: We add the number of numbers that are divisible by 2 and 6 and subtract the numbers which are divisible by 12. Hence, the
required probability is
\(\frac{520}{2} + \frac{520}{6} – \frac{520}{12}\) = 303.3 = 303(Approximately).

4. In a renowned software development company of 240 computer programmers 102 employees are proficient in Java, 86 in C#, 126 in
Python, 41 in C# and Java, 37 in Java and Python, 23 in C# and Python, and just 10 programmers are proficient in all three languages. How
many computer programmers are there those are not proficient in any of these three languages?
a) 138
b) 17
c) 65
d) 49
View Answer

Answer: b
Explanation: Let U denote the set of all employed computer programmers and let J, C and P denote the set of programmers proficient in
Java, C# and Python, respectively. So, |U| = 240, |J| = 102, |C| = 86, |P| = 126, |J ∩ C| = 41, |J ∩ P| = 37, |C ∩ P| = 23 and |J ∩ C ∩ P| = 10.
The number of computer programmers that are not proficient in any of these three languages is said to be same as the cardinality of the
complement of the set J ∪ C ∪ P. First, we have to calculate |J ∪ C ∪ P| = 102 + 86 + 126 – 41 – 37 – 23 + 10 = 223. Now calculate |(J ∪ C
∪ P)’ | = |U| – |J ∪ C ∪ P| = 240 – 223 = 17. 17 programmers are not proficient in any of the three languages.

5. In class, students want to join sports. 15 people will join football, 24 people will join basketball, and 7 people will join both. How many
people are there in the class?
a) 19
b) 82
c) 64
d) 30
View Answer

Answer: d
Explanation: There are 15 people who wish to join football, but 9 of those people also join basketball. By using the principle of inclusion
and exclusion, we have: 15 people joining football + 24 people joining basketball – 9 people who will join both = 30 people total.
advertisement

6. The sum of all integers from 1 to 520 that are multiples of 4 or 5?

a) 187
b) 208
c) 421
d) 52
View Answer

Answer: b
Explanation: PIE is used to count the elements of a set and stated as the sum of elements in A or B is equal to the sum of elements in A plus
the sum of elements in B minus the sum of elements in A and B. Let A be the set of multiples of 4 and B be the set of multiples of 5, then A
⋂ B is the set of multiples of 20, and hence
\(\frac{520}{4} + \frac{520}{5} – \frac{520}{20}\) = 208.

7. There are 9 letters having different colors (red, orange, yellow, green, blue, indigo, violet) and 4 boxes each of different shapes
(tetrahedron, cube, polyhedron, dodecahedron). How many ways are there to place these 9 letters into the 4 boxes such that each box
contains at least 1 letter?
a) 260100
b) 878760
c) 437102
d) 256850
View Answer

Answer: a
Explanation: Let N be the total number of ways we can distribute the letters. Each letter can be placed into any one of the 4 boxes, so |N| =
9
4 . Let T be the set of ways such that the tetrahedron box has no letters, C be the set of ways such that the cube box has no letters, P be the
set of ways such that the cube box has no letters, and D be the set of ways such that the dodecahedron box has no letters. Now, to find |N| –
7
|T U C U P U D|. We have |T|=|C|=|P|=|D|=2 and since the letters can be placed into one of the two other boxes, and |TUC| = |C U P| = |P U
7
D| = |D U T| = 1 , since all the letters must be placed in the remaining box, and T ⋂ C ⋂ P ⋂ D| = 0. Hence, PIE implies |N| – |T U C U P U
9 9 9
D| = 4 – 4 x 2 + 4 x 1 – 0 = 260100.

8. A card is drawn randomly from a standard deck of cards. Determine the probability that the card drawn is a queen or a heart.
a) \(\frac{1}{4}\)
b) \(\frac{13}{56}\)
c) \(\frac{4}{13}\)
d) \(\frac{5}{52}\)
View Answer

Answer: c
Explanation: Let M be the event that the card is a queen, and let N be the event that the card is a heart. Then Since there are 13 different
ranks of cards in the deck, P(M) = \(\frac{1}{13}\) and since there are 4 suits in the deck, P(N) = \(\frac{1}{4}\). There is only one card that
is both a queen and a heart, so P(M ⋂ N) = \(\frac{1}{52}\). Therefore, P(M U N) = \(\frac{1}{4} + \frac{1}{13} – \frac{1}{52} =
\frac{16}{52} = \frac{4}{13}\).

9. An integer from 300 through 780, inclusive is to be chosen at random. Find the probability that the number is chosen will have 1 as at
least one digit.
a) \(\frac{171}{900}\)
b) \(\frac{43}{860}\)
c) \(\frac{231}{546}\)
d) \(\frac{31}{701}\)
View Answer

Answer: a
3
Explanation: The number of numbers that don’t have one anywhere 9 = 729 is (9 possibilities for each individual digit), and there are
2
9*10 = 900 numbers overall (9 possibilities for hundreds, 10 for the tens and units), so there are 900 – 729 = 171 numbers with at least a
one and thus \(\frac{171}{900}\) probability.
advertisement

10. From 1, 2, 3, …, 320 one number is selected at random. Find the probability that it is either a multiple of 7 or a multiple of 3.
a) 72%
b) 42.5%
c) 12.8%
d) 63.8%
View Answer

Answer: b
6
Explanation: Number of multiples of 7=45 and number of multiples of 3=10 and number of numbers which are multiples of both 7 and 3 =
15 Thus, P (selecting either a multiple of 7 or a multiple of 3) = \(\frac{45}{320} + \frac{106}{320} – \frac{15}{320} = \frac{136}{320} =
\frac{2}{5}\) = 0.425 or 42.5%.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
» Next - Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Numerical Problems & Algorithms

2. C++ Programming Examples on Numerical Problems & Algorithms
3. C Programming Examples on Combinatorial Problems & Algorithms
4. C# Programming Examples on LINQ
5. Engineering Mathematics Questions and Answers
6. C# Programming Examples on Mathematics
7. Probability and Statistics Questions and Answers
8. Discrete Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers – Counting – Linear Permutation
10. Probability and Statistics Questions and Answers – Permutations and Combinations
11. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
12. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
13. Probability and Statistics Questions and Answers – Set Theory of Probability – 2
14. Discrete Mathematics Questions and Answers – Counting – Pigeonhole Principle
15. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
16. Discrete Mathematics Questions and Answers – Principle of Mathematical Induction
17. Probability and Statistics Questions and Answers – Theorem of Total Probability
18. Discrete Mathematics Questions and Answers – Counting – Derangements
19. Discrete Mathematics Questions and Answers – Fundamental Principle of Counting
20. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
 advertisement

Discrete Mathematics Questions and Answers – Discrete Probability

– Logarithmic Series
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Discrete Probability – Logarithmic Series”.

1. Computation of the discrete logarithm is the basis of the cryptographic system _______
a) Symmetric cryptography
b) Asymmetric cryptography
c) Diffie-Hellman key exchange
d) Secret key cryptography
View Answer

Answer: c
x
Explanation: A discrete logarithm modulo of an integer to the base is an integer such that a ≡ b (mod g). The problem of computing the
discrete logarithm is a well-known challenge in the field of cryptography and is the basis of the cryptographic system i.e., the Diffie-
Hellman key exchange.
advertisement

2. Solve the logarithmic function of ln(\(\frac{1+5x}{1+3x}\)).

2
a) 2x – 8x + \(\frac{152x^3}{3}\) – …
2
b) x + \(\frac{7x^2}{2} – \frac{12x^3}{5}\) + …
c) x – \(\frac{15x^2}{2} + \frac{163x^3}{4}\) – …
d) 1 – \(\frac{x^2}{2} + \frac{x^4}{4}\) – …
View Answer

Answer: a
Explanation: To solve the logarithmic function ln(\(\frac{1+5x}{1+3x}\)) = ln(1+5x) – ln(1+3x) = (5x – \(\frac{(5x)^2}{2} +
2
\frac{(5x)^3}{3}\) – …) – (3x – \(\frac{(3x)^2}{2} + \frac{(3x)^3}{3}\) – …) = 2x – 8x + \(\frac{152x^3}{3}\) – …

-5
3. Determine the logarithmic function of ln(1+5x) .
a) 5x + \(\frac{25x^2}{2} + \frac{125x^3}{3} + \frac{625x^4}{4}\) …
b) x – \(\frac{25x^2}{2} + \frac{625x^3}{3} – \frac{3125x^4}{4}\) …
c) \(\frac{125x^2}{3} – 625x^3 + \frac{3125x^4}{5}\) …
d) -25x + \(\frac{125x^2}{2} – \frac{625x^3}{3} + \frac{3125x^4}{4}\) …
View Answer

Answer: d
-5
Explanation: Apply the logarithmic law, that is logax = xlog(a). Now the function is ln(1+5x) = -5log(1+5x). By taking the series = -5(5x
– \(\frac{(5x)^2}{2} + \frac{(5x)^3}{3} – \frac{(5x)^4}{4}\) + …) = -25x + \(\frac{125x^2}{2} – \frac{625x^3}{3} +
\frac{3125x^4}{4}\) …

2 log x
4. Find the value of x: 3 x a a = 348?
a) 7.1
b) 4.5
c) 6.2
d) 4.8
View Answer

Answer: d
log x 2 1/3
Explanation: Since, a a = x. The given equation may be written as: 3x x = 348 ⇒ x = (116) = 4.8.

2
5. Solve for x: log2(x -3x)=log2(5x-15).
a) 2, 5
b) 7
c) 23
d) 3, 5
View Answer

Answer: d
2 2 2
Explanation: By using the property if logax = logay then x=y, gives 2x -3x=10-6x. Now, to solve the equation x -3x-5x+15=0 ⇒ x -8x+15
⇒ x=3, x=5
2
For x=3: log2(3 -3*3) = log2(5*3-15) ⇒ true
2
For x=5: log2(5 -3*5) = log2(5*5-15) ⇒ true
The solutions to the equation are : x=3 and x=5.
advertisement

x+3 x+2
6. Solve for x the equation 2 =5 .
a) ln (24/8)
b) ln (25/8) / ln (2/5)
c) ln (32/5) / ln (2/3)
d) ln (3/25)
View Answer

Answer: b
x+3 x+2 x+3 x+2
Explanation: Given that 2 =5 . By taking ln of both sides: ln (2 ) = ln (5 )
⇒ (x + 3) ln 2 = (x + 2) ln 5
⇒ x ln 2 + 3 ln 2 = x ln 5 + 2 ln 5
⇒ x ln 2 – x ln 5 = 2 ln 5 – 3 ln 2
2 3
⇒ x = ( 2 ln 5 + 3 ln 2 ) / (ln 2 – ln 5) = ln (5 / 2 ) / ln (2/5) = ln (25/8) / ln (2/5).

7. Given: log4 z = B log2/3z, for all z > 0. Find the value of constant B.
a) 2/(3!*ln(2))
b) 1/ln(7)
c) (4*ln(9))
d) 1/(2*ln(3))
View Answer

Answer: d
Explanation: By using change of base formula we can have ln (x) / ln(4) = B ln(x) / ln(2/3) ⇒
B = 1/(2*ln(3)).

x x
8. Evaluate: 16 – 4 – 9 = 0.
a) ln [( 5 + \(\sqrt{21}\)) / 2] / ln 8
b) ln [( 2 + \(\sqrt{33}\)) / 2] / ln 5
c) ln [( 1 + \(\sqrt{37}\)) / 2] / ln 4
d) ln [( 1 – \(\sqrt{37}\)) / 2] / ln 3
View Answer

Answer: c
x x x x2 x2 x x 2
Explanation: Given: 16 – 4 – 9 = 0. Since 16 = (4 ) , the equation may be written as: (4 ) – 4 – 9 = 0. Let t = 3 and so t: t – t – 9 =
0 which gives t: t = (1 + \(\sqrt{37}\)) / 2 and (1 – \(\sqrt{37}\)) / 2
x
Since t = 4x, the acceptable solution is y = (1 + \(\sqrt{37}\)) / 2 ⇒ 4x = (1 + \(\sqrt{37}\))/2. By using ln on both sides: ln 4 = ln [ (1 +
\(\sqrt{37}\)) / 2] ⇒ x = ln [ ( 1 + \(\sqrt{37}\))/2] / ln 3.

y
9. Transform 54 = n+1 into equivalent a logarithmic expression.
a) log12 (n+1)
2
b) log41 (n )
c) log63 (n)
d) log54 (n+1)
View Answer

Answer: d
y x
Explanation: By using the equivalent expression: a = x ⇔ y = loga (x) to write 3 = m as a logarithm: y = log54 (n+1).
advertisement

10. If loga\((\frac{1}{8}) = -\frac{3}{4}\), than what is x?

a) 287
b) 469
c) 512
d) 623
View Answer

Answer: c
-5/9 -5/9 -9/5 -9/5
Explanation: By using exponential form: a = 2/8. Now, raise both sides of the above equation to the power -9/5: (x ) = (1/32) .
9/5 9
By simplifying we get, a = 32 = 2 = 512.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion
» Next - Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Discrete Probability – Principle of Inclusion Exclusion
Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
advertisement
advertisement
Recommended Posts:

1. C Programming Examples on Numerical Problems & Algorithms

2. C Programming Examples on Puzzles & Games
3. C++ Programming Examples on Numerical Problems & Algorithms
4. Java Programming Examples on Numerical Problems & Algorithms
5. Engineering Mathematics Questions and Answers
6. C# Programming Examples on Mathematics
7. Probability and Statistics Questions and Answers
8. Discrete Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers – Counting – Derangements
10. Discrete Mathematics Questions and Answers – Arithmetic and Geometric Mean
11. Discrete Mathematics Questions and Answers – Counting – Terms in Binomial Expansion
12. Ordinary Differential Equations Questions and Answers – First Order Linear Differential Equations
13. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 3
14. Probability and Statistics Questions and Answers – Binomial Distribution
15. Discrete Mathematics Questions and Answers – Algorithms – Complexity-2
16. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 1
17. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 4
18. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
19. Probability and Statistics Questions and Answers – Poisson Distribution
20. Discrete Mathematics Questions and Answers – Geometric Probability

advertisement

Discrete Mathematics Questions and Answers – Discrete Probability

– Power Series
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Discrete Probability – Power Series”.

1. The explicit formula for the geometric sequence 3, 15, 75, 375,… is _______
n-1
a) 2*6! * 3
n-1
b) 3 * 5
n-1
c) 3! * 8
n-1
d) 7 * 4
View Answer

Answer: b
Explanation: The initial term is 3 and each subsequent term is the product of its previous term, the common ratio is 5. Thus the formula
n-1
generating this sequence is an = 3 * 5 .
advertisement

th
2. The third term of a geometric progression with common ratio equal to half the initial term is 81. Determine the 12 term.
12
a) 3
15
b) 4
 8
c) 6
9
d) 5
View Answer

Answer: a
rd 2 3
Explanation: Let the initial term be a and the common ratio r. The 3 term is ar = 27 and the initial term is a=3r so 3r = 81 ⇒ r=3 ⇒ a=3.
11 11 12
The a12 = a * r = 3 * 3 = 3 .

3. Which of the following series is called the “formal power series”?

2 n
a) b0+b1x+b2x +…+bnx
2 n
b) b1x+b2x +…+bnx
2 n
c) 1/2b0+1/3b1x+1/4b2x +…+1/nbnx
2 2 n
d) n (b0+b1x+b2x +…+bnx )
View Answer

Answer: a
Explanation: A formal power series is also called a “formal series”, of a field F is an infinite sequence b0, b1, b2, … over F. It is a function
2 n
from the set of nonnegative integers to F i.e., 0, 1, 2, 3, … → F. A formal power series can also be written as b0+b1x+b2x +…+bnx .

4. sec(x) has a trigonometric series that is given by _______

n 2n
a) ∞∑n=0 ((-1) E2n / (2n)!)*x
n
b) ∞∑n=0 ((-1) E2n)
n 2n
c) ((-1) B2n / (2n)!)*x
2n+1
d) ∞∑n=0 ((2n)!)*x
View Answer

Answer: a
n 2n
Explanation: A trigonometric series is an example of a Maclaurin series. Here, sec(x) can be represented as ∞∑n=0 ((-1) E2n / (2n)!)*x .

n n-1
5. Determine the interval and radius of convergence for the power series: ∞∑n=17 /n(3x−1) .
a) (2x+1)/6
b) 7|3x−1|
c) 5|x+1|
d) 3!*|4x−9|
View Answer

Answer: b
n+1 n n n n-
Explanation: Okay, let’s start off with the Ratio Test to get our hands on L = limn→ ∞∣7 (3x−1) /(n+1) 7 (3x−1)
1 n n+1 n
∣=limn→∞∣7 (3x−1) ∣=|3x−1|limn→∞7 /(3n-1)=7|3x−1|.
advertisement

6. Determine a power series representation for the function g(x)=ln(7−x).

n+1 n+1
a) ∞∑n=0 x /7
n+1
b) ln(14)∞∑n=0 x /7n
n+1 n+1
c) ln(7)∞∑n=0 x /7
n+1
d) ln∞∑n=0 x/7
View Answer

Answer: c
Explanation: We know that ∫1/7−x dx=−ln(7−x) and there is a power series representation for 1/7−x. So, ln(7−x)=−∫1/7−xdx
 n n+1
=−∫ ∞∑n=0 x /7 dx=C
n+1 n+1
⇒ ∞∑n=0 x /7
n+1 n+1
So, the answer is, ln(7−x)=ln(7)∞∑n=0 x /7 .

7. An example of Maclaurin series is _______

n
a) ∞∑n=0 (x /n!)
b) ∞∑n=0 (x/5+n!)
n+1
c) ∞∑n=0 (x /(n-1)!)
n
d) (x /n)
View Answer

Answer: a
x n
Explanation: The exponential function e can described as ∞∑n=0 (x /n!) which is an example of a Maclaurin series. This series converges
for all x.

8. Find the power series representation for the function f(x)=x/4−x.

n+1 n+1
a) ∞∑n=0x /4
n+1 n
b) ∞∑n=0x 4
n n
c) ∞∑n=0x 4
n+1
d) ∞∑n=0x
View Answer

Answer: a
Explanation: So, again, we’ve got an x in the numerator. f(x)=x*1/4−x. If there is a power series representation for g(x)=1/4−x, there will be
4 4
a power series representation for f(x). Suppose, g(x)=1/4*1/1−x . To get a power series representation is to replace the x with x . Doing this
n n n n n n n+1
gives, g(x)=1/4 ∞∑n=0 x /4 (x /4 nprovided ∣x/4∣<1) ⇒ g(x) = 1/4 ∞∑n=0 x /4 = ∞∑n=0 x /4 . The interval of convergence for this
n n+1 n+1 n+1
series is, ∣x/4∣<1⇒1/4 |x|<1⇒|x|<4. Now, multiply g(x) by x and we have f(x)=x*1/4−x=x ⇒ ∞∑n=0 x /4 = ∞∑n=0x /4 and the
interval of convergence will be |x|<4.

m
9. What is the radius of convergence and interval of convergence for the power series ∞∑n=0m!(2x-1) ?
a) 3, 12
b) 1, 0.87
c) 2, 5.4
d) 0, 1/2
View Answer

Answer: d
m+1 m
Explanation: Suppose, L=limn→∞ |(m+1)!(2x+1) /m!(2x+1) |
= limm→∞∣(m+1)m!(2x-1)/m!|
= |2x-1|limm→∞(m+1)
So, this power series will only converge if x=1/2. We know that every power series will converge for x=a and in this case a=1/2. Remember
n
that we get a from (x−a) . In this case, the radius of convergence is R=0 and the interval of convergence is x=1/2.
advertisement

n+1 n
10. Determine the radius of convergence and interval of convergence for the power series: ∞∑n=0 (x−7) /n .
a) 0, −1<x<1
b) ∞, −∞<x<∞
c) 1, −2<x<2
d) 2, −1<x<1
View Answer
Answer: b
n+1 n
Explanation: So, L=limn→∞∣(x−7) /n ∣
L=limn→∞∣x−7/n∣
L=|x−7|limn→∞1/n=0
So, since L=0<1 any of the value of x, this power series will converge for every x. In these cases, the radius of convergence is R=∞ and
interval of convergence is −∞<x<∞.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
» Next - Discrete Mathematics Questions and Answers – Number of Relations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
Discrete Mathematics Questions and Answers – Number of Relations
advertisement
advertisement

Recommended Posts:

1. Engineering Mathematics Questions and Answers

2. C# Programming Examples on Mathematics
3. Signals & Systems Questions and Answers
4. Power Plant Questions and Answers
5. Power Electronics Questions and Answers
6. Power Systems Questions and Answers
7. Probability and Statistics Questions and Answers
8. Discrete Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers – Graph’s Matrices
10. Network Theory Questions and Answers – Apparent Power and Power Factor
11. Discrete Mathematics Questions and Answers – Counting – Binomial Coefficient
12. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 2
13. Discrete Mathematics Questions and Answers – Harmonic Sequences
14. Discrete Mathematics Questions and Answers – Special Sequences
15. Discrete Mathematics Questions and Answers – Number Theory – Base Conversion
16. Discrete Mathematics Questions and Answers – Sequences and Summations
17. Engineering Mathematics Questions and Answers – Taylor Mclaurin Series – 1
18. Discrete Mathematics Questions and Answers – Arithmetic Sequences
19. Discrete Mathematics Questions and Answers – Addition Theorem on Probability
20. Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability

advertisement
Discrete Mathematics Questions and Answers – Number of
Relations
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Number of Relations”.

1. How many binary relations are there on a set S with 9 distinct elements?
90
a) 2
100
b) 2
81
c) 2
60
d) 2
View Answer

Answer: c
2
Explanation: S is the set with 9 elements. A relation on S is defined as S x S. There are 9 number of ordered pairs in relation. So, the
(9*9)
number of binary relations is 2 = 281.
advertisement

2. _________ number of reflexive relations are there on a set of 11 distinct elements.

110
a) 2
121
b) 3
90
c) 2
132
d) 2
View Answer

Answer: a
(n*n)-n
Explanation: Let A be a set consists of n distinct elements. There are 2 number of reflexive relations that can be formed. So, here the
(11*11)-11 110
answer is 2 =2 .

3. The number of reflexive as well as symmetric relations on a set with 14 distinct elements is __________
120
a) 4
70
b) 2
201
c) 3
91
d) 2
View Answer

Answer: d
(n*(n-1))/2
Explanation: Let A be a set consists of n distinct elements. There are 2 number of reflexive and symmetric relations that can be
14*(14-1)/2 91
formed. So, here the answer is 2 =2 .

4. The number of symmetric relations on a set with 15 distinct elements is ______

196
a) 2
50
b) 2
320
c) 2
78
d) 2
View Answer
Answer: a
(n-1)*(n-1)
Explanation: Let S be a set consists of n distinct elements. There are 2 number of reflexive and symmetric relations that can be
(15-1)*(15-1) 196
formed. So, here the answer is 2 =2 .

5. Suppose S is a finite set with 7 elements. How many elements are there in the largest equivalence relation on S?
a) 56
b) 78
c) 49
d) 100
View Answer

Answer: c
Explanation: Let R is an equivalence relation on the set S and so it satisfies the reflexive, symmetric and transitive property. The largest
2
equivalence relation means it should contain the largest number of ordered pairs. Since we can have n ordered pairs in R x R where n
2 2
belongs to S and all these ordered pairs are present in this relation; its the largest equivalence relation.So there are n elements i.e 7 = 49
elements in the largest equivalence relation.
advertisement

6. ________ is the rank of the largest equivalence relation on a set of 20 elements.

20
a) 3
400
b) 2
c) 20
d) 1
View Answer

Answer: d
Explanation: The rank of an equivalence relation is the number of an equivalence classes. If we have a1, a2, a3, …, an elements then a1 and
a2 will be in the same equivalence class because everything is related and so on. In this case, there is only one equivalence class.

7. How many elements are there in the smallest equivalence relation on a set with 8 elements?
2
a) 10
b) 8
c) 48
d) 32
View Answer

Answer: b
Explanation: Let R is an equivalence relation on the set S with n elements and so it satisfies reflexive, symmetric and transitive properties.
The smallest equivalence relation means it should contain minimum number of ordered pairs i.e along with symmetric and transitive
properties it must always satisfy reflexive property. So, the smallest equivalence relation will have n ordered pairs and so the answer is 8.

8. The rank of smallest equivalence relation on a set with 12 distinct elements is _______
a) 12
b) 144
c) 136
d) 79
View Answer
Answer: a
Explanation: In the case of smallest equivalence relation, each element is in one equivalence class like {a1}, {a2}, … are equivalence
classes. So, the rank or number of equivalence classes is n for a set with n elements and so the answer is 12.

9. If a set A has 8 elements and a set B has 10 elements, how many relations are there from A to B?
90
a) 2
80
b) 3
c) 164
80
d) 2
View Answer

Answer: d
mn
Explanation: Let, a relation R from A to B is a subset of A×B. As the maximum number of subsets (Elements in the powerset) is 2 , there
mn 80
are 2 number of relations from A to B and so the answer is 2 .
advertisement

10. Synonym for binary relation is _______

a) equivalence relation
b) dyadic relation
c) orthogonal relation
d) one to many relations
View Answer

Answer: b
2
Explanation: A binary relation on a set S is a set of ordered pairs of elements of S. It is a subset of the cartesian product S = S x S. The
terms correspondence, dyadic relation and 2-place relation are synonyms for the binary relation.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
» Next - Discrete Mathematics Questions and Answers – Closure on Relations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
Discrete Mathematics Questions and Answers – Closure on Relations
advertisement
advertisement

Recommended Posts:

1. Python Programming Examples

2. C Programming Examples on Strings
3. C# Programming Examples on Sorting
4. Engineering Mathematics Questions and Answers
 5. C# Programming Examples on Mathematics
6. C Programming Examples using Recursion
7. C Programming Examples on Searching and Sorting
8. Python Programming Examples on Linked Lists
9. C# Programming Examples on Arrays
10. Java Programming Examples on Arrays
11. C Programming Examples on Trees
12. C Programming Examples on Combinatorial Problems & Algorithms
13. C++ Programming Examples on Combinatorial Problems & Algorithms
14. C Programming Examples on Linked List
15. C# Programming Examples on Matrix
16. Java Programming Examples on Combinatorial Problems & Algorithms
17. C Programming Examples on Arrays
18. Python Programming Examples on Trees
19. Python Programming Examples on Searching and Sorting
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Closure on

Relations
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Closure on Relations”.

1. R is a binary relation on a set S and R is reflexive if and only if _______

a) r(R) = R
b) s(R) = R
c) t(R) = R
d) f(R) = R
View Answer

Answer: a
Explanation: Let reflexive closure of R:r(R) = R. If R is reflexive, it satisfies all the condition in the definition of reflexive closure. So, a
reflexive closure of a relation is the smallest number of reflexive relation contain in R. Hence, R = r(R).
advertisement

2. If R1 and R2 are binary relations from set A to set B, then the equality ______ holds.
cc c
a) (R ) = R
c
b) (A x B) = Φ
c c c
c) (R1 U R2) = R1 ∪ R2
c c c
d) (R1 U R2) = R1 ∩ R2
View Answer

Answer: c
c c c
Explanation: To proof (R1 U R2) = R1 ∪ R2 ,
 c
if <x,y> belongs to (R1 U R2)
⇔ <y,x> ∈ (R1 U R2)
⇔ <y,x> ∈ R1 or <y,x> ∈ R2
c c
⇔ <x,y> ∈ R1 or <x,y> ∈ R2
c c
⇔ <x,y> ∈ R1 ∪ R2 .

3. The condition for a binary relation to be symmetric is _______

a) s(R) = R
b) R ∪ R = R
c
c) R = R
d) f(R) = R
View Answer

Answer: c
Explanation: If <a,b> ∈ R then <b,a> ∈ R, where a and b belong to two different sets and so its symmetric.
c
R also contains <b,a>
c
R = R.

4. ______ number of reflexive closure exists in a relation R = {(0,1), (1,1), (1,3), (2,1), (2,2), (3,0)} where {0, 1, 2, 3} ∈ A.
6
a) 2
b) 6
c) 8
d) 36
View Answer

Answer: b
Explanation: The reflexive closure of R is the relation, R ∪ Δ = { (a,b) | (a,b) R (a,a) | a A }. Hence, R ∪ Δ = {(0,1), (1,1), (1,3), (2,1), (2,2),
(3,0)} and the answer is 6.

5. The transitive closure of the relation {(0,1), (1,2), (2,2), (3,4), (5,3), (5,4)} on the set {1, 2, 3, 4, 5} is _______
a) {(0,1), (1,2), (2,2), (3,4)}
b) {(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)}
c) {(0,1), (1,1), (2,2), (5,3), (5,4)}
d) {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}
View Answer

Answer: d
Explanation: Let R be a relation on a set A. The connectivity relation on R* consists of pairs (a,b) such that there is a path of length at least
1 2 3 n
one from a to b in R. Mathematically, R* = R ∪ R ∪ R ∪ … ∪ R . Hence the answer is {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}.
advertisement

2
6. Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) ∈ N | a!= b} satisfies _______
property.
a) symmetry
b) transitivity
c) antisymmetry
d) reflexivity
View Answer
Answer: a
Explanation: It is not reflexive as aRa is not possible. It is symmetric as if aRb then bRa. It is not antisymmetric as aRb and bRa are possible
and we can have a!=b. It is not transitive as if aRb and bRc then aRc need not be true. This is violated when c=a. So the answer is symmetry
property.

7. The number of equivalence relations of the set {3, 6, 9, 12, 18} is ______
a) 4
5
b) 2
c) 22
d) 90
View Answer

Answer: a
Explanation: Number of equivalence Relations are given by BELL number. The nth of these numbers i.e, Bn counts the number of different
ways to partition a set that has exactly n elements, or equivalently, the number of equivalence relations on it. Let’s say, 1 -> Equivalence
relation with 1 element; 1 2 -> Equivalence relation with 2 element; 2 3 5 -> Equivalence relation with 3 element; 5 7 10 15 -> Equivalence
relation with 4 element. Hence, the answer is 4.

8. Let R1 and R2 be two equivalence relations on a set. Is R1 ∪ R2 an equivalence relation?

a) an equivalence relation
b) reflexive closure of relation
c) not an equivalence relation
d) partial equivalence relation
View Answer

Answer: a
Explanation: R1 union R2 is not equivalence relation because transitivity property of closure need not hold. For instance, (x, y) can be in R1
and (y, z) be in R2 and (x, z) not in either R1 or R2. However, R1 intersection R2 is an equivalence relation.

9. A relation R is defined on the set of integers as aRb if and only if a+b is even and R is termed as ______
a) an equivalence relation with one equivalence class
b) an equivalence relation with two equivalence classes
c) an equivalence relation
d) an equivalence relation with three equivalence classes
View Answer

Answer: b
Explanation: R is reflexive as (a+b) is even for any integer; R is symmetric as if (a+b) is even (b+a) is also even; R is transitive as if
((a+b)+c) is even, then (a+(b+c)) is also even.
So, R is an equivalence relation. For set of natural numbers, sum of even numbers always give even, sum of odd numbers always give even
and sum of any even and any odd number always give odd. So, must have two equivalence classes -> one for even and one for odd.
{…, -4, -2, 0, 2, … } and {…, -3, -1, 1, 3, … }.
advertisement

10. The binary relation U = Φ (empty set) on a set A = {11, 23, 35} is _____
a) Neither reflexive nor symmetric
b) Symmetric and reflexive
c) Transitive and reflexive
d) Transitive and symmetric
View Answer
Answer: d
Explanation: U = Φ (empty set) on a set A = {11, 23, 35} need to be hold Irreflexive, symmetric, anti-symmetric, asymmetric and transitive
closure property, but it is not Reflexive as it does not contain any self loop in itself.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Number of Relations
» Next - Discrete Mathematics Questions and Answers – Types of Relations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Number of Relations
Discrete Mathematics Questions and Answers – Types of Relations
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Mathematical Functions

2. Simple C Programs
3. C++ Programming Examples on Data-Structures
4. Python Programming Examples on Graphs
5. C Programming Examples on Searching and Sorting
6. C Programming Examples on Arrays
7. Python Programming Examples on Linked Lists
8. C Programming Examples on Linked List
9. Java Programming Examples on Combinatorial Problems & Algorithms
10. C Programming Examples on Combinatorial Problems & Algorithms
11. Engineering Mathematics Questions and Answers
12. Python Programming Examples on Searching and Sorting
13. C Programming Examples using Recursion
14. C++ Programming Examples on Combinatorial Problems & Algorithms
15. C Programming Examples without using Recursion
16. Java Programming Examples on Graph Problems & Algorithms
17. C Programming Examples on Graph Problems & Algorithms
18. C# Programming Examples on Mathematics
19. C++ Programming Examples on Graph Problems & Algorithms
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Types of Relations

« Prev
Next »
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Types of Relations”.

1. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is __________
a) reflective, symmetric and transitive
b) irreflexive, symmetric and transitive
c) neither reflective, nor irreflexive but transitive
d) irreflexive and antisymmetric
View Answer

Answer: c
Explanation: Not reflexive -> (3,3) not present; not irreflexive -> (1, 1) is present; not symmetric -> (2, 1) is present but not (1, 2); not
antisymmetric – (2, 3) and (3, 2) are present; not asymmetric -> asymmetry requires both antisymmetry and irreflexivity. So, it is transitive
closure of relation.
advertisement

2. Consider the relation: R’ (x, y) if and only if x, y>0 over the set of non-zero rational numbers,then R’ is _________
a) not equivalence relation
b) an equivalence relation
c) transitive and asymmetry relation
d) reflexive and antisymmetric relation
View Answer

Answer: b
Explanation: Reflexive: a, a>0
Symmetric: if a, b>0 then both must be +ve or -ve, which means b, a > 0 also exists
Transitive: if a, b>0 and b, c>0 then to have b as same number, both pairs must be +ve or -ve which implies a, c>0. Hence, R’ is an
equivalence relation.

3. Let S be a set of n>0 elements. Let be the number Br of binary relations on S and let Bf be the number of functions from S to S. The
expression for Br and Bf, in terms of n should be ____________
2 2
a) n and 2(n+1)
3 (n+1)
b) n and n
(n+6)
c) n and n
(n*n) n
d) 2 and n
View Answer

Answer: d
(n*n) n
Explanation: For a set with n elements the number of binary relations should be 2 and the number of functions should be n . Hence Br
(n*n) n
=2 and Bf = n .

4. Let A be a set of k (k>0) elements. Which is larger between the number of binary relations (say, Nr) on A and the number of functions
(say, Nf) from A to A?
a) number of relations
b) number of functions
c) the element set
d) number of subsets of the relation
View Answer

Answer: a
(n*n) n
Explanation: For a set with k elements the number of binary relations should be 2 and the number of functions should be n . Now,
 (n*n) 2 n 2
2 => n log (2) [taking log] and n => nlog (n) [taking log]. It is known that n log (2) > nlog (n). Hence, the number of binary relations
> the number of functions i.e, Nr > Nf.

5. Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is?
a) {(a,b) | a >= b and a, b belong to {1, 2, 3}}
b) {(a,b) | a > b and a, b belong to {1, 2, 3}}
c) {(a,b) | a <= b and a, b belong to {1, 2, 3}}
d) {(a,b) | a = b and a, b belong to {1, 2, 3}}
View Answer

Answer: a
Explanation: By definition of Transitive closure we have that a is related to all smaller b (as every a is related to b – 1) and from the
reflexive property a is related to a.
advertisement

6. Let R1 be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R2 be another relation from B to C = {1, 2, 3, 4} as defined below:
i. An element a in A is related to an element b in B (under R1) if a * b is divisible by 3.
ii. An element a in B is related to an element b in C (under R2) if a * b is even but not divisible by 3. Which is the composite relation R1R2
from A to C?
a) R1R2 = {(1, 2), (1, 4), (3, 3), (5, 4), (5,6), (7, 3)}
b) Φ
c) R1R2 = {(1, 2), (1,6), (3, 2), (3, 4), (5, 4), (7, 2)}
d) R1R2 = {(2,2), (3, 2), (3, 4), (5, 1), (5, 3), (7, 1)}
View Answer

Answer: b
Explanation: By definition, i) R1 = {(1,6), (3,2), (3,4), (3,6), (3,8), (5,6), (7,6)} and ii) R2 = {(1,2), (1,4), (1,8), (5,2), (5,4), (5,8), (7,2),
(7,4), (7,8)}. So, R1R2 = Φ.

7. The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________
a) O(n)
b) O(logn)
(n+(3/2))
c) O(n )
3
d) O(n )
View Answer

Answer: d
3
Explanation: Calculation of transitive closure results into matrix multiplication. We can do matrix multiplication in O(n ) time. There are
better algorithms that do less than cubic time.

8. Let A and B be two non-empty relations on a set S. Which of the following statements is false?
a) A and B are transitive ⇒ A∩B is transitive
b) A and B are symmetric ⇒ A∪B is symmetric
c) A and B are transitive ⇒ A∪B is not transitive
d) A and B are reflexive ⇒ A∩B is reflexive
View Answer

Answer: c
Explanation: In terms of set theory, the binary relation R defined on the set X is a transitive relation if, for all a, b, c ∈ X, if aRb and bRc,
then aRc. If there are two relations on a set satisfying transitive property then there union must satisfy transitive property.
 2 2
9. Determine the characteristics of the relation aRb if a = b .
a) Transitive and symmetric
b) Reflexive and asymmetry
c) Trichotomy, antisymmetry, and irreflexive
d) Symmetric, Reflexive, and transitive
View Answer

Answer: d
2 2
Explanation: Since, x = y is just a special case of equality, so all properties that apply to x = y also apply to this case. Hence, the relation
satisfies symmetric, reflexive and transitive closure.
advertisement

10. Let R be a relation between A and B. R is asymmetric if and only if ________

a) Intersection of D(A) and R is empty, where D(A) represents diagonal of set
-1 -1
b) R is a subset of R, where R represents inverse of R
-1
c) Intersection of R and R is D(A)
d) D(A) is a subset of R, where D(A) represents diagonal of set
View Answer

Answer: a
Explanation: A relation is asymmetric if and only if it is both antisymmetric and irreflexive. As a consequence, a relation is transitive and
asymmetric if and only if it is a strict partial order. If D(A) is a diagonal of A set and intersection of D(A) and R is empty, then R is
asymmetric.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Closure on Relations
» Next - Discrete Mathematics Questions and Answers – Relations – Partial Orderings
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Closure on Relations
Discrete Mathematics Questions and Answers – Relations – Partial Orderings
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Combinatorial Problems & Algorithms

2. Python Programming Examples on Trees
3. C# Programming Examples on Sorting
4. C# Programming Examples on Data Structures
5. C Programming Examples
6. C++ Programming Examples on Combinatorial Problems & Algorithms
7. C# Programming Examples on Arrays
 8. C Programming Examples without using Recursion
9. Engineering Mathematics Questions and Answers
10. C Programming Examples on Searching and Sorting
11. C Programming Examples on Trees
12. Python Programming Examples on Searching and Sorting
13. C Programming Examples on Arrays
14. Python Programming Examples on Linked Lists
15. C# Programming Examples on Mathematics
16. Java Programming Examples on Graph Problems & Algorithms
17. C Programming Examples on Linked List
18. C Programming Examples on Graph Problems & Algorithms
19. C++ Programming Examples on Graph Problems & Algorithms
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Relations – Partial

Orderings
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Relations – Partial Orderings”.

1. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of edges in the Hasse diagram of is
______
a) 6
b) 5
c) 9
d) 4
View Answer

Answer: b
Explanation: Hasse Diagram is:
32
/
16
/
8
/ \
2 4
advertisement

So, the number of edges should be: 4.

2. The less-than relation, <, on a set of real numbers is ______

a) not a partial ordering because it is not asymmetric and irreflexive equals antisymmetric
b) a partial ordering since it is asymmetric and reflexive
c) a partial ordering since it is antisymmetric and reflexive
d) not a partial ordering because it is not antisymmetric and reflexive
View Answer

Answer: a
Explanation: Relation less than a set of real numbers is not antisymmetric and reflexive. Relation is not POSET because it is irreflexive.
Again, aRb != bRa unless a=b and so it is antisymmetric. A relation may be ‘not asymmetric and not reflexive but still antisymmetric, as
{(1,1) (1,2)}. So, the relation is not a partial ordering because it is not asymmetric and irreflexive equals antisymmetric.

3. If the longest chain in a partial order is of length l, then the partial order can be written as _____ disjoint antichains.
2
a) l
b) l+1
c) l
l
d) l
View Answer

Answer: c
Explanation: If the length of the longest chain in a partial order is l, then the elements in the POSET can be partitioned into l disjoint
antichains.

4. Suppose X = {a, b, c, d} and π1 is the partition of X, π1 = {{a, b, c}, d}. The number of ordered pairs of the equivalence relations induced
by __________
a) 15
b) 10
c) 34
d) 5
View Answer

Answer: b
Explanation: The ordered pairs of the equivalence relations induced = {(a,a), (a,b), (a,c), (b,a), (b,b), (b,c), (c,a), (c,b), (c,c), (d,d)}. Poset ->
equivalence relations = each partition power set – Φ.
advertisement

5. A partial order P is defined on the set of natural numbers as follows. Here a/b denotes integer division. i)(0, 0) ∊ P. ii)(a, b) ∊ P if and only
if a % 10 ≤ b % 10 and (a/10, b/10) ∊ P. Consider the following ordered pairs:
i. (101, 22) ii. (22, 101) iii. (145, 265) iv. (0, 153)
The ordered pairs of natural numbers are contained in P are ______ and ______
a) (145, 265) and (0, 153)
b) (22, 101) and (0, 153)
c) (101, 22) and (145, 265)
d) (101, 22) and (0, 153)
View Answer

Answer: d
Explanation: For ordered pair (a, b), to be in P, each digit in a starting from unit place must not be larger than the corresponding digit in b.
This condition is satisfied by options (iii) (145, 265) => 5 ≤ 5, 4 < 6 and 1 < 2; (iv) (0, 153) => 0 < 3 and no need to examine further.

6. The inclusion of ______ sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a
complete lattice under the partial order defined by set containment.
a) {1}, {2, 4}
b) {1}, {1, 2, 3}
c) {1}
d) {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5}
View Answer

Answer: c
Explanation: A lattice is complete if every subset of partial order set has a supremum and infimum element. For example, here we are given
a partial order set R. Now it will be a complete lattice if whatever be the subset we choose, it has a supremum and infimum element. Here
relation given is set containment, so supremum element will be just union of all sets in the subset we choose. Similarly, the infimum element
will be just an intersection of all the sets in the subset we choose. As R now is not complete lattice, because although it has a supremum for
every subset we choose, but some subsets have no infimum. For example, if we take subset {{1, 3, 5}, {1, 2, 4}}, then intersection of sets in
this is {1}, which is not present in R. So clearly, if we add set {1} in R, we will solve the problem. So adding {1} is necessary and sufficient
condition for R to be a complete lattice.

7. Consider the ordering relation a | b ⊆ N x N over natural numbers N such that a | b if there exists c belong to N such that a*c=b. Then
___________
a) | is an equivalence relation
b) It is a total order
c) Every subset of N has an upper bound under |
d) (N,|) is a lattice but not a complete lattice
View Answer

Answer: d
Explanation: A set is called lattice if every finite subset has a least upper bound and greatest lower bound. It is termed as a complete lattice if
every subset has a least upper bound and greatest lower bound. As every subset of this will not have LUB and GLB so (N,|) is a lattice but
not a complete lattice.

8. Consider the set N* of finite sequences of natural numbers with a denoting that sequence a is a prefix of sequence b. Then, which of the
following is true?
a) Every non-empty subset of has a greatest lower bound
b) It is uncountable
c) Every non-empty finite subset of has a least upper bound
d) Every non-empty subset of has a least upper bound
View Answer

Answer: a
Explanation: Consider any sequence like “45, 8, 7, 2” – it can have many (infinite) least upper bounds like “45, 8, 7, 2, 5”, “45, 8, 7, 2, 1”
and so on but it can have only 1 greatest lower bound – “45, 8, 7” because we are using the prefix relation. So, every non-empty subset has a
greatest lower bound.
advertisement

9. A partial order ≤ is defined on the set S = {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number of total
orders on the set S which contain the partial order ≤ is ______
a) n+4
2
b) n
c) n!
d) 3
View Answer

Answer: c
Explanation: To make this partial order a total order, we need the relation to hold for every two element of the partial order. Currently, there
is no relation between any bi and bj. So, for every bi and bj, we have to add either (bi, bj) or (bj, bi) in total order. So, this translates to
giving an ordering for n elements between x and y, which can be done in n! ways.

10. Let (A, ≤) be a partial order with two minimal elements a, b and a maximum element c. Let P:A –> {True, False} be a predicate defined
on A. Suppose that P(a) = True, P(b) = False and P(a) ⇒ P(b) for all satisfying a ≤ b, where ⇒ stands for logical implication. Which of the
following statements cannot be true?
a) P(x) = True for all x S such that x ≠ b
b) P(x) = False for all x ∈ S such that b ≤ x and x ≠ c
c) P(x) = False for all x ∈ S such that x ≠ a and x ≠ c
d) P(x) = False for all x ∈ S such that a ≤ x and b ≤ x
View Answer

Answer: d
Explanation: Here, maximum element is c and so c is of a higher order than any other element in A. Minimal elements are a and b: No other
element in A is of lower order than either a or b.
We are given P(a) = True. So, for all x such that a≤x, P(x) must be True. We do have at least one such x, which is c as it is the maximum
element. So, P(x) = False for all x ∈ S such that a ≤ x and b ≤ x -> cannot be true. P(x) = True for all x S such that x ≠ b -> can be True as all
elements mapped to TRUE doesn’t violate the given implication. P(x) = False for all x ∈ S such that x ≠ a and x ≠ c -> can be True if a is
related only to c. P(x) = False for all x ∈ S such that b ≤ x and x ≠ c -> can be True as b≤x ensures x≠a and for all other elements P(x) can be
False without violating the given implication.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

advertisement

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Types of Relations
» Next - Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and Partitions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Types of Relations
Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and Partitions
advertisement
advertisement

Recommended Posts:

1. Copyright
2. C++ Programming Examples on Graph Problems & Algorithms
3. C# Programming Examples on Sorting
4. C++ Programming Examples on Hard Graph Problems & Algorithms
5. C Programming Examples using Recursion
6. C Programming Examples without using Recursion
7. C Programming Examples on Searching and Sorting
8. C++ Programming Examples on Data-Structures
 9. C Programming Examples on Hard Graph Problems & Algorithms
10. C Programming Examples on Arrays
11. Java Programming Examples on Combinatorial Problems & Algorithms
12. C# Programming Examples on Mathematics
13. Engineering Mathematics Questions and Answers
14. C Programming Examples on Matrix
15. C# Programming Examples on Matrix
16. C Programming Examples on Combinatorial Problems & Algorithms
17. C++ Programming Examples on Combinatorial Problems & Algorithms
18. Java Programming Examples on Arrays
19. C# Programming Examples on Arrays
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Relations –

Equivalence Classes and Partitions
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Relations – Equivalence Classes and
Partitions”.

1. Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = {3, 5, 6}. Here R is known as _________
a) equivalence relation
b) reflexive relation
c) symmetric relation
d) transitive relation
View Answer

Answer: a
Explanation: Here, [3] = {3, 5}, [5] = {3, 5}, [5] = {5}. We can see that [3] = [5] and that S/R will be {[3], [6]} which is a partition of S.
Thus, we can choose either {3, 6} or {5, 6} as a set of representatives of the equivalence classes.
advertisement

2. Consider the congruence 45≡3(mod 7). Find the set of equivalence class representatives.
a) {…, 0, 7, 14, 28, …}
b) {…, -3, 0, 6, 21, …}
c) {…, 0, 4, 8, 16, …}
d) {…, 3, 8, 15, 21, …}
View Answer

Answer: a
Explanation: Note that a set of class representatives is the subset of a set which contains exactly one element from each equivalence class.
Now, for integers n, a and b, we have congruence a≡b(mod n), then the set of equivalence classes are {…, -2n, -n, 0, n, 2n,…}, {…, 1-2n, 1-
n, 1, 1+n, 1+2n,…}. The required answer is {…, 0, 7, 14, 28, …}.
3. Which of the following relations is the reflexive relation over the set {1, 2, 3, 4}?
a) {(0,0), (1,1), (2,2), (2,3)}
b) {(1,1), (1,2), (2,2), (3,3), (4,3), (4,4)}
c) {,(1,1), (1,2), (2,1), (2,3), (3,4)}
d) {(0,1), (1,1), (2,3), (2,2), (3,4), (3,1)
View Answer

Answer: b
Explanation: {(1,1), (1,2), (2,2), (3,3), (4,3), (4,4)} is a reflexive relation because it contains set = {(1,1), (2,2), (3,3), (4,4)}.

4. Determine the partitions of the set {3, 4, 5, 6, 7} from the following subsets.
a) {3,5}, {3,6,7}, {4,5,6}
b) {3}, {4,6}, {5}, {7}
c) {3,4,6}, {7}
d) {5,6}, {5,7}
View Answer

Answer: b
Explanation: {3,5}, {3,6,7}, {4,5,6}. It is not a partition because these sets are not pairwise disjoint. The elements 3, 5 and 6 appear
repeatedly these sets. {1}, {2,3,6}, {4}, {5} – this is a partition as they are pairwise disjoint. {3,4,6}, {7} – this is not a partition as element
5 is missing.
{5,6}, {5,7} – this is not a partition because it is missing the elements 3, 4 in any of the sets.

5. Determine the number of equivalence classes that can be described by the set {2, 4, 5}.
a) 125
b) 5
c) 16
d) 72
View Answer

Answer: b
Explanation: Suppose B={2, 4, 5} and B×B = (2,2), (4,4), (5,5), (2,4), (4,2), (4,5), (5,4), (2,5), (5,2). A relation R on set B is said to be
3
equivalence relation if R is reflexive, Symmetric, transitive. Hence, total number of equivalence relation=5 out of 2 =8 relations.
advertisement

6. Determine the number of possible relations in an antisymmetric set with 19 elements.

a) 23585
87
b) 2.02 * 10
91
c) 9.34 * 7
d) 35893
View Answer

Answer: b
Explanation: Number of antisymmetric relation is given:-|A|=n, |AxA|=n xn. Then, N=total number of diagonal will n and we know that N =
n (n2-n)/2 87
2 *3 . So, the number of relations should be = 2.02 * 10 .

7. For a, b ∈ Z define a | b to mean that a divides b is a relation which does not satisfy ___________
a) irreflexive and symmetric relation
b) reflexive relation and symmetric relation
c) transitive relation
d) symmetric relation
View Answer

Answer: b
Explanation: Suppose, a=0, then we know that 0 does not divide 0, 0 ∤ 0 and it is not reflexive. Again, 2 | 4 but 4 does not 2 and so it is not a
symmetric relation.

8. Which of the following is an equivalence relation on R, for a, b ∈ Z?

a) (a-b) ∈ Z
2
b) (a +c) ∈ Z
c) (ab+cd)/2 ∈ Z
3
d) (2c )/3 ∈ Z
View Answer

Answer: b
Explanation: Let a ∈ R, then a−a = 0 and 0 ∈ Z, so it is reflexive. To see that a-b ∈ Z is symmetric, then a−b ∈ Z -&gt say, a−b = m, where
m ∈ Z ⇒ b−a = −(a−b)=−m and −m ∈ Z. Thus, a-b is symmetric. To see that a-b is transitive, let a, b, c ∈ R. Thus, a−b ∈ Z; b−c ∈ Z. Let
a−b = i and b−c = j, for integers i,j ∈ Z. Then a−c ='(a−b)+(b−c)=i + j. So, a−c ∈ Z. Therefore a – c is transitive. Hence, (a-b) is an
equivalence relation on the set R. Rest of the options are not equivalence relations.

9. Determine the set of all integers a such that a ≡ 3 (mod 7) such that −21 ≤ x ≤ 21.
a) {−21, −18, −11, −4, 3, 10, 16}
b) {−21, −18, −11, −4, 3, 10, 17, 24}
c) {−24, -19, -15, 5, 0, 6, 10}
d) {−23, −17, −11, 0, 2, 8, 16}
View Answer

Answer: b
Explanation: For an integer a we have x ≡ 3 (mod 7) if and only if a = 7m + 3. Thus, by calculating multiples of 7, add 3 and restrict the
value of a, so that −21 ≤ x ≤ 21. The set for a = {−21, −18, −11, −4, 3, 10, 17, 24}.
advertisement

10. For a, b ∈ R define a = b to mean that |x| = |y|. If [x] is an equivalence relation in R. Find the equivalence relation for [17].
a) {,…,-11, -7, 0, 7, 11,…}
b) {2, 4, 9, 11, 15,…}
c) {-17, 17}
d) {5, 25, 125,…}
View Answer

Answer: c
Explanation: We can find that [17] = {a ∈ R|a = 17} = {a ∈ R||a| = |17|} = {-17, 17} and [−17] = {a ∈ R|a = −17} = {a ∈ R||a| = |−17|}=
{−17, 17}. Hence, the required equivalence relation is {-17, 17}.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Relations – Partial Orderings
» Next - Discrete Mathematics Questions and Answers – Graphs – Diagraph
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Relations – Partial Orderings
Discrete Mathematics Questions and Answers – Graphs – Diagraph
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Graph Problems & Algorithms

2. C Algorithms, Problems & Programming Examples
3. C# Programming Examples on Mathematics
4. Engineering Mathematics Questions and Answers
5. Training Classes on C, Linux & SAN – Group Photos
6. Java Programming Examples on Utility Classes
7. Java Programming Examples on Classes
8. Discrete Mathematics Questions and Answers – Logics – Logical Equivalences
9. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
10. Discrete Mathematics Questions and Answers – Groups – Closure and Associativity
11. Discrete Mathematics Questions and Answers – Types of Matrices
12. Discrete Mathematics Questions and Answers – Properties of Matrices
13. Discrete Mathematics Questions and Answers – Operations on Matrices
14. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
15. Discrete Mathematics Questions and Answers
16. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
17. Discrete Mathematics Questions and Answers – Groups – Cosets
18. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
19. Disjoint-Set Data Structure Multiple Choice Questions and Answers (MCQs)
20. Discrete Mathematics Questions and Answers – Advanced Counting Techniques – Recurrence Relation

advertisement

Discrete Mathematics Questions and Answers – Graphs – Diagraph

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs – Diagraph”.

1. A directed graph or digraph can have directed cycle in which ______

a) starting node and ending node are different
b) starting node and ending node are same
c) minimum four vertices can be there
d) ending node does not exist
View Answer
Answer: b
Explanation: If the start node and end node are same in the path of a graph then it is termed as directed cycle i.e, c0 = cn. For instance, a c b
a is a simple cycle in which start and end nodes are same(a). But, a c b b a is not a simple cycle as there is a loop <b,b>.
advertisement

2. Let, D = <A, R> be a directed graph or digraph,then D’ = <A’, R’> is a subgraph if ___________
a) A’ ⊂ A and R’ = R ∩ (A’ x A’)
b) A’ ⊂ A and R ⊂ R’ ∩ (A’ x A’)
c) R’ = R ∩ (A’ x A’)
d) A’ ⊆ A and R ⊆ R’ ∩ (A’ x A’)
View Answer

Answer: a
Explanation: A directed graph or digraph is an ordered pair D<A, R> where A(is a set of nodes of D) is a set and R(the elements of R are the
arcs of D) is a binary relation on A. The relation R is called the incidence relation on D. Now, a digraph is a subgraph of D if i)A’ ⊂ A and
ii)R’ = R ∩ (A’ x A’). If D’ D, D’ is a proper subgraph of D.

3. The graph representing universal relation is called _______

a) complete digraph
b) partial digraph
c) empty graph
d) partial subgraph
View Answer

Answer: a
Explanation: Consider, A is a graph with vertices {a, b, c, d} and the universal relation is A x A. The graph representing universal relation is
called a complete graph and all ordered pairs are present there.

4. What is a complete digraph?

a) connection of nodes without containing any cycle
b) connecting nodes to make at least three complete cycles
c) start node and end node in a graph are same having a cycle
d) connection of every node with every other node including itself in a digraph
View Answer

Answer: d
Explanation: Every node should be connected to every other node including itself in a digraph is the complete digraph. Now, graphs are
connected, strongly connected and disconnected

5. Disconnected components can be created in case of ___________

a) undirected graphs
b) partial subgraphs
c) disconnected graphs
d) complete graphs
View Answer

Answer: c
Explanation: By the deletion of one edge from either connected or strongly connected graphs the graph obtained is termed as a disconnected
graph. It can have connected components separated by the deletion of the edges. The edge that has to be deleted called cut edge.
advertisement
6. A simple graph can have _______
a) multiple edges
b) self loops
c) parallel edges
d) no multiple edges, self-loops and parallel edges
View Answer

Answer: d
Explanation: If a graph say G = <V, E> has no parallel or multiple edges and no self loops contained in it is called a simple graph. An
undirected graph may have multiple edges and self-loops.

7. Degree of a graph with 12 vertices is _______

a) 25
b) 56
c) 24
d) 212
View Answer

Answer: c
Explanation: Number of edges incident on a graph is known as degree of a vertex. Sum of degrees of each vertex is called total degree of the
graph. Total degree = 2 * number of vertices. So, if there are 24 vertices then total degree is 24.

8. In a finite graph the number of vertices of odd degree is always ______

a) even
b) odd
c) even or odd
d) infinite
View Answer

Answer: a
Explanation: In any finite graph, sum of degree of all the vertices = 2 * number of edges.
Sum of degree of all the vertices with even degree + sum of degree of all the vertices with odd degree = 2 * number of edges. Now, even
number + sum of degree of all the vertices with odd degree = even number. It is possible if and only if number of odd degree vertices are
even.

9. An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7.
What is the degree of vertex 8?
a) 15
b) 8
c) 5
d) 23
View Answer

Answer: b
Explanation: Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. By definition, sum of degree= 2 * No of edges
Let x = degree of vertex 8
8 + 7 + 8 + 7 + 8 + 7 + 8 + x = 2 * 31
53 + x = 61
x=8
Hence, degree of vertex 8 is 8.
 advertisement

10. G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible
value of n is ___________
a) 7
b) 43
c) 13
d) 10
View Answer

Answer: c
Explanation: Let m be min degree and M be a max degree of a graph, then m ≤ 2E/V ≤ M. Here, m=4, E=26, v=?
So, 4 ≤ (2*26)/V
V ≤ (52/4)
V ≤ 13 ⇒ V = 13.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and Partitions
» Next - Discrete Mathematics Questions and Answers – Graphs – Hasse Diagrams
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Relations – Equivalence Classes and Partitions
Discrete Mathematics Questions and Answers – Graphs – Hasse Diagrams
advertisement
advertisement

Recommended Posts:

1. C Programming Examples without using Recursion

2. Data Structure Questions and Answers
3. C++ Programming Examples on Computational Geometry Problems & Algorithms
4. Python Programming Examples on Trees
5. C Programming Examples on Computational Geometry Problems & Algorithms
6. C Programming Examples on Trees
7. Python Programming Examples on Linked Lists
8. Java Programming Examples on Combinatorial Problems & Algorithms
9. C Programming Examples on Combinatorial Problems & Algorithms
10. C++ Algorithms, Problems & Programming Examples
11. C Algorithms, Problems & Programming Examples
12. C++ Programming Examples on Combinatorial Problems & Algorithms
13. Java Programming Examples on Hard Graph Problems & Algorithms
14. Discrete Mathematics Questions and Answers
15. Java Programming Examples on Graph Problems & Algorithms
 16. C++ Programming Examples on Graph Problems & Algorithms
17. C Programming Examples on Graph Problems & Algorithms
18. C++ Programming Examples on Hard Graph Problems & Algorithms
19. C Programming Examples on Hard Graph Problems & Algorithms
20. C Program to Represent Graph Using Adjacency Matrix

advertisement

Discrete Mathematics Questions and Answers – Graphs – Hasse

Diagrams
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs – Hasse Diagrams”.

1. Hasse diagrams are first made by ______

a) A.R. Hasse
b) Helmut Hasse
c) Dennis Hasse
d) T.P. Hasse
View Answer

Answer: b
Explanation: Hasse diagrams can be described as the transitive reduction as an abstract directed acyclic graph. This graph drawing
techniques are constructed by Helmut Hasse(1948).
advertisement

2. If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering graph is called ______
a) upward planar
b) downward planar
c) lattice
d) biconnected components
View Answer

Answer: a
Explanation: In a Hasse diagram if no two edges cross each other in the drawing of partial order Hasse diagram, then its covering graph
called the upward planar.

3. If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity
__________
a) NP-complete
2
b) O(n )
c) O(n+2)
3
d) O(n )
View Answer
Answer: a
Explanation: If the partial order has at most one minimal element, or it has at most one maximal element, then to test whether a partial order
with multiple sources and sinks can be drawn as a crossing-free Hasse diagram or not it’s time complexity is NP-complete.

4. Which of the following relation is a partial order as well as an equivalence relation?

a) equal to(=)
b) less than(<)
c) greater than(>)
d) not equal to(!=)
View Answer

Answer: a
Explanation: The identity relation = on any set is a partial order in which every two distinct elements are incomparable and that depicts the
relation of both a partial order and an equivalence relation. For non-linear orders, there are many advanced properties of posets.

5. The relation ≤ is a partial order if it is ___________

a) reflexive, antisymmetric and transitive
b) reflexive, symmetric
c) asymmetric, transitive
d) irreflexive and transitive
View Answer

Answer: a
Explanation: Let A is a set and ≤ is a relation on A, then ≤ is a partial order if it satisfies reflexive, antisymmetric, and transitive, i.e., for all
x, y and z in P. That means, x ≤ x (reflexivity);
if x ≤ y and y ≤ x then x = y (antisymmetry) and if x ≤ y and y ≤ z then x ≤ z (transitivity).
advertisement

6. In which of the following relations every pair of elements is comparable?

a) ≤
b) !=
c) >=
d) ==
View Answer

Answer: a
Explanation: In the ≤(or less than and equal to) relation, every pair of elements is comparable.

7. In a poset (S, ⪯), if there is no element n∈S with m<n, then which of the following is true?
a) an element n exists for which m=n
b) An element m is maximal in the poset
c) A set with the same subset of the poset
d) An element m is minimal in the poset
View Answer

Answer: b
Explanation: By the definition, an element m exists in a poset (S, ⪯) is maximal if and only if there is no n∈S with m≺n.

8. In a poset P({v, x, y, z}, ⊆) which of the following is the greatest element?

a) {v, x, y, z}
b) 1
c) ∅
d) {vx, xy, yz}
View Answer

Answer: a
Explanation: We know that, in a Hasse diagram, the maximal element(s) are the top and the minimal elements are at the bottom of the
diagram. In the given poset, {v, x, y, z} is the maximal or greatest element and ∅ is the minimal or least element.

9. Suppose P1 is a partially ordered class and a cut of P1 is pair (D, T) of nonempty subclasses of P1 satisfies which of the following
properties?
a) D∩T=Ø
b) D∪T=P1
c) xyz∈T
d) z∈T and zx∈D
View Answer

Answer: a
Explanation: Suppose P1 is a partially ordered class and a cut of P1 is pair (D, T) of nonempty subclasses of P1 satisfies the following
properties: i) D∩T=Ø and D∪T=P1 ii) If z∈D and y≤z, then y∈D and iii) If z∈T and y≥z, then y∈T.
advertisement

10. Let G be the graph defined as the Hasse diagram for the ⊆ relation on the set S{1, 2,…, 18}. How many edges are there in G?
a) 43722
b) 2359296
c) 6487535
d) 131963
View Answer

Answer: b
18
Explanation: Here the total number of elements in S is 18 and so number of vertices in Hasse diagram are 2 . Hence, the number of edges
18-1
in Hasse diagram are 18 * 2 =2359296.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Graphs – Diagraph
» Next - Discrete Mathematics Questions and Answers – Graphs – Lattices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Graphs – Diagraph
Discrete Mathematics Questions and Answers – Graphs – Lattices
advertisement
advertisement
Recommended Posts:

1. C Programming Examples on Searching and Sorting

2. C Algorithms, Problems & Programming Examples
3. Python Programming Examples on Searching and Sorting
4. C# Programming Examples on Arrays
5. C++ Algorithms, Problems & Programming Examples
6. Java Programming Examples on Arrays
7. C Programming Examples on Arrays
8. C# Programming Examples on Sorting
9. Java Programming Examples on Hard Graph Problems & Algorithms
10. Engineering Mathematics Questions and Answers
11. C Programming Examples on Hard Graph Problems & Algorithms
12. C++ Programming Examples on Hard Graph Problems & Algorithms
13. Java Programming Examples on Combinatorial Problems & Algorithms
14. C++ Programming Examples on Combinatorial Problems & Algorithms
15. C Programming Examples on Combinatorial Problems & Algorithms
16. Java Programming Examples on Graph Problems & Algorithms
17. C++ Programming Examples on Graph Problems & Algorithms
18. C Programming Examples on Graph Problems & Algorithms
19. Discrete Mathematics Questions and Answers
20. Python Programming Examples on Graphs

advertisement

Discrete Mathematics Questions and Answers – Graphs – Lattices

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs – Lattices”.

1. A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______
a) sublattice
b) lattice
c) trail
d) walk
View Answer

Answer: b
Explanation: A poset in which every pair of elements has both a least upper bound and a greatest lower bound is called a lattice. A lattice
can contain sublattices which are subsets of that lattice.
advertisement

+ +
2. In the poset (Z , |) (where Z is the set of all positive integers and | is the divides relation) are the integers 9 and 351 comparable?
a) comparable
b) not comparable
c) comparable but not determined
d) determined but not comparable
View Answer

Answer: a
Explanation: The two integers 9 and 351 are comparable since 9|351 i.e, 9 divides 351. But 5 and 127 are not comparable since 5 | 127 i.e 5
does not divide 127.

3. If every two elements of a poset are comparable then the poset is called ________
a) sub ordered poset
b) totally ordered poset
c) sub lattice
d) semigroup
View Answer

Answer: b
Explanation: A poset (P, <=) is known as totally ordered if every two elements of the poset are comparable. “<=” is called a total order and a
totally ordered set is also termed as a chain.

4. ______ and _______ are the two binary operations defined for lattices.
a) Join, meet
b) Addition, subtraction
c) Union, intersection
d) Multiplication, modulo division
View Answer

Answer: a
Explanation: Join and meet are the binary operations reserved for lattices. The join of two elements is their least upper bound. It is denoted
by V, not to be confused with disjunction. The meet of two elements is their greatest lower bound. It is denoted by ∧ and not to be confused
with a conjunction.

5. A ________ has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).
a) semilattice
b) join semilattice
c) meet semilattice
d) bounded lattice
View Answer

Answer: d
Explanation: A lattice that has additionally a supremum element and an infimum element which satisfy 0<=a<=1, for every an in the lattice
is called a bounded lattice. A partially ordered set is a bounded lattice if and only if every finite set (including the empty set) of elements has
a join and a meet.
advertisement
6. The graph given below is an example of _________

a) non-lattice poset
b) semilattice
c) partial lattice
d) bounded lattice
View Answer

Answer: a
Explanation: The graph is an example of non-lattice poset where b and c have common upper bounds d, e and f but none of them is the least
upper bound.

7. A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if _________

a) x>=z, where x in S implies z in S, for every element x, y in L
b) x=y and y<=z, where x, y in S implies z in S, for every element x, y, z in L
c) x<=y<=z, where x, y in S implies z in S, for every element x, y, z in L
d) x=y and y>=z, where x, y in S implies z in S, for every element x, y, z in L
View Answer

Answer: c
Explanation: A sublattice S of a lattice L is a convex sublattice of L, if x ≤ z ≤ y and x, y in S implies that z belongs to S, for all elements x,
y, z in L.

8. The graph is the smallest non-modular lattice N5. A lattice is _______ if and only if it does not have a _______ isomorphic to N5.

a) non-modular, complete lattice

b) moduler, semilattice
c) non-modular, sublattice
d) modular, sublattice
View Answer

Answer: d
Explanation: A lattice (L, ∨, ∧) is modular if for all elements a, b, c of L, the following identity holds->modular identity: (a ∧ c) ∨ (b ∧ c) =
[(a ∧ c) ∨ b] ∧ c. This condition is equivalent to the following axiom -> modular law: a ≤ c implies a ∨ (b ∧ c) = (a ∨ b) ∧ c. A lattice is
modular if and only if it does not have a sublattice isomorphic to N5.

9. Every poset that is a complete semilattice must always be a _______

a) sublattice
b) complete lattice
c) free lattice
d) partial lattice
View Answer

Answer: b
Explanation: A poset is called a complete lattice if all its subsets have both a join and a meet. Every complete lattice is a bounded lattice.
Every poset that is a complete semilattice must always be a complete lattice.
advertisement

10. A free semilattice has the _______ property.

a) intersection
b) commutative and associative
c) identity
d) universal
View Answer

Answer: d
Explanation: Any set X may be used to generate the free semilattice FX. The free semilattice is defined to consist of all of the finite subsets
of X with the semilattice operation given by ordinary set union; the free semilattice has the universal property.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Graphs – Hasse Diagrams
» Next - Discrete Mathematics Questions and Answers – Bipartite Graphs
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Graphs – Hasse Diagrams
Discrete Mathematics Questions and Answers – Bipartite Graphs
advertisement
advertisement

Recommended Posts:

1. Database Management System Questions and Answers

2. Python Programming Examples on Searching and Sorting
3. Engineering Mathematics Questions and Answers
4. C Programming Examples on Arrays
5. RDBMS Questions and Answers
 6. C# Programming Examples on Sorting
7. C# Programming Examples on Mathematics
8. Java Programming Examples on Collections
9. Java Programming Examples on Arrays
10. Python Programming Examples on Linked Lists
11. C# Programming Examples on Matrix
12. C Programming Examples on Linked List
13. Python Programming Examples on Graphs
14. C# Programming Examples on Arrays
15. Discrete Mathematics Questions and Answers
16. Discrete Mathematics Questions and Answers – Algebraic Laws on Sets
17. Discrete Mathematics Questions and Answers – Types of Relations
18. Discrete Mathematics Questions and Answers – Groups – Existence of Identity & Inverse
19. Discrete Mathematics Questions and Answers – Set Operations – 2
20. Discrete Mathematics Questions and Answers – Cartesian Product of Sets

advertisement

Discrete Mathematics Questions and Answers – Bipartite Graphs

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Bipartite Graphs”.

1. The maximum number of edges in a bipartite graph on 14 vertices is ___________

a) 56
b) 14
c) 49
d) 87
View Answer

Answer: c
Explanation: Maximum number of edges occur in a complete bipartite graph when every vertex has an edge to every opposite vertex in the
graph. Number of edges in a complete bipartite graph is a*b, where a and b are no. of vertices on each side. This quantity is maximum when
a = b i.e. when there are 7 vertices on each side. So answer is 7 * 7 = 49.
advertisement

2. In a ______ the degree of each and every vertex is equal.

a) regular graph
b) point graph
c) star graph
d) euler graph
View Answer

Answer: c
Explanation: A regular graph has the same degree in each of its vertices. In a regular bipartite graph, if the common degree of each vertices
is 1, the two parts are of the same size.
3. The time complexity to test whether a graph is bipartite or not is said to be _______ using depth first search.
3
a) O(n )
b) linear time
c) O(1)
d) O(nlogn)
View Answer

Answer: b
Explanation: It is possible to test whether a graph is bipartite, and to return either a two-coloring (if it is bipartite) or an odd cycle (if it is
not) in linear time i.e, O(n) using depth first search. In case of the intersection of n line segments or other simple shapes in the Euclidean
graph, it is possible to test whether the graph is bipartite and it will return either a two-coloring or an odd cycle in time O(nlogn), even
2
though the graph itself has up to O(n ) edges.

4. The partition V = V1 ∪ V2 in a bipartite graph G1 is called ________

a) bipartition of G1
b) 2-vertex set of G1
c) sub bipartite graphs
d) disjoint vertex set
View Answer

Answer: b
Explanation: A graph G1(V, E) is called bipartite if its vertex set V(G) can be decomposed into two non-empty disjoint subsets V1(G1) and
V2(G1) in such a way that each edge e ∈ E(G) has its one end joint in V1(G1) and other endpoint in V2(G1). The partition V = V1 ∪ V2 in
a bipartite graph G1 is called bipartition of G1.

5. What is the maximum number of edges in a bipartite graph on 14 vertices?

a) 78
b) 15
c) 214
d) 49
View Answer

Answer: d
2
Explanation: By definition, the maximum possible number of edges in a bipartite graph on ‘n’ vertices = (1/4) x n .
2
Substituting n = 14, we get maximum number of edges in a bipartite graph on 14 vertices,= (1/4) x (14)
= (1/4) x 14 x 14
= 49
∴ Maximum number of edges in a bipartite graph on 14 vertices = 49.
advertisement

6. In a complete bipartite graph, the intersection of two sub graphs is ______

a) 1
b) null
10
c) 2
d) 412
View Answer

Answer: b
Explanation: In a complete Bipartite graph, there must exist a partition say, V(G)=X∪Y and X∩Y=∅, that means all edges share a vertex
from both set X and Y.
7. Bipartite graphs are used in ________
a) modern coding theory
b) colouring graphs
c) neural networks
d) chemical bonds
View Answer

Answer: a
Explanation: All types of cyclic graphs are examples of cyclic graphs. A cyclic graph is considered bipartite if all the cycles involved are of
even length. Bipartite graphs are widely used in modern coding theory apart from being used in modeling relationships.

8. All closed walks are of ______ length in a bipartite graph.

a) infinite
b) even
c) odd
d) odd prime
View Answer

Answer: b
Explanation: In a bipartite graph G all closed walks must be of even length as well as all cycles in G are of even length. Then only the graph
is considered a bipartite graph.

9. Every complete bipartite graph must not be _______

a) planar graph
b) line graph
c) complete graph
d) subgraph
View Answer

Answer: c
Explanation: The below bipartite graph is not a complete graph as there is no edge between A-B, B-C, C-D, C-Q, P-Q, Q-R, Q-D and so it is
not a complete graph.

advertisement

10. The spectrum of a graph is _______ if and only if it is _______ graph.

a) symmetry, bipartite
b) transitive, bipartite
c) cyclic, Euler
d) reflexive, planar
View Answer

Answer: a
Explanation: A graph is bipartite if and only if it does not contain an odd cycle. The spectrum of a graph is symmetric if and only if it is a
bipartite graph. These are the characteristics of the graph.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Graphs – Lattices
» Next - Discrete Mathematics Questions and Answers – Graphs Properties
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Graphs – Lattices
Discrete Mathematics Questions and Answers – Graphs Properties
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Computational Geometry Problems & Algorithms

2. Engineering Mathematics Questions and Answers
3. Python Programming Examples on Trees
4. Java Algorithms, Problems & Programming Examples
5. C Programming Examples on Trees
6. C# Programming Examples on Mathematics
7. Java Programming Examples on Combinatorial Problems & Algorithms
8. C Programming Examples on Combinatorial Problems & Algorithms
9. C Algorithms, Problems & Programming Examples
10. Data Structures & Algorithms II – Questions and Answers
11. C++ Programming Examples on Combinatorial Problems & Algorithms
12. C++ Algorithms, Problems & Programming Examples
13. C++ Programming Examples on Graph Problems & Algorithms
14. Java Programming Examples on Graph Problems & Algorithms
15. C Programming Examples on Graph Problems & Algorithms
16. Discrete Mathematics Questions and Answers
17. Java Programming Examples on Hard Graph Problems & Algorithms
18. C++ Programming Examples on Hard Graph Problems & Algorithms
19. C Programming Examples on Hard Graph Problems & Algorithms
20. Python Programming Examples on Graphs

advertisement
Discrete Mathematics Questions and Answers – Graphs Properties
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graphs Properties”.

1. In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______

a) 728
b) 450
c) 360
d) 260
View Answer

Answer: c
Explanation: A Hamiltonian cycle in a connected graph G is defined as a closed path that traverses every vertex of G exactly once except the
starting vertex, at which the path also terminates. In an n-complete graph, there are (n-1)!/2 hamiltonian cycles and so the answer is 360.
advertisement

2. If each and every vertex in G has degree at most 23 then G can have a vertex colouring of __________
a) 24
b) 23
c) 176
d) 54
View Answer

Answer: a
Explanation: A vertex colouring of a graph G = (V’,E’) with m colours is a mapping f:V’ -> {1,…,m} such that f(u)!=f(v) for every (u,v)
belongs to E’. Since in worst case the graph can be complete, d+1 colours are necessary for graph containing vertices with degree at most
‘d’. So, the required answer is 24.

3. Triangle free graphs have the property of clique number is __________

a) less than 2
b) equal to 2
c) greater than 3
d) more than 10
View Answer

Answer: d
Explanation: In an undirected triangle-free graph no three vertices can form a triangle of edges. It can be described as graphs with clique
number less than 2 and the graphs with girth greater than 4.

4. Berge graph is similar to ______ due to strong perfect graph theorem.

a) line graph
b) perfect graph
c) bar graph
d) triangle free graph
View Answer
Answer: b
Explanation: In a perfect graph, the chromatic number of each and every induced subgraph is equal to the size of the largest clique of that
subgraph. These perfect graphs are same as Berge graphs due to strong perfect graph theorem.

5. Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree
4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of
the last vertex?
a) 4
b) 0
c) 2
d) 5
View Answer

Answer: c
Explanation: We know that sum of degrees of all vertices = 2X no of edges. Say number of edges is E. Degree of last vertex is x,
1+2+3+4+5+6+7++8+9+x = 2XE
=>45+x = 2XE
Now putting options we get answer 0 or 5
But one vertex of degree 9 means it connected to all other vertexes. So, the degree must be 5.
advertisement

6. A ______ is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo
4(for integral values of number of edges).
a) Subgraph
b) Hamiltonian graph
c) Euler graph
d) Self complementary graph
View Answer

Answer: d
Explanation: It is the definition of self complementary graph. It is a graph that is isomorphic to its complement.

7. In a ______ the vertex set and the edge set are finite sets.
a) finite graph
b) bipartite graph
c) infinite graph
d) connected graph
View Answer

Answer: b
Explanation: In graph theory, most common graphs are considered to be finite otherwise it is an infinite graph. Now, a finite graph is a graph
in which the vertex set and the edge set are described as the finite sets.

8. If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges.
a) 38
b) 37
c) 17/54
d) 17/53
View Answer
Answer: b
Explanation: Here we are given a forest with 54 vertices and 17 components. A component is itself a tree and since there are 17 components
means that every component has a root, therefore we have 17 roots. Each new vertex of the forest contributes to a single edge to a forest. So
for remaining 54-17 = 37 vertices we can have m-n=37 edges. Hence, answer is 37.

9. The number of edges in a regular graph of degree 46 and 8 vertices is ____________

a) 347
b) 230
c) 184
d) 186
View Answer

Answer: c
Explanation: In a complete graph which is (n-1) regular (where n is the number of vertices) has edges n*(n-1)/2. In the graph n vertices are
adjacent to n-1 vertices and an edge contributes two degree so dividing by 2. Hence, in a d regular graph number of edges will be n*d/2 =
46*8/2 = 184.
advertisement

10. An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and
v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
101
a) 1/2
b) 1/50
c) 1/100
d) 1/20
View Answer

Answer: b
Explanation: For the given condition we can simply design a K-Map and mark an edge between every two adjacent cells in K-map. Hence,
that will give us a Bipartite graph and chromatic number for this = 2. Hence the ratio is 2/n=2/100=1/50 and the given graph is actually a
hypercube graph.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Bipartite Graphs
» Next - Discrete Mathematics Questions and Answers – Complete and Connected Graphs
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Bipartite Graphs
Discrete Mathematics Questions and Answers – Complete and Connected Graphs
advertisement
advertisement

Recommended Posts:
 1. C Programming Examples on Mathematical Functions
2. C Programming Examples on Set & String Problems & Algorithms
3. Engineering Mathematics Questions and Answers
4. Java Programming Examples on Mathematical Functions
5. Java Algorithms, Problems & Programming Examples
6. C Programming Examples on Computational Geometry Problems & Algorithms
7. C++ Algorithms, Problems & Programming Examples
8. Java Programming Examples on Combinatorial Problems & Algorithms
9. C++ Programming Examples on Combinatorial Problems & Algorithms
10. C Programming Examples on Combinatorial Problems & Algorithms
11. C# Programming Examples on Mathematics
12. C Algorithms, Problems & Programming Examples
13. Java Programming Examples on Graph Problems & Algorithms
14. C++ Programming Examples on Graph Problems & Algorithms
15. Java Programming Examples on Hard Graph Problems & Algorithms
16. C Programming Examples on Graph Problems & Algorithms
17. Discrete Mathematics Questions and Answers
18. C Programming Examples on Hard Graph Problems & Algorithms
19. C++ Programming Examples on Hard Graph Problems & Algorithms
20. C++ Program to Generate a Random UnDirected Graph for a Given Number of Edges

advertisement

Discrete Mathematics Questions and Answers – Complete and

Connected Graphs
« Prev
Next »

This set of Tricky Discrete Mathematics Questions and Answers focuses on “Complete and Connected Graphs”.

1. A bridge can not be a part of _______

a) a simple cycle
b) a tree
c) a clique with size ≥ 3 whose every edge is a bridge
d) a graph which contains cycles
View Answer

Answer: a
Explanation: In a connected graph, a bridge is an edge whose removal disconnects the graph. In a cycle if we remove an edge, it will still be
connected. So, bridge cannot be part of a cycle. A clique is any complete subgraph of a graph.
advertisement

2. Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are
positive is called _______
a) subgraph
b) tree
c) hamiltonian cycle
d) grid
View Answer

Answer: b
Explanation: If all the edge weights of an undirected graph are positive, any subset of edges that connects all the vertices and has minimum
total weight is termed as a tree. In this case, we need to have a minimum spanning tree need to be exact.

3. G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree
vertex of G. The resultant graph is ______
a) Complete bipartite graph
b) Hamiltonian cycle
c) Regular graph
d) Euler graph
View Answer

Answer: d
Explanation: In any simple undirected graph, total degree of all vertices is even (since each edge contributes 2 degrees). So number of
vertices having odd degrees must be even, otherwise, their sum would have been odd, making total degree also odd. Now single vertex n is
connected to all these even number of vertices (which have odd degrees). So, degree of n is also even. Moreover, now degree of all vertices
which are connected to v is increased by 1, hence earlier vertices which had odd degree now have even degree. So now, all vertices in the
graph have even degree, which is necessary and sufficient condition for euler graph.

4. Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if
either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
a) 98
b) 13
c) 6
d) 34
View Answer

Answer: c
Explanation: Edge set consists of edges from i to j using either 1) j = i+1 OR 2) j=3i. The trick to solving this question is to think in a
reverse way. Instead of finding a path from 1 to 50, try to find a path from 100 to 1. The edge sequence with the minimum number of edges
is 1 – 3 – 9 – 10 – 11 – 33 which consists of 6 edges.

5. What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and
remaining of degree 6?
a) 11
b) 14
c) 18
d) 19
View Answer

Answer: c
Explanation: We know that, sum of degree of all the vertices = 2 * number of edges
2*7 + 5*2 + 6*x = 39*2
x=9
Number of vertices = 7 + 2 + 9 = 18.
advertisement
6. ______ is the maximum number of edges in an acyclic undirected graph with k vertices.
a) k-1
2
b) k
c) 2k+3
3
d) k +4
View Answer

Answer: a
Explanation: This is possible with spanning trees since, a spanning tree with k nodes has k – 1 edges.

7. The minimum number of edges in a connected cyclic graph on n vertices is _____________

a) n – 1
b) n
c) 2n+3
d) n+1
View Answer

Answer: b
Explanation: For making a cyclic graph, the minimum number of edges have to be equal to the number of vertices. SO, the answer should be
n minimum edges.

8. The maximum number of edges in a 8-node undirected graph without self loops is ____________
a) 45
b) 61
c) 28
d) 17
View Answer

Answer: c
Explanation: In a graph of n vertices we can draw an edge from a vertex to n-1 vertex we will do it for n vertices and so total number of
edges is n*(n-1). Now each edge is counted twice so the required maximum number of edges is n*(n-1)/2. Hence, 8*(8-1)/2 = 28 edges.

9. Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant
graph must necessarily lie down between _____ and _____
a) n-1 and n+1
b) v and k
c) k+1 and v-k
d) k-1 and v-1
View Answer

Answer: d
Explanation: If a vertex is removed from the graph, lower bound: number of components decreased by one = k-1 (remove an isolated vertex
which was a component) and upper bound: number of components = v-1 (consider a vertex connected to all other vertices in a component as
in a star and all other vertices outside this component being isolated. Now, removing the considered vertex makes all other (v-1) vertices
isolated making (v-1) components.
advertisement

n
10. The 2 vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the
corresponding sets intersect in exactly two elements.
The number of connected components in G can be ___________
a) n+2
n/2
b) 3
2
c) n
n
d) 2
View Answer

Answer: b
Explanation: n+1(subsets of size < 2 are all disconnected) (subsets of size >= 2 are all connected)+1(subset of size >= 2 are all
connected)=n+2 is the number of connected components in G.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice Tricky questions and answers on all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions
and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Graphs Properties
» Next - Discrete Mathematics Questions and Answers – Isomorphism in Graphs
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Graphs Properties
Discrete Mathematics Questions and Answers – Isomorphism in Graphs
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on Mathematics

2. Data Structures & Algorithms II – Questions and Answers
3. Python Programming Examples on Linked Lists
4. Data Structure Questions and Answers
5. Python Programming Examples on Trees
6. Java Algorithms, Problems & Programming Examples
7. C Programming Examples on Trees
8. C Programming Examples on Combinatorial Problems & Algorithms
9. C++ Algorithms, Problems & Programming Examples
10. C++ Programming Examples on Combinatorial Problems & Algorithms
11. Java Programming Examples on Combinatorial Problems & Algorithms
12. Discrete Mathematics Questions and Answers
13. C Algorithms, Problems & Programming Examples
14. Java Programming Examples on Hard Graph Problems & Algorithms
15. Java Programming Examples on Graph Problems & Algorithms
16. C++ Programming Examples on Graph Problems & Algorithms
17. C Programming Examples on Graph Problems & Algorithms
18. C Programming Examples on Hard Graph Problems & Algorithms
19. C++ Programming Examples on Hard Graph Problems & Algorithms
20. C++ Program to Find Chromatic Index of Cyclic Graphs
 advertisement

Discrete Mathematics Questions and Answers – Isomorphism in

Graphs
« Prev
Next »

This set of Discrete Mathematics written test Questions & Answers focuses on “Isomorphism in Graphs”.

1. A graph which has the same number of edges as its complement must have number of vertices congruent to ______ or _______ modulo
4(for integral values of number of edges).
a) 6k, 6k-1
b) 4k, 4k+1
c) k, k+2
d) 2k+1, k
View Answer

Answer: c
Explanation: By using invariant of isomorphism and property of edges of graph and its complement, we have: a) number of edges of
isomorphic graphs must be the same.
b) number of edge of a graph + number of edges of complementary graph = Number of edges in Kn(complete graph), where n is the number
of vertices in each of the 2 graphs which will be the same. So we know number of edges in Kn = n(n-1)/2. So number of edges of each of the
above 2 graph(a graph and its complement) = n(n-1)/4. So this means the number of vertices in each of the 2 graphs should be of the form
“4x” or “4x+1” for integral value of number of edges which is necessary. Hence the required answer is 4x or 4x+1 so that on doing modulo
we get 0 which is the definition of congruence.
advertisement

2. Every Isomorphic graph must have ________ representation.

a) cyclic
b) adjacency list
c) tree
d) adjacency matrix
View Answer

Answer: d
Explanation: A graph can exist in different forms having the same number of vertices, edges and also the same edge connectivity, such
graphs are called isomorphic graphs. Two graphs G1 and G2 are said to be isomorphic if −> 1) their number of components (vertices and
edges) are same and 2) their edge connectivity is retained. Isomorphic graphs must have adjacency matrix representation.

3. A cycle on n vertices is isomorphic to its complement. What is the value of n?

a) 5
b) 32
c) 17
d) 8
View Answer

Answer: a
Explanation: A cycle with n vertices has n edges. Number of edges in cycle = n and number of edges in its complement = (n*(n−1)/2) – n.
To be isomorphism, both graphs should have equal number of edges. This gives, (n*(n-1)/2) – n = n
⇒n=5

4. How many perfect matchings are there in a complete graph of 10 vertices?

a) 60
b) 945
c) 756
d) 127
View Answer

Answer: b
Explanation: Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (exactly one
appearance). So for n vertices perfect matching will have n/2 edges and there won’t be any perfect matching if n is odd. For n=10, we can
10 8 6
choose the first edge in C2 = 45 ways, second in C2=28 ways, third in C2=15 ways and so on. So, the total number of ways
45*28*15*6*1=113400. But perfect matching being a set, order of elements is not important and the permutations 5! of the 5 edges are
same only. So, total number of perfect matching is 113400/5! = 945.

5. A graph G has the degree of each vertex is ≥ 3 say, deg(V) ≥ 3 ∀ V ∈ G such that 3|V| ≤ 2|E| and 3|R| ≤ 2|E|, then the graph is said to be
________ (R denotes region in the graph)
a) Planner graph
b) Polyhedral graph
c) Homomorphic graph
d) Isomorphic graph
View Answer

Answer: b
Explanation: A simple connected planar graph is called a polyhedral graph if the degree of each vertex is(V) ≥ 3 such that deg(V) ≥ 3 ∀ V ∈
G and two conditions must satisfy i) 3|V| ≤ 2|E| and ii) 3|R| ≤ 2|E|.
advertisement

6. A complete n-node graph Kn is planar if and only if _____________

a) n ≥ 6
2
b) n = n + 1
c) n ≤ 4
d) n + 3
View Answer

Answer: c
Explanation: Any graph with 4 or less vertices is planar, any graph with 8 or less edges is planar and a complete n-node graph Kn is planar if
and only if n ≤ 4.

7. A graph is ______ if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.
a) bipartite graph
b) planar graph
c) line graph
d) euler subgraph
View Answer

Answer: b
Explanation: A graph is known as planar graph if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.
8. An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if
and only if ____________
a) f(u) and f(v) are contained in G but not contained in H
b) f(u) and f(v) are adjacent in H
c) f(u * v) = f(u) + f(v)
2 2
d) f(u) = f(u) + f(v)
View Answer

Answer: b
Explanation: Two graphs G and H are said to be isomorphic to each other if there exist a one to one correspondence, say f between the
vertex sets V(G) and V(H) and a one to one correspondence g between the edge sets E(G) and E(H) with the following conditions:-
(i) for every vertex u in G, there exists a vertex u’ in H such that u’=f(u) and vice versa.
(ii) for every edge uv in G, g(uv)=f(u)*f(v)=u’v’ is H.

9. What is the grade of a planar graph consisting of 8 vertices and 15 edges?

a) 30
b) 15
c) 45
d) 106
View Answer

Answer: a
Explanation: If G is a planar graph with n vertices and m edges then r(G) = 2m i.e. the grade or rank of G is equal to the twofold of the
number of edges in G. So, the rank of the graph is 2*15=30 having 8 vertices and 15 edges.
advertisement

10. A _______ is a graph with no homomorphism to any proper subgraph.

a) poset
b) core
c) walk
d) trail
View Answer

Answer: b
Explanation: A core can be defined as a graph that does not retract to any proper subgraph. Every graph G is homomorphically equivalent to
a unique core called the core of G.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all written questions on Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Complete and Connected Graphs
» Next - Discrete Mathematics Questions and Answers – Different Path in a Graph
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Complete and Connected Graphs
Discrete Mathematics Questions and Answers – Different Path in a Graph
advertisement
advertisement

Recommended Posts:

1. Engineering Mathematics Questions and Answers

2. Java Programming Examples on Set & String Problems & Algorithms
3. C++ Programming Examples on Set & String Problems & Algorithms
4. Data Structures & Algorithms II – Questions and Answers
5. C Programming Examples on Set & String Problems & Algorithms
6. Java Programming Examples on Combinatorial Problems & Algorithms
7. C# Programming Examples on Mathematics
8. C Programming Examples on Combinatorial Problems & Algorithms
9. Java Algorithms, Problems & Programming Examples
10. C++ Algorithms, Problems & Programming Examples
11. C++ Programming Examples on Combinatorial Problems & Algorithms
12. C Algorithms, Problems & Programming Examples
13. Discrete Mathematics Questions and Answers
14. Java Programming Examples on Graph Problems & Algorithms
15. C++ Programming Examples on Graph Problems & Algorithms
16. Java Programming Examples on Hard Graph Problems & Algorithms
17. C Programming Examples on Graph Problems & Algorithms
18. C++ Programming Examples on Hard Graph Problems & Algorithms
19. C Programming Examples on Hard Graph Problems & Algorithms
20. Python Programming Examples on Graphs

advertisement

Discrete Mathematics Questions and Answers – Different Path in a

Graph
« Prev
Next »

This set of Discrete Mathematics Objective Questions & Answers focuses on “Different Path in a Graph”.

1. Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph?
a) topological sort
b) hash table
c) binary search
d) radix sort
View Answer

Answer: a
Explanation: For Directed Acyclic graph, single source shortest distances can be calculated in O(V+E) time. For that purpose Topological
Sorting can be used. Topological Sorting of any graph represents a linear ordering of the graph.
advertisement
2. The _______ of a graph G consists of all vertices and edges of G.
a) edge graph
b) line graph
c) path complement graph
d) eulerian circuit
View Answer

Answer: d
Explanation: we know that he Eulerian circuit in a graph G is a circuit that includes all vertices and edges of G. A graph that can have
Eulerian circuit, also can have a Eulerian graph.

3. A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.
a) Euler path
b) Hamiltonian path
c) Planar graph
d) Path complement graph
View Answer

Answer: b
Explanation: The Eulerian path in a graph say, G is a walk from one vertex to another, that can pass through all vertices of G as well as
traverses exactly once every edge of G. Therefore, an Eulerian path can not be a circuit. A Hamiltonian path is a walk that contains every
vertex of the graph exactly once. Hence, a Hamiltonian path is not a circuit.

4. A walk has Closed property if ____________

a) v0=vk
b) v0>=vk
c) v < 0
d) vk > 1
View Answer

Answer: a
Explanation: A walk in a graph is said to be closed if the starting vertex is the same as the ending vertex, that is v0=vk, it is described as
Open otherwise.

5. A trail in a graph can be described as ______________

a) a walk without repeated edges
b) a cycle with repeated edges
c) a walk with repeated edges
d) a line graph with one or more vertices
View Answer

Answer: a
Explanation: Suppose in a graph G a trail could be defined as a walk with no repeated edges. Suppose a walk can be defined as efgh. There
are no repeated edges so this walk is a trail.
advertisement

6. Let a graph can be denoted as ncfkedn a kind of ____________

a) cycle graph
b) line graph
c) hamiltonian graph
d) path graph
View Answer

Answer: a
Explanation: In the graph ncfkedn, no edges are repeated in the walk, which makes it a trail and then start and end vertex n is same making it
a cycle graph.

7. Determine the edge count of a path complement graph with 14 vertices.

a) 502
b) 345
c) 78
d) 69
View Answer

Answer: c
Explanation: Let, an n-path complement graph Pn’ is the graph complement of the path graph Pn. Since Pn is self-complementary, P4’ is
1
isomorphic to P4. Now, Pn’ has an edge count = ⁄2(n-2)(n-1). So, the required edge count is=78.

8. The sum of an n-node graph and its complement graph produces a graph called _______
a) complete graph
b) bipartite graph
c) star graph
d) path-complement graph
View Answer

Answer: a
Explanation: Suppose, the complement G’ of a graph G is known as edge-complement graph which consists of with the same vertex set but
whose edge set contains the edges not present in G. The graph sum G+G’ on an n-node graph G is called the complete graph say, Kn.

9. In a directed weighted graph, if the weight of every edge is decreased by 10 units, does any change occur to the shortest path in the
modified graph?
a) 209
b) 65
c) 57
d) 43
View Answer

Answer: c
Explanation: The shortest path will change in the modified graph. Suppose that the shortest path is of weight 21 and has 7 edges and there is
another path with 4 edges and total weight 17. Now, the weight of the first shortest path is increased by 7*10 and becomes 21 + 70 and the
weight of the second path is increased by 4*10 and becomes 17 + 40. So the shortest path changes to the other path with weight as 57.
advertisement

10. Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a
given source vertex to a given destination vertex to get the time complexity of O(V+E)?
a) BFS
b) DFS
c) Binary search
d) Radix sort
View Answer
Answer: a
Explanation: In BFS due to the least number of edges between two vertices and so if all the edges in a graph are of same weight, then to find
the shortest path BFS can be used for efficiency. So we have to split all edges of weight 5 into two edges of weight 2 each and one edge of
weight 1. In the worst case, all edges are of weight 1. To split all edges, O(E) operations can be done and so the time complexity becomes
which is equal to O(V+E).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all objective questions on Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Isomorphism in Graphs
» Next - Discrete Mathematics Questions and Answers – Planarity, Degree and Coloring of Graph
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Isomorphism in Graphs
Discrete Mathematics Questions and Answers – Planarity, Degree and Coloring of Graph
advertisement
advertisement

Recommended Posts:

1. Python Programming Examples on Trees

2. C Programming Examples on Set & String Problems & Algorithms
3. Engineering Mathematics Questions and Answers
4. C# Programming Examples on Mathematics
5. Java Algorithms, Problems & Programming Examples
6. Data Structure Questions and Answers
7. Java Programming Examples on Combinatorial Problems & Algorithms
8. Data Structures & Algorithms II – Questions and Answers
9. C Programming Examples on Combinatorial Problems & Algorithms
10. C++ Programming Examples on Combinatorial Problems & Algorithms
11. C++ Algorithms, Problems & Programming Examples
12. Discrete Mathematics Questions and Answers
13. C Algorithms, Problems & Programming Examples
14. Python Programming Examples on Graphs
15. Java Programming Examples on Hard Graph Problems & Algorithms
16. C++ Programming Examples on Graph Problems & Algorithms
17. Java Programming Examples on Graph Problems & Algorithms
18. C Programming Examples on Graph Problems & Algorithms
19. C++ Programming Examples on Hard Graph Problems & Algorithms
20. C Programming Examples on Hard Graph Problems & Algorithms

advertisement
Discrete Mathematics Questions and Answers – Planarity, Degree
and Coloring of Graph
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Planarity, Degree and Coloring of Graph”.

1. The chromatic number of a graph is the property of ____________

a) graph coloring
b) graph ordering
c) group ordering
d) group coloring
View Answer

Answer: b
Explanation: A graph coloring is an assignment of labels to the vertices of a graph such that no two adjacent vertices share the same labels is
called the colors of the graph. Now, the chromatic number of any graph is the minimal number of colors for which such an assignment is
possible.
advertisement

2. If a graph G is k-colorable and k<n, for any integer n then it is ___________

a) n-colorable
2
b) n nodes
c) (k+n)-colorable
3 3
d) (k +n +1) nodes
View Answer

Answer: a
Explanation: The chromatic number of a graph is the minimal number of colors for which a graph coloring is possible. A graph G is termed
as k-colorable if there exists a graph coloring on G with k colors. If a graph is k-colorable, then it is n-colorable for any n>k.

3. If Cn is the nth cyclic graph, where n>3 and n is odd. Determine the value of X(Cn).
a) 32572
b) 16631
c) 3
d) 310
View Answer

Answer: c
Explanation: Here n is odd and X(Cn)! = 2. Since there are two adjacent edges in Cn. Now, a graph coloring for Cn exists where vertices are
colored red and blue alternatively and another edge is with a different colour say orange, then the value of X(Cn) becomes 3.

4. Determine the density of a planar graph with 34 edges and 13 nodes.

a) 22/21
b) 12/23
c) 328
d) 576
View Answer

Answer: a
Explanation: The density of a planar graph or network is described as the ratio of the number of edges(E) to the number of possible edges in
a network with(N) nodes. So, D = E − N + 1/ 2 N − 5. Hence, the required answer is: D=(34-13+1)/(2*13-5) = 22/21. A completely sparse
planar graph has density 0 and a completely dense planar graph has degree 1.

5. If the number of vertices of a chromatic polynomial PG is 56, what is the degree of PG?
a) 344
b) 73
c) 265
d) 56
View Answer

Answer: d
Explanation: The chromatic polynomial PG of a graph G is a polynomial in which every natural number k returns the number PG(k) of k-
colorings of G. Since, the degree of PG is equal to the number of vertices of G, the required answer is 56.
advertisement

6. For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing
a planar representation of the graph?
a) 321
b) 9
c) 1024
d) 596
View Answer

Answer: b
Explanation: We know that the number of regions in a planar representation of the graph is r=e-v+2, then the required answer is r=16-
9+2=9.

7. For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing
a planar representation of the graph?
a) 321
b) 9
c) 1024
d) 596
View Answer

Answer: b
Explanation: Note that K3,3 and K5 are the “smallest” non-planar graphs because in that every non-planar graph contains them. According
to Kuratowski’s theorem, a graph is defined as non-planar if and only if it contains a subgraph homomorphic to K3,3 or K5.

8. Suppose G be a connected planar graph of order n≥5 and size m. If the length of the smallest cycle in G is 5, then which of the following
is true?
4
a) (m+n) >=mn
b) m≤5/3(n−2)
2
c) (m +n)/3
d) n>=(6/5)(n+1)
View Answer

Answer: b
Explanation: Because G is connected and planar, Euler’s theorem is bound to be involved. Let f denote the number of faces so that
n−m+f=2. Because the length of the smallest cycle in G is 5, every face has at least 5 edges adjacent to it. This means 2m≥5f because every
edge is adjacent to two faces. Plugging this in yields 2=n−m+f≤n−m+2/5m=n−3/5m, and hence m≤5/3(n−2).

9. What is the number of edges of the greatest planar subgraph of K3,2 where m,n≤3?
a) 18
b) 6
c) 128
d) 702
View Answer

Answer: b
Explanation: The plane graph with an edge at most 6+2(m−3) is the greatest planar graph. So, in this case the number of edges is 6.
advertisement

10. A non-planar graph can have ____________

a) complete graph
b) subgraph
c) line graph
d) bar graph
View Answer

Answer: b
Explanation: A non-planar graph can have removed edges and vertices so that it contains subgraphs. However, non-planar graphs cannot be
drawn in a plane and so no edge of the graph can cross it.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Different Path in a Graph
» Next - Discrete Mathematics Questions and Answers – Graph’s Matrices
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Different Path in a Graph
Discrete Mathematics Questions and Answers – Graph’s Matrices
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Linked List

 2. Python Programming Examples on Trees
3. C Programming Examples on Trees
4. C# Programming Examples on Mathematics
5. C++ Algorithms, Problems & Programming Examples
6. Python Programming Examples on Linked Lists
7. Java Algorithms, Problems & Programming Examples
8. Data Structures & Algorithms II – Questions and Answers
9. Java Programming Examples on Combinatorial Problems & Algorithms
10. C++ Programming Examples on Combinatorial Problems & Algorithms
11. C Programming Examples on Combinatorial Problems & Algorithms
12. C Algorithms, Problems & Programming Examples
13. Discrete Mathematics Questions and Answers
14. Python Programming Examples on Graphs
15. C++ Programming Examples on Graph Problems & Algorithms
16. Java Programming Examples on Graph Problems & Algorithms
17. C Programming Examples on Graph Problems & Algorithms
18. Java Programming Examples on Hard Graph Problems & Algorithms
19. C Programming Examples on Hard Graph Problems & Algorithms
20. C++ Programming Examples on Hard Graph Problems & Algorithms

advertisement

Discrete Mathematics Questions and Answers – Graph’s Matrices

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Graph’s Matrices”.

1. A direct product of a group G possess which of the following characteristics?

a) a multiplication of subgroups of G
b) a factorization via subgroups of G
c) a superset of subgroups of G
d) a maximal power set of subgroups
View Answer

Answer: b
Explanation: A direct product of a group G is a factorization via subgroups of G when the intersection is nontrivial, say X and Y, such that
G = XY, X intersect Y = 1, and [X, Y]=1 and X, Y are normal in G.
advertisement

2. In invariant algebra, some generators of group G1 that goes either into itself or zero under ______ with any other element of the algebra.
a) commutation
b) permutation
c) combination
d) lattice
View Answer
Answer: a
Explanation: Some generators of group G1 in group theory which goes either into itself or zero under commutation with any other element
of the whole algebra is called invariant subalgebra.

3. Which of the following can be embedded in an algebraically closed group?

a) infinite group
b) stargraph
c) a countable group
d) a semilattice
View Answer

Answer: c
Explanation: We know that any countable group can always be embedded in an algebraically closed group.

4. Which of the following is the set of m×m invertible matrices?

2
a) a permutation group of degree m
b) a general linear group of degree m
c) a sublattice group of degree m
d) a isomorphic graph of m nodes
View Answer

Answer: b
Explanation: The general linear group of degree m is the set of m×m invertible matrices, consists of a general linear group of degree m
having the ordinary matrix multiplication operation.

5. If any group is a manifold what is the dimension of that group?

a) same as manifold
b) same as vector space
c) infinite
d) finite
View Answer

Answer: a
Explanation: If a group is a (topological) manifold, then the dimension of a group will be the dimension of this manifold. A linear
representation F of a group G1 on a vector space V’ has the dimension of V’.
advertisement

6. A Latin square graph is a representation of a _______

a) quasi group
b) homomorphic group
c) semigroup
d) subgroup
View Answer

Answer: a
Explanation: We know that any group is a representation of a graph. Now, a Quasi Group can be represented by a Latin Square matrix or by
a Latin Square graph.

7. There exists _______ between group homology and group cohomology of a finite group.
a) homomorphism
b) isomorphism
c) automorphism
d) semilattice structure
View Answer

Answer: a
Explanation: We know that there exists an isomorphism between group homology and group cohomology of finite group. Let S’ denote the
set of all integers, and let G’ be a finite cyclic Group and for every S then G’-module N, we have S’S’n(G’, A) is isomorphic to S’n+1(G’,
A).

8. In basic ring theory, any ring R1 may be embedded in its own ________
a) semilattice
b) endomorphism ring
c) homomorphic ring
d) subgroup
View Answer

Answer: b
Explanation: We know that in basic ring theory, any ring R with its identity can be embedded in its own endomorphism ring and this is one
of the most important characterization of rings. The endomorphism ring can contain a copy of its ring.

9. In Modern particle physics there must exist ______________

a) group theory
b) graph theory
c) lattice structure
d) invariant semigroup
View Answer

Answer: a
Explanation: Modern particle physics exists with group theory. Group theory can predict the existence of many elementary particles.
Depending on different symmetries, the structure and behaviour of molecules and crystals can be defined.
advertisement

10. For any graph say G, Cayley graph is ______________

a) canonial
b) not canonical
c) isomorphic
d) homomorphic
View Answer

Answer: b
Explanation: A different Cayley graph will be given for each choice of a generating set. Hence, the Cayley graph is not canonical.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Planarity, Degree and Coloring of Graph
» Next - Discrete Mathematics Questions and Answers – Properties of Tree
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Planarity, Degree and Coloring of Graph
Discrete Mathematics Questions and Answers – Properties of Tree
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Computational Geometry Problems & Algorithms

2. Java Programming Examples on Combinatorial Problems & Algorithms
3. C Programming Examples on Computational Geometry Problems & Algorithms
4. C++ Programming Examples on Combinatorial Problems & Algorithms
5. C Programming Examples on Hard Graph Problems & Algorithms
6. Java Programming Examples on Hard Graph Problems & Algorithms
7. Automata Theory Questions and Answers
8. Information Science Questions and Answers
9. C++ Programming Examples on Hard Graph Problems & Algorithms
10. Computer Science Questions and Answers
11. C Algorithms, Problems & Programming Examples
12. C Programming Examples on Combinatorial Problems & Algorithms
13. C# Programming Examples on Mathematics
14. Electronics & Communication Engineering Questions and Answers
15. C++ Algorithms, Problems & Programming Examples
16. Mechatronics Engineering Questions and Answers
17. Instrumentation Engineering Questions and Answers
18. Engineering Mathematics Questions and Answers
19. Python Programming Examples on Graphs
20. Discrete Mathematics Questions and Answers – Operations on Matrices

advertisement

Discrete Mathematics Questions and Answers – Properties of Tree

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Properties of Tree”.

1. An undirected graph G which is connected and acyclic is called ____________

a) bipartite graph
b) cyclic graph
c) tree
d) forest
View Answer
Answer: c
Explanation: An undirected graph G which is connected and acyclic is termed as a tree. G contains no cycles and if any edge is added to G a
simple cycle is formed.
advertisement

2. An n-vertex graph has ______ edges.

2
a) n
b) n-1
c) n*n
d) n*(n+1)/2
View Answer

Answer: b
Explanation: Suppose G is a connected graph which has no cycles. Every subgraph of G includes at least one vertex with zero or one
incident edges. It has n vertices and n-1 edges. Generally, the order-zero graph is not considered to be a tree.

3. What is a star tree?

a) A tree having a single internal vertex and n-1 leaves
b) A tree having n vertices arranged in a line
c) A tree which has 0 or more connected subtrees
d) A tree which contains n vertices and n-1 cycles
View Answer

Answer: a
Explanation: A star tree of order n is a tree with as many leaves as possible or in other words a star tree is a tree that consists of a single
internal vertex and n-1 leaves. However, an internal vertex is a vertex of degree at least 2.

4. A polytree is called _______________

a) directed acyclic graph
b) directed cyclic graph
c) bipartite graph
d) connected graph
View Answer

Answer: a
Explanation: A directed acyclic graph is known as a polytree whose underlying undirected graph is a tree. In other words, a directed tree is a
directed graph which would be tree if the directions on the edges were ignored.

5. The tree elements are called __________

a) vertices
b) nodes
c) points
d) edges
View Answer

Answer: b
Explanation: Every tree element is called a node and the lines connecting the elements are called branches. A finite tree structure has a
member that has no superior and is called the “root” Or root node. Nodes that have no child are called leaf nodes.
advertisement
6. In an n-ary tree, each vertex has at most ______ children.
a) n
4
b) n
c) n*n
d) n-1
View Answer

Answer: a
Explanation: An n-ary tree is a rooted tree in which each vertex has at most n children. 2-ary trees are termed as binary trees, 3-ary trees are
sometimes called ternary trees.

7. A linear graph consists of vertices arranged in a line.

a) false
b) true
c) either true or false
d) cannot determined
View Answer

Answer: b
Explanation: A linear graph also known as a path graph is a graph which consists of k vertices arranged in a line, so that vertices from i and
i+1 are connected by an edge for i=0,…, k-1.

8. Two labeled trees are isomorphic if ____________

a) graphs of the two trees are isomorphic
b) the two trees have same label
c) graphs of the two trees are isomorphic and the two trees have the same label
d) graphs of the two trees are cyclic
View Answer

Answer: c
n-2
Explanation: The number of labeled trees of k number of vertices is k . Two labeled trees are isomorphic if their graphs are isomorphic
and the corresponding points of the two trees have the same labels.

9. A graph which consists of disjoint union of trees is called ______

a) bipartite graph
b) forest
c) caterpillar tree
d) labeled tree
View Answer

Answer: b
Explanation: A forest is an undirected acyclic graph in which all the connected components are individual trees. This graph contains a
disjoint union of trees.
advertisement

10. What is a bipartite graph?

a) a graph which contains only one cycle
b) a graph which consists of more than 3 number of vertices
c) a graph which has odd number of vertices and even number of edges
d) a graph which contains no cycles of odd length
View Answer

Answer: d
Explanation: A graph is called a bipartite graph if and only if it contains no cycle of odd length. Every tree is a bipartite graph and a median
graph.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Graph’s Matrices
» Next - Discrete Mathematics Questions and Answers – Trees – Cycles
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Graph’s Matrices
Discrete Mathematics Questions and Answers – Trees – Cycles
advertisement
advertisement

Recommended Posts:

1. C Programming Examples without using Recursion

2. Data Structures & Algorithms II – Questions and Answers
3. Java Algorithms, Problems & Programming Examples
4. Java Programming Examples on Combinatorial Problems & Algorithms
5. C Programming Examples on Computational Geometry Problems & Algorithms
6. Python Programming Examples on Trees
7. C Programming Examples on Trees
8. C Algorithms, Problems & Programming Examples
9. C++ Programming Examples on Combinatorial Problems & Algorithms
10. C Programming Examples on Combinatorial Problems & Algorithms
11. C++ Algorithms, Problems & Programming Examples
12. Data Structure Questions and Answers
13. Java Programming Examples on Hard Graph Problems & Algorithms
14. Discrete Mathematics Questions and Answers
15. Java Programming Examples on Graph Problems & Algorithms
16. C++ Programming Examples on Graph Problems & Algorithms
17. C++ Programming Examples on Hard Graph Problems & Algorithms
18. C Programming Examples on Graph Problems & Algorithms
19. Java Program to Check if a Directed Graph is a Tree or Not Using DFS
20. C++ Program to Generate a Random Directed Acyclic Graph DAC for a Given Number of Edges

advertisement
Discrete Mathematics Questions and Answers – Trees – Cycles
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Trees – Cycles”.

1. If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______
a) m+n-1
b) m-n
c) m*n
d) m*n+1
View Answer

Answer: c
Explanation: As there are n possible edges to be removed from G and m edges to be removed from G and the rest from a spanning tree so
the number of spanning tree in the new graph is m*n.
advertisement

2. For an n-vertex undirected graph, the time required to find a cycle is ____________
a) O(n)
2
b) O(n )
c) O(n+1)
d) O(logn)
View Answer

Answer: a
Explanation: The existence of a cycle in directed and undirected graphs can be determined by depth-first search (DFS) of the graph finds an
edge that points to an ancestor of the current vertex. In an undirected graph, finding any already visited vertex will indicate a back edge. All
the back edges which DFS skips over are part of cycles. In the case of undirected graphs, only O(n) time is required to find a cycle in an n-
vertex graph, since at most n − 1 edges can be tree edges.

3. A binary cycle space forms a ______ over the two element field.
a) triangular graph
b) vector space
c) binary tree
d) hamiltonian graph
View Answer

Answer: b
Explanation: The term cycle refers to an element of the cycle space of a graph. There are many cycle spaces. The most common is the binary
cycle space, which contains the edge sets that have even degrees at every vertex and it forms a vector space over the two-element field.

4. If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________
a) the degree of each vertex is at most n/2
b) the degree of each vertex is equal to n
c) the degree of every vertex is at least n+1/2
d) the degree of every vertex in G is at least n/2
View Answer
Answer: d
Explanation: A simple circuit in a graph G that passes through every vertex exactly once is called a Hamiltonian circuit. If there is a vertex
of degree one in a graph then it is impossible for it to have a Hamiltonian circuit. If G is a simple graph with n-vertices and n>=3 such that
the degree of every vertex in G is at least n/2, then G has a Hamiltonian circuit.

5. What is a separable graph?

a) A disconnected graph by deleting a vertex
b) A disconnected graph by removing an edge
c) A disconnected graph by removing one edge and a vertex
d) A simple graph which does not contain a cycle
View Answer

Answer: a
Explanation: By deletion of a vertex the graph is disconnected and the graph is called separable graph and the vertex is called cut vertex.
advertisement

6. How many edges are there in a complete graph of order 9?

a) 35
b) 36
c) 45
d) 19
View Answer

Answer: b
Explanation: In a complete graph of order n, there are n*(n-1) number of edges and degree of each vertex is (n-1). Hence, for a graph of
order 9 there should be 36 edges in total.

7. How many cycles are there in a wheel graph of order 5?

a) 6
b) 10
c) 25
d) 7
View Answer

Answer: d
Explanation: In a cycle of a graph G if we join all the vertices to the centre point, then that graph is called a wheel graph. There is always a
2
Hamiltonian cycle in a wheel graph and there are n -3n+3 cycles. So, for order 5 the answer should be 7.

8. The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________
2
a) O(V )
b) O(V+E-1)
c) O(V+E)
d) O(E+1)
View Answer

Answer: c
Explanation: An undirected graph has Eulerian Path if the following two conditions are true: -a) All vertices with a non-zero degree are
connected. A graph of vertices with zero degrees don’t belong to Eulerian Cycle or Path, b) If two vertices have odd degree and all other
vertices have even degree. Thus, the time to find whether a graph has a Eulerian path or not is O(V+E) with V vertices and E edges.
9. The time complexity to find shortest distances by using Dijkstra’s algorithm is __________
2
a) O(E )
b) O(V+1-E)
c) O(V+E)
d) O(E+VlogV)
View Answer

Answer: d
Explanation: Time complexity of finding shortest distance can be O(E + VLogV) using Fibonacci Heap. The reason is that Fibonacci Heap
takes O(1) time for decrease-key operation while Binary Heap takes O(logn) time.
advertisement

10. Topological sorting of a graph represents _______ of a graph.

a) linear probing
b) linear ordering
c) quadrilateral ordering
d) insertion sorting
View Answer

Answer: b
Explanation: Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv,
vertex u comes before v in the ordering. If the graph is not a DAG, topological sorting for a graph is not possible.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Properties of Tree
» Next - Discrete Mathematics Questions and Answers – Tree Traversal
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Properties of Tree
Discrete Mathematics Questions and Answers – Tree Traversal
advertisement
advertisement

Recommended Posts:

1. C# Programming Examples on Data Structures

2. C# Programming Examples on Mathematics
3. Data Structures & Algorithms II – Questions and Answers
4. Data Structure Questions and Answers
5. Java Algorithms, Problems & Programming Examples
6. C Programming Examples on Combinatorial Problems & Algorithms
7. C++ Algorithms, Problems & Programming Examples
8. Java Programming Examples on Combinatorial Problems & Algorithms
 9. C++ Programming Examples on Combinatorial Problems & Algorithms
10. C Algorithms, Problems & Programming Examples
11. Discrete Mathematics Questions and Answers
12. C Programming Examples on Trees
13. Python Programming Examples on Trees
14. C++ Programming Examples on Graph Problems & Algorithms
15. Java Programming Examples on Graph Problems & Algorithms
16. C Programming Examples on Graph Problems & Algorithms
17. Java Programming Examples on Hard Graph Problems & Algorithms
18. Python Programming Examples on Graphs
19. C++ Program to Create the Prufer Code for a Tree
20. C++ Program to Check Whether an Undirected Graph Contains a Eulerian Path

advertisement

Discrete Mathematics Questions and Answers – Tree Traversal

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Tree Traversal”.

1. In preorder traversal of a binary tree the second step is ____________

a) traverse the right subtree
b) traverse the left subtree
c) traverse right subtree and visit the root
d) visit the root
View Answer

Answer: b
Explanation: In a preorder traversal of a binary tree first is to visit the root, second traverse the left subtree of the tree and third traverse the
right subtree of the tree.
advertisement

2. An important application of binary tree is ______

a) Huffman coding
b) stack implementation
c) queue implementation
d) traverse a cyclic graph
View Answer

Answer: a
Explanation: A binary tree is used to sort a list of elements; the inorder traversal will do this automatically. Better tree sorting algorithm will
involve balancing the trees. The binary coding, in particular for the Huffman coding is an immediate application of binary trees.

3. From the following code identify the which traversal of a binary tree is this __________

//if node has left child

order(node.left)
//if node has right child
 order(node.right)
visit(node)

a) Inorder traversal
b) preorder traversal
c) postorder traversal
d) Euler tour traversal
View Answer

Answer: c
Explanation: In a postorder traversal of a binary tree first is to traverse the left subtree, second traverse the right subtree of the tree and third
is to visit the node.
advertisement

4. What is the minimum height for a binary search tree with 60 nodes?
a) 1
b) 3
c) 4
d) 2
View Answer

Answer: d
Explanation: If there are k nodes in a binary tree, maximum height of that tree should be k-1, and minimum height should be floor(log2k).
By using the formula, minimum height must be 2 when there are 60 nodes in a tree.

5. From the following code identify the which traversal of a binary tree is this __________

function traversal(node)
{
//Input:root node of the tree
//Output:None
visitLeft(node)
//if node has left child
traversal(node.left)
visit_Below(node)
//if node has right child
traversal(node.right)
visitRight(node)
}

a) Inorder traversal
b) Euler Tour traversal
c) Post-order traversal
d) Pre-order Traversal
View Answer

Answer: b
Explanation: The code signifies Euler Tour traversal which is a generic traversal of a binary tree. In this tree traversal we have to walk
around the tree and visit each node three times:
1. On the left (pre-order), 2. From below (in-order), 3. On the right (post-order) and Create subtrees for all the nodes.
advertisement
6. For the expression (7-(4*5))+(9/3) which of the following is the post order tree traversal?
a) *745-93/+
b) 93/+745*-
c) 745*-93/+
d) 74*+593/-
View Answer

Answer: c
Explanation: First build a binary tree for the expression then find out the postorder traversal of that tree and after that the answer will be
745*-93/+.

7. The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________
2
a) O(n )
b) O(n+1)
c) O(1)
d) O(n)
View Answer

Answer: d
Explanation: The approach is to traverse the binary tree in any fashion and check if the node is the leaf node(child node)or not. After that,
add node data to the sum variable. So, after summing up all leaf nodes, the time complexity of the operation should be O(n).

8. An immediate application of a Depth First Search traversal is __________

a) count the number of leaf nodes
b) perform Inorder traversal in easy way
c) count number of nodes
d) implement preorder traversal
View Answer

Answer: a
Explanation: Given an n-ary binary tree, by performing DFS traversal on that tree number of leaf nodes can be calculated and for that we
need to maintain an array for the leaf count.

9. Breadth First Search traversal of a binary tree finds its application in __________
a) Cloud computing
b) Peer to peer networks
c) Weighted graph
d) Euler path
View Answer

Answer: b
Explanation: Breadth First Search traversal has diverse applications such as in the peer to peer networks like BitTorrent, BFS traversal is
used to find all the neighbour nodes of the network.
advertisement

10. Worst case complexity of Breadth First Search traversal __________

a) O(n*n)
b) O(nlogn)
2
c) O(n logn)
 3
d) O(n )
View Answer

Answer: b
Explanation: In an n-ary binary tree, we must have to visit all nodes from an adjacent node and repeat the same for next unvisited nodes.
Hence, in worst case the time complexity should be O(nlogn).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Trees – Cycles
» Next - Discrete Mathematics Questions and Answers – Trees – Interconversion for Prefix Postfix Infix Notations
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Trees – Cycles
Discrete Mathematics Questions and Answers – Trees – Interconversion for Prefix Postfix Infix Notations
advertisement
advertisement

Recommended Posts:

1. C Programming Examples
2. C++ Programming Examples on Combinatorial Problems & Algorithms
3. Java Programming Examples on Combinatorial Problems & Algorithms
4. C++ Programming Examples on Data-Structures
5. Data Structure Questions and Answers
6. Python Programming Examples on Searching and Sorting
7. C++ Programming Examples on Hard Graph Problems & Algorithms
8. C Programming Examples on Combinatorial Problems & Algorithms
9. Python Programming Examples on Graphs
10. Discrete Mathematics Questions and Answers
11. Java Programming Examples on Graph Problems & Algorithms
12. Python Programming Examples on Linked Lists
13. C Programming Examples on Graph Problems & Algorithms
14. C Programming Examples on Linked List
15. C++ Programming Examples on Graph Problems & Algorithms
16. C# Programming Examples on Data Structures
17. C Programming Examples using Recursion
18. C Programming Examples without using Recursion
19. Python Programming Examples on Trees
20. Data Structure Questions and Answers – Inorder Traversal

advertisement
Discrete Mathematics Questions and Answers – Trees –
Interconversion for Prefix Postfix Infix Notations
« Prev
Next »

This set of Discrete Mathematics Question Paper focuses on “Trees – Interconversion for Prefix Postfix Infix Notations”.

1. Evaluation of expression a/b+c*d-e in postfix notation.

a) ab+cd/*-e
b) ab/cd*+e-
c) abc/+d*-e
d) abcd/+*-e
View Answer

Answer: b
Explanation: The expression=a/b+c*d-e
={(ab/)+(cd*)}-e
={(ab/)(cd*)+}-e
={(ab/)(cd*)+}e-
So the output is: ab/cd*+e-
advertisement

2. Evaluation of 4*5+3/2-9 in prefix notation.

a) *45-/32+9
b) *+453/-29
c) -+*45/329
d) *+/45932
View Answer

Answer: c
Explanation: The expression=4*5+3/2-9
={(4*5)+(3/2)-9}
={(*45)+(/32)-9}
={+(*45)(/32)}-9
=-{+(*45)(/32)9
So the output is; -+*45/329.

3. What is the output of the following if funct1(7)?

Void main()
{
int n;
long int func;
scanf(“%d”,&n);
func=func1 (n)
printf(“%ld!=%ld”,n,func);
}
long int func1(int n)
{
 if(n==0)
{
Return 1;
}
else
{
return(n*func1(n-1));
}
}

a) 128
b) 4320
c) 720
d) 5040
View Answer

Answer: d
Explanation: This is a factorial function of an integer using recursive approach. By running the function on integer 7 we get 5040.
advertisement

4. Infix to prefix conversion can be done using __________

a) two queues
b) two stacks
c) one stack and two queues
d) one stack
View Answer

Answer: b
Explanation: In the infix expression, the operator appears between the operands and in infix notation if the operator appears before the
operands in the expression. For the conversion between them two stacks are used efficiently. The idea is to use one stack for operators and
other to store operands.

5. Conversion from prefix to postfix expression can be done _______________

a) using bubble sort
b) using radix sort
c) using two queues
d) in a direct manner
View Answer

Answer: d
Explanation: In a postfix expression, the operators appear after the operands. Conversion from prefix to postfix is done directly which is
better than converting the prefix expression in infix and then infix to postfix expression. It gives better efficiency.

6. What is the postfix expression of 9+3*5/(10-4)?

a) 9 3 + * 5 / 10 4 –
b) 9 3 5 + * / 10 4 –
c) 9 3 + 5 * / 10 4 –
d) 9 3 5 * / + 10 – 4
View Answer

Answer: c
Explanation: The expression, 9+3*5/(10-4)
= 9+3*5/(10 4-)
= 9+35/*(10 4-)
= 935/*+(10 4-)
So the output is:9 3 5 / * + 10 4 -.

7. What is the postfix expression of (A+B)-C*(D/E))+F?

a) A B + C D E / * – F +
b) A B C D E + / * F – +
c) A B C + * D E / F + –
d) A B + C – * D E / F +
View Answer

Answer: a
Explanation: The expression is (A+B)-C*(D/E))+F
= (A+B)-C*(DE/)+F
= (A+B)-C*(DE/)F+
= (A+B)-C(DE/)*F+
= (A+B)C(DE/)*-F+
= (AB+)C(DE/)*-F+
So the output is: AB+CDE/*-F+.
advertisement

8. Convert the following expression into prefix notation.

(g-(f^e/d+c)-ba)

a) ^-/gfed+c-ab
b) -ab/+-ec^dgf
c) -ab-+c/d^efg
d) ab/+-^cde-fg
View Answer

Answer: c
Explanation: Convert it first in postfix notation, we can have
(g-(f^e/d+c)-ba)
= (g-(f^e/dc+)-ba)
= (g-(f^ed/c+)-ba)
= (g-(fe^d/c+)-ba)
= (g-(fe^d/c+)ba-)
= (gfe^d/c+-ba-)
By reversing this expression gives the prefix expression, i.e
-ab-+c/d^efg.

9. What is the postfix expression of the given expression, (2*4-(5+7/3^4)-8)10?

a) 2 4 5 * 7 3 4 ^ / + 8 – – 10
b) 2 4 * ^ 5 7 3 4 / + 8 10 – –
c) 2 4 * 5 7 ^ 3 4 / + – 8 10 –
d) 2 4 * 5 7 3 4 ^ / + – 8 – 10
View Answer
Answer: d
Explanation: By solving we can have,
(2*4-(5+7/3^4)-8)10
= (2*4-(5+7/34^)-8)10
= (2*4-(5+734^/)-8)10
= (2*4-(5734^/+)-8)10
= (2*45734^/+–8)10
= 2*45734^/+-8-10
= 24*5734^/+-8-10
So the output is: 2 4 * 5 7 3 4 ^ / + – 8 – 10.

10. Prefix expression can be evaluated _________

a) from right to left
b) from left to right
c) from the exact middle
d) from second right element
View Answer

Answer: b
Explanation: Expressions are usually evaluated from left to right manner. Prefix expressions follow the normal rule i.e from left to right.
Postfix expressions can be evaluated from right to left.
advertisement

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all questions papers on Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Tree Traversal
» Next - Discrete Mathematics Questions and Answers – Spanning Trees
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Tree Traversal
Discrete Mathematics Questions and Answers – Spanning Trees
advertisement
advertisement

Recommended Posts:

1. Engineering Mathematics Questions and Answers

2. C# Programming Examples on Mathematics
3. C# Programming Examples
4. C# Programming Examples on Gaming
5. C++ Programming Examples on Graph Problems & Algorithms
6. Java Programming Examples on Graph Problems & Algorithms
7. C Programming Examples on Graph Problems & Algorithms
8. Python Programming Examples on Trees
 9. C Programming Examples on Trees
10. Data Structure Questions and Answers
11. Discrete Mathematics Questions and Answers
12. C++ Program to Implement Expression Tree
13. C++ Program to Construct an Expression Tree for a Postfix Expression
14. Java Program to Implement Shunting Yard Algorithm
15. Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion of Gates
16. C Program to Traverse the Tree Recursively
17. C# Programming Examples on Conversions
18. Java Program to Construct an Expression Tree for an Prefix Expression
19. Java Program to Construct an Expression Tree for an Postfix Expression
20. Java Program to Construct an Expression Tree for an Infix Expression

advertisement

Discrete Mathematics Questions and Answers – Spanning Trees

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Spanning Trees”.

1. Spanning trees have a special class of depth-first search trees named _________
a) Euclidean minimum spanning trees
b) Tremaux trees
c) Complete bipartite graphs
d) Decision trees
View Answer

Answer: b
Explanation: A tremaux tree of an undirected graph G is a spanning tree of G which is rooted at one of its vertices with the property that
every two adjacent vertices in G are related to each other as an ancestor and descendant in the tree.
advertisement

2. If the weight of an edge e of cycle C in a graph is larger than the individual weights of all other edges of C, then that edge ________
a) belongs to an minimum spanning tree
b) cannot belong to an minimum spanning tree
c) belongs to all MSTs of the graph
d) can not belong to the graph
View Answer

Answer: b
Explanation: For any cycle C in the graph, if the weight of an edge e of C is larger than the individual weights of all other edges of C, then
this edge cannot belong to an MST.

3. For every spanning tree with n vertices and n edges what is the least number of different Spanning trees can be formed?
a) 2
b) 5
c) 3
d) 4
View Answer

Answer: c
Explanation: If graph is connected and has ‘n’ edges, there will be exactly one cycle, if n vertices are there. A different spanning tree can be
constructed by removing one edge from the cycle, one at a time. The minimum cycle length can be 3. So, there must be at least 3 spanning
trees in any such Graph. Consider a Graph with n = 4, then 3 spanning trees possible at maximum (removing edges of cycle one at a time,
alternatively). So, any Graph with minimum cycle length ‘3’ will have at least 3 spanning trees.

4. Time complexity of Prim’s algorithm is _________

a) O((V+E)logV)
b) O(E+V)
c) O(E)
d) O(V+1)
View Answer

Answer: a
Explanation: In Prim’s Algorithm, we will start with an arbitrary node (take any point to start) and mark it. In each iteration, a new vertex is
marked that is adjacent to the one that we have already marked. Each vertex is inserted in the priority queue only once and insertion in
priority queue take logarithmic time. Hence, the time complexity of Prim’s Algorithm is O((V+E)logV).

5. What is the time complexity of Kruskal’s algorithm?

a) O(ElogV)
b) O(V+logE)
c) O(E+1)
2
d) O(V )
View Answer

Answer: a
Explanation: In Kruskal’s algorithm, at each iteration, we will select the edge with the lowest weight. So, we will start with the lowest
weighted edge first. After that we will select the second lowest weighted edge. In Kruskal’s algorithm, most time consuming operation is
sorting because the total complexity of the Disjoint-Set operations will be O(ElogV) and it is the overall Time Complexity of the algorithm.
advertisement

6. An immediate application of minimum spanning tree ______

a) gesture analysis
b) handwriting recognition
c) fingerprint detection
d) soft computing
View Answer

Answer: b
Explanation: Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees. It is used in network
designing, in the algorithms predicting the travelling salesman problem,multi-terminal minimum cut problem and minimum-cost weighted
perfect matching. It can also used in Handwriting recognition and image segmentation.

6. If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option.
a) false
b) maximum cost edge is added
c) true
d) minimum cost edge need not be unique
View Answer

Answer: c
Explanation: If the edge was not included in the MST, removing any of the (larger cost) edges in the cycle formed after adding e to the
MST, would yield a spanning tree of smaller weight. Thus, if the minimum cost edge e of a graph is unique, then this edge is included in any
MST.

7. A complete undirected graph of n nodes can have maximum ______ spanning trees.
n+1
a) n
n-2
b) n
c) \(\frac{n(n+1)}{2}\)
d) n
View Answer

Answer: b
Explanation: The spanning tree does not contain any cycle. If a spanning tree has n nodes, there are n-1 edges. A complete graph can have a
n-2
maximum of n number of spanning trees.

8. The spanning tree will be maximally acyclic if ____________

a) one additional edge makes a cycle in the tree
b) two additional edges makes a cycle in the tree
c) removing one edge makes the tree cycle free
d) removing two edges make the tree cycle free
View Answer

Answer: a
Explanation: A connected graph G can have more than one spanning tree. Removing one edge from the spanning tree will make the graph
disconnected and the spanning tree is minimally connected. Adding one edge to the spanning tree will create a circuit or loop and the
spanning tree is maximally acyclic.
advertisement

9. In a maximum spanning tree the weighted graph is of _______

a) maximum number of edges
b) maximum number of cyclic trees
c) minimum number of vertices
d) maximum weight
View Answer

Answer: d
Explanation: A maximum spanning tree can be computed by negating the weights for each edge and applying Kruskal’s algorithm. Thus, it
is a spanning tree of a weighted graph having maximum weight assigned to all the edges.

10. Prim’s algorithm can be implemented using _______

a) a stack data structure
b) radix sort
c) priority queue data structure
d) bubble sort
View Answer
Answer: c
Explanation: The time complexity of Prim’s algorithm depends on the data structures used for the graph and for ordering the edges by
weight, which can be done using a priority queue. In general, a priority queue will be quicker at finding the vertex in the spanning tree with
minimum cost. The choice of data structures for implementation will lead to varying time complexity.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

advertisement

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Trees – Interconversion for Prefix Postfix Infix Notations
» Next - Discrete Mathematics Questions and Answers – Boolean Algebra
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Trees – Interconversion for Prefix Postfix Infix Notations
Discrete Mathematics Questions and Answers – Boolean Algebra
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Data-Structures

2. Java Algorithms, Problems & Programming Examples
3. Java Programming Examples on Data-Structures
4. Data Structure Questions and Answers
5. C Algorithms, Problems & Programming Examples
6. C++ Programming Examples on Combinatorial Problems & Algorithms
7. C Programming Examples on Data-Structures
8. C Programming Examples on Combinatorial Problems & Algorithms
9. Java Programming Examples on Combinatorial Problems & Algorithms
10. Discrete Mathematics Questions and Answers
11. C++ Algorithms, Problems & Programming Examples
12. C Programming Examples on Trees
13. Python Programming Examples on Trees
14. Java Programming Examples on Graph Problems & Algorithms
15. Java Programming Examples on Hard Graph Problems & Algorithms
16. C++ Programming Examples on Graph Problems & Algorithms
17. C++ Programming Examples on Hard Graph Problems & Algorithms
18. Python Programming Examples on Graphs
19. C Programming Examples on Graph Problems & Algorithms
20. C Programming Examples on Hard Graph Problems & Algorithms

advertisement
Discrete Mathematics Questions and Answers – Boolean Algebra
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra”.

1. Algebra of logic is termed as ______________

a) Numerical logic
b) Boolean algebra
c) Arithmetic logic
d) Boolean number
View Answer

Answer: c
Explanation: The variables that can have two discrete values False(0) and True(1) and the operations of logical significance are dealt with
Boolean algebra.
advertisement

2. Boolean algebra can be used ____________

a) For designing of the digital computers
b) In building logic symbols
c) Circuit theory
d) Building algebraic functions
View Answer

Answer: a
Explanation: For designing digital computers and building different electronic circuits boolean algebra is accepted widely.

3. What is the definition of Boolean functions?

k
a) An arithmetic function with k degrees such that f:Y–>Y
n
b) A special mathematical function with n degrees such that f:Y –>Y
n
c) An algebraic function with n degrees such that f:X –>X
2 n
d) A polynomial function with k degrees such that f:X –>X
View Answer

Answer: b
Explanation: A Boolean function is a special mathematical function with n degrees and where Y = {0,1} is the Boolean domain with being a
non-negative integer. It helps in describing the way in which the Boolean output is derived from Boolean inputs.

4. F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is ________

a) 2
b) 5
c) 4
d) 1
View Answer

Answer: c
Explanation: This is a function of degree 4 from the set of ordered pairs of Boolean variables to the set {0,1}.
5. A ________ value is represented by a Boolean expression.
a) Positive
b) Recursive
c) Negative
d) Boolean
View Answer

Answer: d
Explanation: A Boolean value is given by a Boolean expression which is formed by combining Boolean variables and logical connectives.
advertisement

6. Which of the following is a Simplification law?

a) M.(~M+N) = M.N
b) M+(N.O) = (M+N)(M+O)
c) ~(M+N) = ~M.~N
d) M.(N.O) = (M.N).O
View Answer

Answer: a
Explanation: By Simplification Law we can have X.(~X+Y) = X.Y and X+(~X.Y) = X+Y. By, De’ Morgan’s law ~(X+Y) = ~X.~Y. By
commutative law we can say that A.(B.C) = (A.B).C.

7. What are the canonical forms of Boolean Expressions?

a) OR and XOR
b) NOR and XNOR
c) MAX and MIN
d) SOM and POM
View Answer

Answer: d
Explanation: There are two kinds of canonical forms for a Boolean expression-> 1)sum of minterms(SOM) form and
2)product of maxterms(SOM) form.

8. Which of the following is/are the universal logic gates?

a) OR and NOR
b) AND
c) NAND and NOR
d) NOT
View Answer

Answer: c
Explanation: NAND and NOR gates are known as the universal logic gates. A universal gate is a gate which can implement any Boolean
function without the help of 3 basic gate types.

9. The logic gate that provides high output for same inputs ____________
a) NOT
b) X-NOR
c) AND
d) XOR
View Answer
Answer: b
Explanation: The logic gate which gives high output for the same inputs, otherwise low output is known as X-NOR or Exclusive NOR gate.
advertisement

10. The ___________ of all the variables in direct or complemented from is a maxterm.
a) addition
b) product
c) moduler
d) subtraction
View Answer

Answer: a
Explanation: The Boolean function is expressed as a sum of the 1-minterms and the inverse of function is represented as 0-minterms.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Spanning Trees
» Next - Discrete Mathematics Questions and Answers – Boolean Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Spanning Trees
Discrete Mathematics Questions and Answers – Boolean Functions
advertisement
advertisement

Recommended Posts:

1. Civil Engineering Questions and Answers

2. Master of Computer Applications Questions and Answers
3. Digital Image Processing Questions and Answers
4. VLSI Questions and Answers
5. Python Questions and Answers
6. Bachelor of Computer Applications Questions and Answers
7. C++ Programming Examples on Set & String Problems & Algorithms
8. PLC Programming Examples
9. Microcontroller Questions and Answers
10. VHDL Questions and Answers
11. MATLAB Questions and Answers
12. C Programming Examples on Set & String Problems & Algorithms
13. Signals & Systems Questions and Answers
14. C# Programming Examples on Events
15. Control Systems Questions and Answers
16. Computer Fundamentals Questions and Answers
17. Digital Circuits Questions and Answers
 18. C# Programming Examples on Mathematics
19. Engineering Mathematics Questions and Answers
20. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables

advertisement

Discrete Mathematics Questions and Answers – Boolean Functions

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Functions”.

1. What is the use of Boolean identities?

a) Minimizing the Boolean expression
b) Maximizing the Boolean expression
c) To evaluate a logical identity
d) Searching of an algebraic expression
View Answer

Answer: a
Explanation: Boolean identities are used for minimizing the Boolean expression and transforming into an equivalent expression.
advertisement

2. _________ is used to implement the Boolean functions.

a) Logical notations
b) Arithmetic logics
c) Logic gates
d) Expressions
View Answer

Answer: c
Explanation: To implement a Boolean function logic gates are used. Basic logic gates are AND, OR and NOT.

3. Inversion of single bit input to a single bit output using _________

a) NOT gate
b) NOR gate
c) AND gate
d) NAND gate
View Answer

Answer: a
Explanation: A NOT gate is used to invert a single bit input (say A) to a single bit of output (~A).

4. There are _________ numbers of Boolean functions of degree n.

a) n
(2*n)
b) 2
3
c) n
 (n*2)
d) n
View Answer

Answer: b
Explanation: There are 2n different n-tuples of 0’s and 1’s. A Boolean function is an assignment of 0’s or 1’s to each of these 2 n different
(2*n)
n-tuples. Hence, there are 2 different Boolean functions.

5. A _________ is a Boolean variable.

a) Literal
b) String
c) Keyword
d) Identifier
View Answer

Answer: a
Explanation: A literal is a Boolean variable or its complement. A maxterm is a sum of n literals and a minterm is a product of n literals.
advertisement

6. Minimization of function F(A,B,C) = A*B*(B+C) is _________

a) AC
b) B+C
c) B`
d) AB
View Answer

Answer: d
Explanation: AB(B+C)
= ABB + ABC [Applying distributive rule]
= AB + ABC [Applying Idempotent law]
= AB (1+C)
= AB*1 [As, 1+C=1]
= AB.

7. The set for which the Boolean function is functionally complete is __________
a) {*, %, /}
b) {., +, -}
c) {^, +, -}
d) {%, +, *}
View Answer

Answer: b
Explanation: A Boolean function is represented by using three operators ., +, -. We can find a smaller set of functionally complete operators
if one of the three operators of this set can be expressed in terms of the other two.

8. (X+Y`)(X+Z) can be represented by _____

a) (X+Y`Z)
b) (Y+X`)
c) XY`
d) (X+Z`)
View Answer
Answer: a
Explanation: (X+Y`) (X+Z)
= XX + XZ + XY`+ Y`Z
= X + XZ + XY`+ Y`Z
= X (1+Z) + XY`+ Y`Z
= X.1 + XY`+ Y`Z
= X (1+Y`) + Y`Z
= X + Y`Z.

9. __________ is a disjunctive normal form.

a) product-of-sums
b) product-of-subtractions
c) sum-of-products
d) sum-of-subtractions
View Answer

Answer: c
Explanation: The sum of minterms that represents the function is called the sum-of-products expansion or the disjunctive normal form. A
Boolean sum of minterms has the value 1 when exactly one of the minterms in the sum has the value 1. It has the value 0 for all other
combinations of values of the variables.
advertisement

10. a ⊕ b = ________
a) (a+b)(a`+b`)
b) (a+b`)
c) b`
d) a` + b`
View Answer

Answer: a
Explanation: a ⊕ b
= a`b + ab`
= a`b+aa` + bb` + ab` [As, a*a` = 0 and b*b` = 0]
= a`(a+b) + b`(a+b)
= (a+b)(a`+b`).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Boolean Algebra
» Next - Discrete Mathematics Questions and Answers – Minimization of Boolean Functions
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Boolean Algebra
Discrete Mathematics Questions and Answers – Minimization of Boolean Functions
 advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Stacks & Queues

2. C Questions and Answers
3. Java Programming Examples on Numerical Problems & Algorithms
4. C++ Programming Examples on Numerical Problems & Algorithms
5. C Programming Examples on Numerical Problems & Algorithms
6. PHP Questions and Answers
7. Simple C Programs
8. Computer Fundamentals Questions and Answers
9. Python Questions and Answers
10. Simple Java Programs
11. VLSI Questions and Answers
12. Java Programming Examples on Mathematical Functions
13. C Programming Examples on Mathematical Functions
14. Digital Circuits Questions and Answers
15. Engineering Mathematics Questions and Answers
16. PLC Programming Examples
17. VHDL Questions and Answers
18. C# Programming Examples on Mathematics
19. C# Programming Examples on Functions
20. Discrete Mathematics Questions and Answers – Number Theory – Highest Common Factors

advertisement

Discrete Mathematics Questions and Answers – Minimization of

Boolean Functions
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Minimization of Boolean Functions”.

1. Find the simplified expression A’BC’+AC’.

a) B
b) A+C
c) (A+B)C’
d) B’C
View Answer

Answer: c
Explanation: Given: A’BC’ + AC’
= C’(A’B + A)
= C’(A + B).
advertisement
2. Evaluate the expression: (X + Z)(X + XZ’) + XY + Y.
a) XY+Z’
b) Y+XZ’+Y’Z
c) X’Z+Y
d) X+Y
View Answer

Answer: d
Explanation: (X + Z)(X + XZ’) + XY + Y [Original Expression]
= (x + z)X(1 + Z’) + XY + Y [Distributive]
= (X + Z)X + XY + Y [Complement, Identity]
= (X+Z)X + Y(X+1) [ Distributive]
= (X+Z)X + Y [Idempotent]
= XX + XZ + Y [Distributive]
= X + XZ + Y [Identity]
= X(1+Z) + Y
= X + Y [Idempotent].

3. Simplify the expression: A’(A + BC) + (AC + B’C).

a) (AB’C+BC’)
b) (A’B+C’)
c) (A+ BC)
d) AC
View Answer

Answer: b
Explanation: Given: A’(A + BC) + (AC + B’C)
= A’A + A’BC + AC + B’C
= A’BC + C(A + B’)
= C(A’B + A + B’)
= C(A + B + B’)
= C(A + 1)
= AC.

4. What is the simplification value of MN(M + N’) + M(N + N’)?

a) M
b) MN+M’N’
c) (1+M)
d) M+N’
View Answer

Answer: b
Explanation: Given: MN(M + N’) + M(N + N’)
= MN(M+N’) + M.1
= MNM + MNN’ + M
= MN + 0 +M
= M(N + 1)
= M.
5. Simplify the expression XZ’ + (Y + Y’Z) + XY.
a) (1+XY’)
b) YZ + XY’ + Z’
c) (X + Y +Z)
d) XY’+ Z’
View Answer

Answer: c
Explanation: Given: X Z’ + (Y + Y’Z) + XY
= XZ’ + (Y + Z) + XY
= XZ’ + Y + Z + XY
= (XZ’ + Z) + (Y + XY)
= (X + Z) + Y (1 + X)
= X + Y + Z.
advertisement

6. Find the simplified term Y’ (X’ + Y’) (X + X’Y)?

a) XY’
b) X’Y
c) X + Y
d) X’Y’
View Answer

Answer: a
Explanation: Given: Y’ (X’ + Y’) (X + X’Y)
= Y’(X’ + Y’)(X + Y)
= (X’Y’ + Y’)(X + Y)
= (XX’Y’ + X’Y’Y + XY’ + YY’)
= XY’.

7. If an expression is given that x+x’y’z=x+y’z, find the minimal expression of the function F(x,y,z) = x+x’y’z+yz?
a) y’ + z
b) xz + y’
c) x + z
d) x’ + y
View Answer

Answer: c
Explanation: We have, x+x’y’z+yz
= x+y’z+yz [since, x+x’y’z=x+y’z]
= x+z(y’+y)
= x + z.

8. Simplify the expression: XY’ + X’ + Y’X’.

a) X’ + Y
b) XY’
c) (XY)’
d) Y’ + X
View Answer
Answer: c
Explanation: Given XY’+X’+Y’X’ = Y’(X+X’) + X’ = Y’.1 + X’ = X’ + Y’ = (XY)’ [De Morgan’s law].

9. Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.

a) B(AC)’ + AC’
b) AC’ + B’
c) ABC + B’ + C
d) BC’ + A’B
View Answer

Answer: a
Explanation: Given: A′B+ABC′+BC’+AB′C′
= A’B + BC’ (1 + A) + AB’C”
= A’B + BC’ + AB’C’
= A’B + BC’ + BC’ + AB’C’
= B(A’ + C’) + C’(A + AB’)
= B(AC)’ + C’ A(1 + B’)
= B(AC)’ + AC’.
advertisement

10. Minimize the following Boolean expression using Boolean identities.

F(A,B,C) = (A+BC’)(AB’+C)
a) A + B + C’
b) AC’ + B
c) B + AC
d) A(B’ + C)
View Answer

Answer: d
Explanation: Given, F(A,B,C) = (A+BC’)(AB’+C)
= (AAB’ + BC’AB’ + AC + BC’C)
= (AB’ + 0 + AC + 0)
= A(B’ + C).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Boolean Functions
» Next - Discrete Mathematics Questions and Answers – Boolean Algebra – Karnaugh Maps
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Boolean Functions
Discrete Mathematics Questions and Answers – Boolean Algebra – Karnaugh Maps
advertisement
advertisement
Recommended Posts:

1. Bachelor of Computer Applications Questions and Answers

2. C Programming Examples on Mathematical Functions
3. Java Programming Examples on Mathematical Functions
4. C# Programming Examples on Mathematics
5. Engineering Mathematics Questions and Answers
6. C# Programming Examples on Functions
7. Discrete Mathematics Questions and Answers
8. Discrete Mathematics Questions and Answers – Sets – Venn Diagram
9. PLC Program to Implement Various Boolean Functions With Don’t Care Condition
10. PLC Program to Implement Various Boolean Functions
11. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
12. Discrete Mathematics Questions and Answers – Trees – Interconversion for Prefix Postfix Infix Notations
13. Discrete Mathematics Questions and Answers – Properties of Matrices
14. Discrete Mathematics Questions and Answers – Discrete Probability – Logarithmic Series
15. Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
16. Computer Fundamentals Questions and Answers – Boolean Functions
17. Discrete Mathematics Questions and Answers – Number of Functions
18. Discrete Mathematics Questions and Answers – Domain and Range of Functions
19. Discrete Mathematics Questions and Answers – The Growth of Functions
20. Discrete Mathematics Questions and Answers – Functions

advertisement

Discrete Mathematics Questions and Answers – Boolean Algebra –

Karnaugh Maps
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra – Karnaugh Maps”.

1. K-map is used for _______

a) logic minimization
b) expression maximization
c) summing of parity bits
d) logic gate creation
View Answer

Answer: a
Explanation: K-map(Maurice Karnaugh of Bell labs in 1953) is defined as a diagrammatic method for logic minimization and it is a pictorial
view of truth table which shows the relationship between inputs and output. It is more efficient than Boolean algebra. K-map is a diagram
made up of squares in which each square represents a minterm or maxterm of the logic function.
advertisement

2. To display time in railway stations which digital circuit is used?

a) seven segment decoder
b) eight segment encoder
c) 8:3 multiplexer
d) 9 bit segment driver
View Answer

Answer: a
Explanation: A seven segment decoder is a digital circuit which is used to construct a common type of digital display device i.e., a set of
LED (or LCD) segments that display numbers from 0 through 9 at the command of a four-bit code. Moreover, the behavior of the display
driver IC is represented by a truth table with seven outputs.

3. Simplify the expression using K-maps: F(A,B,C,D)=Σ (1,3,5,6,7,11,13,14).

a) AB+BC’D+A’B’C
b) BCD’+A’C’D+BD’
c) A’D+BCD+A’BC+AB’C’
d) AC’D’+BC+A’BD+C’D’
View Answer

Answer: c
Explanation: By solving the given expression we have minterms such as A’D+BCD+A’BC+AB’C’. So, we can get the required expression
A’D+BCD+A’BC+AB’C’.

4. When designing a circuit to emulate a truth table, both Product-of-Sums (POS) expressions and Sum-of-Products (SOP) expressions can
be derived from?
a) k-map
b) NAND gate
c) NOR gate
d) X-NOR gate
View Answer

Answer: a
Explanation: A Karnaugh map can be used to build the appropriate POS expression for designing a circuit to form the truth table. Karnaugh
maps are not limited to SOP expressions only for minimizing boolean functions.

5. Simplify the expression using K-maps: F(A,B,C) = Σ (1,3,5,6,7).

a) AC’+B’
b) AB+C
c) AB’+B’C’
d) A’BC+B’C+AC
View Answer

Answer: b
Explanation: By solving the given expression, the minterms are: C and AB. Hence, we can get the required expression C+AB.
advertisement

6. Simplify the expression using K-maps: F(A,B,C) = π(0,2,4,5,7).

a) (x+y)(y+z)(x+z)(x’+z’)
b) (x+z’)(y+z)(x+y)
c) (x+y’+z)(x+z’)
d) (y’+z’)(x’+y)(z+y’)
View Answer
Answer: a
Explanation: By solving the given expression, the maxterms are: (x+y), (x’+y), (x+z) and (x’+z’). Hence, we can get required expression
(x+y)(x’+y)(x+z)(x’+z’).

7. Addition of two or more bits produces how many bits to construct a logic gate?
a) 108
b) 2
c) 32
d) 64
View Answer

Answer: b
Explanation: Addition of bits requires carry-in and carry-out bits. Addition of two terms (bits) a and b, and a carry-in bit Cin is required to
compute a sum bit S and a carry-out bit Cout. Hence, two bits are produced in general.

8. Use Karnaugh map to find the simplified expression of the function: F = x’yz + xy + xy’z’.
a) xz’+y’z’
b) xy’z+xy
c) y’z+x’y+z
d) yz+xy+xy’z
View Answer

Answer: d
Explanation: F = x’yz + xyz + xy z’ + xy’z’ is the canonical form for the function. Now, using k-map the minimal form must be:
yz+xy+xy’z.

9. Who has invented K-map?

a) Maurice Karnaugh
b) Edward Veitch
c) George Boole
d) Adam Smith
View Answer

Answer: a
Explanation: The Karnaugh map (KM or K-map) is invented by Maurice Karnaugh in 1953 that is a method of simplifying Boolean
expressions.
advertisement

10. In Gray coding, the adjacent code values differ by _______

a) single bit
b) 3 bits
c) 10 bits
d) 0 bit
View Answer

Answer: a
Explanation: In Gray coding, the adjacent code values differ only by a single bit. If the given code-word is 01, then the previous and the next
code-words are to be 11 or 00 but cannot be 10 in any case. Each cell within a K-map has a definite place-value which is obtained by using
this encoding technique. The rows and the columns of the table use Gray code-labeling which in turn represents the values of the
corresponding input variables and each K-map cell can be addressed using a unique Gray Code-Word.
Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Minimization of Boolean Functions
» Next - Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion of Gates
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Minimization of Boolean Functions
Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion of Gates
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Set & String Problems & Algorithms

2. Automata Theory Questions and Answers
3. Microcontroller Questions and Answers
4. C Programming Examples on Stacks & Queues
5. Compilers Questions and Answers
6. C# Programming Examples on Conversions
7. Computer Fundamentals Questions and Answers
8. Python Programming Examples on Stacks & Queues
9. Java Programming Examples on Graph Problems & Algorithms
10. Artificial Intelligence Questions and Answers
11. C++ Programming Examples on Graph Problems & Algorithms
12. C Programming Examples on Graph Problems & Algorithms
13. Engineering Mathematics Questions and Answers
14. C# Programming Examples on Mathematics
15. Java Programming Examples on Data-Structures
16. C Programming Examples on Bitwise Operations
17. VLSI Questions and Answers
18. PLC Programming Examples
19. Digital Circuits Questions and Answers
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Boolean Algebra –

Interconversion of Gates
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra – Interconversion of Gates”.
1. In order to make a luggage security alarm, a single _____ is used.
a) NOR gate
b) NAND gate
c) X-NOR gate
d) XOR gate
View Answer

Answer: b
Explanation: The NAND gate consists of two inputs and if both of them are high the output is low. A luggage security alarm circuit is a
system which is based on the NAND gate. It is used to generate an alarm when any authorized person tries to steal the luggage.
advertisement

2. In Boolean algebra, the data is a bit-representation of information consists of _________

a) 0 and 1
b) 2 and 5
c) 1 and 15
d) 4 and 8
View Answer

Answer: a
Explanation: The data, in boolean algebra must be in a bit-representation form which can be in between two values 0 and 1.

3. Using which component a shift register is implemented?

a) register
b) transistor
c) latch
d) flip-flop
View Answer

Answer: d
Explanation: A shift register, in digital circuitry, is a combination of two or more flip-flops to share the bits of information by using the
same clock. A shift register can have both parallel and serial inputs and outputs.

4. How many NAND gates are required to make an XOR gate?

a) 7
b) 12
c) 4
d) 8
View Answer

Answer: c
Explanation: An XOR gate is created by using four NAND gates. This construction gives a propagation delay three times to that of a single
NAND gate.

5. In Multiplexer gate, for selecting the inputs, two bits named _____ and _____ are required generally.
a) selector bit, data bit
b) parity bit. Generator bit
c) input bit, inverted bit
d) raising bit, sinking bit
View Answer
Answer: a
Explanation: In multiplexer gate for selecting the inputs say, for 3 input bits, one bit is required as selector bit and two other bits are required
as data bits.
advertisement

6. A NOR gate can be derived from ______

a) NAND gate
b) XOR gate
c) AND gate
d) OR gate
View Answer

Answer: a
Explanation: NAND and NOR gates are called universal gates. As we can generate any of the basic gates as well as other gates from these
two gates. So, a NOR gate can be made by a NAND gate.

7. In which logic gate the output state is usually the complement of the input state?
a) NOT gate
b) NOR gate
c) X-NOR gate
d) OR gate
View Answer

Answer: a
Explanation: NOT gate is the simplest digital logic circuit which is also called an inverter because it takes the input in 0 or 1 form and gives
the output as the complement of the input.

8. In OR gate for 13 numbers of inputs what are the stages possible for it?
a) 1239
b) 213
c) 13
d) 1387
View Answer

Answer: b
Explanation: OR gate works in a way such that if any of the input is binary low(or 0), the output of the gate is binary 1(or high). Here, the
n 13
number of stage possible = 2 = 2 .

9. Which of the following is built exclusively from NOR gate?

a) Plant guard machine
b) Apollo Guidance Computer
c) Street market app
d) Dish washer
View Answer

Answer: b
Explanation: The first embedded system is the Apollo Guidance Computer which was built exclusively from NOR gates. A logically
inverted OR gate is a NOR gate and it can have two or more inputs.
advertisement
10. Which of the following gates is used to implement a logical conditional?
a) OR gate
b) Magnetic logic gate
c) XOR gate
d) IMPLY gate
View Answer

Answer: d
Explanation: The IMPLY gate is a digital logic gate that is used to implements logical conditional. Two symbols are used to represent the
IMPLY gates → the traditional symbol and the IEEE symbol. IMPLY gate can be made by two memristors.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Boolean Algebra – Karnaugh Maps
» Next - Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants and Essentials
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Boolean Algebra – Karnaugh Maps
Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants and Essentials
advertisement
advertisement

Recommended Posts:

1. Simple Java Programs

2. C++ Programming Examples on Set & String Problems & Algorithms
3. Microcontroller Questions and Answers
4. C Programming Examples on Set & String Problems & Algorithms
5. VHDL Questions and Answers
6. Information Science Questions and Answers
7. Biotechnology Questions and Answers
8. Computer Science Questions and Answers
9. Information Technology Questions and Answers
10. Master of Computer Applications Questions and Answers
11. Home
12. VLSI Questions and Answers
13. Bachelor of Computer Applications Questions and Answers
14. C Programming Examples on Bitwise Operations
15. PLC Programming Examples
16. C# Programming Examples on Mathematics
17. Engineering Mathematics Questions and Answers
18. Computer Fundamentals Questions and Answers
19. Digital Circuits Questions and Answers
20. Discrete Mathematics Questions and Answers
 advertisement

Discrete Mathematics Questions and Answers – Boolean Algebra –

Prime Implicants and Essentials
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Boolean Algebra – Prime Implicants and
Essentials”.

1. What is the maximum number of prime implicants with 34-variable minimized expression?
a) 34
b) 764
33
c) 2
31
d) 2
View Answer

Answer: c
n-1
Explanation: For n-variable K Map, we have = 2 prime implicants. In this case, n=34 and the maximum number of prime implicants will
34-1 33
be 2 =2 .
advertisement

2. How many cells are there for an 8-variable K-Map?

a) 421
b) 1048
c) 256
d) 375
View Answer

Answer: c
Explanation: Any Boolean expression or a function comprising of 8 variables can be solved using an 8-variable K-Map. So, an 8-variable K-
8
Map must contain 2 = 256.

3. Determine the number of essential prime implicants of the function f(a, b, c, d) = Σm(1, 3, 4, 8, 10, 13) + d(2, 5, 7, 12), where m denote
the minterm and d denotes the don’t care condition.
3
a) 2
b) 3
c) 643
d) 128
View Answer

Answer: b
Explanation: A prime implicant that cannot be replaced by any other implicant for getting the output is called the essential prime implicants.
Here, we have 3 essential prime implicants by using the K-map representation.

4. How many number of prime implicants are there in the expression F(x, y, z) = y’z’ + xy + x’z.
a) 7
b) 19
c) 3
d) 53
View Answer

Answer: c
Explanation: An implicant of a function is a product term which is included in the function.
Hence, for the given function, y’z’, xy and x’z all are prime implicants.

5. f(x, y, z) = xy’+yz’+xyz, what are essential prime implicants of this switching function?
a) 8
b) 0
c) 4
d) 3
View Answer

Answer: b
Explanation: There are no essential prime implicants for this switching function. We can get this solution by using K-Map.
advertisement

6. How many essential prime implicants are there in the K-Map of the function F = Σ(0, 1, 2, 4, 7, 11, 12, 13, 15)?
a) 4
b) 1
c) 3
d) 7
View Answer

Answer: b
Explanation: By, solving the minimization expression using K-Map, there is only 1 essential prime implicant exist as it is not covered by
any other input variable.

7. Determine the number of prime implicants of the following function F?

F(a, b, c, d) = Σm(1, 3, 7, 9, 10, 11, 13, 15)
a) 621
b) 187
5
c) 3
d) 5
View Answer

Answer: d
Explanation: There are 5 prime implicants for the function (a+b+d’)(a+c’+d’)
(a’+c+d)(a’+b+d’)(a’+b’+c’+d). Hence, the required answer is 5.

8. For an 18-variable k-map determine the number of prime implicants?

18
a) 2
b) 35
c) 253
d) 721
View Answer
Answer: a
n 18
Explanation: The maximum number of implicants for the n-variable k-map is 2 . Hence, the required answer is 2 .

9. How many false essential prime implicants for the given Boolean functions f(A, B, C) = ∑m(2, 5, 6)?
a) 1024
b) 2
c) 16
d) 435
View Answer

Answer: b
Explanation: There are two essential prime implicants such as (B+C) and (B+C’) for the given function. Hence, the required answer is 2.
advertisement

10. How many minimal forms are there in the function F(A, B, C) = ∑(1, 3, 2, 5, 6, 7) if it is having cyclic prime implicants k-map?
a) 216
b) 2
c) 14
d) 82
View Answer

Answer: b
Explanation: In cyclic prime implicant, min terms will be (1, 3, 5, 7, 9, 11). Hence, either we can have [(1,3), (7,11), (5,9)] or [(1,5), (11,9),
(3.7)]. So, there can be 2 minimal forms.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion of Gates
» Next - Discrete Mathematics Questions and Answers – Modeling Computations – Finite-State Automation
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion of Gates
Discrete Mathematics Questions and Answers – Modeling Computations – Finite-State Automation
advertisement
advertisement

Recommended Posts:

1. C Programming Examples using Recursion

2. C Programming Examples on Strings
3. C Programming Examples on Mathematical Functions
4. Engineering Mathematics Questions and Answers
5. Java Programming Examples on Numerical Problems & Algorithms
6. C# Programming Examples on Mathematics
 7. C++ Programming Examples on Numerical Problems & Algorithms
8. C Programming Examples on Numerical Problems & Algorithms
9. Discrete Mathematics Questions and Answers
10. C Program to Find whether a Number is Prime or Not using Recursion
11. Discrete Mathematics Questions and Answers – Types of Set
12. Discrete Mathematics Questions and Answers – Probability Distribution
13. Discrete Mathematics Questions and Answers – Discrete Probability – Generating Functions
14. Python Program to Find if a Number is Prime or Not Prime Using Recursion
15. Discrete Mathematics Questions and Answers – Permutation Groups
16. Discrete Mathematics Questions and Answers – Cryptography – Decryption
17. Discrete Mathematics Questions and Answers – Discrete Probability – Power Series
18. Discrete Mathematics Questions and Answers – Set Operations – 2
19. Discrete Mathematics Questions and Answers – Discrete Probability – Mean and Variance of Random Variables
20. Discrete Mathematics Questions and Answers – Number Theory – Primes and Greatest Common Divisors

advertisement

Discrete Mathematics Questions and Answers – Modeling

Computations – Finite-State Automation
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Modeling Computations – Finite-State
Automation”.

1. How many states are there in combinatorial FSM?

a) 86
19
b) 2
c) 1
d) 132
View Answer

Answer: c
Explanation: As an FSM’s memory is limited by the number of states, it cannot perform the computational tasks that a Turing machine can
do. A “Combinatorial FSM” is defined as a finite state machine with only one state and it allows actions based upon transition into a state.
advertisement

2. Which of the following algorithms transforms any NFA into its identical DFA?
a) Minimal set construction
b) Dynamic programming
c) Powerset construction
d) Huffman coding
View Answer

Answer: b
Explanation: The powerset construction algorithm is a powerful algorithm that can transform any non-deterministic automaton into a more
complex deterministic automaton with identical functionality.
3. Which of the following is not a member of the set of a deterministic finite state machine?
a) state-transition function
b) initial state
c) input symbols
d) stack
View Answer

Answer: b
Explanation: A deterministic finite state machine or acceptor deterministic finite state machine is a quintuple (Σ, G, s1, δ, F), where: Σ is the
input alphabet (a finite, non-empty set of symbols), G is a finite, non-empty set of states, s1 is an initial state, an element of S, δ is the state-
transition function: δ: G × Σ → G.

4. In system engineering which of the following methods bridges the gap between the two ends of system development?
a) ASM method
b) VSM method
c) Factor method
d) FSM method
View Answer

Answer: a
Explanation: An abstract state machine (ASM) has its operations on states that are arbitrary data structures as well as it can bridge the gap
between the two ends of the system development. This method builds upon three basic concepts such as ASM, ground model and
refinement.

5. Optimisation of an FSM machine can be done by ________

a) Naive-bias algorithm
b) Huffman encoding scheme
c) Pirate-plot algorithm
d) Hopcroft minimization algorithm
View Answer

Answer: b
Explanation: The job of fastest known algorithm, hopcroft minimization algorithm is to optimize and FSM system that means finding a
machine with the minimum number of states which can have the same function to perform. Acyclic FSAs can be minimized in linear time.
advertisement

6. A deterministic automaton system can have ______ transition for a given state of an input symbol.
a) exactly one
b) more than one
c) no transition
d) 2n transition
View Answer

Answer: a
Explanation: In a deterministic automaton, for each possible input every state has exactly one transition. In a non-deterministic automaton,
an input can have one, more than one, or no transition for a given state. In the study of computation, a transition system is used and it can be
made of states and transitions between states, which may be labeled with labels chosen from a set.

7. Which of the following techniques refer to the equivalence of DFA and N-DFA automata?
a) subset construction
b) superset construction
c) powerset construction
d) finite field construction
View Answer

Answer: b
Explanation: For every N-DFA there is a corresponding DFA for every N-DFA, and the basic technique is described as subset construction
because each state in the DFA corresponds to some subset of states of the NDFA.

8. Equivalence of automata states that ____________

a) two automata accept the same set of input strings
b) two automata have same set of states
c) two automata does not contain initial input symbols
d) two automata share equal transition function
View Answer

Answer: a
Explanation: The formal definition is if two automata J and K are equivalent then if there is a path from the start state of J to a final state of J
and there is a path from the start state of k to a final state of K as well as if there is a path from the start state of K to a final state of K, where
there is a path from the start state of J to a final state of J. Two automata J and K are said to be equivalent if both automata accept exactly the
same set of input strings.

9. In the operating system, newly started processes can have a start in the _________
a) Blocked state
b) Running sate
c) Ready state
d) Exit state
View Answer

Answer: c
Explanation: In the behaviour of the processes, newly started processes start their execution in a Ready state and have to wait until the OS
scheduler assigns a CPU to them. At that moment, the process starts running and it stays in this state until either the scheduler decides to
take back the CPU (as a “time slice” has expired).
advertisement

10. In lexical analysis of a compiler______ is used.

a) DFA
b) NDFA
c) NFA
d) Turing machine
View Answer

Answer: a
Explanation: A Deterministic Finite automaton system is used in the lexical analysis of the compiler.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants and Essentials
» Next - Discrete Mathematics Questions and Answers – Group Theory
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants and Essentials
Discrete Mathematics Questions and Answers – Group Theory
advertisement
advertisement

Recommended Posts:

1. Machine Dynamics Questions and Answers

2. C Programming Examples on Computational Geometry Problems & Algorithms
3. Java Programming Examples on Numerical Problems & Algorithms
4. Java Programming Examples on Multithreading
5. Machine Drawing Questions and Answers
6. C++ Programming Examples on Hard Graph Problems & Algorithms
7. C Programming Examples on Combinatorial Problems & Algorithms
8. C Programming Examples on Numerical Problems & Algorithms
9. Computational Fluid Dynamics Questions and Answers
10. Python Programming Examples on Graphs
11. C# Programming Examples on Mathematics
12. C Programming Examples on Searching and Sorting
13. Engineering Mathematics Questions and Answers
14. Solid State Chemistry Questions and Answers
15. Compilers Questions and Answers
16. Discrete Mathematics Questions and Answers
17. Java Programming Examples on Set & String Problems & Algorithms
18. C Programming Examples on Set & String Problems & Algorithms
19. C++ Programming Examples on Set & String Problems & Algorithms
20. Automata Theory Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Group Theory

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Group Theory”.

1. A non empty set A is termed as an algebraic structure ________

a) with respect to binary operation *
b) with respect to ternary operation ?
c) with respect to binary operation +
d) with respect to unary operation –
View Answer

Answer: a
Explanation: A non empty set A is called an algebraic structure w.r.t binary operation “*” if (a*b) belongs to S for all (a*b) belongs to S.
Therefore “*” is closure operation on ‘A’.
advertisement

2. An algebraic structure _________ is called a semigroup.

a) (P, *)
b) (Q, +, *)
c) (P, +)
d) (+, *)
View Answer

Answer: a
Explanation: An algebraic structure (P,*) is called a semigroup if a*(b*c) = (a*b)*c for all a,b,c belongs to S or the elements follow
associative property under “*”. (Matrix,*) and (Set of integers,+) are examples of semigroup.

3. Condition for monoid is __________

a) (a+e)=a
b) (a*e)=(a+e)
c) a=(a*(a+e)
d) (a*e)=(e*a)=a
View Answer

Answer: d
Explanation: A Semigroup (S,*) is defined as a monoid if there exists an element e in S such that (a*e) = (e*a) = a for all a in S. This
element is called identity element of S w.r.t *.

4. A monoid is called a group if _______

a) (a*a)=a=(a+c)
b) (a*c)=(a+c)
c) (a+c)=a
d) (a*c)=(c*a)=e
View Answer

Answer: d
Explanation: A monoid(B,*) is called Group if to each element there exists an element c such that (a*c)=(c*a)=e. Here e is called an identity
element and c is defined as the inverse of the corresponding element.

5. A group (M,*) is said to be abelian if ___________

a) (x+y)=(y+x)
b) (x*y)=(y*x)
c) (x+y)=x
d) (y*x)=(x+y)
View Answer
Answer: b
Explanation: A group (M,*) is said to be abelian if (x*y) = (x*y) for all x, y belongs to M. Thus Commutative property should hold in a
group.
advertisement

6. Matrix multiplication is a/an _________ property.

a) Commutative
b) Associative
c) Additive
d) Disjunctive
View Answer

Answer: b
Explanation: The set of two M*M non-singular matrices form a group under matrix multiplication operation. Since matrix multiplication is
itself associative, it holds associative property.

7. A cyclic group can be generated by a/an ________ element.

a) singular
b) non-singular
c) inverse
d) multiplicative
View Answer

Answer: a
Explanation: A singular element can generate a cyclic group. Every element of a cyclic group is a power of some specific element which is
known as a generator ‘g’.

8. How many properties can be held by a group?

a) 2
b) 3
c) 5
d) 4
View Answer

Answer: c
Explanation: A group holds five properties simultaneously –
i) Closure
ii) associative
iii) Commutative
iv) Identity element
v) Inverse element.

9. A cyclic group is always _________

a) abelian group
b) monoid
c) semigroup
d) subgroup
View Answer
Answer: a
Explanation: A cyclic group is always an abelian group but every abelian group is not a cyclic group. For instance, the rational numbers
under addition is an abelian group but is not a cyclic one.
advertisement

10. {1, i, -i, -1} is __________

a) semigroup
b) subgroup
c) cyclic group
d) abelian group
View Answer

Answer: c
Explanation: The set of complex numbers {1, i, -i, -1} under multiplication operation is a cyclic group. Two generators i and -i will covers
all the elements of this group. Hence, it is a cyclic group.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Modeling Computations – Finite-State Automation
» Next - Discrete Mathematics Questions and Answers – Group Axioms
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Modeling Computations – Finite-State Automation
Discrete Mathematics Questions and Answers – Group Axioms
advertisement
advertisement

Recommended Posts:

1. Engineering Mathematics Questions and Answers

2. Network Theory Questions and Answers
3. Python Programming Examples on Trees
4. C# Programming Examples on Functions
5. C Programming Examples without using Recursion
6. Java Programming Examples on Arrays
7. C Programming Examples on Data-Structures
8. C Programming Examples using Recursion
9. Java Programming Examples on Numerical Problems & Algorithms
10. C++ Programming Examples on Combinatorial Problems & Algorithms
11. C Programming Examples on Trees
12. C Programming Examples on Linked List
13. C++ Programming Examples on Numerical Problems & Algorithms
14. Electromagnetic Theory Questions and Answers
15. C Programming Examples on Numerical Problems & Algorithms
 16. Theory of Machines Questions and Answers
17. C# Programming Examples on Matrix
18. C# Programming Examples on Mathematics
19. Training Classes on C, Linux & SAN – Group Photos
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Group Axioms

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Group Axioms”.

1. __________ are called group postulates.

a) Group lemmas
b) Group theories
c) Group axioms
d) Group
View Answer

Answer: c
Explanation: The group axioms are also called the group postulates. A group with an identity (that is, a monoid) in which every element has
an inverse is termed as semi group.
advertisement

2. A subgroup has the properties of ________

a) Closure, associative
b) Commutative, associative, closure
c) Inverse, identity, associative
d) Closure, associative, Identity, Inverse
View Answer

Answer: d
Explanation: A subgroup S is a subset of a group G (denoted by S <= G) if it holds the four properties simultaneously – Closure,
Associative, Identity and Inverse element.

3. If a * b = a such that a ∗ (b ∗ c) = a ∗ b = a and (a * b) * c = a * b = a then ________

a) * is associative
b) * is commutative
c) * is closure
d) * is abelian
View Answer

Answer: a
Explanation: ‘∗’ can be defined by the formula a∗b = a for any a and b in S. Hence, (a ∗ b)∗c = a∗c = a and a ∗(b ∗ c)= a ∗ b = a. Therefore,
”∗” is associative. Hence (S, ∗) is a semigroup. On the contrary, * is not associative since, for example, (b•c)•c = a•c = c but b•(c•c) = b•a =
b Thus (S,•) is not a semigroup.
4. The set of odd and even positive integers closed under multiplication is ________
a) a free semigroup of (M, ×)
b) a subsemigroup of (M, ×)
c) a semigroup of (M, ×)
d) a subgroup of (M, ×)
View Answer

Answer: b
Explanation: Let C and D be the set of even and odd positive integers. Then, (C, ×) and (D, ×) are subsemigroups of (M, ×) since A and B
are closed under multiplication. On the other hand, (A, +) is a subsemigroup of (N, +) since A is closed under addition, but (B, +) is not a
subsemigroup of (N, +) since B is not closed under addition.

5. If F is a free semigroup on a set S, then the concatenation of two even words is ________
a) a semigroup of F
b) a subgroup of F
c) monoid of F
d) cyclic group of F
View Answer

Answer: b
Explanation: Let F be the free semigroup on the set S = {m,n}. Let, E consist of all even words, i.e, words with even length and the
concatenation of two such words is also even. Thus E is a subsemigroup of F.
advertisement

6. The set of rational numbers form an abelian group under _________

a) Association
b) Closure
c) Multiplication
d) Addition
View Answer

Answer: c
Explanation: The set of nonzero rational numbers form an abelian group under multiplication. The number 1 is the identity element and q/p
is the multiplicative inverse of the rational number p/q.

7. Condition of semigroup homomorphism should be ____________

a) f(x * x) = f(x * y)
b) f(x) = f(y)
c) f(x) * f(y) = f(y)
d) f(x * y) = f(x) * f(y)
View Answer

Answer: d
Explanation: Consider two semigroups (S,∗) and (S’,∗’). A function f: S -> S’ is called a semigroup homomorphism if f(a∗b) = f(a)∗f(b).
Suppose f is also one-to-one and onto. Then f is called an isomorphism between S and S’ and S and S’ are said to be isomorphic semigroups.

8. A function f:(M,∗)→(N,×) is a homomorphism if ______

a) f(a, b) = a*b
b) f(a, b) = a/b
c) f(a, b) = f(a)+f(b)
d) f(a, b) = f(a)*f(a)
View Answer

Answer: b
Explanation: The function f is a homomorphism since f(x∗y)= f(ac, bd)= (ac)/(bd) = (a/b)(c/d) = f(x)f(y).

9. A function defined by f(x)=2*x such that f(x+y)=2x+y under the group of real numbers, then ________
a) Isomorphism exists
b) Homomorphism exists
c) Heteromorphic exists
d) Association exists
View Answer

Answer: b
Explanation: Let T be the group of real numbers under addition, and let T’ be the group of positive real numbers under multiplication. The
mapping f: T -> T’ defined by f(a)=2*a is a homomorphism because f(a+b)=2a+b = 2a*2b = f(a)*f(b). Again f is also one-to-one and onto T
and T’ are isomorphic.
advertisement

10. If x * y = x + y + xy then (G, *) is _____________

a) Monoid
b) Abelian group
c) Commutative semigroup
d) Cyclic group
View Answer

Answer: c
Explanation: Let x and y belongs to a group G.Here closure and associativity axiom holds simultaneously. Let e be an element in G such
that x * e = x then x+e+xe=a => e(1+x)=0 => e = 0/(1+x) = 0. So, identity axiom does not exist but commutative property holds. Thus, (G,*)
is a commutative semigroup.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Group Theory
» Next - Discrete Mathematics Questions and Answers – Groups – Closure and Associativity
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Group Theory
Discrete Mathematics Questions and Answers – Groups – Closure and Associativity
advertisement
advertisement

Recommended Posts:
 1. C# Programming Examples on Functions
2. C++ Programming Examples on Graph Problems & Algorithms
3. Java Programming Examples on String Handling
4. C# Programming Examples on LINQ
5. Simple C Programs
6. C Programming Examples on Strings
7. C Programming Examples using Recursion
8. C Programming Examples on Mathematical Functions
9. Python Programming Examples
10. Java Programming Examples on Mathematical Functions
11. Java Programming Examples on Numerical Problems & Algorithms
12. C++ Programming Examples on Numerical Problems & Algorithms
13. C# Programming Examples on Matrix
14. C Programming Examples on Numerical Problems & Algorithms
15. Automata Theory Questions and Answers
16. Engineering Mathematics Questions and Answers
17. Training Classes on C, Linux & SAN – Group Photos
18. C Programming Examples on Matrix
19. C# Programming Examples on Mathematics
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Groups – Closure

and Associativity
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Groups – Closure and Associativity”.

1. Let (A7, ⊗7)=({1, 2, 3, 4, 5, 6}, ⊗7) is a group. It has two sub groups X and Y. X={1, 3, 6}, Y={2, 3, 5}. What is the order of union of
subgroups?
a) 65
b) 5
c) 32
d) 18
View Answer

Answer: b
Explanation: Given, (A7, ⊗7)=({1, 2, 3, 4, 5, 6}, ⊗7) and the union of two sub groups X and Y, X={1, 3, 6} Y={2, 3, 5} is X∪Y={1, 2, 3,
5, 6} i.e., 5. Here, the order of the union can not be divided by order of the group.
advertisement

2. A relation (34 × 78) × 57 = 57 × (78 × 34) can have __________ property.

a) distributive
b) associative
c) commutative
d) closure
View Answer

Answer: b
Explanation: For any three elements(numbers) a, b and c associative property describes a × ( b × c ) = ( a × b ) × c [for multiplication].
Hence associative property is true for multiplication and it is true for multiplication also.

3. B1: ({0, 1, 2….(n-1)}, xm) where xn stands for “multiplication-modulo-n” and B2: ({0, 1, 2….n}, xn) where xn stands for
“multiplication-modulo-m” are the two statements. Both B1 and B2 are considered to be __________
a) groups
b) semigroups
c) subgroups
d) associative subgroup
View Answer

Answer: b
Explanation: Here, B1 is the group and identity element is 0, means for all a∈B1, a+n.0=a. As a<n. But in B2 identity element does not
exist. Here, 0 can not be the identity element. For example, for one of the member n of the set we have n+n.0=0, It will be n. So, B2 is not a
group. Both B1 and B2 are semigroups as they satisfy closure and associativity property.

4. If group G has 65 elements and it has two subgroups namely K and L with order 14 and 30. What can be order of K intersection L?
a) 10
b) 42
c) 5
d) 35
View Answer

Answer: c
Explanation: As it is an intersection so the order must divide both K and L. Here 3, 6, 30 does not divide 14. But 5 must be the order of the
group as it divides the order of intersection of K and L as well as the order of the group.

5. Consider the binary operations on X, a*b = a+b+4, for a, b ∈ X. It satisfies the properties of _______
a) abelian group
b) semigroup
c) multiplicative group
d) isomorphic group
View Answer

Answer: a
Explanation: Since * closed operation, a*b belongs to X. Hence, it is an abelian group.
advertisement

6. Let * be the binary operation on the rational number given by a*b=a+b+ab. Which of the following property does not exist for the group?
a) closure property
b) identity property
c) symmetric property
d) associative property
View Answer
Answer: b
Explanation: For identity e, a+e=e+a=e, a*e = a+e+ae = a => e=0 and e+a = e+a+ea = a => e=0. So e=0 will be identity, for e to be identity,
a*e = a ⇒ a+e+ae = a ⇒ e+ae = 0 and e(1+a) = 0 which gives e=0 or a=-1. So, when a = -1, no identity element exist as e can be any value
in that case.

7. Let G be a finite group with two sub groups M & N such that |M|=56 and |N|=123. Determine the value of |M⋂N|.
a) 1
b) 56
c) 14
d) 78
View Answer

Answer: a
Explanation: We know that gcd(56, 123)=1. So, the value of |M⋂N|=1.

8. A group G, ({0}, +) under addition operation satisfies which of the following properties?
a) identity, multiplicity and inverse
b) closure, associativity, inverse and identity
c) multiplicity, associativity and closure
d) inverse and closure
View Answer

Answer: b
Explanation: Closure for all a, b∈G, the result of the operation, a+b, is also in G. Since there is one element, hence a=b=0, and
a+b=0+0=0∈G. Hence, closure property is satisfied. Associative for all a, b, c∈G, (a+b)+c=a+(b+c). For example, a=b=c=0. Hence
(a+b)+c=a+(b+c)
⟹(0+0)+0=0+(0+0)⟹0=0. Hence, associativity property is satisfied. Suppose for an element e∈G such that, there exists an element a∈G
and so the equation e+a=a+e=a holds. Such an element is unique, the identity element property is satisfied. For example, a=e=0. Hence e+a
= a+e⟹0+0=0+0⟹0=a. Hence e=0 is the identity element. For each a∈G, there exists an element b∈G (denoted as a-1), such that
a+b=b+a=e, where e is the identity element. The inverse element is 0 as the addition of 0 with 0 will be 0, which is also an identity element
of the structure.

9. If (M, *) is a cyclic group of order 73, then number of generator of G is equal to ______
a) 89
b) 23
c) 72
d) 17
View Answer

Answer: c
Explanation: We need to find the number of co-primes of 73 which are less than 73. As 73 itself is a prime, all the numbers less than that are
co-prime to it and it makes a group of order 72 then it can be of {1, 3, 5, 7, 11….}.
advertisement

10. The set of even natural numbers, {6, 8, 10, 12,..,} is closed under addition operation. Which of the following properties will it satisfy?
a) closure property
b) associative property
c) symmetric property
d) identity property
View Answer
Answer: a
Explanation: The set of even natural numbers is closed by the addition as the sum of any two of them produces another even number. Hence,
this closed set satisfies the closure property.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Group Axioms
» Next - Discrete Mathematics Questions and Answers – Groups – Existence of Identity & Inverse
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Group Axioms
Discrete Mathematics Questions and Answers – Groups – Existence of Identity & Inverse
advertisement
advertisement

Recommended Posts:

1. C Programming Examples without using Recursion

2. Java Programming Examples on Graph Problems & Algorithms
3. C++ Programming Examples on Numerical Problems & Algorithms
4. C Programming Examples on Linked List
5. C# Programming Examples on Sorting
6. Python Programming Examples
7. C Programming Examples on Trees
8. C++ Programming Examples on Combinatorial Problems & Algorithms
9. C Programming Examples on Numerical Problems & Algorithms
10. C++ Programming Examples on Graph Problems & Algorithms
11. C Programming Examples on Graph Problems & Algorithms
12. C Programming Examples using Recursion
13. C# Programming Examples on Delegates
14. Java Programming Examples on Arrays
15. C Programming Examples on Arrays
16. Engineering Mathematics Questions and Answers
17. C# Programming Examples on Mathematics
18. C Programming Examples on Matrix
19. C# Programming Examples on Matrix
20. Discrete Mathematics Questions and Answers – Inverse of Matrices

advertisement

Discrete Mathematics Questions and Answers – Groups – Existence

of Identity & Inverse
« Prev
Next »

This set of Discrete Mathematics Puzzles focuses on “Groups – Existence of Identity & Inverse”.

1. In a group there must be only __________ element.

a) 1
b) 2
c) 3
d) 5
View Answer

Answer: a
Explanation: There can be only one identity element in a group and each element in a group has exactly one inverse element. Hence, two
important consequences of the group axioms are the uniqueness of the identity element and the uniqueness of inverse elements.
advertisement

2. _____ is the multiplicative identity of natural numbers.

a) 0
b) -1
c) 1
d) 2
View Answer

Answer: c
Explanation: 1 is the multiplicative identity of natural numbers as a⋅1=a=1⋅a ∀a∈N. Thus, 1 is the identity of multiplication for the set of
integers(Z), set of rational numbers(Q), and set of real numbers(R).

3. An identity element of a group has ______ element.

a) associative
b) commutative
c) inverse
d) homomorphic
View Answer

Answer: c
Explanation: By the definition of all elements of a group have an inverse. For an element, a in a group G, an inverse of a is an element b
such that ab=e, where e is the identity in the group. The inverse of an element is unique and usually denoted as -a.

4. __________ matrices do not have multiplicative inverses.

a) non-singular
b) singular
c) triangular
d) inverse
View Answer

Answer: b
Explanation: The rational numbers are an extension of the integer numbers in which each non-zero number has an inverse under
multiplication. A 3 × 3 matrix may or may not have an inverse under matrix multiplication. The matrices which do not have multiplicative
inverses are termed as singular matrices.
5. If X is an idempotent nonsingular matrix, then X must be ___________
a) singular matrix
b) identity matrix
c) idempotent matrix
d) nonsingular matrix
View Answer

Answer: b
2 -1
Explanation: Since X is idempotent, we have X =X. As X is nonsingular, it is invertible. Thus, the inverse matrix X exists. Then we have,
-1 -1
I=X X = X X2=IX=X.
advertisement

-1 -1 -1 -1
6. If A, B, and C are invertible matrices, the expression (AB ) (CA ) C2 evaluates to ____________
a) BC
-1
b) C BC
-1
c) AB
-1
d) C B
View Answer

Answer: a
-1 -1 -1 -1 -1
Explanation: Using the properties (AB) =b A and (A ) =A, we may have,
-1 -1 -1 -1
(AB ) (CA ) C2
-1 -1 -1 -1 -1 -1
=(B ) A (A ) C C2
-1 -1
=BA AC C2
-1
=BIC=BC [As, A A=I].

7. If the sum of elements in each row of an n×n matrix Z is zero, then the matrix is ______________
a) inverse
b) non-singular
c) additive inverse
d) singular
View Answer

Answer: d
Explanation: By the definition, an n×n matrix A is said to be singular if there exists a nonzero vector v such that Av=0. Otherwise, it is
known that A is a nonsingular matrix.

8. ___________ are the symmetry groups used in the Standard model.

a) lie groups
b) subgroups
c) cyclic groups
d) poincare groups
View Answer

Answer: a
Explanation: A symmetry group can encode symmetry features of a geometrical object. The group consists of the set of transformations that
leave the object unchanged. Lie groups are such symmetry groups used in the standard model of particle physics.

9. A semigroup S under binary operation * that has an identity is called __________

a) multiplicative identity
b) monoid
c) subgroup
d) homomorphism
View Answer

Answer: b
Explanation: Let P(S) is a commutative semigroup has the identity e, since e*A=A=A*e for any element A belongs to P(S). Hence, P(S) is a
monoid.
advertisement

10. An element a in a monoid is called an idempotent if ______________

-1 -1
a) a =a*a
2
b) a*a =a
2
c) a =a*a=a
3
d) a =a*a
View Answer

Answer: c
Explanation: An algebraic structure with a single associative binary operation and an Identity element are termed as a monoid. It is studied
2
in semigroup theory. An element x in a monoid is called idempotent if a = a*a = a.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all Puzzles on Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Groups – Closure and Associativity
» Next - Discrete Mathematics Questions and Answers – Groups – Subgroups
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Groups – Closure and Associativity
Discrete Mathematics Questions and Answers – Groups – Subgroups
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Arrays

2. C# Programming Examples
3. Java Programming Examples on Data-Structures
4. C Programming Examples without using Recursion
5. Java Programming Examples on Combinatorial Problems & Algorithms
6. Signals & Systems Questions and Answers
7. C Programming Examples using Recursion
8. C Programming Examples on Combinatorial Problems & Algorithms
9. Numerical Methods Questions and Answers
10. C++ Programming Examples on Combinatorial Problems & Algorithms
 11. C# Programming Examples on Mathematics
12. Java Programming Examples on Numerical Problems & Algorithms
13. C# Programming Examples on LINQ
14. C++ Programming Examples on Numerical Problems & Algorithms
15. Java Programming Examples on Arrays
16. C Programming Examples on Numerical Problems & Algorithms
17. Engineering Mathematics Questions and Answers
18. C# Programming Examples on Matrix
19. C Programming Examples on Matrix
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Groups –

Subgroups
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Groups – Subgroups”.

1. A trivial subgroup consists of ___________

a) Identity element
b) Coset
c) Inverse element
d) Ring
View Answer

Answer: a
Explanation: Let G be a group under a binary operation * and a subset H of G is called a subgroup of G if H forms a group under the
operation *. The trivial subgroup of any group is the subgroup consisting of only the Identity element.
advertisement

2. Minimum subgroup of a group is called _____________

a) a commutative subgroup
b) a lattice
c) a trivial group
d) a monoid
View Answer

Answer: c
Explanation: The subgroups of any given group form a complete lattice under inclusion termed as a lattice of subgroups. If o is the Identity
element of a group(G), then the trivial group(o) is the minimum subgroup of that group and G is the maximum subgroup.

3. Let K be a group with 8 elements. Let H be a subgroup of K and H<K. It is known that the size of H is at least 3. The size of H is
__________
a) 8
b) 2
c) 3
d) 4
View Answer

Answer: d
Explanation: For any finite group G, the order (number of elements) of every subgroup L of G divides the order of G. G has 8 elements.
Factors of 8 are 1, 2, 4 and 8. Since given the size of L is at least 3(1 and 2 eliminated) and not equal to G(8 eliminated), the only size left is
4. Size of L is 4.

4. __________ is not necessarily a property of a Group.

a) Commutativity
b) Existence of inverse for every element
c) Existence of Identity
d) Associativity
View Answer

Answer: a
Explanation: Grupoid has closure property; semigroup has closure and associative; monoid has closure, associative and identity property;
group has closure, associative, identity and inverse; the abelian group has group property and commutative.

5. A group of rational numbers is an example of __________

a) a subgroup of a group of integers
b) a subgroup of a group of real numbers
c) a subgroup of a group of irrational numbers
d) a subgroup of a group of complex numbers
View Answer

Answer: b
Explanation: If we consider the abelian group as a group rational numbers under binary operation + then it is an example of a subgroup of a
group of real numbers.
advertisement

6. Intersection of subgroups is a ___________

a) group
b) subgroup
c) semigroup
d) cyclic group
View Answer

Answer: b
Explanation: The subgroup property is intersection closed. An arbitrary (nonempty) intersection of subgroups with this property, also attains
the similar property.

7. The group of matrices with determinant _________ is a subgroup of the group of invertible matrices under multiplication.
a) 2
b) 3
c) 1
d) 4
View Answer
Answer: c
Explanation: The group of real matrices with determinant 1 is a subgroup of the group of invertible real matrices, both equipped with matrix
multiplication. It has to be shown that the product of two matrices with determinant 1 is another matrix with determinant 1, but this is
immediate from the multiplicative property of the determinant. This group is usually denoted by(n, R).

8. What is a circle group?

a) a subgroup complex numbers having magnitude 1 of the group of nonzero complex elements
b) a subgroup rational numbers having magnitude 2 of the group of real elements
c) a subgroup irrational numbers having magnitude 2 of the group of nonzero complex elements
d) a subgroup complex numbers having magnitude 1 of the group of whole numbers
View Answer

Answer: a
Explanation: The set of complex numbers with magnitude 1 is a subgroup of the nonzero complex numbers associated with multiplication. It
is called the circle group as its elements form the unit circle.

9. A normal subgroup is ____________

a) a subgroup under multiplication by the elements of the group
b) an invariant under closure by the elements of that group
c) a monoid with same number of elements of the original group
d) an invariant equipped with conjugation by the elements of original group
View Answer

Answer: d
Explanation: A normal subgroup is a subgroup that is invariant under conjugation by any element of the original group that is, K is normal if
and only if gKg-1=K for any g belongs to G Equivalently, a subgroup K of G is normal if and only if gK=Kg for any g belongs to G.Normal
subgroups are useful in constructing quotient groups and in analyzing homomorphisms.
advertisement

10. Two groups are isomorphic if and only if __________ is existed between them.
a) homomorphism
b) endomorphism
c) isomorphism
d) association
View Answer

Answer: c
Explanation: Two groups M and K are isomorphic (M ~= K) if and only if there exists an isomorphism between them. An isomorphism f:M
-> K between two groups M and K is a mapping which satisfies two conditions: 1) f is a bijection and 2) for every x,y belongs to M, we
have f(x*My) = f(x) * Kf(y).

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Groups – Existence of Identity & Inverse
» Next - Discrete Mathematics Questions and Answers – Groups – Cosets
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Groups – Existence of Identity & Inverse
Discrete Mathematics Questions and Answers – Groups – Cosets
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Data-Structures

2. C++ Programming Examples on Combinatorial Problems & Algorithms
3. C Programming Examples on Combinatorial Problems & Algorithms
4. Java Programming Examples on Collections
5. C Programming Examples without using Recursion
6. C# Programming Examples on Arrays
7. Python Programming Examples on Linked Lists
8. C# Programming Examples on Functions
9. C Programming Examples on Linked List
10. Java Programming Examples on Numerical Problems & Algorithms
11. C Programming Examples on Arrays
12. C# Programming Examples on LINQ
13. C++ Programming Examples on Numerical Problems & Algorithms
14. Java Programming Examples on Arrays
15. C Programming Examples on Numerical Problems & Algorithms
16. C# Programming Examples on Mathematics
17. C# Programming Examples on Matrix
18. Engineering Mathematics Questions and Answers
19. C Programming Examples on Matrix
20. Simultaneous Algebraic Equations Questions and Answers – Introduction to Determinants

advertisement

Discrete Mathematics Questions and Answers – Groups – Cosets

« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Groups – Cosets”.

1. a * H is a set of _____ coset.

a) right
b) left
c) sub
d) semi
View Answer

Answer: b
Explanation: Let (H, *) be the semigroup of the group (G, *). Let a belongs to G. (a * H) is the set of a left coset of H in G and (H * a) be the
set of a right coset of H in G.
 advertisement

2. a * H = H * a relation holds if __________

a) H is semigroup of an abelian group
b) H is monoid of a group
c) H is a cyclic group
d) H is subgroup of an abelian group
View Answer

Answer: d
Explanation: If h is the subgroup of an abelian group G, then the set of left cosets of H in G is to be set of right cosets i.e, a * H = H * a.
Hence, subgroup is called the normal subgroup.

3. Lagrange’s theorem specifies __________

a) the order of semigroup is finite
b) the order of the subgroup divides the order of the finite group
c) the order of an abelian group is infinite
d) the order of the semigroup is added to the order of the group
View Answer

Answer: b
Explanation: Lagrange’s theorem satisfies that the order of the subgroup divides the order of the finite group.

4. A function is defined by f(x)=2x and f(x + y) = f(x) + f(y) is called _____________

a) isomorphic
b) homomorphic
c) cyclic group
d) heteromorphic
View Answer

Answer: a
Explanation: Let (G,*) and (G’,+) are two groups. The mapping f:G->G’ is said to be isomorphism if two conditions are satisfied 1) f is one-
to-one function and onto function and 2) f satisfies homomorphism.

5. An isomorphism of a group onto itself is called ____________

a) homomorphism
b) heteromorphism
c) epimorphism
d) automorphism
View Answer

Answer: d
Explanation: An automorphism is defined as an isomorphism of a group onto itself. Similarly, the homomorphism of a group onto itself is
defined as the endomorphism of the group.
advertisement

6. The elements of a vector space form a/an ____________ under vector addition.
a) abelian group
b) commutative group
c) associative group
d) semigroup
View Answer

Answer: a
Explanation: An example of a coset is associated with the theory of vector spaces. The elements (vectors) form an abelian group under the
vector addition in a vector space. Subspaces of a vector space are subgroups of this group.

7. A set of representatives of all the cosets is called _________

a) transitive
b) reversal
c) equivalent
d) transversal
View Answer

Answer: d
Explanation: A coset representative is a representative in the equivalence class. In all cosets, a set of the representative is always transversal.

8. Which of the following statement is true?

a) The set of all rational negative numbers forms a group under multiplication
b) The set of all matrices forms a group under multiplication
c) The set of all non-singular matrices forms a group under multiplication
d) The set of matrices forms a subgroup under multiplication
View Answer

Answer: c
Explanation: Since multiplication of two negative rational numbers gives a positive number. Hence, closure property is not satisfied.
Singular matrices do not form a group under multiplication. Matrices have to be non-singular (determinant !=0) for the inverse to exist.
Hence the set of all non-singular matrices forms a group under multiplication is a true option.

9. How many different non-isomorphic Abelian groups of order 8 are there?

a) 5
b) 4
c) 2
d) 3
View Answer

Answer: c
m 3
Explanation: The number of Abelian groups of order P (let, P is prime) is the number of partitions of m. Here order is 8 i.e. 2 and so
partition of 3 are {1, 1} and {3, 0}. So number of different abelian groups are 2.
advertisement

10. Consider the set B* of all strings over the alphabet set B = {0, 1} with the concatenation operator for strings ________
a) does not form a group
b) does not have the right identity element
c) forms a non-commutative group
d) forms a group if the empty string is removed from
View Answer

Answer: a
Explanation: Identity element for concatenation is an empty string. Now, we cannot concatenate any string with a given string to get empty
string there is no inverse for string concatenation. Only other 3 group properties such as closure, associative and existence of identity are
satisfied.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Groups – Subgroups
» Next - Discrete Mathematics Questions and Answers – Cyclic Groups
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Groups – Subgroups
Discrete Mathematics Questions and Answers – Cyclic Groups
advertisement
advertisement

Recommended Posts:

1. Java Programming Examples on Mathematical Functions

2. Python Programming Examples
3. C++ Programming Examples on STL
4. Numerical Methods Questions and Answers
5. Java Programming Examples on Numerical Problems & Algorithms
6. C Algorithms, Problems & Programming Examples
7. C# Programming Examples on LINQ
8. C# Programming Examples on Functions
9. Java Programming Examples on Utility Classes
10. Java Programming Examples on Multithreading
11. C++ Programming Examples on Combinatorial Problems & Algorithms
12. C Programming Examples using Recursion
13. C++ Programming Examples on Numerical Problems & Algorithms
14. C Programming Examples on Numerical Problems & Algorithms
15. C# Programming Examples on Strings
16. C# Programming Examples on Matrix
17. C# Programming Examples on Mathematics
18. Engineering Mathematics Questions and Answers
19. C Programming Examples on Matrix
20. Discrete Mathematics Questions and Answers – Trees – Cycles

advertisement

Discrete Mathematics Questions and Answers – Cyclic Groups

« Prev
Next »
This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Cyclic Groups”.

1. An infinite cyclic group does not have a ______ series.

a) AP
b) GP
c) Composite
d) Finite
View Answer

Answer: c
Explanation: Suppose that any finite group of order less than n has a composition series. Let G be a finite group of order n. If G is simple,
then G⊳{e}, where e is the identity element of G and hence, it is a composition series. However, any infinite cyclic group does not have a
composite series.
advertisement

2. Every cyclic group is a/an ______

a) infinite subgroup
b) abelian group
c) monoid
d) commutative semigroup
View Answer

Answer: b
Explanation: Let C be a cyclic group with a generator g∈C. Namely, we have G={g.Let x and y be arbitrary elements in C. Then, there
exists n, m∈Z such that x=gn and y=gm. It follows that x*y = gn*gm = gn+m = gm*gn = yx. Hence, we find that xy=yx for any x,y belongs
to G.Thus, G is an abelian group.

3. What is an irreducible module?

a) A cyclic module in a ring with any non-zero element as its generator
b) A cyclic module in a ring with any positive integer as its generator
c) An acyclic module in a ring with rational elements as its generator
d) A linearly independent module in a semigroup with a set of real numbers
View Answer

Answer: a
Explanation: A nonzero R-module M is irreducible if and only if M is a cyclic module with any nonzero element as its generator. Suppose
that M is an irreducible module. Let a∈M be any nonzero element and consider the submodule (a) generated by the element a. Since a is a
nonzero element, the submodule (a) is non-zero. Since M is irreducible, this implies that M=(a). Hence M is a cyclic module generated by a.
Since a is any nonzero element, the module M is a cyclic module with any nonzero element as its generator.

4. A finite group G of order 219 is __________

a) a semigroup
b) a subgroup
c) a commutative inverse
d) a cyclic group
View Answer

Answer: d
Explanation: The prime factorization 219=3⋅73. By the definition of Sylow’s theorem, determine the number np of Sylow p-group for
p=3,73. np≡1(mod p) and np divides n/p. Thus, n3 could be 1, 4, 7, 10, 13,… and n3 needs to divide 219/3=73. Hence the only possible
value for n3 is n3=1. So there is a unique Sylow 3-subgroup P3 of G. By Sylow’s theorem, the unique Sylow 3-subgroup must be a normal
subgroup of G. Similarly, n73=1, 74,… and n73 must divide 219/73=3 and hence we must have n73=1. Thus, G has a unique normal Sylow
73-subgroup P73.

5. The number of generators of cyclic group of order 219 is __________

a) 144
b) 124
c) 56
d) 218
View Answer

Answer: a
Explanation: The number of generators of a cyclic group of order n is equal to the number of integers between 1 and n that are relatively
prime to n.Namely, the number of generators is equal to ϕ(n), where ϕ is the Euler totient function. We know that G is a cyclic group of
order 219. Hence, the number of generators of G is ϕ(219) = ϕ(3)ϕ(73) = 3⋅73 = 144.
advertisement

6. The order of a simple abelian group is __________

a) infinite
b) real number
c) finite
d) prime
View Answer

Answer: a
Explanation: Let p be the order of g (hence the order of G). As a contradiction, assume that p=ab is a composite number with integers a > 1,
b > 1. Then (ga) is a proper normal subgroup of G. This is a contradiction since G is simple. Thus, p must be a prime number.
Therefore, the order of G is a prime number.

7. The Number of Elements Satisfying g7=e in a finite Group F is ______

a) even
b) not a number
c) odd
d) rational
View Answer

Answer: c
Explanation: Let g≠e be an element in group F such that g7=e. As 7 is a prime number, this yields that the order of g is 7. Consider, the
subgroup (g) is generated by g. As the order of g is 7, the order of the subgroup (g) is 7. Hence, the order must be odd.

8. All the rings of order p2 is ____________

a) associative
b) cyclic
c) inverse
d) commutative
View Answer

Answer: d
Explanation: Let R be a ring with unit 1. Suppose that the order of R is |R|=p2 for some prime number p. Then it has been proven that R is a
commutative ring.
9. An element of a commutative ring R(1≠0) is nilpotent if __________
a) a+1=0
n
b) a = 0, for some positive integer n
n
c) a = 1, for some integer n
2
d) a = 0
View Answer

Answer: b
Explanation: Since a is nilpotent in a commutative ring R, we have an=0 for some positive integer n. since R is commutative, for any m∈R,
we have (am)n=anmn=0. Then we have the following equality: (1−am)(1+(am)+(am)2+⋯+(am)n−1)=1. Hence, 1−am is a unit in R.
advertisement

10. A group G of order 20 is __________

a) solvable
b) unsolvable
c) 1
d) not determined
View Answer

Answer: a
Explanation: The prime factorization of 20 is 20=2⋅5. Let n5 be the number of 5-Sylow subgroups of G. By Sylow’s theorem, we have,
n5≡1(mod 5)and n5|4. Thus, we have n5=1. Let P be the unique 5-Sylow subgroup of G. The subgroup P is normal in G as it is the unique 5-
Sylow subgroup. Then consider the subnormal series G▹P▹{e}, where e is the identity element of G. Then the factor groups G/P, P/{e}
have order 4 and 5 respectively. Hence these are cyclic groups(in particular abelian). Hence, the group G of order 20 has a subnormal series
whose factor groups are abelian groups, and thus G is a solvable group.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Groups – Cosets
» Next - Discrete Mathematics Questions and Answers – Permutation Groups
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Groups – Cosets
Discrete Mathematics Questions and Answers – Permutation Groups
advertisement
advertisement

Recommended Posts:

1. C++ Programming Examples on Numerical Problems & Algorithms

2. C Programming Examples on Numerical Problems & Algorithms
3. Java Programming Examples on Numerical Problems & Algorithms
4. C# Programming Examples on Sorting
5. C Programming Examples using Recursion
 6. Engineering Mathematics Questions and Answers
7. C# Programming Examples on Mathematics
8. Discrete Mathematics Questions and Answers
9. Discrete Mathematics Questions and Answers – Algebraic Laws on Sets
10. Discrete Mathematics Questions and Answers – Properties of Matrices
11. Discrete Mathematics Questions and Answers – Number Theory – Quadratic Residue and Pseudo Prime
12. Digital Communications Questions and Answers – Cyclic Codes and Linear Block Codes
13. Discrete Mathematics Questions and Answers – Number Theory – Primes and Greatest Common Divisors
14. Discrete Mathematics Questions and Answers – Operations on Matrices
15. Discrete Mathematics Questions and Answers – Set Operations – 2
16. Discrete Mathematics Questions and Answers – Number Theory – Prime Numbers
17. Asymmetric Ciphers Questions and Answers – Number Theory – II
18. Discrete Mathematics Questions and Answers – Boolean Algebra – Prime Implicants and Essentials
19. Symmetric Ciphers Questions and Answers – Groups Rings and Fields
20. Discrete Mathematics Questions and Answers – Graph’s Matrices

advertisement

Discrete Mathematics Questions and Answers – Permutation

Groups
« Prev
Next »

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Permutation Groups”.

1. Consider an integer 23 such that 23 >= 3p for a 2p-cycle in a permutation group, then p is ___________
a) odd prime
b) even prime
c) rational number
d) negative prime
View Answer

Answer: a
Explanation: Let n an integer such that n>=3p and m is a 2p-cycle in the permutation group, then p is an odd prime.
advertisement

2. Suppose Km={P∈Sm|, |P| is odd prime}. Determine the set for which m≥3 Km a subgroup of Sm.
a) {3, 5, 7, 11, 13, …}
b) {-14, -8, -3, 0, 3, 8, 14}
c) {2, 4, 6, 8, 10, 12}
d) {12, 25, 56, 78, 134,…}
View Answer

Answer: a
Explanation: Since Km is a subset of Sm, then the set will be {3, 5, 7, 11, 13, …}.
3. The dihedral group having order 6 can have degree _____________
a) 3
b) 26
c) 326
d) 208
View Answer

Answer: a
Explanation: A symmetric group on a set of three elements is said to be the group of all permutations of a three-element set. It is a dihedral
group of order six having degree three.

4. Let (z, *) is a group with x*y=x+y-2 then inverse of x is ___________

a) -(x+4)
2
b) (x +6)
c) (x+y)/5
2
d) (3y+4x )
View Answer

Answer: a
-1
Explanation: Let, Identity element I, x*I = I*x = x ⇒ x = x + I – 2 ⇒ I = 2. Inverse of x is x
-1
Now, x*x = I
-1
⇒x+x –2=2
-1
⇒ x = -(x+4).

5. Let X be a n-square matrix such that Y = X + 8I. Which of the following property will exist?
a) idempotent
b) Y transpose is nilpotent
c) X nilpotent
d) Y inverse
View Answer

Answer: b
Explanation: Suppose, we have a matrix
\(a=\begin{bmatrix}
1 & 0\\
2 & 1\\
2 2
\end{bmatrix} \) then Y will not resulting in Y, hence it is not idempotent, Y is not 0 and so it is not nilpotent. But, as Y is a square
matrix, by the property inverse will exist in this case.
advertisement

6. Suppose, M is a lower triangular matrix with all diagonal entries zero. The resultant matrix of M+I will be ___________
a) idempotent
b) singular
c) nilpotent
d) inverse
View Answer

Answer: b
Explanation: Since, M is a lower triangular matrix with diagonal elements zero, then we add I and it will result in a lower triangular matrix
with all diagonal entries 1. Thus, all eigenvalues M+I are non zero (eigenvalues of triangular matrix is the diagonal elements). So,
determinant will never be zero. Hence, the matrix can have inverse property.

98 97
7. If Y (a raised to the power of 5) = 0 and Y is a 97-square matrix. Determine the value of Y .
a) I+Y
b) -Y+3
c) 0
2
d) Y
View Answer

Answer: c
Explanation: Question does not provide any notion of existing an inverse property or related to rank matrix. Hence, by considering zero
matrix as Y and that satisfy all the constraints.

th th
8. If 54 row of a 67 row matrix is linearly independent with each other then find the rank of the matrix.
a) 61
b) 54
c) 187
d) 32
View Answer

Answer: b
th th
Explanation: If k row of a matrix with n row is linearly independent then the rank of that matrix is k. If we take the transpose of a matrix
the rank does not change. Hence, the answer is 54 in this case.

k
9. Let M be an 4×4 matrix with real entries such that M =0, for some k≥1. Find the determinant value of (I+M), where, I be the 4 x 4
identity matrix.
a) 72
b) 1
c) 4
d) 36
View Answer

Answer: b
4
Explanation: By cayley hamilton theorem, M = 0. So, characteristic equation should be λ*4=0 and after solving we get 0 for every eigen
value. Eigen values of (I+M) = Individual Eigen value of 1+m. So all the eigen values of (I+M) are 1 and Det(I+A) = 1.
advertisement

10. Suppose (2, 5, 8, 4) and (3, 6) are the two permutation groups that form cycles. What type of permutation is this?
a) odd
b) even
c) acyclic
d) prime
View Answer

Answer: b
Explanation: There are four permutations (2, 5), (2, 8), (2, 4) and (3, 6) and so it is an even permutation.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Cyclic Groups
» Next - Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Cyclic Groups
Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
advertisement
advertisement

Recommended Posts:

1. C Programming Examples on Mathematical Functions

2. Programming Questions and Answers
3. C++ Programming Examples on Combinatorial Problems & Algorithms
4. Java Algorithms, Problems & Programming Examples
5. C++ Programming Examples on STL
6. Java Programming Examples on Combinatorial Problems & Algorithms
7. Signals & Systems Questions and Answers
8. C Programming Examples using Recursion
9. Numerical Methods Questions and Answers
10. C Programming Examples on Combinatorial Problems & Algorithms
11. Java Programming Examples on Mathematical Functions
12. Java Programming Examples on Numerical Problems & Algorithms
13. C++ Programming Examples on Numerical Problems & Algorithms
14. C Programming Examples on Numerical Problems & Algorithms
15. Engineering Mathematics Questions and Answers
16. C# Programming Examples on Mathematics
17. Java Programming Examples on Arrays
18. C Programming Examples on Matrix
19. C# Programming Examples on Matrix
20. Discrete Mathematics Questions and Answers

advertisement

Discrete Mathematics Questions and Answers – Groups – Burnside

Theorem
« Prev

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Groups – Burnside Theorem”.
1. Which of the following is not an abelian group?
a) semigroup
b) dihedral group
c) trihedral group
d) polynomial group
View Answer

Answer: b
2
Explanation: The dihedral group(Dih4) of order 8 is a non-abelian p-group. But, every group of order p must be abelian group.
advertisement

2. If we take a collection of {∅, {2}, {3}, {5}} ordered by inclusion. Which of the following is true?
a) isomorphic graph
b) poset
c) lattice
d) partially ordered set
View Answer

Answer: b
Explanation: This is a poset. Since {2}, {3} and {5} have no common upper bound, it is not a lattice.

3. _______ characterizes the properties of distributive lattices.

a) Congruence Extension Property
b) Algebraic extension property
c) Poset
d) Semigroup
View Answer

Answer: b
Explanation: An algebra A describes the congruence extension property (CEP) if for every B≤A and θ∈Con(B) there exists a φ∈Con(A)
such that θ = φ∩(B×B). A class M of algebras has the CEP if every algebra in the class has the CEP. The Congruence Extension Property
specifically characterizes the distributive lattices among all lattices.

4. Suppose that H be an X-set and suppose that a∼b and |Xa|=|Xb|, the which of the following is true?
a) Xa is powerset of Xb
b) Xa is isomorphic to Xb
c) Xa is homomorphic to Xb
d) Xb is the subset of Xa
View Answer

Answer: b
Explanation: According to Burnside theorem, Xa is isomorphic to Xb and in particular |Xa|=|Xb|.

5. If he 4 sides of a square are to be colored by colors. How many different colourings with 50 colours are there if two arrangements that can
be obtained from each other by rotation are identical?
a) 773762
b) 363563
c) 4536822
d) 1563150
View Answer
Answer: d
4 2
Explanation: There are m + m + 2m elements after performing all rotations. Dividing this by the number of transformations 4 produces
the desired number of distinct colorings \(\frac{m^4 + m^2 + 2m}{4}\). Hence, the number of distinct colorings with 50 colors is 1563150.
advertisement

6. Let H be a finite group. The order of Sylow p-subgroup of H for every prime factor p with multiplicity 9 is?
a) p+6
9
b) p
p
c) p
2
d) 3!*p
View Answer

Answer: b
9
Explanation: We know that, for a finite group H, there exists a Sylow p-subgroup of H having order p for every prime factor p with
multiplicity 9.

7. How many indistinguishable necklaces can be made from beads of 4 colors with exactly 9 beads of each color where each necklace is of
length 16?
a) 76967234
b) 5652209
c) 14414400
d) 8686214
View Answer

Answer: c
Explanation: If B is the set of all possible permutations of these 16 beads, then the required answer is |B| = 16!/(9!)4 = 14414400.

8. Invariant permutations of two functions can form __________

a) groups
b) lattices
c) graphs
d) rings
View Answer

Answer: a
Explanation: Suppose, there are two functions f1 and f2 which belong to the same equivalence class since there exists an invariant
permutation say, π(a permutation that does not change the object itself, but only its representation), such that: f2*π≡f1. So, invariant
permutations can form a group, as the product (composition) of invariant permutations is again an invariant permutation.

9. Suppose P(h) is a group of permutations and identity permutation(id) belongs to P(c). If ϕ(c)=c then which of the following is true?
-1
a) ϕ ∈P(h)
-1
b) ϕ ∈P(h)
-1
c) ϕ ∈P(h)
-1
d) ϕ ∈P(h)
View Answer

Answer: b
Explanation: Let, ϕ and σ both can fix h, then we can have ϕ(σ(h)) = ϕ(h) = h. Hence, ϕ∘σ fixes h and ϕ∘σ∈P(h). Now, all colorings can be
-1 -1 -1
fixed by the identity permutation. So id∈P(h) and if ϕ(h) = h then ϕ (h) = ϕ (ϕ(h)) = id(h) = h which implies that ϕ ∈P(h).
advertisement
10. An isomorphism of Boolean algebra is defined as _______
a) order isomorphism
b) unordered isomorphism
c) order homomorphism
d) hyper-morphism
View Answer

Answer: a
Explanation: We know that very σ-complete Boolean algebra is a Boolean algebra. An isomorphism of Boolean algebras is termed as an
order isomorphism. All meets and joins present in an order isomorphism domain is preserved. Hence, a Boolean algebra isomorphism
preserves all meets and joins in its domain.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!

Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Discrete Mathematics Questions and Answers – Permutation Groups
Categories Discrete Mathematics MCQs Post navigation
Discrete Mathematics Questions and Answers – Permutation Groups
Best Reference Books – Development of Human Resources
advertisement
advertisement

Recommended Posts:

1. CSS Questions and Answers

2. C++ Programming Examples on STL
3. Java Programming Examples on Collections
4. Data Structures & Algorithms II – Questions and Answers
5. Java Programming Examples on Combinatorial Problems & Algorithms
6. C++ Programming Examples on Combinatorial Problems & Algorithms
7. C Programming Examples on Combinatorial Problems & Algorithms
8. Engineering Mathematics Questions and Answers
9. C# Programming Examples on Mathematics
10. Discrete Mathematics Questions and Answers – Boolean Algebra – Interconversion of Gates
11. Discrete Mathematics Questions and Answers – Cryptography – Ciphers
12. Symmetric Ciphers Questions and Answers – Groups Rings and Fields
13. Discrete Mathematics Questions and Answers – Cryptography – Decryption
14. Discrete Mathematics Questions and Answers – Group Theory
15. Discrete Mathematics Questions and Answers – Relations – Partial Orderings
16. Discrete Mathematics Questions and Answers – Planarity, Degree and Coloring of Graph
17. Discrete Mathematics Questions and Answers – Discrete Probability – Bayes Theorem
18. Discrete Mathematics Questions and Answers – Boolean Algebra
19. Discrete Mathematics Questions and Answers – Group Axioms
20. Discrete Mathematics Questions and Answers
 advertisement

Best Reference Books – Development of Human Resources

« Prev
Next »

We have compiled a list of Best Reference Books on Development of Human Resources Subject. These books are used by students of top
universities, institutes and colleges.

Here is the full list of best reference books on Development of Human Resources.

We have put a lot of effort into researching the best books for reference on this subject and came out with a recommended list of best books.
The table below contains a review of these books and links to the Amazon website to directly purchase these books. As an Amazon
Associate, we earn from qualifying purchases, but this does not impact our reviews, comparisons, and listing of these books; the table serves
as a ready reckoner list of these best books.

advertisement

1. “Human Resource Development” by Jon M Werner and Randy L DeSimone

2. “Human Resource Management (CAIIB 2010)” by IIBF (Indian Institute of Banking and
Finance)

3. “Human Resource Development” by Mankin

4. “Predictive Analytics for Human Resources” by Jac Fitz-Enz and John R Mattox II

5. “Strategic Human Resource Development: Concepts and Practices” by Prasad

6. “Human Resource Development” by Srividhya Lalitha

7. “Human Resources Development” by Balyan

8. “Reading In Human Resource Development” by Rao T V

9. “Human Resource Development” by S Yuvaraj

10. “International Human Resource Development: Learning, Education and Training for
Individuals and Organizations” by John P Wilson

People who are searching for Free downloads of books and free pdf copies of these books – “Human Resource Development” by Jon M
Werner and Randy L DeSimone, “Human Resource Management (CAIIB 2010)” by IIBF (Indian Institute of Banking and Finance),
“Human Resource Development” by Mankin, “Predictive Analytics for Human Resources” by Jac Fitz-Enz and John R Mattox II, “Strategic
Human Resource Development: Concepts and Practices” by Prasad, “Human Resource Development” by Srividhya Lalitha, “Human
Resources Development” by Balyan, “Reading In Human Resource Development” by Rao T V, “Human Resource Development” by S
Yuvaraj, “International Human Resource Development: Learning, Education and Training for Individuals and Organizations” by John P
Wilson – we would like to mention that we don’t have free downloadable pdf copies of these good books and one should look for free pdf
copies from these Authors only if they have explicitly made it free to download and read them.

We have created a collection of best reference books on “Development of Human Resources” so that one can readily see the list of top
books on “Development of Human Resources” and buy the books either online or offline.

If any more book needs to be added to the list of best books on Development of Human Resources Subject, please let us know.

advertisement

Sanfoundry Global Education & Learning Series – Best Reference Books!

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Best Reference Books – Construction Economics and Finance
» Next - Best Reference Books – Development Communication
Categories Best Books Post navigation
Discrete Mathematics Questions and Answers – Groups – Burnside Theorem
Best Reference Books – Development Communication
advertisement
advertisement

Recommended Posts:

1. Statistical Quality Control Questions and Answers

2. Engineering Drawing Questions and Answers
3. Hadoop Questions and Answers
4. Drug and Pharmaceutical Biotechnology Questions and Answers
5. SAN – Storage Area Networks Questions & Answers
6. Hazardous Waste Management Questions and Answers
7. Database Management System Questions and Answers
8. Compilers Questions and Answers
9. Highway Engineering Questions and Answers
10. JUnit Questions and Answers
11. Embedded System Questions and Answers
12. Software Engineering Questions & Answers
13. Cloud Computing Questions and Answers
14. Operating System Questions and Answers
15. SQL Server Questions and Answers
16. IOT Questions and Answers
17. Linux Questions and Answers
18. Energy & Environment Management Questions and Answers
19. Best Reference Books – Technology, Engineering and Sciences
20. Human Anatomy and Physiology Questions and Answers

advertisement
Best Reference Books – Development Communication
« Prev
Next »

We have compiled a list of Best Reference Books on Development Communication Subject. These books are used by students of top
universities, institutes and colleges.

Here is the full list of best reference books on Development Communication.

We have put a lot of effort into researching the best books for reference on this subject and came out with a recommended list of best books.
The table below contains a review of these books and links to the Amazon website to directly purchase these books. As an Amazon
Associate, we earn from qualifying purchases, but this does not impact our reviews, comparisons, and listing of these books; the table serves
as a ready reckoner list of these best books.

advertisement

1. “Development Communication: Theory and Practice” by Uma Narula

2. “Communication for Development: Theory and Practice for Empowerment and Social
Justice” by Srinivas Raj Melkote

3. “Development Communication” by Dipankar Sinha

4. “Education And Communication For Development” by Dahama O P

5. “The Quick And Easy Way To Effective Speaking” by Dale Carnegie

6. “Communication Skills” by Sanjay Kumar and Pushp Lata

7. “Public Speaking Essentials: Six Steps to Sizzle on Stage” by Ramakrishna Reddy

8. “Public Speaking Essentials: Six Steps to Sizzle on Stage” by Ramakrishna Reddy

9. “Language Use and Mode of Communication in Community Development” by imusti

10. “Sustainable Development and Green Communication: African and Asian Perspectives”
by imusti

People who are searching for Free downloads of books and free pdf copies of these books – “Development Communication: Theory and
Practice” by Uma Narula, “Communication for Development: Theory and Practice for Empowerment and Social Justice” by Srinivas Raj
Melkote, “Development Communication” by Dipankar Sinha, “Education And Communication For Development” by Dahama O P, “The
Quick And Easy Way To Effective Speaking” by Dale Carnegie, “Communication Skills” by Sanjay Kumar and Pushp Lata, “Public
Speaking Essentials: Six Steps to Sizzle on Stage” by Ramakrishna Reddy, “Public Speaking Essentials: Six Steps to Sizzle on Stage” by
Ramakrishna Reddy, “Language Use and Mode of Communication in Community Development” by imusti, “Sustainable Development and
Green Communication: African and Asian Perspectives” by imusti – we would like to mention that we don’t have free downloadable pdf
copies of these good books and one should look for free pdf copies from these Authors only if they have explicitly made it free to download
and read them.

We have created a collection of best reference books on “Development Communication” so that one can readily see the list of top books on
“Development Communication” and buy the books either online or offline.

If any more book needs to be added to the list of best books on Development Communication Subject, please let us know.

advertisement

Sanfoundry Global Education & Learning Series – Best Reference Books!

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with
latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Best Reference Books – Development of Human Resources
» Next - Best Reference Books – Desktop Publishing Tools
Categories Best Books Post navigation
Best Reference Books – Development of Human Resources
Best Reference Books – Desktop Publishing Tools
advertisement
advertisement

Recommended Posts:

1. Probability and Statistics Questions and Answers

2. Casting, Forming & Welding I Questions and Answers
3. Agricultural Engineering Questions and Answers
4. Wireless & Mobile Communications Questions & Answers
5. Recruitment Support Service – Employers
6. Discrete Mathematics Questions and Answers
7. Bioprocess Engineering Questions and Answers
8. Microwave Engineering Questions and Answers
9. VLSI Questions and Answers
10. Aircraft Maintenance Questions and Answers
11. Avionics Questions and Answers
12. Electromagnetic Theory Questions and Answers
13. Microcontroller Questions and Answers
14. Automata Theory Questions and Answers
15. Optical Communications Questions and Answers
16. Cryptography and Network Security Questions and Answers
17. Best Reference Books – Technology, Engineering and Sciences
18. Electronics & Communication Engineering Questions and Answers
19. Digital Communication Questions and Answers
20. Professional Communication Questions & Answers

advertisement
 Discrete Mathematics MCQS
1. A collection of graph is:
A. row and coloumn
B. Equation
C. vertices and columns
D. None of above
Ans: C
2. The number of edges in a complete graph with ‘n’ vertices is equal to:
A. 2n-1
B. n(n-1)
C. n^2
D. n(n-1)/2
Ans: D
3. Error correcting code is a _____:
A. hamming code
B. gray code
C. error deducting code
D. none of above
Ans: A
4. ordered collection of objects is:
A. Relation
B. set
C. proposition
D. Function
Ans: B
5. A function is a Domain of:
A. it is set of natural numbers for which a function is defined
B. the maximal set of numbers for which a function is defined
C. the maximal set of numbers which a function can take values
D. none of above
Ans: B
6. Range of a function is :
A. the maximal set of numbers for which a function is defined
B. the maximal set of numbers which a function can take values
C. it is set of natural numbers for which a function is defined
D. none of above
Ans: B
7. In an undirected graph the number of nodes with odd degree must be:
A. odd
B. prime
C. even
D. zero
Ans: C
8. What is the cardinality of the set of odd positive integers less than 10?
A. 5
B. 10
 C. 3
D. 20
Ans: A
9. If P then Q is called _________ statement
A. Conjunction
B. disjunction
C. conditional
D. bi conditional

Ans: C
10. (P≥Q)≥ (⋀Q) is __________.
A. not a well formed formula
B. tautology
C. contradiction
D. well formed formula
Ans: A
11. A relation R in a set X is symmetric if ________.
A. xRy, yRz ≥xRz.
B. xRy
C. xRy≥yRx
D. xRx
Ans: C
12. If a relation is reflexive, then all the diagonal entries in the relation matrix
must be________.
A. 0
B. 1
C. 2
D. -1
Ans: B
13. If R is reflexive, symmetric and transitive then the relation is said to be
________.
A. Binary relation
B. Compatibility relation
C. Equivalence relation
D. Partial order relation
Ans: C
14. A finite non-empty set of symbols is called _________.
A. alphabet
B. letter
C. string
D. language
Ans: A
15. Surjective function is also called ________.
A. onto
B. into
C. one to one
 D. one one onto
Ans: A
16. One to one onto function is also called __________.
A. bijective
B. injective
C. surjective
D. composite function
Ans: A
17. The composition of function is associative but not _______.
A. commutative
B. associative
C. distributive
D. idempotent
Ans: A
18. A mapping x into itself is called __________.
A. reflexive
B. symmetric
C. transitive
D. equivalence
Ans: A
19. The duality law of (P∧Q)∨T is ________.
A. (P⋀Q)∧T
B. (P∨Q)∧T
C. (P∨Q)∨F
D. (P∨Q)∧F
Ans: D
20. Min-terms of two statements are formed by introducing the connective
_________.
A. Conjunction
B. disjunction
C. Conditional
D. negation
Ans: A
21. Any vertex having degree one is called _______.
A. Simple vertex
B. pendent vertex
C. regular vertex
D. complete vertex
Ans: B
22. A graph that has neither self loops nor parallel edges is called_____graph.
A. regular
B. simple
C. complete
D. null
Ans: B
23. A graph in which every vertex has same degree is called _________graph.
 A. regular
B. simple
C. complete
D. null
Ans: A
24. Kn denotes _______graph.
A. regular
B. simple
C. complete
D. null
Ans: C
25. The number of vertices of odd degree in a graph is always________.
A. odd
B. even
C. zero
D. one
Ans: B
26. A path of a graph is said to be ______ if it contains all the edges of the graph.
A. eulerian
B. hamiltonian
C. tournament
D. planar
Ans: A
27. Traveling salesman problem is example for_______graph.
A. eulerian
B. hamiltonian
C. tournament
D. planar
Ans: B
28. If a node v is reachable from node u then the path of minimum length u to v
is called _____.
A. reachability
B. node base
C. geodesic
D. accessibility
Ans: C
29. The eccentricity of a center in a tree is defined as ______ of the tree.
A. radius
B. diameter
C. length
D. path
Ans: A
30. P ≥ Q , Q ≥R then________.
A. P ≥ R
B. R ≥P
C. Q
 D. R
Ans: A
31. If a normal form contains all minterms, then it is ________.
A. a tautology
B. a contradiction
C. a contingency
D. both a and b
Ans: A
32. Max-terms of two statements are formed by introducing the connective
_________.
A. disjunction
B. conjunction
C. negation
D. conditional
Ans: A
33. The Subset relation on a set of sets is ________.
A. partial ordering
B. equivalence relation
C. reflexive and symmetric only
D. symmetric and transitive only
Ans: A
34. A relation R is defined on the set of integers as xRy if and only if (x+y) is
even. Which of the following statement is TRUE?
A. R is not an equivalence relation.
B. R is an equivalence relation having one equivalence classes
C. R is an equivalence relation having two equivalence classes
D. R is an equivalence relation having three equivalence classes
Ans: C
35. If R = {(1, y), (1, z), (3, y)} then R power (-1)= ___________.
A. {(1, a), (y, z)}
B. {(y, 1), (z, 1), (y, 3)}
C. {(y, a), (1, z), (3, y)}
D. {(y, a), (z, a), (3, y)}
Ans: B
36. Let R ={ (a,b),(c,d),(b,b)}, S = {(d,b),(c,b),(a,d)} then R composite S =
___________
A. {(a,e),(c,b),(b,e)}
B. {(d,b),(c,b),(a,d)}
C. {(a,b),(b,b)}
D. {(c,b)}
Ans: D
37. The number of relations from A = {a,b,c} to B = {1,2} are __________.
A. 6
B. 8
C. 32
D. 64
 Ans: D
38. The minimum number of edges in a connected graph with n vertices is
___________.
A. n
B. n-1
C. n+1
D. n+2
Ans: B
39. The number of distinct simple graphs with up to three nodes is _________.
A. 7
B. 9
C. 15
D. 25
Ans: A
40. A graph is planar if and only if it does not contain ________.
A. subgraphs homeomorphic to k3 & k3,3
B. subgraphs isomorphic to k5 or k3,3
C. subgraphs isomorphic to k3 & k3,3
D. sub graphs homeomorphic to k5 or k3,3
Ans: D
41. Maximum number of edges in an n-node undirected graph without self loops
is ____.
A. [n(n-a)]/2
B. n-1
C. n
D. [n(n+a)]/2
Ans: A
42. Number of distinct nodes in any elementary path of length p is ________.
A. p
B. p-1
C. p+1
D. p*1
Ans: C
43. The total number of edges in a complete graph of n vertices is _________.
A. n
B. n/2
C. [n(n-a)]/3
D. [n(n-a)]/2
Ans: D
44. A directed complete graph of n vertices contains __________.
A. one arrow between each pair of distinct vertices
B. two arrows between each pair of distinct vertices
C. n-1 arrows between each pair of distinct vertices
D. path between every two distinct vertices
Ans: A
45. A directed graph G = (V, E) is said to be finite if its ________.
 A. set V of vertices is finite
B. set V of vertices & set E of edges are finite
C. set E of edges are finite
D. no vertices & edges are repeated
Ans: A
46. A state from which a deterministic finite state automata can never come out is
called a ____________.
A. trape state
B. starting symbol
C. transition table
D. transition diagram
Ans: A
47. If a compound statement is made up of three simple statements then the
number of rows in the truth table is _______.
A. 2
B. 4
C. 6
D. 8
Ans: D
48. Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a
relation on the set A = {3, 6, 9, 12}. The relation is _________
A. reflexive and transitive
B. reflexive and symmetric
C. symmetric and transitive
D. equivalence relation
Ans: D
49. Let R={(1,b),(3,d),(2,b)} and S={(b,4),(2,5),(d,a)} be a relation then R
composition S=____.
A. {(1,b),(3,d),(2,b)}
B. {(1,4),(3,a),(2,4)}
C. {(4,b),(2,5),(3,a)}
D. {(1,d),(3,b),(2,c)}
Ans: B
50. If R= {(x, 2x)} and S= {(x, 4x)} then R composition S=____.
A. {(x, 4x)}
B. {(x, 2x)}
C. {(x, 8x)}
D. {(x, 10x)}
Ans: C
51. If R= {(x, 2x)} and S= {(x, 5x)} then R composition S=____.
A. {(x, 4x)}
B. {(x, 2x)}
C. {(x, 8x)}
D. {(x, 10x)}
Ans: D
52. Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A={1, 2,
 3, 4}. The relation R is ____.
A. transitive
B. reflexive
C. not symmetric
D. function
Ans: C
53. The NOR statement is a combination of ________.
A. NOT and AND
B. NOT and OR
C. AND and OR
D. NOT or OR
Ans: B
54. If a relation is reflexive then in the graph of a relation there must be a loop at
_____.
A. each node
B. only first node
C. any two nodes
D. only first and last nodes
Ans: A
55. Which of the following traversal techniques lists the nodes of binary search in
ascending order?
A. pre order
B. post order
C. in order
D. root order
Ans: C
56. The rank of the incidence matrix of any connected graph G with n vertices is
______.
A. n
B. n+1
C. n-1
D. n-2
Ans: C
57. The number of 1's in each row of an incidence matrix of a graph G is equal to
_____.
A. the degree of the corresponding vertices
B. the sum of degrees of all vertices
C. the degree of the initial vertex
D. the degree of the terminal vertex
Ans: A
58. Each column of an incidence matrix of a graph G has exactly _______.
A. one 1's
B. two 1's
C. one 2's
D. two 2's
Ans: B
59. An undirected graph is tripartite if and only if it has no circuits of _______
lengths
A. odd
B. even
C. distinct
D. equal
Ans: A
60. A graph is bipartite if and only if its chromatic number is ________.
A. 1
B. 2
C. odd
D. even
Ans: B
61. The number of pendant vertices in a full binary tree with n vertices is
________.
A. (n-a)/2
B. (n-1)/2
C. (n+a)/2
D. n/2
Ans: C
62. The number of vertices in a full binary tree is _______.
A. odd
B. even
C. equal
D. 0
Ans: A
63. A binary tree with 2k vertices of level k has at least _______ vertices.
A. 2 power k
B. 2 power (k-1)
C. 2 power (k-1)-1)
D. 2 power (k+1)-1
Ans: D
64. For a symmetric digraph, the adjacency matrix is _________.
A. symmetric
B. antisymmetric
C. asymmetric
D. symmetric and asymmetric
Ans: A
65. The total number of degrees of an isolated node is _______.
A. 0
B. 1
C. 2
D. 3
Ans: A
66. If G is a connected planar graph then it has a vertex of degree _______.
A. 3 or less
 B. 4 or less
C. 5 or less
D. 6 or less
Ans: C
67. A product of the variable and their negation in a formula is called ________.
A. an elementary sum
B. an elementary product
C. a well-formed formula
D. an equivalence of relation formula
Ans: B
68. A formula consisting of disjunctions of min-terms is called _________.
A. DNF
B. CNF
C. PDNF
D. PCNF
Ans: C
69. The less than relation < on real is __________.
A. a partial ordering since it is asymmetric and reflexive
B. a partial ordering since it is anti-symmetric and reflexive
C. not a partial ordering since it is not asymmetric and not reflexive
D. not a partial ordering since it is not anti-symmetric and not reflexive
Ans: D
70. A relation R in X is said to be a ________, if it is reflexive and symmetric.
A. void relation
B. circular
C. partial order relation
D. compatibility relation
Ans: D
71. The set X*X itself defines a relation in X is called a _____relation.
A. void
B. universal
C. partial
D. equivalence
Ans: B
72. A self complemented distributive lattice is called _______.
A. boolean algebra
B. modular lattice
C. complete lattice
D. self dual lattice
Ans: A
73. Every finite subset of a lattice has ____________.
A. a Least Upper Bound and Greatest Lower Bound
B. many Least Upper Bounds and a Greatest Lower Bound
C. many Least Upper Bounds and many Greatest Lower Bounds
D. either some Least Upper Bounds or some Greatest Lower Bounds
Ans: A
 A formula consisting of conjunctions of max-terms is called _________.
A. DNF
B. CNF
C. PCNF
D. PDNF
Ans: C
74. The set of all divisors of 24 are ___________.
A. {1, 2, 3, 4, 6, 8, 12, 24}
B. {2, 3, 4, 6, 8, 12}
C. {1, 3, 6, 12,}
D. {2, 4, 6, 8}
Ans: A
75. In a bounded lattice, an element b belongs to L is called a complement of an
element a belongs to L if ______.
A. a*b=0
B. a+b=1
C. both a and b
D. none
Ans: C
76. If each non-empty subset of a lattice has a least upper bound and greatest
lower bound then the lattice
is called ________.
A. complete
B. associative
C. absorption
D. commutative
Ans: A
77. A __________ is a complemented distributive lattice.
A. boolean homomorphism
B. boolean algebra
C. boolean isomorphism
D. boolean function
Ans: D
78. Every connected graph contains a ________.
A. tree
B. sub tree
C. spanning tree
D. spanning subtree
Ans: C
79. A minimal non-empty edge cut of G is called a _________.
A. bond
B. cycle
C. path
D. tour
Ans: A
80. A connected graph that has no cut vertices is called a ________.
 A. block
B. bond
C. cycle
D. tour
Ans: A
81. A graph is Eulerian if it contains __________.
A. Euler tour
B. Euler trail
C. Hamiltonian path
D. Euler path
Ans: A
82. Hamilton cycle is a cycle that contains every ________of G.
A. path
B. cycle
C. vertex
D. edge
Ans: C
83. A set containing no element is called ____________.
A. null set
B. finite set
C. infinite
D. equal set
Ans: A
84. A = {1,3,5,7,9} is a __________.
A. null set
B. finite set
C. singleton set
D. infinite set
Ans: B
85. The number of Indians in the world is _________.
A. finite set
B. universal set
C. infinite set
D. equal set
Ans: A
86. If in the truth table the answer column has the truth values both TRUE and
FALSE then it is said to be________.
A. tautology
B. contradiction
C. contingency
D. equivalence relation
Ans: C
87. To prove the statement P tautologically implies the statement Q, it is enough
to prove that _________.
A. P conditional Q is a contradiction
B. P conditional Q is a tautology
 C. P biconditional is a contradiction
D. P biconditional Q is a tautology
Ans: B
88. To prove the statement P is tautologically equivalent to the statement Q, it is
enough to prove that _______.
A. P conditional Q is a contradiction
B. P conditional Q is a tautology
C. P biconditional Q is a contradiction
D. P biconditional Q is a tautology
Ans: D
89. Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R
composite S=____.
A. {(1,5),(3,3),(2,6)}
B. {(1,5),(3,6),(2,5)}
C. {(4,4),(2,5),(3,3)}
D. {(1,1),(3,3),(2,2)}
Ans: A
90. The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______.
A. reflexive, not symmetric, transitive
B. not reflexive, symmetric, transitive
C. reflexive, symmetric, not transitive
D. reflexive, not symmetric, not transitive
Ans: B
91. There are only five distinct Hasse diagrams for partially ordered sets that
contain _______elements.
A. 2
B. 3
C. 4
D. 6
Ans: B
92. If an edge e is said to join the vertices u and v then the vertices u and v are
called __.
A. initial vertices
B. terminal vertices
C. ends of e
D. all the above
Ans: B
93. Edges intersect only at their ends are called ________.
A. planar
B. loop
C. link
D. non plannar
Ans: B
94. Two vertices which are incident with the common edge are called
______________vertices.
A. distinct
 B. directed
C. adjacent
D. loops
Ans: C
95. An edge with identical ends is called _________.
A. complete graph
B. bipartite graph
C. loops
D. link
Ans: C
96. An edge with same ends is called ___________.
A. complete graph
B. bipartite graph
C. loops
D. link
Ans: D
97. In a graph if few edges have directions and few do not have directions then
the graph is called_________.
A. multi graph
B. directed graph
C. undirected graph
D. mixed graph
Ans: D
98. If two edges have same vertices as its terminal vertices those edges are called
____.
A. parallel
B. adjacent
C. incident
D. distinct
Ans: A
99. The graph defined by the vertices and edges of a __________ is bipartite.
A. square
B. cube
C. single
D. both square and cube
Ans: B
100. To any graph G there corresponds a vertex in a matrix called
________matrix.
A. incidence
B. adjacency
C. square
D. null
Ans: A
101. If H is a sub graph of G then G is a ______ of H.
A. proper sub grapth
B. inducted sub graph
 C. spanning subgraph
D. super graph
Ans: D
102. If the graph G1 and G2 has no vertex in common then it is said to be ______.
A. disjoint
B. edge disjoint
C. union
D. intersection
Ans: A
103. The degree of vertex v in G is __________.
A. number of edges of G incident with v
B. number of loops in G
C. number of links in G
D. number of sub graph in G
Ans: A
104. Each loop counting has _________ edges.
A. 1
B. 2
C. 3
D. 4
Ans: B
105. The negation of the statement is formed by introducing ___________.
A. not
B. and
C. or
D. if
Ans: A
106. A __________ is an ordered collection of objects.
a) Relation
b) Function
c) Set
d) Proposition
Ans: C
107. Power set of empty set has exactly _________ subset.
a) One
b) Two
c) Zero
d) Three
Ans: A
108. What is the Cartesian product of A = {1, 2} and B = {a, b}?
a) {(1, a), (1, b), (2, a), (b, b)}
b) {(1, 1), (2, 2), (a, a), (b, b)}
c) {(1, a), (2, a), (1, b), (2, b)}
d) {(1, 1), (a, a), (2, a), (1, b)}
Ans: C
109. The bit string for the set {2, 4, 6, 8, 10} (with universal set of natural numbers
 less than or equal to 10) is ____________________
a) 0101010101
b) 1010101010
c) 1010010101
d) 0010010101
Ans: A
110. The set difference of the set A with null set is __________
a) A
b) null
c) U
d) B
Ans: A
111. The shaded area of figure is best described by

a) A‘ (Complement of A)
b) B – (A ∩ B) – (C ∩ B)
c) A ∩ C ∩ B
d) B’ (Complement of B)
Ans: B
112. The relation between sets A,B,C as shown by venn diagram is
a) A is subset of B and B is subset of C
b) C is not a subset of A and A is subset of B
c) C is subset of B and B is subset of A
d) None of the mentioned
Ans: C
113. Let A : All badminton player are good sportsperson.
B: All person who plays cricket are good sportsperson.
Let X denotes set of all badminton players, Y of all cricket players, Z of all
good sportsperson. Then which of the following statements is correct?
a) Z contains both X and Y
b) Z contains X and Y is outside
c) X contains Y and Z
d) None of the mentioned
Ans: A
114. In the given figure the if n(A)=20,n(U)=50,n(C)=10 and n(A∩B)=5 then
n(B)=? .

a) 35
b) 20
 c) 30
d)10
Ans: A Explanation: Here n(B)= n(U) – n(A) + n(A∩B
115. The shaded area of figure is best described by

a)A‘ (Complement of A)
b) A U B – (A ∩ B)
c) A – B
d) B
Ans: B
116. If set A has 3 elements then number of elements in A X A X A are
a) 9
b) 27
c) 6
d)19
Ans: B
117. The set containing all the collection of subsets is known as
a) Subset
b) Power set
c) Union set
d) None of the mentioned
Ans: B
118. State whether the given statement is true or false
The number of subsets of a set can be odd or even.
a) True
b) False
Ans: A
119. A drawer contains 12 red and 12 blue socks, all unmatched. A person takes
socks out at random in the dark. How many socks must he take out to be sure
that he has at least two blue socks?
a) 18
b) 35
c) 28
d) 14
Ans: D Explanation: Given 12 red and 12 blue socks so, in order to take out at least 2
blue socks, first we need to take out 12 shocks (which might end up red in worst
case) and then take out 2 socks (which would be definitely blue). Thus we need to
take out total 14 socks.
120. The least number of computers required to connect 10 computers to 5 routers
to guarantee 5 computers can directly access 5 routers is ______
a) 74
 b) 104
c) 30
d) 67
Ans: C Explanation: Given 12 red and 12 blue socks so, in order to take out at least 2
blue socks, first we need to take out 12 shocks (which might end up red in worst
case) and then take out 2 socks (which would be definitely blue). Thus we need to
take out total 14 socks.
121. A bag contains 25 balls such as 10 balls are red, 7 are white and 8 are blue.
What is the minimum number of balls that must be picked up from the bag
blindfolded (without replacing any of it) to be assured of picking at least one
ball of each colour?
a) 10
b) 18
c) 63
d) 35
Ans: B
Explanation: Consider three buckets red, white and blue and we want the total
number of balls such that each bucket contain at least one ball. Now consider the
state of picking up a ball without replacement : (normally you consider the worst
case scenario in these cases) Starting 10 balls all are red and thus goes to bucket
name Red. Now again picking up the ball gives 7 balls which are of same colour
and put all of them in bucket named White. The next pick will definitely be of
different colour thus: we picked 10 + 7 + 1 = 18.
122. The number of binary strings of 17 zeros and 8 ones in which no two ones are
adjacent is ___________
a) 43758
b) 24310
c) 32654
d) 29803
Ans: A
Explanation: First place 17 zeroes side by side _ 0 _ 0 _ 0 … 0 _ and 8 1’s can be
placed in any of the (17+1) available gaps hence the number of ways = n+1Ck =
43758.
123. How many words that can be formed with the letters of the word
‘SWIMMING’ such that the vowels do not come together? Assume that
words are of with or without meaning.
a) 430
b) 623
c) 729
d) 1239
Ans: C
Explanation: The word ‘SWIMMING contains 8 letters. Of which, I occurs twice
and M occurs twice. Therefore, the number of words formed by this word
= 8!/2!∗2! = 10080. In order to find the number of permutations that can be
formed where the two vowels I and I come together, we group the letters that
should come together and consider that group as one letter. So, the letters are
 S,W,M,M,N,G, (I,I). So, the number of letters are 7 the number of ways in which
7 letters can be arranged is 7! = 5040. In I and I, the number of ways in which I
and I can be arranged is 2!. Hence, the total number of ways in which the letters of
the ‘SWIMMING’ can be arranged such that vowels are always together
are 7!/2!∗2! = 5040 ways. The number of words in which the vowels do not come
together is =(10080 – 5040) = 5040.
124. In how many ways can 10 boys be seated in a row having 28 seats such that
no two friends occupy adjacent seats?
a) 13P5
b) 9P29
c) 19P10
d) 15P7
Ans: C
Explanation: First let us take the 18 unoccupied seats. They create 19 slots i.e.,
one on the left of each seat and one on the right of the last one. So we can place
the 10 boys in any of these 19 slots that are, 19P10 ways.
125. How many ways can 8 prizes be given away to 7 students, if each student is
eligible for all the prizes?
a) 40325
b) 40320
c) 40520
d) 40720
Ans: B
Explanation: Now the first student is eligible to receive any of the 8 available
prizes (so 8 ways), the second student will receive a prize from rest 7 available
prizes (so 7 ways), the third student will receive his prize from the rest 6 prizes
available(so 6 ways) and so on. So total ways would be 8! = 8*7*6*5*4*3*2*1 =
40320. Hence, the 7 prizes can be distributed in 40320 ways.
126. How many numbers of three digits can be formed with digits 1, 3, 5, 7 and 9?
a) 983
b) 120
c) 345
d) 5430
Ans: B
Explanation: Here number of digits, n = 5 and number of places to be filled-up r
= 3. Hence, the required number is 5P3 = 5!/2!*3! = 120
127. How many words can be formed with the letters of the word ‘CASTLE’ when
‘O’ and ‘A’ occupying end places.
a) 217
b) 48
c) 75
d) 186
Ans: B
Explanation: When ‘O’ and ‘A’ are occupying end-places => A.S.T.L. (CE). We
can see that (CE) are fixed, hence A, S, T, L can be arranged in 4! Ways and (C,
E) can be arranged themselves is 2! ways. So, the number of words formed = 4! x
 2! = 48 ways.
128. Determine the number of ways of choosing a cricket team (consists of 11
players) out of 18 players if a particular player is never chosen.
a) 12798
b) 22800
c) 31824
d) 43290
Ans: C
Explanation: When ‘O’ and ‘A’ are occupying end-places => A.S.T.L. (CE). We
can see that (CE) are fixed, hence A, S, T, L can be arranged in 4! Ways and (C,
E) can be arranged themselves is 2! ways. So, the number of words formed = 4! x
2! = 48 ways.
129. How many different choices can be made from 5 roses, 4 marigold and 8
sunflowers if at least one flower is to be chosen for making of garland?
a) 269
b) 270
c) 281
d) 320
Ans: A
Explanation: Number of ways of selecting roses = (5+1) = 6 ways, number of
ways of selecting marigold = (4+1) = 5 ways, and the number of ways of selecting
sunflowers = (8+1) = 9 ways. Total number of ways of selecting flowers= 6 * 5 *
9 = 270. But this includes when no flowers or zero flowers is selected (There is no
flowers of a different type, hence n=0 => 2 n = 20 = 1). Hence, the number of ways
of selecting at least one fruit = 270 – 1 = 269.
130. In how many ways 6 pens can be selected from 15 identical black pens?
a) 9*3!
b) 21
c) 14!
d) 1
Ans: D
Explanation: Here the pens are identical, the total number of ways of selecting 6
pens is 1
131. Determine the number of ways of selecting one or more letters from the
letters BBBBBB?
a) 6
b) 73
c) 23
d) 56
Ans: A
Explanation: The number of ways of selecting one ‘B’s = 1, selecting two ‘B’s =
1, selecting three ‘B’s = 1, selecting four ‘B’s = 1, selecting five ‘B’s = 1 and
selecting six ‘B’s = 1. Hence, the required number of ways = 6.
132. Determine the number of ways such that 5 men and 5 women be seated at a
round table if no two women are seated together.
a) 654870
 b) 144521
c) 362160
d) 5634
Ans: C
Explanation: The men and women can be seated alternately so that no two
women will sit together. Hence, 4 women can be seated on alternate seats at a
round table in (4 – 1)! or 6
ways. Now, the 5 men can be seated in the remaining seats in 5! or 120 ways.
Therefore the total number of ways in this case will be (10-1)! – (120 * 6) =
362160.
133. Find the number of ways in which 4 people E, F, G, H, A, C can be seated at a
round table, such that E and F must always sit together.
a) 32
b) 290
c) 124
d) 48
Ans: D
Explanation: E and F can sit together in all arrangements in 2! Ways. Now, the
arrangement of the 5 people in a circle can be done in (5 – 1)! or 24 ways.
Therefore, the total number of ways will be 24 x 2 = 48.
134. There are 6 equally spaced points A, B, C, D, E and F marked on a circle with
radius R. How many convex heptagons of distinctly different areas can be
drawn using these points as vertices?
a) 7! * 6
b) 7C5
c) 7!
d) same area
Ans: D
Explanation: Since all the points are equally spaced; hence the area of all the
convex heptagons will be same.
135. There are 2 twin sisters among a group of 15 persons. In how many ways can
the group be arranged around a circle so that there is exactly one person
between the two sisters?
a) 15 *12! * 2!
b) 15! * 2!
c) 14C2
d) 16 * 15!
Ans: A
Explanation: We know that n objects can be arranged around a circle
in (n−1)!/2. If we consider the two sisters and the person in between the brothers
as a block, then there will 12 others and this block of three people to be arranged
around a circle. The number of ways of arranging 13 objects around a circle is in
12! ways. Now the sisters can be arranged on either side of the person who is in
between the sisters in 2! ways. The person who sits in between the two sisters can
be any of the 15 in the group and can be selected in 15 ways. Therefore, the total
number of ways 15 *12! * 2!.
136. The number of words of 4 consonants and 3 vowels can be made from 15
consonants and 5 vowels, if all the letters are different is ________
a) 3! * 12C5
b) 16C4 * 4C4
c) 15! * 4
d) 15C4 * 5C3 * 7!
Ans: D
Explanation: There are 4 consonants out of 15 can be selected in 15C4 ways and 3
vowels can be selected in 5C3 ways. Therefore, the total number of groups each
containing 4 consonants and 3 vowels = 15C4 * 4C3. Each group contains 7 letters
which can be arranged in 7! ways. Hence, required number of words
= 15C4 * 5C3 * 7!.
137. How many ways are there to arrange 7 chocolate biscuits and 12 cheesecake
biscuits into a row of 19 biscuits?
a) 52347
b) 50388
c) 87658
d) 24976
Ans: B
Explanation: Consider the situation as having 19 spots and filling them with 7
chocolate biscuits and 19 cheesecake biscuits. Then we just choose 7 spots for the
chocolate biscuits and let the other 10 spots have cheesecake biscuits. The number
of ways to do this job is 19C7 = 50388.
138. If a, b, c, d and e are five natural numbers, then find the number of ordered
sets(a, b, c, d, e) possible such that a+b+c+d+e=75.
a) 65C5
b) 58C6
c) 72C7
d) 74C4
Ans: D
Explanation: Let assumes that there are 75 identical balls which are to be
arranged in 5 different compartments (Since a, b, c, d, e are distinguishable). If the
balls are arranged in the row. We have 74 gaps where we can place a ball in each
gap since we need 5 compartments we need to place only 4 balls. We can do this
in 74C4 ways.
139. There are 15 people in a committee. How many ways are there to group these
15 people into 3, 5, and 4?
a) 846
b) 2468
c) 658
d) 1317
Ans: D Explanation: The number of ways to choose 3 people out of 9 is 15C3. Then,
number of ways to choose 5 people out of (15-3) = 12 is 12C5. Finally, the number
of ways to choose 4 people out of (12-4) = 8 is 8C4. Hence, by the rule of
product, 15C3 + 12C5 + 8C4 = 1317.
140. There are six movie parts numbered from 1 to 6. Find the number of ways in
 which they be arranged so that part-1 and part-3 are never together.
a) 876
b) 480
c) 654
d) 237
Ans: B
Explanation: The total number of ways in which 6 part can be arranged = 6! =
720. The total number of ways in which part-1 and part-3 are always together: =
5!*2! = 240. Therefore, the total number of arrangements, in which they are not
together is = 720 − 240 = 480.
141. How many ways are there to divide 4 Indian countries and 4 China countries
into 4 groups of 2 each such that at least one group must have only Indian
countries?
a) 6
b) 45
c) 12
d) 76
Ans: A
Explanation: The number of ways to divide 4+4=8 countries into 4 groups of 2
each is as follows: (10C2 * 10C2 * 10C2 * 10C2)/4! = 30. Since it is required that at
least one group must have only Indian countries, we need to subtract 30 from the
number of possible groupings where all 4 groups have 1 Indian country and 1
China country each. This is equivalent to the number of ways to match each of the
4 Indian countries with one China country: 4! = 24. Therefore, the answer is 30 –
24 = 6.
142. From a group of 8 men and 6 women, five persons are to be selected to form a
committee so that at least 3 women are there on the committee. In how many
ways can it be done?
a) 686
b) 438
c) 732
d) 549
Ans: A
Explanation: We may have (2 men and 3 women) or (1 men and 4 woman) or (5
women only). The Required number of ways = (8C2 × 6C3) + (8C1 × 6C4) + (6C5) =
686.
143. Evaluate the expression (y+1)4 – (y-1)4.
a) 3y2 + 2y5
b) 7(y4 + y2 + y)
c) 8(y3 + y1)
d) y + y2 + y3
Ans: C
Explanation: By using Binomial theorem,the expression (y+1)4 – (y-1)4 can be
expanded as = (y+1)4 = 4C0y4 + 4C1y3 + 4C2y2 + 4C3y1 + 4C4y0 and (y-1)4 = 4C0y4 –
4
C1y3 + 4C2y2 – 4C3y1 + 4C4y0. Now, (y+1)4 – (y-1)4 =
( C0y4 + 4C1y3 + 4C2y2 + 4C3y1 + 4C4y0) – (4C0y4 – 4C1y3 + 4C2y2 – 4C3y1 + 4C4y0) =
4
 2(4C1y3 + 4C3y1) = 8(y3 + y1).
144. Find the coefficient of x 7 in (x+4)9.
a) 523001
b) 428700
c) 327640
d) 129024
Ans: D
Explanation: It is known that (r+1)th term, in the binomial expansion of (a+b)n is
given by, Tr+1 = nCran-rbr. Assuming that x7 occurs in the (r+1)th term of the
expansion (x+4)9, we obtain Tr+1 = 129024x4.
145. Determine the 7th term in the expansion of (x-2y)12.
a) 6128y7
b) 59136y6
c) 52632x6
d) 39861y5
Ans: B
Explanation: By assuming that x 7 occurs in the (r+1)th term of the expansion (x-
2y)12, we obtain Tr+1 = nCran-rbr = 12C6 x6 (2y)6 = 59136y6.
146. Calculate the value of 8C5.
a) 79
b) 43
c) 120
d) 56
Ans: D
Explanation: We can use the formula nCk = n!k!(n−k)! to calculate the value
of 8C5 = 8!/5!(8−5)! = 56.
147. In how many ways can you select 9 cupcakes from a box containing 17
cupcakes?
a) 42769
b) 45398
c) 24310
d) 36214
Ans: C
Explanation: The number of ways to choose 9 cupcakes out of a set of 17
is 17C9 = 17!/9!(17−9)! = 24,310
148. How many 4-digit numbers can be formed by using 2, 4, 6, 8, 10, 12 without
repetition of digits?
a) 15
b) 42
c) 70
d) 127
Ans: A
Explanation: Here making a 4-digit number is equivalent to filling 4 places with 6
numbers. So, the number of ways of filling all the four places is 6C4 = 15. Hence,
the total possible 4-digit numbers from the above 6 numbers are 15.
149. What is the coefficient of x 9 in the expansion of (x+5)14?
 a) 5! * 14C6
b) 14C5
c) 54 * 14C5
d) 34 * 11C5
Ans: C
Explanation: the binomial theorem is (x+y)a = Σ aCi xa-i yi. In order to get the
coefficient of x9, we need to have a-i=9. Since a=14, i=5. Thus, the answer is aC5 *
y4 = 54 * 14C5.
150. Determine the independent term of x 7 in the expansion of (3x 2 + 4)12.
a) 220 * 46
b) 230
c) 548* 3!
d) 220 * 36 * 46
Ans: D
Explanation: By using Binomial theorem = n∑k=0 (nk) xkyn-k = n0x0yn + n1x1yn-1 +
n2x2yn-2 + … + nnxny0, where (nk) = n!/k!(n−k)!. Now, Tr+1 = nCran-rbr,
T9+1 = 12C6a12-6b6 = 220 * (3x2)6 * (4)6 = 220 * 36 * 46. Hence the coefficient is
220 * 36 * 46.
151. Find the coefficient of x 8 in the expansion of (x+2)11.
a) 640
b) 326
c) 1320
d) 456
Ans: C
Explanation: The coefficient of the 8th term is 11C8 = 165. Hence, the 8th term of
the expansion is 165 * 23 * x8 = 1320x8, where the coefficient is 1320.
152. A Poset in which every pair of elements has both a least upper bound and a
greatest lower bound is termed as _______
a) sublattice
b) lattice
c) trail
d) walk
Ans: B
153. In the poset (Z+, |) (where Z+ is the set of all positive integers and | is the
divides relation) are the integers 9 and 351 comparable?
a) comparable
b) not comparable
c) comparable but not determined
d) determined but not comparable
Ans: A
154. If every two elements of a poset are comparable then the poset is called
________
a) sub ordered poset
b) totally ordered poset
c) sub lattice
d) semigroup
 Ans: B
155. ______ and _______ are the two binary operations defined for lattices.
a) Join, meet
b) Addition, subtraction
c) Union, intersection
d) Multiplication, modulo division
Ans: A
156. The graph given below is an example of _________

a) non-lattice poset
b) semilattice
c) partial lattice
d) bounded lattice
Ans: A
Explanation: The graph is an example of non-lattice poset where b and c have
common upper bounds d, e and f but none of them is the least upper bound.
157. The maximum number of edges in a bipartite graph on 14 vertices is
___________
a) 56
b) 14
c) 49
d) 87
Ans: C Explanation: Maximum number of edges occur in a complete bipartite graph
when every vertex has an edge to every opposite vertex in the graph. Number of
edges in a complete bipartite graph is a*b, where a and b are no. of vertices on
each side. This quantity is maximum when a = b i.e. when there are 7 vertices on
each side. So answer is 7 * 7 = 49.
158. In a ______ the degree of each and every vertex is equal.
a) regular graph
b) point graph
c) star graph
d) euler graph
Ans: C
Explanation: A regular graph has the same degree in each of its vertices. In a
regular bipartite graph, if the common degree of each vertices is 1, the two parts
are of the same size.
159. The time complexity to test whether a graph is bipartite or not is said to be
_______ using depth first search.
a) O(n3)
 b) linear time
c) O(1)
d) O(nlogn)
Ans: B
Explanation: It is possible to test whether a graph is bipartite, and to return either
a two-coloring (if it is bipartite) or an odd cycle (if it is not) in linear time i.e, O(n)
using depth first search. In case of the intersection of n line segments or other
simple shapes in the Euclidean graph, it is possible to test whether the graph is
bipartite and it will return either a two-coloring or an odd cycle in time O(nlogn),
even though the graph itself has up to O(n 2) edges.
160. What is the maximum number of edges in a bipartite graph on 14 vertices?
a) 78
b) 15
c) 214
d) 49
Ans: D
Explanation: By definition, the maximum possible number of edges in a bipartite
graph on ‘n’ vertices = (1/4) x n2.
Substituting n = 14, we get maximum number of edges in a bipartite graph on 14
vertices,= (1/4) x (14)2
= (1/4) x 14 x 14
= 49
∴ Maximum number of edges in a bipartite graph on 14 vertices = 49.
161. In a complete bipartite graph, the intersection of two sub graphs is ______
a) 1
b) null
c) 210
d) 412
Ans: B Explanation: In a complete Bipartite graph, there must exist a partition say,
V(G)=X∪Y and X∩Y=∅, that means all edges share a vertex from both set X and
Y.
162. Bipartite graphs are used in ________
a) modern coding theory
b) colouring graphs
c) neural networks
d) chemical bonds
Ans: A
Explanation: All types of cyclic graphs are examples of cyclic graphs. A cyclic
graph is considered bipartite if all the cycles involved are of even length. Bipartite
graphs are widely used in modern coding theory apart from being used in
modeling relationships.
163. Every complete bipartite graph must not be _______
a) planar graph
b) line graph
c) complete graph
d) subgraph
 Ans: C
Explanation: The below bipartite graph is not a complete graph as there is no
edge between A-B, B-C, C-D, C-Q, P-Q, Q-R, Q-D and so it is not a complete
graph.

164. G is a simple undirected graph and some vertices of G are of odd degree. Add
a node n to G and make it adjacent to each odd degree vertex of G. The
resultant graph is ______
a) Complete bipartite graph
b) Hamiltonian cycle
c) Regular graph
d) Euler graph
Ans: D
Explanation: In any simple undirected graph, total degree of all vertices is even
(since each edge contributes 2 degrees). So number of vertices having odd degrees
must be even, otherwise, their sum would have been odd, making total degree also
odd. Now single vertex n is connected to all these even number of vertices (which
have odd degrees). So, degree of n is also even. Moreover, now degree of all
vertices which are connected to v is increased by 1, hence earlier vertices which
had odd degree now have even degree. So now, all vertices in the graph have even
degree, which is necessary and sufficient condition for euler graph.
165. What is the number of vertices in an undirected connected graph with 39
edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
a) 11
b) 14
c) 18
d) 19
Ans: C
Explanation: We know that, sum of degree of all the vertices = 2 * number of
edges
2*7 + 5*2 + 6*x = 39*2
x=9
Number of vertices = 7 + 2 + 9 = 18.
166. ______ is the maximum number of edges in an acyclic undirected graph with
k vertices.
a) k-1
b) k2
c) 2k+3
d) k3+4
Ans: A
Explanation: This is possible with spanning trees since, a spanning tree with k
 nodes has k – 1 edges.
167. The minimum number of edges in a connected cyclic graph on n vertices is
_____________
a) n – 1
b) n
c) 2n+3
d) n+1
Ans: B
Explanation: For making a cyclic graph, the minimum number of edges have to
be equal to the number of vertices. SO, the answer should be n minimum edges.
168. The maximum number of edges in a 8-node undirected graph without self
loops is ____________
a) 45
b) 61
c) 28
d) 17
Ans: C Explanation: In a graph of n vertices we can draw an edge from a vertex to n-1
vertex we will do it for n vertices and so total number of edges is n*(n-1). Now
each edge is counted twice so the required maximum number of edges is n*(n-
1)/2. Hence, 8*(8-1)/2 = 28 edges.
169. Every Isomorphic graph must have ________ representation.
a) cyclic
b) adjacency list
c) tree
d) adjacency matrix
Ans: D
Explanation: A graph can exist in different forms having the same number of
vertices, edges and also the same edge connectivity, such graphs are called
isomorphic graphs. Two graphs G1 and G2 are said to be isomorphic if −> 1) their
number of components (vertices and edges) are same and 2) their edge
connectivity is retained. Isomorphic graphs must have adjacency matrix
representation.
170. A cycle on n vertices is isomorphic to its complement. What is the value of n?
a) 5
b) 32
c) 17
d) 8
Ans: A
Explanation: A cycle with n vertices has n edges. Number of edges in cycle = n
and number of edges in its complement = (n*(n−1)/2) – n. To be isomorphism,
both graphs should have equal number of edges. This gives, (n*(n-1)/2) – n = n
⇒n=5
171. How many perfect matchings are there in a complete graph of 10 vertices?
a) 60
b) 945
c) 756
 d) 127
Ans: B
Explanation: Perfect matching is a set of edges such that each vertex appears only
once and all vertices appear at least once (exactly one appearance). So for n
vertices perfect matching will have n/2 edges and there won’t be any perfect
matching if n is odd. For n=10, we can choose the first edge in 10C2 = 45 ways,
second in 8C2=28 ways, third in 6C2=15 ways and so on. So, total number of ways
45*28*15*6*1=113400. But perfect matching being a set, order of elements is not
important and the permutations 5! of the 5 edges are same only. So, total number
of perfect matching is 113400/5! = 945.
172. A complete n-node graph Kn is planar if and only if _____________
a) n ≥ 6
b) n2 = n + 1
c) n ≤ 4
d) n + 3
Ans: C
Explanation: Any graph with 4 or less vertices is planar, any graph with 8 or less
edges is planar and a complete n-node graph Kn is planar if and only if n ≤ 4.
173. An isomorphism of graphs G and H is a bijection f the vertex sets of G and H.
Such that any two vertices u and v of G are adjacent in G if and only if
____________
a) f(u) and f(v) are contained in G but not contained in H
b) f(u) and f(v) are adjacent in H
c) f(u * v) = f(u) + f(v)
d) f(u) = f(u)2 + f(v)2
Ans: B
174. What is the grade of a planar graph consisting of 8 vertices and 15 edges?
a) 30
b) 15
c) 45
d) 106
Ans: A
Explanation: If G is a planar graph with n vertices and m edges then r(G) = 2m
i.e. the grade or rank of G is equal to the twofold of the number of edges in G. So,
the rank of the graph is 2*15=30 having 8 vertices and 15 edges
175. A _______ is a graph with no homomorphism to any proper subgraph.
a) poset
b) core
c) walk
d) trail
Ans: B
176. The chromatic number of a graph is the property of ____________
a) graph coloring
b) graph ordering
c) group ordering
d) group coloring
 Ans: B
177. Determine the density of a planar graph with 34 edges and 13 nodes.
a) 22/21
b) 12/23
c) 328
d) 576
Ans: A
Explanation: The density of a planar graph or network is described as the ratio of
the number of edges(E) to the number of possible edges in a network with(N)
nodes. So, D = E − N + 1/ 2 N − 5. Hence, the required answer is: D=(34-
13+1)/(2*13-5) = 22/21. A completely sparse planar graph has density 0 and a
completely dense planar graph has degree 1.
178. A non-planar graph can have ____________
a) complete graph
b) subgraph
c) line graph
d) bar graph
Ans: B
179. An undirected graph G which is connected and acyclic is called ____________
a) bipartite graph
b) cyclic graph
c) tree
d) forest
Ans: C
180. An n-vertex graph has ______ edges.
a) n2
b) n-1
c) n*n
d) n*(n+1)/2
Ans: B
181. A polytree is called _______________
a) directed acyclic graph
b) directed cyclic graph
c) bipartite graph
d) connected graph
Ans: A
182. The tree elements are called __________
a) vertices
b) nodes
c) points
d) edges
Ans: B
183. In an n-ary tree, each vertex has at most ______ children.
a) n
b) n4
c) n*n
 d) n-1
Ans: A
184. A linear graph consists of vertices arranged in a line.
a) false
b) true
c) either true or false
d) cannot determined
Ans: B
185. Two labeled trees are isomorphic if ____________
a) graphs of the two trees are isomorphic
b) the two trees have same label
c) graphs of the two trees are isomorphic and the two trees have the same label
d) graphs of the two trees are cyclic
Ans: C
186. A graph which consists of disjoint union of trees is called ______
a) bipartite graph
b) forest
c) caterpillar tree
d) labeled tree
Ans: B
187. What is a bipartite graph?
a) a graph which contains only one cycle
b) a graph which consists of more than 3 number of vertices
c) a graph which has odd number of vertices and even number of edges
d) a graph which contains no cycles of odd length
Ans: D
188. How many edges are there in a complete graph of order 9?
a) 35
b) 36
c) 45
d) 19
Ans: B
Explanation: In a complete graph of order n, there are n*(n-1) number of edges
and degree of each vertex is (n-1). Hence, for a graph of order 9 there should be 36
edges in total.
189. How many cycles are there in a wheel graph of order 5?
a) 6
b) 10
c) 25
d) 7
Ans: D
Explanation: In a cycle of a graph G if we join all the vertices to the centre point,
then that graph is called a wheel graph. There is always a Hamiltonian cycle in a
wheel graph and there are n 2-3n+3 cycles. So, for order 5 the answer should be 7.
190. In preorder traversal of a binary tree the second step is ____________
a) traverse the right subtree
 b) traverse the left subtree
c) traverse right subtree and visit the root
d) visit the root
Ans: B
191. An important application of binary tree is ______
a) Huffman coding
b) stack implementation
c) queue implementation
d) traverse a cyclic graph
Ans: A
Explanation: A binary tree is used to sort a list of elements; the inorder traversal
will do this automatically. Better tree sorting algorithm will involve balancing the
trees. The binary coding, in particular for the Huffman coding is an immediate
application of binary trees.
192. From the following code identify the which traversal of a binary tree is this
__________
//if node has left child
order(node.left)
//if node has right child
order(node.right)
visit(node)
a) Inorder traversal
b) preorder traversal
c) postorder traversal
d) Euler tour traversal

Ans: C
Explanation: In a postorder traversal of a binary tree first is to traverse the left
subtree, second traverse the right subtree of the tree and third is to visit the node
193. An immediate application of a Depth First Search traversal is __________
a) count the number of leaf nodes
b) perform Inorder traversal in easy way
c) count number of nodes
d) implement preorder traversal
Ans: A
194. What is the postfix expression of 9+3*5/(10-4)?
a) 9 3 + * 5 / 10 4 –
b) 9 3 5 + * / 10 4 –
c) 9 3 + 5 * / 10 4 –
d) 9 3 5 * / + 10 – 4
Ans: C
Explanation: The expression, 9+3*5/(10-4)
= 9+3*5/(10 4-)
= 9+35/*(10 4-)
= 935/*+(10 4-)
 So the output is:9 3 5 / * + 10 4 -.(solve by tree diagram)
195. What is the postfix expression of (A+B)-C*(D/E))+F?
a) A B + C D E / * – F +
b) A B C D E + / * F – +
c) A B C + * D E / F + –
d) A B + C – * D E / F +
Ans: A
Explanation: The expression is (A+B)-C*(D/E))+F
= (A+B)-C*(DE/)+F
= (A+B)-C*(DE/)F+
= (A+B)-C(DE/)*F+
= (A+B)C(DE/)*-F+
= (AB+)C(DE/)*-F+
So the output is: AB+CDE/*-F+.
196. Prefix expression can be evaluated _________
a) from right to left
b) from left to right
c) from the exact middle
d) from second right element
Ans: B
197. _____ is a disjunctive normal form.
a) product-of-sums
b) product-of-subtractions
c) sum-of-products
d) sum-of-subtractions
Ans: C
198. The truth table for (p ∨ q) ∨ (p ∧ r) is the same as the truth table for:
A. p ∨ q
B. (p ∨ q) ∧ r
C. (p ∨ q) ∧ (p ∧ r)
D. (p ∨ q) ∧ (p ∨ r)
Ans: A
199. How many have all the vowels together in word MISAPPREHENSION:
A. 15!/2!2!2!2!2!
B. 10!/2!2!2! × 6!/2!2!
C. 13!/2!2!2!2!
D. None of the above
Ans: B
200. The Boolean function [∼(∼p∧q)∧∼(∼p∧∼q)]∨(p∧r) is equal to the Boolean
function:
A. q
B. p ∧ r
C. p
D. None of the above
Ans: C
201. Which of the following statements is FALSE:
A. (P ∧ Q) ∨ (∼P ∧ Q) ∨ (P ∧ ∼Q) is equal to ∼Q ∧ ∼P
B. (P ∧ Q) ∨ (∼P ∧ Q) ∨ (P ∧ ∼Q) is equal to Q ∨ P
C. (P ∧ Q) ∨ (∼P ∧ Q) ∨ (P ∧ ∼Q) is equal to Q ∨ (P ∧ ∼Q)
D. (P ∧ Q) ∨ (∼P ∧ Q) ∨ (P ∧ ∼Q) is equal to [(P ∨ ∼P) ∧ Q] ∨ (P ∧ ∼Q)
Ans: A
202. Hasse diagrams are drawn
A. Partially ordered sets
B. Lattices
C. Boolean algebra
D. None of these
Ans: A
203. The set of integers Z with the binary operation "*" defined as a*b =a +b+ 1
for a, b ∈ Z, is a group. The identity element of this group is
A.0
B. 1
C.-1
D.12
Ans: C
204. (Z,*) is a group with a*b = a+b+1 ∀ a, b ∈Z. The inverse of a is
A.0
B. -2
C.a-2
D.-a-2
Ans: D
205. Match the following
A. Groups I. Associativity
B. Semi groups II. Identity
C. Monoids III. Commutative
D. Abelian Groups IV Left inverse
A.A B C D
IV I II III
B. A B C D
III I IV II
C.A B C D
II III I IV
D.A B C D
I II III IV
Ans: A
206. Which of the following statements is FALSE ?

A.The set of rational numbers is an abelian group under addition

B.The set of rational integers is an abelian group under addition
C.The set of rational numbers form an abelian group under multiplication
D.None of these
 Ans: D
207. The set of all nth roots of unity under multiplication of complex numbers
form a/an
A.semi group with identity
B. commutative semigroups with identity
C.group
D.abelian group
Ans: D
208. Which of the following is TRUE ?
A. Set of all rational negative numbers forms a group under multiplication
B. Set of all non-singular matrices forms a group under multiplication
C.Set of all matrices forms a group under multipication
D.Both (b) and (c)
Ans: B
209. In the group G = {2, 4, 6, 8) under multiplication modulo 10, the identity
element is
A.6
B. 8
C.4
D.2
Ans: A
210. Let (Z, *) be an algebraic structure, where Z is the set of integers and the
operation * is defined by n * m = maximum (n, m). Which of the following
statements is TRUE for (Z, *) ?
A.(Z, *) is a monoid
B. (Z, *) is an abelian group
C.(Z, *) is a group
D.None of these
Ans: D
211. In a classroom containing 28 people, there are 18 people who speak English,
15 people who speak Hindi and 22 people who speak Telugu, 9 people speak
both English and Hindi, while 1 people speak both Hindi and Telugu. Further
13 persons speak both Telugu and English. How many people speak all three
languages?
A.9
B. 8
C.7
D.6
Ans: D
212. A monoid is always a
A. A group
B. a commutative group
C. a non abelian group
D. groupoid
Ans: D
213. A monoid is always a
 A. A group
B. a commutative group
C. a non abelian group
D. semi - group
Ans: D
 MCQs related to topics with answers

UNIT-I
1. If p ˄ q is T, then
A) p is T, q is T B) p is F, q is T C) p is F, q is F D) p is T,
q is F

2. If p →q is F, then
A) p is T, q is T B) p I s F, q is T C) p is F, q is F D) p is T,
q is F

3. The statement from ∼ (p ˄ q) is logically equivalent to

A) ∼ p ˅ ∼ q B) ∼ p ˅ qC) p ˅ ∼ q D) ∼ p ˄∼ q

4. p → p is logically equivalent to
A) p B) Tautology C) Contradiction D) None
of these

5. The converse of p → q is
A) ∼q → ∼p B) ∼ p → ∼ q C) ∼ p → q D) q → p

6. Let p: Mohan is rich, q : Mohan is happy, then the statement: Mohan is rich, but Mohan is not happy
in symbolic form is
A) p ˄ q B) ∼ p˄ q C) p ˅ q D) p ˄ ∼
q

7. Let p: I will get a job, q: I pass the exam, then the statement form: I will get a job only if I pass the
exam, in symbolic from is
A) p → q B) p ˄ q C) q → p D) p ˄ q

8. Let p denote the statement: “Gopal is tall”, q: “Gopal is handsome”. Then the negation of the
statement Gopal is tall, but not handsome, in symbolic form is:
A) ∼ p ˄ q B) ∼ p ˅ q C) ∼ p ˅ ∼q D) ∼ p ˄
∼q

9. If p ˄ (p → q) is T, then
A) p is T B) p is F, q is T C) p is T, q is T D) p is F,
q is F

10. If (∼ (p ˅ q)) → q is F, then

A) p is T, q is F B) p is F, q is T C) p is T, q is T D) p is F,
q is F

11. If (∼ p → r) ˄ (p ↔ q) is T and r is F, then truth values of p and q are:

A) p is T, q is T B) p is T, q is F C) p is F, q is F D) p is F,
q is T

12. If ((p → q ) → q) → p is F, then

1
 A) p is T, q is T B) p is T, q is F C) p is F, q is T D) p is F,
q is F

13. Disjunctive normal form of p ˄ (p → q) is

A) (p ˄ q) B) (p ˄ q) ˅ p C) (p ˅ q) ˄ q D) p ˅ q

14. (p ˄ (p → q )) → q is logically equivalent to

A) p ˅ q B) (p ˄ q) ˅ (~ p ˄ ~q) C) Tautology D) (~ p ˅ q) ˄ (p ˅ q)

15. Conjunctive normal form of p ˄ (p → q) is

A) p ˄ ( p ˅ q) B) p ˄ q C) (p ˄ q) ˅ (~ p ˄ q) D) p ˅ q

16. If (p ˅ q) ˄ (~ p ˅ ~q) is F, then

A) p is T, q is T, or q is F B) p is F, q is T
B) C) p is T, q is F D) p and q must have same truth values

17. Let p denote the statement: “I finish my homework before dinner”, q: “It rains” and r: “I will go for a
walk”, the representative of the following statement: if I finish my homework before dinner and it
does not rain, then I will go for walk is
A) p ˄ ~q ˄ r B) (p ˄ ~q ) → r C) p → (~q ˄ r) D) (p → ~q) → r)

18. Consider a following advertisement for a game:

1. There are three statements in this advertisement
2. Two of them are not true
3. The average increase in IQ scores of people who learn this game is more than 20 points.
Which of the following statement is false?
A) (1) B) (2) C) (3) D) None of these

19. The premises p → q, ~q, logically imply

A) q B) p C) ~ p D) ~ q

20. The premises p, p → q, logically imply

A) q B) p C) ~ p D) ~q

21. The premises p → q, q → r, logically imply

A) p → r B) r → p C) (p → q) → r D) p

22. The premises p ˅ ~ q, q, logically imply

A) p B) q C) ~ p D) ~ q

23. The premises p → q, ~ r → p, ~ q logically imply

A) p B) q C) r D) ~ p ˄ q

24. The disjunctive normal form of (p ˅ ~ q) → q is

(A) (p ˄ q) ˅ p B) (~ p ˄ q) ˅ q C) (p ˄ q) ˅ p D) (p ˄ ~ q) ˅ q

25. The contrapositive of p → q is

A) ~ q → ~ p B) ~ p → ~ q C) ~ p → q D) ~ q → p

2
 UNIT-II
1. Let A = {a, b ,c} and B = {1, 2}. Consider a relation R defined from set A to set B. Then R is equal to
a subset of .
A) A B) B C) A × B D) B × A

2. A relation R is defined in the set Z of integers as follows:

(x, y) ∈ R if x2 + y2 = 9. Which of the followings is wrong?
A) R = {(0, 3), (0, -3), (3, 0), (-3, 0)} B) Domain of R = {-3, 0, 3}
C) Range of R = {-3, 0, 3} D) At least one is false

3. Let A = {1, 2, 3}, B = {1, 3, 5}. If relation R from A to B is given by {(1, 3), (2, 5), (3, 3)}, then R-1 is
.
A) {(3, 3), (3, 1), (5, 3)} B) {(1, 3), (2, 5), (3, 3)} C) {(1, 3), (5, 2)} D) none of these

4. Let A = {1,2,3,4} and let R = {(2,2), (3,3), (4,4), (1,2)} be a relation in A. Then R is .
A) reflexive B) symmetric C) transitive D) none of these

5. Let A = {a, b, c} then the relation R = {(a, a), (b, b), (c, c))} is .
A) reflexive B) symmetric C) transitive D) all of these

6. Consider the relation x ≡(mod 5) then the set {…, -9, -4, 1, 6, 11, ….} defines .
A) [0] B) [1] C) [2] D) [3]

7. A binary relation R on a set A is defined as given below: if (a, b) ∈ R and (b, a) ∈ R then a = b. The
relation R is .
A) reflexive B) anti- symmetric C) transitive D) all of these

8. Consider a relation R on a set A= {1, 2 , 3 , 4}, If R = {(1, 3), (1, 4), (2, 3), (2, 4), (3, 1), (3, 4)} then R
is .
A) reflexive B) symmetric C) transitive D) none of these

9. Consider the Hasse diagram given below.

4

2 3

1
The anti-chain is given by .
A) {2, 4} B) {3, 4} C) Both (a) and (b) D) {2, 3}

10. If R and S are binary relation defined on the sets A and B then select the correct statement.
A) (R ∪ S)-1 = R-1 ∩ S -1 B) ~𝑅 = A-1 C) (R ∪ S)-1 = R-1 ∪ S-1 D) (R ∪ S)-1 = ~(𝑅 ∪ 𝑆)

11. If number of elements in sets A and B are m and n respectively, then the number of relations from A to
B is .
A) 2m+n B) 2mn C) m + n D) m * n

12. Let R be the relation in the real numbers defined by x ≤ y. Then R is .

3
 A) reflexive B) transitive C) symmetric D) all of these

13. Let X be a family of sets and R be a relation in X defined by (A, B) ∈ R then A and B are disjoint sets.
The relation R is .
A) reflexive B) symmetric C) transitive D) anti-symmetric

14. Let R be an equivalence relation defined in A. Let 𝜋 be a set of equivalence classes of A with respect to
the relation R. then [a] = ?
A) {x: x ∈ A and (x, a) ∈ R} B) {x: x ∈ A and (a, x) ∈ R} C) {x: x ∈ A and (x, x) ∈ R} D) All of
these

15. If (a, b) ∈ R means „a‟ is a factor of „b‟, the relation R in Z – {0} is .

A) reflexive and symmetric B) reflexive, symmetric and transitive
C) reflexive, transitive a and anti-symmetric D) reflexive and transitive

16. X = {1, 2, 3, 4, 5, 6, 7, 8, 9} and A = {{2, 4, 5, 8}, {1, 9}, {3, 6, 7}}, B = {{1, 3, 6}, {2, 8}, {5, 7, 9}}.
Then,
A) Both A and B are valid partitions B) Both A and B are invalid partition
C) A is valid but B is invalid partitions D) A is invalid but B is valid partition

17. Consider the Hasse diagram for (S, ≤), where S = {1, 2, 3, 4, 5, 6}. Find the meaning of ≤ for the
relation a ≤ b

4 6

2 3
5
1
A) a divides b B) b divides a C) a = b D) none of these

18. R is a relation defined in Z by aRb if and only if ab ≥ 0 then R is .

A) reflexive B) symmetric C) transitive D) equivalence

19. Which is a valid partition of A = {a, b, c}?

A) 𝜋1 = {{a, b}, {c}} B) 𝜋2 = {{a, c}, {b}} C) 𝜋3 = {{a}, {b}, {c}} D) all of these

20. Let A be the non-empty set of children in family. The relation „x‟ is the brother of „y‟ in A is
.
A) reflexive B) symmetric C) transitive D) all of these

21. If S = {1, 2, 3, … , 8, 9}. Find the valid partition out of the given partitions.
A) {{1, 3, 5}, {2, 6}, {4, 8, 9}} B) {{1, 3, 5}, {2, 4, 6, 8}, {7, 9}}
C) {{1, 3, 5}, {2, 4, 6, 8}, {5, 7, 9}} D) {{s}}

22. Let A = {1, 2, 3, 4, 5} and R = {(1, 2), (1, 1), (2, 1), (2, 2), (3, 3), (4, 4), (4, 5), (5, 4), (5, 5)}. Find 𝜋.
A) {{1, 2}, {3}, {4, 5}} B) {{1, 2}, {3, 4}, {5}} C) {{1, 2, 3}, {4, 5}} D) none of these

23. Let a relation R in the set R of real numbers be defined as (a, b) ∈ R if 1 + ab > 0 for all a, b ∈ R. The

4
relation R is .
A) reflexive and symmetric B) symmetric and transitive C) only transitive D) an equivalence

24. If R = {(a, a), (a, b), (b, a), (b, b), (c, c), (d, d), (d, e), (e, d), (e, e)} is defined on the set A = {a, b, c, d,
e} then 𝜋 ?
A) {{a, b}, {c}, {d, e}} B) {{a, b, c}, {d, e}} C) {{a}, {b, c}, {d, e}} D) {{a, b, c, d, e}}

25. Let I be the set of integers. Let R be the relations in I defined by (x, y) ∈ 𝑅 if (x - y) is divisible by m,
where x, y, m ∈ I, then R is .
A) reflexive B) transitive C) symmetric D) all of these

26. Let f: A → B. If two or more elements have the same image in B, then f is said to be .
A) many- one B) injective C) surjective D) bijective

27. Let A = {1, 2, 3} and B = {a, b, c, d}. The function f: A → B is defined below. F = {(1, a), (2, a), (3,
d)} then the f is .
A) injective B) surjective C) bijective D) none of these

28. Let f: A → B. If f (x) = f (y) ⇒ x = y for all x, y ∈ A then f is said to be .

A) injective B) surjective C) bijective D) into

29. Let A = {1, 2, 3} and B = {a, b, c, d}. The function f: A → B is defined below. F = {(1, a), (1, b), (2, d),
(3, c)} then the f is .
A) not defined B) injective C) surjective D) bijective

30. A bijective function is --.

A) injective B) surjective C) both injective and surjective D) both injective or surjective but not
both 31. The function f (x) = x − 2 when x ≠ 2 is .
2−x
A) injective B) surjective C) constant D) identity

32. Let A = {1, 2, 3} and B = {a, b, c, d}. The function f: A → B is defined below. F = {(1, a), (2, b)} then
the f is .
A) not defined B) injective C) surjective D) bijective

33. If a function f: A → A is defined by the formula f (x) = x then f is called .

A) identity function B) constant function C) onto function D) into function

34. Let A = {1, 2, 3} and B = {a, b, c, d}. The function f: A → B is defined below. F = {(1, a), (2, d), (3,
b)} then the f is .
A) not defined B) injective C) surjective D) bijective

35. Select the property of an inverse function.

A) only bijective functions have inverse B) if f: A → B is bijective then f-1 B → A is also bijective
C) if f: A → B is bijective then f-1 is unique D) all of these

36. If f (x) = 1 - 1 then f (f (1)) is .

x x
1 1 x 1
A) B) C) D)
x 1+x x−1 x−1

5
 − 1 , x ∈ R – { -1 }, the f-1 (x) is equal to
37. If f (x) = xx + .
1 𝟏
A) x − 1 B) x + 1 D)
x+ 1 1−x 𝐱−𝟏
C) + x1

x 2, 0 ≤ 𝑥 ≤ 2
38. The relation is defined by, f(x = then .
3x, 2 ≤ 𝑥 ≤ 10
A) f is not a function B) f is a function C) f is bijective function D) f is injective function
2 + 3x + 5
39. Find the domain of the function f (x) = x
x2 − 5x + 4
A) R B) R – {1} C) R – {4} D) R – {1, 4}

40. The range of function f (x) = x is

A) (0, ∞) B) ( -∞, 0) C) [0, ∞ ) D) none of these
3
41. Given f (x) = log 1+x and g (x) = 3x+x then (fog) (x) equals to .
1−x 1+3x2
A) – f (x) B) 3 f(x) C) (f (x))3 D) none of these

42. Mapping f: R → R which is defined as f (x) = cox x, x ∈ R is .

A) one-on B) neither one-one nor onto C) onto D) one-one and onto

43. The function f: R → R defined by f (x) = (x - 1) (x- 2) (x- 3) is .

A) one-one but not onto B) onto but not one-one C) both one-one and onto D) None

44. Let A be a set containing 5 distinct elements. The total number of distinct function from A to A is
.
A) 5 ! B) 55 C) 25 – 1 D) 25
45. Let A = [-1, 1 ] and f: A → A be defined as f (x) = x x for all x ∈ A, then f (x) is .
A) many-one into function B) one-one into function C) many-one onto function D) one-one onto

46. Let f: R → R , g → R, be two functions, such that f (x) = 2x – 3, g (x) = x3 + 5. The function (fog)-1
(x) is equal to
the fum
x +7 7 x−2 𝐱− 𝟕
A) 1/3 B) x − 1/3 C) ) 1/3 D) )
2 2 7 𝟐 1/3
x − 10−x
47. The inverse of function f (x) =10 + 1 is .
10x + 10−x
x 1 x
A) f-1 (x) = log10 ) B) f-1 (x) = 𝟏
log10 ) C) f-1 (x) = log10 ) D) none
2−x 𝟐 2 1−x

48. Let f: R → R, such that f (x) = 1 ,r∈x , then f is .

1 + x2 _
A) injective B) surjective C) bijective D) none of these

49. The order of the recurrence relation ar – 7ar-1 + 10ar-2 = 0 is .

A) 3 B) 2 C) 1 D) None of the above

50. The order of the recurrence relation 4ar+3 – 20ar+2 + 17ar+1 – 4ar = 0 is .
A) 3 B) 4 C) 2 D) None of the above

6
 UNIT-III
1. From a group of 7 men and 6 women, five persons are to be selected to form a committee so that at least
3 men are there on the committee. In how many ways can it be done?
A. 564 B. 645 C. 735 D. 756

2. In how many different ways can the letters of the word 'LEADING' be arranged in such a
way that the vowels always come together?
A. 360 B. 480 C. 720 D. 5040

3. In how many different ways can the letters of the word 'CORPORATION' be arranged so
that the vowels always come together?
A. 810 B. 1440 C. 2880 D. 50400

4. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be
formed?
A. 210 B. 1050 C. 25200 D. 21400

5. In how many ways can the letters of the word 'LEADER' be arranged?
A. 72 B. 144 C. 360 D. 720

6. In a group of 6 boys and 4 girls, four children are to be selected. In how many different
ways can they be selected such that at least one boy should be there?
A. 159 B. 194 C. 205 D. 209

7. How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9, which are divisible by
5 and none of the digits is repeated?
A. 5 B. 10 C. 15 D. 20

8. In how many ways a committee, consisting of 5 men and 6 women can be formed from 8
men and 10 women?
A. 266 B. 5040 C. 11760 D. 86400

10. A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be
drawn from the box, if at least one black ball is to be included in the draw?
A. 32 B. 48 C. 64 D. 96

11. In how many different ways can the letters of the word 'DETAIL' be arranged in such a way that
the vowels occupy only the odd positions?
A. 32 B. 48 C. 36 D. 60

12. In how many ways can a group of 5 men and 2 women be made out of a total of 7 men and 3
women?
A. 63 B. 90 C. 126 D. 45

13. How many 4-letter words with or without meaning, can be formed out of the letters of the
word, 'LOGARITHMS', if repetition of letters is not allowed?

7
 A. 40 B. 400 C. 5040 D. 2520

14. In how many different ways can the letters of the word 'MATHEMATICS' be arranged so
that the vowels always come together?
A. 10080 B. 4989600 C. 120960 D. None of these

15. In how many different ways can the letters of the word 'OPTICAL' be arranged so that
the vowels always come together?
A. 120 B. 720 C. 4320 D. 2160

16. How many 6 digit telephone numbers can be formed if each number starts
with 35 and no digit appears more than once?
A. 720 B. 360 C. 1420 D. 1680

17. There are 6 periods in each working day of a school. In how many ways can
one organize 5 subjects such that each subject is allowed at least one
period?
A. 3200 B. None of these C. 1800 D. 3600

18. An event manager has ten patterns of chairs and eight patterns of tables. In
how many ways can he make a pair of table and chair?
A. 100 B. 80 C. 110 D. 64

buses are running between two places P and Q. In how many ways can a
person go from P to Q and return by a different bus?
A. None of these B. 600 C. 576 D. 625

20. A box contains 4 red, 3 white and 2 blue balls. Three balls are drawn at
random. Find out the number of ways of selecting the balls of different
colours?
A. 62 B. 48 C. 12 D. 24

21. A question paper has two parts P and Q, each containing 10 questions. If a
student needs to choose 8 from part P and 4 from part Q, in how many
ways can he do that?
A. None of these B. 6020 C. 1200 D. 9450

22. In how many different ways can 5 girls and 5 boys form a circle such that
the boys and the girls alternate?
A. 2880 B. 1400 C. 1200 D. 3212

23. Find out the number of ways in which 6 rings of different types can be worn
in 3 fingers?
A. 120 B. 720 C. 125 D. 729

24.In how many ways can 5 man draw water from 5 taps if no tap can be used
more than once?

8
 A. None of these B. 720 C. 60 D. 120

25. How many two digit numbers can be generated using the digits 1,2,3,4
without repeating any digit?
A. 4 B. 10 C. 12 D. 16

26. There are 10 women and 15 men in an office. In how many ways can a
person can be selected?
A. None of these B. 50 C. 25 D. 150

27. In how many ways can three boys can be seated on five chairs?
A. 30 B. 80 C. 60 D. 120

28. There are 6 persons in an office. A group consisting of 3 persons has to be

formed. In how many ways can the group be formed?
A. 30 B. 10 C. 40 D. 20

29. In how many ways can a team of 5 persons be formed out of a total of 10
persons such that two particular persons should be included in each team?
A. 56 B. 28 C. 112 D. 120

30. How many triangles can be formed by joining the vertices of an octagon?
A. 56 B. 28 C. 112 D. 120

9
 UNIT-IV
1. Consider an undirected random graph of eight vertices. The probability that there is an edge
between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
(A) 1/8 (B) 1 (C) 7 (D) 8

2. Which of the following statements is/are TRUE for undirected graphs?

P: Number of odd degree vertices is even.

Q: Sum of degrees of all vertices is even.

(A) P only (B) Q only (C) Both P and Q (D) Neither P nor Q

3. The line graph L(G) of a simple graph G is defined as follows:

· There is exactly one vertex v(e) in L(G) for each edge e in G.
· For any two edges e and e‟ in G, L(G) has an edge between v(e) and v(e‟), if and only if e and e‟are
incident with the same vertex in G.
Which of the following statements is/are TRUE?

(P) The line graph of a cycle is a cycle.

(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.

(A) P only (B) P and R only (C) R only (D) P, Q and S only

4. Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected

graph, then the number of bounded faces in any embedding of G on the plane is equal to
(A) 3 (B) 4 (C) 5 (D) 6

5. Which of the following graphs is isomorphic to;

(A) A (B) B (C) C (D) D

10
6. Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number
of distinct cycles of length 4 in G is equal to
(A) 15 (B) 30 (C) 45 (D) 360

7.
(A) K4 is planar while Q3 is not
(B) Both K4 and Q3 are planar
(C) Q3 is planar while K4 is not
(D) Neither K4 nor Q3 are planar

8. Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d
in G. If S and T are two different trees with ξ(S) = ξ(T),then
(A) |S| = 2|T| (B) |S| = |T|-1 (C) |S| = |T| (D) |S| = |T|+1

9. The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in
decreasing order. Which of the following sequences can not be the degree sequence of any graph?

I. 7, 6, 5, 4, 4, 3, 2, 1
II. 6, 6, 6, 6, 3, 3, 2, 2
III. 7, 6, 6, 4, 4, 3, 2, 2
IV. 8, 7, 7, 6, 4, 2, 1, 1

(A) I and II (B) III and IV (C) IV only (D) II and IV

10. What is the chromatic number of an n-vertex simple connected graph which does not contain any
odd length cycle? Assume n >= 2.
(A) 2 (B) 3 (C) n-1 (D) n

11. Which one of the following is TRUE for any simple connected undirected graph with more than
2 vertices?
(A) No two vertices have the same degree.
(B) At least two vertices have the same degree.
(C) At least three vertices have the same degree.
(D) All vertices have the same degree.

12.Which of the following statements is true for every planar graph on n vertices?
(A) The graph is connected
(B) The graph is Eulerian

11
(C) The graph has a vertex-cover of size at most 3n/4
(D) The graph has an independent set of size at least n/3

13. Which of the following statements is true for every planar graph on n vertices?
(A) The graph is connected
(B) The graph is Eulerian
(C) The graph has a vertex-cover of size at most 3n/4
(D) The graph has an independent set of size at least n/3

14.G is a graph on n vertices and 2n – 2 edges. The edges of G can be partitioned into two edge-
disjoint spanning trees. Which of the following is NOT true for G?
(A) For every subset of k vertices, the induced subgraph has at most 2k-2 edges
(B) The minimum cut in G has at least two edges
(C) There are two edge-disjoint paths between every pair to vertices
(D) There are two vertex-disjoint paths between every pair of vertices

15. Let G be the non-planar graph with the minimum possible number of edges. Then G has
(A) 9 edges and 5 vertices
(B) 9 edges and 6 vertices
(C) 10 edges and 5 vertices
(D) 10 edges and 6 vertices

16. Which of the following graphs has an Eulerian circuit?

(A) Any k-regular graph where kis an even number.
(B) A complete graph on 90 vertices
(C) The complement of a cycle on 25 vertices
(D) None of the above

17.Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which
one of the following graphs has the same strongly connected components as G ?

(A) A (B) B (C) C (D) D

18. Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1
<= i <= 12, 1 <= j <= 12}. There is an edge between (a, b) and (c, d) if |a − c| <= 1 and |b − d| <= 1.
The number of edges in this graph is .
(A) 500 (B) 502 (C) 506 (D) 510

19. An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is called graphic if there exists a
simple undirected graph with n vertices having degrees d1, d2, … , dn respectively. Which of the
following 6-tuples is NOT graphic?
(A) (1, 1, 1, 1, 1, 1) (B) (2, 2, 2, 2, 2, 2)
(C) (3, 3, 3, 1, 0, 0) (D) (3, 2, 1, 1, 1, 0)

12
20.A cycle on n vertices is isomorphic to its complement. The value of n is .
(A) 2 (B) 4 (C) 6 (D) 5

21. If G is a forest with n vertices and k connected components, how many edges does G have?
(A) floor(n/k) (B) ceil(n/k) (C) n-k (D) n-k+1

22.Let d denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices with d
≥ 3, which one of the following is TRUE?
(A) In any planar embedding, the number of faces is at least n/2 + 2
(B) In any planar embedding, the number of faces is less than n/2 + 2
(C) There is a planar embedding in which the number of faces is less than n/2 + 2
(D) There is a planar embedding in which the number of faces is at most n/(d+1)

23.The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6 . Two vertices
of G are adjacent if and only if the corresponding sets intersect in exactly two elements.
The number of vertices of degree zero in G is:
(A) 1 (B) n (C) n+1 (D) 2n

24.The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices
of G are adjacent if and only if the corresponding sets intersect in exactly two elements.
The number of connected components in G is:
(A) n (B) n+2 (C) 2n/2 (D) 2n / n

25.Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of
faces in the planar embedding of the graph is
(A) 6 (B) 8 (C) 9 (D) 13

26. Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of
G is 8. Then, the size of the maximum independent set of G is
(A) 12 (B) 8 (C) Less than 8 (D) More than 12

27.Which one of the following graphs is NOT planar?

(A) G1 (B) G2 (C) G3 (D) G4

13
28. Let s and t be two vertices in a undirected graph G + (V, E) having distinct positive edge weights.
Let [X, Y] be a partition of V such that s ∈ X and t ∈ Y. Consider the edge e having the minimum
weight amongst all those edges that have one vertex in X and one vertex in Y.
Let the weight of an edge e denote the congestion on that edge. The congestion on a path is defined
to be the maximum of the congestions on the edges of the path. We wish to find the path from s to t
having minimum congestion. Which one of the following paths is always such a path of minimum
congestion?
(A) a path from s to t in the minimum weighted spanning tree
(B) a weighted shortest path from s to t
(C) an Euler walk from s to t
(D) a Hamiltonian path from s to t

29.The minimum number of colours required to colour the following graph, such that no two
adjacent vertices are assigned the same colour, is

(A) 2 (B) 3 (C) 4 (D) 5

30.Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the
number of components in the resultant graph must necessarily lie between
(A) k and n (B) k – 1 and k + 1
(C) k – 1 and n – 1 (D) k + 1 and n – k

31. Dijkstra‟s Algorithm will work for both negative and positive weights?
a) True
b) False
View Answer

32. A graph having an edge from each vertex to every other vertex is called a
a) Tightly Connected
b) Strongly Connected
c) Weakly Connected
d) Loosely Connected
View Answer

33. What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
a) 2 b) 4 c) 5 d) 9

14
34. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of

a) O(V*V) b) O(V*V*V) c) O(E*V) d) O(E*E)

35. All Graphs have unique representation on paper.

a) True
b) False

36. Assuming value of every weight to be greater than 10, in which of the following cases the
shortest path of a directed weighted graph from 2 vertices u and v will never change?
a) add all values by 10 b) subtract 10 from all the values
c) multiply all values by 10 d) In both the cases of multiplying and adding by 10

37. What is the maximum possible number of edges in a directed graph with no self loops having 8
vertices?
a) 28 b) 64 c) 256 d) 56

38. Every Directed Acyclic Graph has at least one sink vertex.
a) True
b) False

39. What would be the DFS traversal of the given Graph?

a) ABCED b) AEDCB c) EDCBA d) ADECB

40. What is the maximum number of edges present in a simple directed graph with 7 vertices if there
exists no cycles in the graph?
a) 21 b) 7 c) 6 d) 49

41.Which of the following is a topological sorting of the given graph?

a) A B C D E F b) A B F E D C c) A B E C F D d) All of the Mentioned

42. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
a) (V*(V-1))/2 b) (V*(V+1))/2 c) (V+1)C2 d) (V-1)C2

15
43. The topological sorting of any DAG can be done in time.
a) cubic b) quadratic c) linear d) logarithmic

44. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
a) Many Hamiltonian paths are possible b) No Hamiltonian path is possible
c) Exactly 1 Hamiltonian path is possible d) Given information is insufficient to comment
anything

45. What sequence would the BFS traversal of the given graph yield?

a) A F D B C E b) C B A F D c) A B D C F d) F D C B A

46. Which of the given statement is true?

a) All the Cyclic Directed Graphs have topological sortings
b) All the Acyclic Directed Graphs have topological sortings
c) All Directed Graphs have topological sortings
d) None of the given statements is true

47. For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is
also reachable from v?
a) True
b) False

48. What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed
Acyclic Graph?
a) Depends on a Graph b) Will always be zero
c) Will always be greater than zero d) May be zero or greater than zero

16
 UNIT-V
1. Other name for directed graph is ……….
A. Direct graph B. Digraph C. Dir-graph D. Digraph

2. Binary trees with threads are called as …….

A. Threaded trees B. Pointer trees C. Special trees D. Special pointer trees

3. Graph G is .................. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.
A. Leterally connected B. Widely Connected
C. Unliterally connected D. Literally connected

4. In Binary trees nodes with no successor are called ……

A. End nodes B. Terminal nodes C. Final nodes D. Last nodes

5. A connected graph T without any cycles is called ……..

A. free graph B. no cycle graph C. non cycle graph D. circular graph

6. Trees are said .................if they are similar and have same contents at corresponding nodes.
A. Duplicate B. Carbon copy C. Replica D. Copies

7. A connected graph T without any cycles is called a ……..

A. A tree graph] B. Free tree C. A tree D. All of the above

8. Every node N in a binary tree T except the root has a unique parent called the ................of N.
A. Antecedents B. Predecessor C. Forerunner D. Precursor

9. In a graph if E=(u,v) means……

A. u is adjacent to v but v is not adjacent to u B. e begins at u and ends at v
C. u is processor and v is successor D. both b andc

10. Sequential representation of binary tree uses ……..

A. Array with pointers B. Single linear array
C. Two dimentional arrays D. Three dimentional arrays

11. In a graph if e=[u,v], Then u and v are called ……..

A. End points of e B. Adjacent nodes C. Neighbours D. All of the above

12. TREE[1]=NULL indicates tree is ……..

A. Overflow B. Underflow C. Empty D. Full

13. A binary tree whose every node has either zero or two children is called …….
A. complete binary tree B. binary search tree C. extended binary tree D. data structure

14. Linked representation of binary tree needs ............... parallel arrays.

A. 4 B. 2 C. 3 D. 5

15. The depth of complete binary tree is given by ……

17
A. Dn = n log2n B. Dn= n log2n+1 C. Dn = log2n D. Dn = log2n+1

16. In a 2-tree, nodes with 0 children are called …………

A. Exterior node B. Outside node C. Outer node D. External node

17. Which indicates pre-order traversal?

A. Left sub-tree, Right sub-tree and root B. Right sub-tree, Left sub-tree and root
C. Root, Left sub-tree, Right sub-tree D. Right sub-tree, root, Left sub-tree

18. In a extended-binary tree nodes with 2 children are called ……..

A. Interior node B. Domestic node C. Internal node D. Inner node

19. A terminal node in a binary tree is called …………

A. Root B. Leaf C. Child D. Branch

20. The height of a BST is given as h. Consider the height of the tree as the no. of edges in the
longest path from root to the leaf. The maximum no. of nodes possible in the tree is?
a) 2h-1 -1 b) 2h+1 -1 c) 2h +1 d) 2h-1 +1

21.. The no of external nodes in a full binary tree with n internal nodes is?
a) n b) n+1 c) 2n d) 2n + 1

22. The difference between the external path length and the internal path length of a binary tree with
n internal nodes is?
a) 1 b) n c) n + 1 d) 2n

23. Suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or
two children. The maximum height of the tree will be?
a) (n+1)/2 b) (n-1)/2 c) n/2 -1 d) (n+1)/2 -1

24. Which of the following statement about binary tree is CORRECT?

a) Every binary tree is either complete or full
b) Every complete binary tree is also a full binary tree
c) Every full binary tree is also a complete binary tree
d) A binary tree cannot be both complete and full

25. Suppose we have numbers between 1 and 1000 in a binary search tree and want to search for the
number 363. Which of the following sequence could not be the sequence of the node examined?
a) 2, 252, 401, 398, 330, 344, 397, 363
b) 924, 220, 911, 244, 898, 258, 362, 363
c) 925, 202, 911, 240, 912, 245, 258, 363
d) 2, 399, 387, 219, 266, 382, 381, 278, 363

26. In full binary search tree every internal node has exactly two children. If there are 100 leaf nodes
in the tree, how many internal nodes are there in the tree?
a) 25 b) 49 c) 99 d) 101

27. Which type of traversal of binary search tree outputs the value in sorted order?

18
a) Pre-order b) In-order c) Post-order d) None

28. Suppose a complete binary tree has height h>0. The minimum no of leaf nodes possible in term
of h is?
a) 2h -1 b) 2h -1 + 1 c) 2h -1 d) 2h +1

29. A 2-3 is a tree such that

a) All internal nodes have either 2 or 3 children
b) All path from root to leaves have the same length
The number of internal nodes of a 2-3 tree having 9 leaves could be
a) 4 b) 5 c) 6 d) 7

30. If a node having two children is to be deleted from binary search tree, it is replaced by its
a) In-order predecessor b) In-order successor
c) Pre-order predecessor d) None

31. A binary search tree is formed from the sequence 6, 9, 1, 2, 7, 14, 12, 3, 8, 18. The minimum
number of nodes required to be added in to this tree to form an extended binary tree is?
a) 3 b) 6 c) 8 d) 11

32. In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1
nodes contains
a) n leaf node b) n internal nodes c) n-1 leaf nodes d) n-1 internal nodes

33. the run time for traversing all the nodes of a binary search tree with n nodes and printing them in
an order is
a) O(nlg(n)) b) O(n) c) O(√n) d) O(log(n))

34. When a binary tree is converted in to an extended binary tree, all the nodes of a binary tree in the
external node becomes
a) Internal nodes b) External nodes c) Root nodes d) None

35. If n numbers are to be sorted in ascending order in O(nlogn) time, which of the following tree can
be used
a) Binary tree b) Binary search tree c) Max-heap d) Min-heap

36. If n elements are sorted in a binary search tree. What would be the asymptotic complexity to
search a key in the tree?
a) O(1) b) O(logn) c) O(n) d) O(nlogn)

37. If n elements are sorted in a balanced binary search tree. What would be the asymptotic
complexity to search a key in the tree?
a) O(1) b) O(logn) c) O(n) d) O(nlogn)

38. The minimum number of elements in a heap of height h is

a) 2h+1 b) 2h c) 2h -1 d) 2h-1

39. The maximum number of elements in a heap of height h is

a) 2h+1 -1 b) 2h c) 2h -1 d) 2h -1
19
40. A threaded binary tree is a binary tree in which every node that does not have right child has a
thread to its
a) Pre-order successor b) In-order successor
c) In-order predecessor d) Post-order successor

41. In which of the following tree, parent node has a key value greater than or equal to the key value
of both of its children?
a) Binary search tree b) Threaded binary tree
c) Complete binary tree d) Max-heap

42. A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
a) log2n b) n-1 c) n d) 2n

43. A binary search tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24
The number of the node in the left sub-tree and right sub-tree of the root, respectively, is
a) (4, 7) b) (7, 4) c) (8, 3) d) (3, 8)

20
 UNIT-VI
1. GCD(a,b) = GCD(b,a mod b)
a) True
b) False

2. All groups satisfy properties

a) G-i to G-v b) G-i to G-iv c) G-i to R-v d) R-i to R-v

3. An Abelian Group satisfies the properties

a) G-i to G-v b) G-i to R-iv c) G-i to R-v d) R-i to R-v

4. A Ring satisfies the properties

a) R-i to R-v b) G-i to G-iv c) G-i to R-v d) G-i to R-iii

5. A Ring is said to be commutative if it also satisfies the property

a) R-vi b) R-v c) R-vii d) R-iv

6. An „Integral Domain‟ satisfies the properties

a) G-i to G-iii b) G-i to R-v c) G-i to R-vi d) G-i to R-iii

7. A Field satisfies all the properties above from G-i to R-vi.

a) True
b) False

8. In modular arithmetic : (a/b) = b(a^-1)

a) True
b) False

9. a.(b.c) = (a.b).c is the representation for which property?

a) G-ii b) G-iii c) R-ii d) R-iii

10. a(b+c) = ac+bc is the representation for which property?

a) G-ii b) G-iii c) R-ii d) R-iii

11. For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?
a) n b) n-1 c) 2n d) n!

12. For the group Sn of all permutations of n distinct symbols, Sn is an abelian group for all values of
n.
a) True
b) False

21
13. Is S a ring from the following multiplication and addition tables?
+abxab
aabaaa
bbabab

a) Yes b) No c) Can‟t Say d) Insufficient Data

14. Does the set of residue classes (mod 3) form a group with respect to modular addition?
a) Yes b) No c) Can‟t Say d) Insufficient Data

15. Does the set of residue classes (mod 3) form a group with respect to modular addition?
a) Yes b) No c) Can‟t Say d) Insufficient Data

16. “A very common field in this category is GF(2) with the set {1, 2} and two operations, addition
and multiplication.”
a) True
b) False
View Answer

17. Multiplication / Division follow which operation?

a) XOR b) NAND c) AND d) OR

18. 18.
01234
04321

01234
–1324

What do the above numbers correspond to?

a) Both Additive Inverses
b) Both Multiplicative Inverses
c) Additive and Multiplicative Inverse respectively
d) Multiplicative and Additive Inverses respectively

19. How many numbers cannot be used in GF(p) in 2n where n=4?

a) 2 b) 5 c) 3 d) 1
View Answer

20. If f(x)=x3+x2+2 and g(x)=x2-x+1, find: f(x) + g(x)

a) x3+2x2-x+3 b) x3+x2+3 c) x3+x+1 d) x2+2x+4

22
 MCQs on Set Theory
1. A _______ is an ordered collection of objects.
A. Relation
B. Function
C. Set
D. Proposition
ANSWER: C

2. Power set of empty set has exactly _____ subset.

A. One
B. Two
C. Zero
D. Three
ANSWER: A

3. The set O of odd positive integers less than 10 can be expressed by ___________
A. {1, 2, 3}
B. {1, 3, 5, 7, 9}
C. {1, 2, 5, 9}
D. {1, 5, 7, 9, 11}
ANSWER: B

4. What is the cardinality of the set of odd positive integers less than 10?
A. 10
B. 5
C. 3
D. 20
ANSWER: B

5. Which of the following two sets are equal?

A. A = {1, 2} and B = {1}
B. A = {1, 2} and B = {1, 2, 3}
C. A = {1, 2, 3} and B = {2, 1, 3}
D. A = {1, 2, 4} and B = {1, 2, 3}
ANSWER: C

6. The set of positive integers is ________.

A. Infinite
B. Finite
C. Subset
D. Empty
ANSWER: A

7. What is the Cardinality of the Power set of the set {0, 1, 2}.
A. 8
B. 6
C. 7
D. 9
ANSWER: A

8. The members of the set S = {x | x is the square of an integer and x < 100} is _________________.
A. {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
B. {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
C. {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
D. {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}
ANSWER: B

9. The union of the sets {1, 2, 5} and {1, 2, 6} is the set _______________.
A. {1, 2, 6, 1}
B. {1, 2, 5, 6}
C. {1, 2, 1, 2}
D. {1, 5, 6, 3}
ANSWER: B

10. The intersection of the sets {1, 2, 5} and {1, 2, 6} is the set ___________.
A. {1, 2}
B. {5, 6}
C. {2, 5}
D. {1, 6}
ANSWER: A

11. Two sets are called disjoint if there _____________ is the empty set.
A. Union Complement
B. Difference
C. Intersection
D. Complement
ANSWER: C

12. Which of the following two sets are disjoint?

A. {1, 3, 5} and {1, 3, 6}
B. {1, 2, 3} and {1, 2, 3}
C. {1, 3, 5} and {2, 3, 4}
D. {1, 3, 5} and {2, 4, 6}
ANSWER: D

13. The difference of {1, 2, 3} and {1, 2, 5} is the set _________.

A. {1}
B. {5}
C. {3}
D. {2}
ANSWER: C

14. The complement of the set A is _____________.

A. A – B
B. U – A
C. A – U
D. B – A
ANSWER: B

15. The bit strings for the sets are 1111100000 and 1010101010. The union of these sets is
____________.
A. 1010100000
B. 1010101101
C. 1111111100
D. 1111101010
ANSWER: D

16. The set difference of the set A with null set is ________.
A. A
B. null
C. U
D. B
ANSWER: A

17. If A = {a,b,{a,c}, ∅}, then A - {a,c} is

A. {a, b, ∅}
B. {b, {a, c}, ∅}
C. {c, {b, c}}
D. {b, {a, c}, ∅}
ANSWER: A

18. The set (A - B) – C is equal to the set

A. (A – B) ∩ C
B. (A ∪ B) – C
C. (A – B) ∪ C
D. (A ∪ B) – C
ANSWER: D

19. Among the integers 1 to 300, the number of integers which are divisible by 3 or 5 is
A. 100
B. 120
C. 130
D. 140
ANSWER: D

20. Using Induction Principle if 13 = 1, 23 = 3 + 5, 33 = 7 + 9 + 11, then

A. 43= 15 + 17 + 19 + 21
B. 43= 11 + 13 + 15 + 17 + 19
C. 43 = 13 + 15 + 17 + 19
D. 43 = 13 + 15 + 17 + 19 + 21
ANSWER: C
 n
21. By mathematical Induction 2 > n3
A. for n ≥ 1
B. for n ≥ 4
C. for n ≥ 5
D. for n ≥ 10
ANSWER: D

22. The symmetric difference A ⊕ B is the set

A. A – A ∩ B
B. (A ∪ B) – (A ∩ B)
C. (A – B) ∩ (B – A)
D. A ∪ (B – A)
ANSWER: B

23. If A is the set of students who play crocket, B is the set of students who play football then the set of
students who play either football or cricket, but not both, can be symbolically depicted as the set
A. A ⊕ B
B. A ∪ B
C. A – B
D. A ∩ B
ANSWER: A

24. Let A and B be two sets in the same universal set. Then A – B =
A. A  B
B. A B
C. A  B
D. None of these
ANSWER: C

25. The number of subsets of a set containing n elements is

A. n
B. 2n - 1
C. n2
D. 2n
ANSWER: D

26. What is the cardinality of the set of odd positive integers less than 10?
A. 10
B. 5
C. 3
D. 20
ANSWER: B
27. Which of the following two sets are equal?
A. A = {1, 2} and B = {1}
B. A = {1, 2} and B = {1, 2, 3}
C. A = {1, 2, 3} and B = {2, 1, 3}
D. A = {1, 2, 4} and B = {1, 2, 3}
ANSWER: C

28. The set O of odd positive integers less than 10 can be expressed by ___________ .
A. {1, 2, 3}
B. {1, 3, 5, 7, 9}
C. {1, 2, 5, 9}
D. {1, 5, 7, 9, 11}
ANSWER: B

29. Power set of empty set has exactly _____ subset.

A. One
B. Two
C. Zero
D. Three
ANSWER: A

30. 8. The set of positive integers is _________ .

A. Infinite
B. Finite
C. Subset
D. Empty
ANSWER: A
 MCQs on Logic & Propositions
1. If p ˄ q is T, then
A. p is T, q is T
B. p is F, q is T
C. p is F, q is F
D. p is T, q is F
ANSWER: B

2. If p →q is F, then
A. p is T, q is T
B. p is F, q is T
C. p is F, q is F
D. p is T, q is F
ANSWER: D

3. The statement from ∼ (p ˄ q) is logically equivalent to

A. ∼ p ˅ ∼ q
B. ∼ p ˅ qC
C. p ˅ ∼ q
D. ∼ p ˄∼ q
ANSWER: A

4. p → p is logically equivalent to
A. p
B. Tautology
C. Contradiction
D. None of these
ANSWER: B

5. The converse of p → q is
A. ∼q → ∼p
B. ∼ p → ∼ q
C. ∼ p → q
D. q → p
ANSWER: D

6. Let p: Mohan is rich, q : Mohan is happy, then the statement: Mohan is rich, but Mohan is not happy in symbolic
form is
A. p ˄ q
B. ∼ p˄ q
C. p ˅ q
D. p ˄ ∼ q
ANSWER: D
7. Let p: I will get a job, q: I pass the exam, then the statement form: I will get a job only if I pass the exam, in
symbolic from is
A. p → q
B. p ˄ q
C. q → p
D. p ˄ q
ANSWER: A

8. Let p denote the statement: “Gopal is tall”, q: “Gopal is handsome”. Then the negation of the statement Gopal is
tall, but not handsome,in symbolic form is:
A. ∼ p ˄q
B. ∼ p ˅ q
C. ∼ p ˅∼q
D. ∼ p ˄∼q
ANSWER: B

9. If p ˄ (p → q) is T, then
A. p is T
B. p is F, q is T
C. p is T, q is T
D. p is F, q is F
ANSWER: C

10. If (∼ (p ˅ q)) → q is F, then

A. p is T, q is F
B. p is F, q is T
C. p is T, q is T
D. p is F, q is
ANSWER: B

11. If (∼ p → r) ˄ (p ↔ q) is T and r is F, then truth values of p and q are:

A. p is T, q is T
B. p is T, q is F
C. p is F, q is F
D. p is F, q is T
ANSWER: A

12. If ((p → q ) → q) → p is F, then

A. p is T, q is T
B. p is T, q is F
C. p is F, q is T
D. p is F, q is F
ANSWER: C
13. (p ˄ (p → q )) → q is logically equivalent to
A. p ˅ q
B. (p ˄ q) ˅ (~ p˄ ~q)
C. Tautology
D. (~ p ˅ q) ˄ (p ˅ q)
ANSWER: C

14. If (p ˅ q) ˄ (~ p˅ ~q) is F, then

A. p is T, q is T, or q is F
B. p is F, q is T
C. p is T, q is F
D. p and q must have same truth values
ANSWER: D

15. Let p denote the statement: “I finish my homework before dinner”, q: “It rains” and r: “I will go for a walk”, the
representative of the following statement: if I finish my homework before dinner and it does not rain, then I will go
for walk is
A. p ˄ ~q ˄ r
B. (p ˄ ~q )→ r
C. p →(~q˄ r)
D. (p →~q)→ r)
ANSWER: B

16. Consider a following advertisement for a game:

1. There are three statements in this advertisement
2. Two of them are not true
3. The average increase in IQ scores of people who learn this game is more than 20 points.
Which of the following statement is false?
A. (1)
B. (2)
C. (3)
D. None of these
ANSWER: B

17. The contrapositive of p →q is

A. ~ q → ~ p
B. ~ p → ~ qC
C. ~ p → q
D. ~ q → p
ANSWER: A

18. Which of the following is declarative statement?

A. It’s right
B. Three is divisible by 3.
C. Two may not be an even integer
D. I love you
ANSWER: B
19. The following propositional statement is (P → (Q v R)) → ((P ^ Q) → R)
A. Satisfiable but not valid
B. valid
C. a contadiction
D. none of the above
ANSWER:

20. Which of the proposition is p ^ (~p v q) is

A. Tautulogy
B. Contradiction
C. Logically equivalent to p ^ q
D. All of above
ANSWER: C

MCQs on Relations and Functions

1. The relation R defined in A = {1, 2, 3} by aRb, if | a 2 – b2 | £ 5. Which of the following is false?

A. R = {(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3, 2)}
B. R–1 = R
C. Domain of R = {1, 2, 3}
D. Range of R = {5}
ANSWER: D

2. The relation R defined on the set A = {1, 2, 3, 4, 5} by R = {(x, y) : | x 2 – y2| < 16} is given by
A. {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)}
B. {(2, 2), (3, 2), (4, 2), (2, 4)}
C. {(3, 3), (4, 3), (5, 4), (3, 4)}
D. None of the above
ANSWER: D

3. If R = {x, y) : x, y Î Z, x2 + y2 £ 4} is a relation in z, then domain of R is

A. {0, 1, 2}
B. {– 2, – 1, 0}
C. {– 2, – 1, 0, 1, 2}
D. None of these
ANSWER: C

4. If A = { (1, 2, 3}, then the relation R = {(2, 3)} in A is

A. symmetric and transitive only
B. symmetric only
C. transitive only
D. not transitive
ANSWER: D
5. Let X be a family of sets and R be a relation in X, defined by ‘A is disjoint from B’. Then, R is
A. reflexive
B. symmetric
C. anti-symmetric
D. transitive
ANSWER: B

6. R is a relation defined in Z by aRb if and only if ab ³ 0, then R is

A. reflexive
B. symmetric
C. transitive
D. equivalence
ANSWER: D

7. Let a relation R in the set R of real numbers be defined as (a, b) Î R if and only if 1 + ab > 0 for all a, bÎR.
The relation R is
A. Reflexive and Symmetric
B. Symmetric and Transitive
C. Only transitive
D. An equivalence relation
ANSWER: A

8. If R be relation ‘<‘ from A = {1, 2, 3, 4} to B = {1, 3, 5} ie, (a, b) Î R iff a < b, then RoR– 1 is
A. {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
B. {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
C. {(3, 3), (3, 5), (5, 3), (5, 5)}
D. { (3, 3), (3, 4), (4, 5)}
ANSWER: C

9. The range of the function when x ¹ 2 is

A. R
B. R – {1}
C. {– 1}
D. R – {– 1}
ANSWER: C

10. R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x – 3. The relation R – 1 is
A. {(11, 8), (13, 10)}
B. {(8, 11), (10, 13)}
C. {(8, 11), (9, 12), (10, 13)}
D. None of the above
ANSWER: B
11. R is a relation on N given by N = {(x, y): 4x + 3y = 20}. Which of the following belongs to R?
A. (– 4, 12)
B. (5, 0)
C. (3, 4)
D. (2, 4)
ANSWER: D

12. The relation R defined on the set of natural numbers as {(a, b): a differs from b by 3} is given
A. {(1, 4), (2, 5), (3, 6), ….}
B. { (4, 1), (5, 2), (6, 3), ….}
C. {(4, 1), (5, 2), (6, 3), ….}
D. None of the above
ANSWER: B

13. Two finite sets A and B have m and n elements respectively. If the total number of subsets of A is
112 more than the total number of subsets of B, then the value of m is
A. 7
B. 9
C. 10
D. 12
ANSWER: A

14. Let X and Y be the sets of all positive divisors of 400 and 1000 respectively (including 1 and the
number). Then, n (X ÇY) is equal to
A. 4
B. 6
C. 8
D. 12
ANSWER: D

15. Let R = { ( 3, 3 ) ( 6, 6 ) ( ( 9, 9 ) ( 12, 12 ), ( 6, 12 ) ( 3, 9 ) ( 3, 12 ), ( 3, 6 ) } be a relation on the set A = {

3, 6, 9, 12 }. The relation is
A. reflexive and transitive
B. reflexive only
C. an equivalence relation
D. reflexive and symmetric only
ANSWER: A

16. Let f : ( - 1, 1 ) → B be a function defined by f ( x ) = 2 1 x 1 2x tan - - , then f is both one-one and onto
when B is the interval
𝜋
A. (0, )
2
−𝜋
B. (0, )
2
𝜋 −𝜋
C. ( , )
2 2
−𝜋 𝜋
D. ( , )
2 2
ANSWER: D
17. Let R be the set of real numbers. If f : R → R is a function defined by f ( x ) = x2 , then f is]
A. inject ve but not subjective
B. subjective but not injective
C. bijective
D. none of these
ANSWER: D

18. Domain of is
A. [0, 4]
B. (0, 4)
C. R ฀ (0, 4)
D. R ฀ [0, 4]
ANSWER: A

19. The domain of is

A. (2, 3)
B. (2, 3]
C. [2, 3]
D. None of these.
ANSWER: C
 JSPM’S BSIOTR WAGHOLI
COMPUTER ENGINEERING DEPARTMENT
CLASS:- SE COMP SUB:-DM
MCQ on Unit 1

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Sets”.

1. A __________ is an ordered collection of objects.

a) Relation
b) Function
c) Set
d) Proposition
Answer: c

2. The set O of odd positive integers less than 10 can be expressed by _____________
a) {1, 2, 3}
b) {1, 3, 5, 7, 9}
c) {1, 2, 5, 9}
d) {1, 5, 7, 9, 11}
Answer: b

3. Power set of empty set has exactly _________ subset.

a) One
b) Two
c) Zero
d) Three
Answer: a

4. What is the Cartesian product of A = {1, 2} and B = {a, b}?

a) {(1, a), (1, b), (2, a), (b, b)}
b) {(1, 1), (2, 2), (a, a), (b, b)}
c) {(1, a), (2, a), (1, b), (2, b)}
d) {(1, 1), (a, a), (2, a), (1, b)}
Answer: c

5. The Cartesian Product B x A is equal to the Cartesian product A x B. Is it True or False?

a) True
b) False
Answer: b

6. What is the cardinality of the set of odd positive integers less than 10?
a) 10
b) 5
c) 3
d) 20
Answer: b

7. Which of the following two sets are equal?

a) A = {1, 2} and B = {1}
b) A = {1, 2} and B = {1, 2, 3}
c) A = {1, 2, 3} and B = {2, 1, 3}
d) A = {1, 2, 4} and B = {1, 2, 3}
Answer: c

8. The set of positive integers is _____________

a) Infinite
b) Finite
c) Subset
d) Empty
Answer: a

9. What is the Cardinality of the Power set of the set {0, 1, 2}.
a) 8
b) 6
c) 7
d) 9
Answer: a

10. The members of the set S = {x | x is the square of an integer and x < 100} is ________________
a) {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
b) {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
c) {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
d) {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}
Answer: b

11. The union of the sets {1, 2, 5} and {1, 2, 6} is the set _______________
a) {1, 2, 6, 1}
b) {1, 2, 5, 6}
c) {1, 2, 1, 2}
d) {1, 5, 6, 3}
Answer: b

12. The intersection of the sets {1, 2, 5} and {1, 2, 6} is the set _____________
a) {1, 2}
b) {5, 6}
c) {2, 5}
d) {1, 6}
Answer: a

13. Two sets are called disjoint if there _____________ is the empty set.
a) Union
b) Difference
c) Intersection
d) Complement
Answer: c

14. Which of the following two sets are disjoint?

a) {1, 3, 5} and {1, 3, 6}
b) {1, 2, 3} and {1, 2, 3}
c) {1, 3, 5} and {2, 3, 4}
d) {1, 3, 5} and {2, 4, 6}
Answer: d

15. The difference of {1, 2, 3} and {1, 2, 5} is the set ____________

a) {1}
b) {5}
c) {3}
d) {2}
Answer: c

16. The complement of the set A is _____________

a) A – B
b) U – A
c) A – U
d) B – A
Answer: b

17. The bit string for the set {2, 4, 6, 8, 10} (with universal set of natural numbers less than or equal to 10) is
____________________
a) 0101010101
b) 1010101010
c) 1010010101
d) 0010010101
Answer: a

18. Let Ai = {i, i+1, i+2, …..}. Then set {n, n+1, n+2, n+3, …..} is the _________ of the set Ai.
a) Union
b) Intersection
c) Set Difference
d) Disjoint
Answer: b

19. The bit strings for the sets are 1111100000 and 1010101010. The union of these sets is ___________
a) 1010100000
b) 1010101101
c) 1111111100
d) 1111101010
Answer: d

20. The set difference of the set A with null set is __________
a) A
b) null
c) U
d) B
Answer: a
 JSPM’S BSIOTR WAGHOLI
COMPUTER ENGINEERING DEPARTMENT
CLASS:- SE COMP SUB:-DM
MCQ on Unit 2

Q.1. A function is said to be ______________, if and only if f(a) = f(b) implies that a = b for all a and b in the domain
of f.
A. One-to-many
B. One-to-one
C. Many-to-many
D. Many-to-one
ANSWER: B

Q.2. The function f(x)=x+1 from the set of integers to itself is onto. Is it True or False?
A. True
B. False
C. none
D. none
ANSWER: A

Q.3. The value of ?1/2.?5/2? ? is _______________.

A. 1
B. 2
C. 3
D. 0.5
ANSWER: A

Q.4. Which of the following function f: Z X Z ? Z is not onto?

A. f(a, b) = a + b
B. f(a, b) = a
C. f(a, b) = |b|
D. f(a, b) = a – b
ANSWER: C

Q.5. The domain of the function that assign to each pair of integers the maximum of these two integers is _______.
A. N
B. Z
C. Z+

D. Z+ * Z+
ANSWER: D
Q.6. Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = 3x + 4. Then the
composition of f and g is ________
A. 6x + 9
B. 6x + 7
C. 6x + 6
D. 6x + 8
ANSWER: A

Q.7. __________ bytes are required to encode 2000 bits of data,

A. 1
B. 2
C. 3
D. 8
ANSWER: B

Q.8. The inverse of function f(x) = x3 + 2 is __________.

A. f -1 (y) = (y – 2) 1/2
B. f -1 (y) = (y – 2) 1/3
C. f -1 (y) = (y) 1/3
D. f -1 (y) = (y – 2)
ANSWER: B

Q.9. The function f(x) = x3 is bijection from R to R. Is it True or False?

A. True
B. False
C. none
D. none
ANSWER: A

Q.10. The g -1({0}) for the function g(x)= ?x? is ________.

A. {x | 0 = x < 1}
B. {x | 0 < x = 1}
C. {x | 0 < x < 1}
D. {x | 0 = x = 1}
ANSWER: D

Q.11.A __________ is an ordered collection of objects

A. Relation
B. Function
C. Set
D. Proposition
ANSWER: C
Q.12.The set O of odd positive integers less than 10 can be expressed by _____________
A. {1, 2, 3}
B. {1, 3, 5, 7, 9}
C. {1, 2, 5, 9}
D. {1, 5, 7, 9, 11}
ANSWER: B

Q.13. Power set of empty set has exactly _________ subset.

A. 1
B. 2
C. 0
D. 3
ANSWER: A

Q.14. What is the Cartesian product of A = {1, 2} and B = {a, b}?

A. {(1, a), (1, b), (2, a), (b, b)}
B. {(1, 1), (2, 2), (a, a), (b, b)}
C. {(1, a), (2, a), (1, b), (2, b)}
D. {(1, 1), (a, a), (2, a), (1, b)}
ANSWER: C

Q.15. The Cartesian Product B x A is equal to the Cartesian product A x B. Is it True or False?
A. True
B. False
C. NULL
D. NULL
ANSWER: B

Q.16. What is the cardinality of the set of odd positive integers less than 10?
A. 10
B. 5
C. 3
D. 20
ANSWER: B

Q.17. Which of the following two sets are equal?

A. A = {1, 2} and B = {1}
B. A = {1, 2} and B = {1, 2, 3}
C. A = {1, 2, 3} and B = {2, 1, 3}
D. A = {1, 2, 4} and B = {1, 2, 3}
ANSWER: C
Q.18. The set of positive integers is _____________
A. Infinite
B. Finite
C. Subset
D. Empty
ANSWER: A

Q.19. What is the Cardinality of the Power set of the set {0, 1, 2}.
A. 8
B. 6
C. 7
D. 9
ANSWER: A

Q.20. The members of the set S = {x | x is the square of an integer and x < 100} is ________________
A. {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
B. {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
C. {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
D. {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}
ANSWER: B
 Discrete Mathematics Unit 1 MCQs

* Required

* This form will record your name, please fill your name.

1. Write set {1, 5, 15, 25,…} in set-builder form. *

(1 Point)

{x: either x=1 or x=5n, where n is a real number}

{x: either x=1 or x=5n, where n is a integer}

{x: either x=1 or x=5n, where n is an odd natural number}

{x: x=5n, where n is a natural number}

2. Convert set {x: x is a positive prime number which divides 72} in roster form. *
(1 Point)

{2, 3, 5}

{2, 3, 6}

{2, 3}

{∅}

Option 2

12/14/2020 /
 3. Express {x: x= n/ (n+1), n is a natural number less than 7} in roster form. *
(1 Point)

{1⁄2, 2⁄3, 4⁄5, 6⁄7}

{1⁄2, 2⁄3, 3⁄4, 4⁄5, 5⁄6, 6⁄7, 7⁄8}

{1⁄2, 2⁄3, 3⁄4, 4⁄5, 5⁄6, 6⁄7}

Infinite set

4. What is the Cardinality of the Power set of the set {0, 1, 2}? *
(1 Point)

5. In Question number 6 How many American tourist visited none of the following three
countries : Columbia Argentina and Brazil *
(1 Point)

12/14/2020 /
 6. In Question number 6 How many American tourists visited Brazil but not Argentina or
Columbia *
(1 Point)

7. In Question number 15 How many students take Math, but not Biology or English? *
(2 Points)

17

32

12

8. Roll Number *

12/14/2020 /
 9. There are 100 students surveyed and asked which of the following subjects they take
this semester : Mathematics , English or Biology. Below is the result of the survey.
a. 35 responded English
b. 50 responded Mathematics
c. 29 responded Biology
d. 12 responded Mathematics and English
e. 8 responded English and Biology
f. 11 responded Biology and math
g. 5 responded all

How many students are not taking any of the three subjects? *
(2 Points)

14

12

10

32

10. The members of the set S = {x | x is the square of an integer and x < 100} is
________________ *
(1 Point)

{0, 2, 4, 5, 9, 58, 49, 56, 99, 12}

{0, 1, 4, 9, 16, 25, 36, 49, 64, 81}

{1, 4, 9, 16, 25, 36, 64, 81, 85, 99}

{0, 1, 4, 9, 16, 25, 36, 49, 64, 121}

12/14/2020 /
 11. Let a set E ={0,2,4,6,8….} of non-negative even numbers and O = {1, 3, 5, 7, 9,…..} of non-
negative odd numbers then? *
(1 Point)

Cardinality of set E is greater than that of O

Cardinality of set O is greater than that of E

Cardinality of set E is equal to that of O

None of the mentioned

12. If cardinality of (A U B) = cardinality of A+ cardinality of B. This means ____________ *

(1 Point)

A is a subset of B

B is a subset of A

A and B are disjoint

None of the mentioned

12/14/2020 /
 13. In a survey,51 American tourists were asked, if they have visited the following Latin
American countries: Argentina, Brazil and Columbia.
35 tourists have visited Argentina.
34 tourists have visited Brazil.
19 tourists have visited Columbia.
5 tourists have visited Argentina and Columbia
11 tourists have visited Argentina and Brazil.
12 tourists have visited Argentina, Brazil and Columbia
Everyone who visited Columbia also visited at least one of the following two countries:
Argentina and Brazil
a. How many American tourists visited Argentina but not Brazil or Columbia *
(1 Point)

14. If A is a subset of B and B is a subset of C, then cardinality of A U B U C is equal to

____________ *
(1 Point)

Cardinality of C

Cardinality of B

Cardinality of A

None of the mentioned

12/14/2020 /
 15. A = {∅,{∅},2,{2,∅},3}, which of the following is true? *
(1 Point)

{{∅,{∅}} ∈ A

{2} ∈ A

∅⊂A

3⊂A

16. In Question number 15 How many students take Math and English , but not Biology? *
(2 Points)

12

35

17. In Question number 6 How many American tourists visited Brazil and Columbia but not
Argentina ? *
(1 Point)

12/14/2020 /
 18. Power set of empty set has exactly _________ subset. *
(1 Point)

One

Two

Zero

Three

19. Name *

This content is neither created nor endorsed by Microsoft. The data you submit will be sent to the form owner.

Microsoft Forms

12/14/2020 /
 Discrete Mathematics Quiz Unit 3

* Required

* This form will record your name, please fill your name.

1. Roll Number *

2. Name *

3. Class *

SE First Shift

SE Second Shift

12/14/2020 /
 4. A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls
be drawn from the box, if at least one black ball is to be included in the draw? *
(2 Points)

32

48

64

96

5. How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9, which are
divisible by 5 and none of the digits is repeated? *
(2 Points)

10

15

20

6. From a group of 7 men and 6 women, five persons are to be selected to form a
committee so that at least 3 men are there on the committee. In how many ways can it
be done? *
(2 Points)

564

645

735

756

12/14/2020 /
 7. A bank has 6 digit account number with no repetition of digits within a account
number. The first and last digit of the account numbers is fixed to be 4 and 7. How
many such account numbers are possible? *
(2 Points)

10080

5040

890

1680

8. In how many ways can we arrange the word ‘FUZZTONE’ so that all the vowels come
together? *
(1 Point)

1440

2160

4320

9. In a room there are 2 green chairs, 3 yellow chairs and 4 blue chairs. In how many ways
can Raj choose 3 chairs so that at least one yellow chair is included? *
(1 Point)

30

64

84

12/14/2020 /
 10. On a railway line there are 20 stops. A ticket is needed to travel between any 2 stops.
How many different tickets would the government need to prepare to cater to all
possibilities? *
(1 Point)

760

190

380

72

11. Without repetition, using digits 2, 3, 4, 5, 6, 8 and 0, how many numbers can be made
which lie between 500 and 1000? *
(1 Point)

70

60

90

147

12. A trekking group is to be formed having 6 members. They are to be selected from 3
girls, 4 boys and 5 teachers. In how many ways can the group be formed so that there
are 3 teachers and 3 boys or 2 girls and 4 teachers? *
(1 Point)

55

90

27

144

12/14/2020 /
 13. There are 8 routes from London to Delhi. And there are 6 routes from Delhi to Tokyo. In
how many different ways can Raj travel from London to Tokyo via Delhi? *
(1 Point)

100

48

24

12

14. In an examination there are 3 multiple choice questions and each question has 4
choices. The number of ways in which a student can fail to get all answers correct is ? *
(1 Point)

11

27

63

84

15. In a crossword puzzle there are 2 solutions to each of the 3 given places and 3 solutions
to 1 other place. How many different solutions can be set in ? *
(1 Point)

12

24

36

48

12/14/2020 /
 16. A gentleman has got 6 sorts of note papers, 7 different ink-stands and 4 different pens.
In how many ways can he begin to write a letter ? *
(1 Point)

168

176

186

196

17. The number of different permutations of the word BANANA is *

(1 Point)

720

120

60

180

18. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can
be formed? *
(1 Point)

25200

120

21400

1050

12/14/2020 /
 19. In how many different ways can the letters of the word 'CORPORATION' be arranged so
that the vowels always come together? *
(1 Point)

810

1440

2880

50400

This content is neither created nor endorsed by Microsoft. The data you submit will be sent to the form owner.

Microsoft Forms

12/14/2020 /
 DM Quiz Unit 2

* Required

* This form will record your name, please fill your name.

1. Roll No. *

2. Name *

3. Class *

SE First shift

SE Second Shift

12/14/2020 /
 4. A function is said to be ______________ if and only if f(a) = f(b) implies that a = b for all a
and b in the domain of f. *
(1 Point)

One-to-many

One-to-one

Many-to-many

Many-to-one

5. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is
__________ *
(1 Point)

reflective, symmetric and transitive

irreflexive, symmetric and transitive

neither reflective, nor irreflexive but transitive

irreflexive and antisymmetric

6. Consider the relation: R’ (x, y) if and only if x, y>0 over the set of non-zero rational
numbers,then R’ is _________ *
(1 Point)

not equivalence relation

an equivalence relation

transitive and asymmetry relation

reflexive and antisymmetric relation

Option 2

12/14/2020 /
 7. Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The
reflexive transitive closure of A is? *
(1 Point)

{(a,b) | a >= b and a, b belong to {1, 2, 3}}

{(a,b) | a > b and a, b belong to {1, 2, 3}}

{(a,b) | a <= b and a, b belong to {1, 2, 3}}

{(a,b) | a = b and a, b belong to {1, 2, 3}}

8. Let A and B be two non-empty relations on a set S. Which of the following statements is
false? *
(1 Point)

A and B are transitive ⇒ A∩B is transitive

A and B are symmetric ⇒ A∪B is symmetric

A and B are transitive ⇒ A∪B is not transitive

A and B are reflexive ⇒ A∩B is reflexive

9. Determine the characteristics of the relation aRb if a2 = b2. *

(2 Points)

ransitive and symmetric

Reflexive and asymmetry

Trichotomy, antisymmetry, and irreflexive

Symmetric, Reflexive, and transitive

Option 2

12/14/2020 /
 10. The transitive closure of the relation {(0,1), (1,2), (2,2), (3,4), (5,3), (5,4)} on the set {1, 2, 3,
4, 5} is *
(2 Points)

{(0,1), (1,2), (2,2), (3,4)}

{(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)}

{(0,1), (1,1), (2,2), (5,3), (5,4)}

{(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}

11. Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R=
{(a,b) ∈ N2 | a!= b} satisfies _______ property. *
(2 Points)

symmetry

transitivity

antisymmetry

reflexivity

12. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b.
Number of edges in the Hasse diagram of is ______ *
(2 Points)

12/14/2020 /
 13. Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = {3, 5, 6}. Here R is known
as _________ *
(2 Points)

equivalence relation

reflexive relation

symmetric relation

transitive relation

14. A directed graph or digraph can have directed cycle in which ______ *
(1 Point)

starting node and ending node are different

starting node and ending node are same

minimum four vertices can be there

ending node does not exist

15. An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7
have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8? *
(1 Point)

15

23

12/14/2020 /
 16. What is the maximum number of edges in a bipartite graph on 14 vertices? *
(2 Points)

78

15

214

49

17. Which of the following relation is a partial order as well as an equivalence relation? *
(1 Point)

equal to(=)

less than(<)

greater than(>)

not equal to(!=)

This content is neither created nor endorsed by Microsoft. The data you submit will be sent to the form owner.

Microsoft Forms

12/14/2020 /
 DM Quiz Unit 5 (SE COMP-I (2020-21))

* Required

* This form will record your name, please fill your name.

Roll Number *

Name *

Class *

SE Shift 1

SE Shift 2

12/14/2020 /
 4

Which of the following is false about a binary search tree? *

(1 Point)

The left child is always lesser than its parent

The right child is always greater than its parent

The left and right sub-trees should also be binary search trees

In order sequence gives decreasing order of elements

What is the speciality about the inorder traversal of a binary search tree? *
(1 Point)

It traverses in a non increasing order

It traverses in an increasing order

It traverses in a random fashion

It traverses based on priority of the node

The number of edges from the root to the node is called __________ of the tree. *
(1 Point)

Height

Depth

Length

Width

12/14/2020 /
 7

What is a full binary tree? *

(1 Point)

Each node has exactly zero or two children

Each node has exactly two children

All the leaves are at the same level

Each node has exactly one or two children

Which of the following is false in the case of a spanning tree of a graph G? *

(1 Point)

It is tree that spans G

It is a subgraph of the G

It includes every vertex of the G

It can be either cyclic or acyclic

Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees. *
(2 Points)

15

16

20

12/14/2020 /
 10

Which of the following is not the algorithm to find the minimum spanning tree of the
given graph? *
(2 Points)

Boruvka’s algorithm

Prim’s algorithm

Kruskal’s algorithm

Bellman–Ford algorithm

11

Kruskal’s algorithm is used to ______ *

(2 Points)

find minimum spanning tree

find single source shortest path

find all pair shortest path algorithm

traverse the graph

12/14/2020 /
 12

Consider the following statements.

S1. Kruskal’s algorithm might produce a non-minimal spanning tree.
S2. Kruskal’s algorithm can efficiently implemented using the disjoint-set data
structure. *
(2 Points)

S1 is true but S2 is false

Both S1 and S2 are false

Both S1 and S2 are true

S2 is true but S1 is false

13

Consider the graph shown below.

Which of the following edges form the MST of the given graph using Prim’a
algorithm, starting from vertex 4. *
(4 Points)

(4-3)(5-3)(2-3)(1-2)

(4-3)(3-5)(5-1)(1-2)

(4-3)(3-5)(5-2)(1-5)

(4-3)(3-2)(2-1)(1-5)

12/14/2020 /
 14

A _________ is a decision support tool that uses a tree-like graph or model of decisions
and their possible consequences, including chance event outcomes, resource costs,
and utility. *
(1 Point)

Decision tree

Graphs

Trees

Neural Networks

Option 2

15

For the tree below, write the in-order traversal. *

(2 Points)

6, 2, 5, 7, 11, 2, 5, 9, 4

6, 5, 2, 11, 7, 4, 9, 5, 2

2, 7, 2, 6, 5, 11, 5, 9, 4

2, 7, 6, 5, 11, 2, 9, 5, 4

Option 2

12/14/2020 /
 This content is neither created nor endorsed by Microsoft. The data you submit will be sent to the form owner.

Microsoft Forms

12/14/2020 /
 DM Quiz Unit-6

* Required

* This form will record your name, please fill your name.

1. Roll No *

2. Name *

3. Class *

SE Shift 1

SE Shift 2

12/14/2020 /
 4. A non empty set A is termed as an algebraic structure ________ *
(2 Points)

with respect to binary operation *

with respect to ternary operation ?

with respect to binary operation +

with respect to unary operation –

5. An algebraic structure _________ is called a semigroup. *

(2 Points)

(P, *)

(Q, +, *)

(P, +)

(+, *)

6. Condition for monoid is __________ *

(2 Points)

(a+e)=a

(a*e)=(a+e)

a=(a*(a+e)

(a*e)=(e*a)=a

12/14/2020 /
 7. A monoid is called a group if _______ *
(2 Points)

(a*a)=a=(a+c)

(a*c)=(a+c)

(a+c)=a

(a*c)=(c*a)=e

8. A group (M,*) is said to be abelian if ___________ *

(2 Points)

(x+y)=(y+x)

(x*y)=(y*x)

(x+y)=x

(y*x)=(x+y)

Option 2

9. Matrix multiplication is a/an _________ property. *

(2 Points)

Commutative

Associative

Additive

Disjunctive

12/14/2020 /
 10. A cyclic group can be generated by a/an ________ element. *
(2 Points)

singular

non-singular

inverse

multiplicative

11. How many properties can be held by a group? *

(2 Points)

12. A cyclic group is always _________ *

(2 Points)

abelian group

monoid

semigroup

subgroup

12/14/2020 /
 13. {1, i, -i, -1} is __________ *
(2 Points)

semigroup

subgroup

cyclic group

abelian group

This content is neither created nor endorsed by Microsoft. The data you submit will be sent to the form owner.

Microsoft Forms

12/14/2020 /
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner