logo
  • Home
  • Test & Rank
  • About
  • Training
  • Programming
  • CS
  • IT
  • IS
  • ECE
  • EEE
  • EE
  • Civil
  • Mechanical
  • Chemical
  • Metallurgy
  • Instrumentation
  • Aeronautical
  • Aerospace
  • Biotechnology
  • Mining
  • Marine
  • Agriculture
  • MCA
  • BCA
  • Internship
  • Jobs
  • Contact

Discrete Mathematics Multiple Choice Questions | MCQs | Quiz

Discrete Mathematics Interview Questions and Answers
Practice Discrete Mathematics questions and answers for interviews, campus placements, online tests, aptitude tests, quizzes and competitive exams.

Get Started

•   Propositions
•   Logic & Bit Operations
•   Implications
•   Logic Circuits
•   De-Morgan's Laws
•   Tautologie & Contradictions
•   Statements Types
•   Logical Equivalences
•   Predicate Logic Quantifiers
•   Nested Quantifiers
•   Inference
•   Proofs Types
•   Set Types
•   Sets
•   Set Operations - 1
•   Set Operations - 2
•   Venn Diagram
•   Algebraic Laws on Sets
•   Cartesian Product of Sets
•   Subsets
•   Functions
•   Functions Growth
•   Functions Range
•   Number of Functions
•   Floor & Ceiling Function
•   Inverse of a Function
•   Arithmetic Sequences
•   Geometric Sequences
•   Arithmetic Mean
•   Special Sequences
•   Harmonic Sequences
•   Cardinality of Sets
•   Matrices Types
•   Matrices Operations
•   Matrices Properties
•   Transpose of Matrices
•   Inverse of Matrices
•   Sequences & Summations
•   Algorithms
•   Algorithms Types
•   Algorithms Complexity - 1
•   Algorithms Complexity - 2
•   Integers & Algorithms
•   Integers & Division
•   Prime Numbers
•   Quadratic Residue
•   Least Common Multiples
•   Highest Common Factors
•   Base Conversion
•   Complement of a Number
•   Exponents Rules
•   Number Theory Applications
•   Greatest Common Divisors
•   Modular Exponentiation
•   Cryptography Encryption
•   Cryptography Decryption
•   Ciphers
•   Mathematical Induction
•   Strong Induction
•   Recursion
•   Counting Principle
•   Pigeonhole Principle
•   Linear Permutation
•   Circular Permutations
•   Combinations
•   Divisors - Number & Sum
•   Objects Division
•   Equations Solution
•   Derangements
•   Binomial Expansion Terms
•   Binomial Coefficient
•   Recurrence Relation
•   ↓ Probability ↓
•   Addition Theorem
•   Multiplication Theorem
•   Geometric Probability
•   Probability Distribution
•   Random Variables
•   Bayes Theorem
•   Generating Functions
•   Exclusion Principle
•   Logarithmic Series
•   Power Series
•   Number of Relations
•   Relations Closure
•   Relations Types
•   Partial Orderings
•   Equivalence Classes
•   Diagraph
•   Hasse Diagrams
•   Lattices
•   Bipartite Graphs
•   Graphs Properties
•   Connected Graphs
•   Graphs Isomorphism
•   Graph - Different Path
•   Degree & Graph Coloring
•   Graph's Matrices
•   Tree Properties
•   Cycles
•   Tree Traversal
•   Notations Interconversion
•   Spanning Trees
•   Boolean Algebra
•   Boolean Functions
•   Functions Minimization
•   Karnaugh Maps
•   Gates Interconversion
•   Prime Implicants
•   Finite State Automation
•   Group Theory
•   Group Axioms
•   Closure & Associativity
•   Identity & Inverse Existence
•   Subgroups
•   Cosets
•   Cyclic Groups
•   Permutation Groups
•   Burnside Theorem

Best Reference Books

Discrete Mathematics Books

« Prev Page
Next Page »

Discrete Mathematics Questions and Answers – Multiplication Theorem on Probability

Posted on August 17, 2017 by Manish

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}\).

3. How many positive divisors does 4000 = 25 53 have?
a) 49
b) 73
c) 65
d) 15
View Answer

Answer: d
Explanation: Any positive divisor of 4000 must be of the form 2x5y, 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 path is chosen at random, what is the probability that a person can travel from the Chennai to the via the 4th and 9th road?
a) \(\frac{3}{67}\)
b) \(\frac{5}{9}\)
c) \(\frac{2}{31}\)
d) \(\frac{1}{24}\)
View Answer

Answer: d
Explanation: There is a \(\frac{1}{6}\) chance of choosing the 4th path, and there is a \(\frac{1}{4}\) chance of choosing the 9th 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 \(\frac{1}{6} * \frac{1}{4} = \frac{1}{24}\) chance of choosing the 4th-9th 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}\).

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}\).
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.

« Prev Page - Discrete Mathematics Questions and Answers – Addition Theorem on Probability
» Next Page - Discrete Mathematics Questions and Answers – Geometric Probability

« Discrete Mathematics Questions and Answers – Addition Theorem on Probability
Discrete Mathematics Questions and Answers – Geometric Probability »
advertisement

Deep Dive @ Sanfoundry:

  1. Contact
  2. Course Registration – 2
  3. C# Programming Examples on Mathematics
  4. Engineering Mathematics Questions and Answers
  5. Discrete Mathematics Questions and Answers
  6. Discrete Mathematics Questions and Answers – Binomial Coefficient
  7. Discrete Mathematics Questions and Answers – Derangements
  8. Discrete Mathematics Questions and Answers – Mean and Variance of Random Variables
  9. Discrete Mathematics Questions and Answers – Combinations
  10. Engineering Mathematics Questions and Answers – Set Theory of Probability – 2
Manish Bhojasia
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @ LinkedIn | Facebook | Twitter

Best Careers

Developer Tracks
SAN Developer
Linux Kernel Developer
Linux Driver Developer
Linux Network Developer

Live Training Photos
Mentoring
Software Productivity
GDB Assignment
Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel Programming. Our Founder has trained employees of almost all Top Companies in India such as VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium, ST-Micro, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Mphasis, Tata-Elxsi, Tata VSNL, Mindtree, Cognizant and Startups.

Best Trainings

SAN I - Technology
SAN II - Admin
Linux Fundamentals
Advanced C Training
Linux-C Debugging
System Programming
Network Programming
Linux Threads
Kernel Programming
Kernel Debugging
Linux Device Drivers

Best Reference Books

Computer Science Books
Algorithm & Programming Books
Electronics Engineering Books
Electrical Engineering Books
Chemical Engineering Books
Civil Engineering Books
Mechanical Engineering Books
Industrial Engineering Books
Instrumentation Engg Books
Metallurgical Engineering Books
All Stream Best Books

Questions and Answers

1000 C Questions & Answers
1000 C++ Questions & Answers
1000 C# Questions & Answers
1000 Java Questions & Answers
1000 Linux Questions & Answers
1000 Python Questions
1000 PHP Questions & Answers
1000 Hadoop Questions
Cloud Computing Questions
Computer Science Questions
All Stream Questions & Answers

India Internships

Computer Science Internships
Instrumentation Internships
Electronics Internships
Electrical Internships
Mechanical Internships
Industrial Internships
Systems Internships
Chemical Internships
Civil Internships
IT Internships
All Stream Internships

About Sanfoundry

About Us
Copyright
Terms
Privacy Policy
Jobs
Bangalore Training
Online Training
Developers Track
Mentoring Sessions
Contact Us
Sitemap
© 2011 Sanfoundry. All Rights Reserved.