Lesson 7.01d-k
7.01d-k Arrangements, multiplicative principle and inclusion-exclusion Quiz: OCR Further Maths, Unit 4
20 questions
In partnership with Revision Ninja
Lesson 7.01d-k, Arrangements, multiplicative principle and inclusion-exclusion: 20 multiple choice questions for the OCR Further Maths (H245), Unit 4: Discrete Mathematics (Y544), written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What is the number of distinct ways to arrange 5 distinct books on a shelf?
- 25
- 120
- 60
- 24
-
How many different outcomes are possible when rolling two fair six-sided dice?
- 12
- 36
- 216
- 64
-
Which counting principle states that sequential independent choices multiply their number of possibilities?
- Pigeonhole principle
- Inclusion-exclusion principle
- Multiplicative principle
- Additive principle
-
What is the value of 7P3, the number of permutations of 3 items from 7?
- 42
- 35
- 210
- 5040
-
What is the value of 8C3, the number of ways to choose 3 items from 8?
- 56
- 336
- 24
- 112
-
How many distinct arrangements are there of the letters in the word RADAR?
- 120
- 30
- 60
- 15
-
In how many ways can 6 people sit around a circular table?
- 24
- 360
- 120
- 720
-
In how many ways can 5 distinct keys be arranged on a key ring?
- 24
- 120
- 12
- 60
-
How many subsets of all sizes does a set with 6 elements have?
- 12
- 36
- 720
- 64
-
What is the Principle of Inclusion-Exclusion formula for two sets, A and B?
- |A| + |B| - |A ∩ B|
- |A| + |B|
- |A| + |B| + |A ∩ B|
- |A| × |B| - |A ∩ B|
-
If set A has 20 elements, set B has 15, and their intersection has 8, find |A ∪ B|.
- 27
- 43
- 23
- 35
-
How many distinct arrangements of the letters MATRIX keep the two vowels together?
- 720
- 480
- 240
- 120
-
How many positive integer solutions exist for the equation x + y + z = 10?
- 36
- 120
- 45
- 66
-
How many non-negative integer solutions exist for the equation x + y + z = 8?
- 28
- 21
- 45
- 56
-
What is defined as a permutation of elements where no element appears in its original position?
- Derangement
- Transposition
- Combination
- Involutive map
-
How many derangements exist for a set containing 4 distinct elements?
- 24
- 12
- 8
- 9
-
How many integers from 1 to 100 are divisible by 2 or 3?
- 66
- 83
- 50
- 67
-
How many ways can 4 people sit in a row if 2 specific people must NOT sit together?
- 6
- 24
- 12
- 18
-
How many surjections exist from a set of 3 elements to a set of 2 elements?
- 6
- 8
- 2
- 9
-
What is the general formula for the number of r-permutations from n distinct objects?
- (n - r)! / n!
- n! / (n - r)!
- n! / (r!(n - r)!)
- n! / r!
Related quizzes
- Existence problems, set notation and the pigeonhole principle Quiz · 7.01a-c · 20 questions
- Graph terminology, complete and bipartite graphs Quiz · 7.02a-e · 20 questions
- Eulerian and Hamiltonian graphs, isomorphism, digraphs, planarity and networks Quiz · 7.02g-p · 20 questions
- Algorithms, tracing and efficiency Quiz · 7.03a-e · 20 questions
- Sorting algorithms and bin packing Quiz · 7.03i-m · 20 questions
- Shortest paths, minimum spanning trees and nearest neighbour Quiz · 7.04a-c · 20 questions
- Route inspection and choosing a network algorithm Quiz · 7.04e-f · 20 questions
- Critical path analysis Quiz · 7.05a · 20 questions
- Formulating linear programming problems and slack variables Quiz · 7.06a-b · 20 questions
- Graphical solutions and the effect of changing constraints Quiz · 7.06c-e · 20 questions