FlashKeepers

Computer Science · College · College and University

Discrete Math for Computer Science, Unit 4: Combinatorics

Discrete Math for Computer Science, unit: Combinatorics. Core concepts, terminology, and worked-example cues a college student meets for this unit, building on prior units without repeating them. Front: a term, concept, or short problem cue. Back: the definition, explanation, or answer.

About this set

38 basic cards for College Computer Science. Set 4 of 8 in Discrete Math for Computer Science. It opens with "What is combinatorics?" and "What is the multiplication principle in counting?". Study it alongside the other College sets below.

38 cards · basic cards · AI-written, checked twice. Edit anything.

Study this set free Look inside first Get FlashKeepers for iPhone

Opens in your browser, no account. Get the iPhone and iPad app · Android app

What is combinatorics?
Show answerThe branch of mathematics studying counting, arrangement, and combination of objects
What is the multiplication principle in counting?
Show answerIf one event can occur in m ways and another in n ways, both together occur in m times n ways
What is the addition principle in counting?
Show answerIf two events cannot occur together, the total ways either occurs is the sum of their individual ways
What is a permutation?
Show answerAn arrangement of objects where order matters
What is a combination?
Show answerA selection of objects where order does not matter
What is the formula for permutations of n objects taken r at a time?
Show answern! divided by (n minus r)!
What is the formula for combinations of n objects taken r at a time?
Show answern! divided by (r! times (n minus r)!)
What does n! (n factorial) represent?
Show answerThe product of all positive integers from 1 up to n
What is the pigeonhole principle?
Show answerIf more items are placed into fewer containers than items, at least one container holds more than one item
What is a practical use of the pigeonhole principle?
Show answerProving that some collision or repetition must occur without identifying it explicitly
What is the binomial theorem used for?
Show answerExpanding expressions of the form (a plus b) raised to a power n
What are binomial coefficients?
Show answerThe numeric coefficients in a binomial expansion, equal to combination values
What is Pascal's Triangle?
Show answerA triangular array of binomial coefficients where each number is the sum of the two above it
What is a permutation with repetition?
Show answerAn arrangement where the same object can be selected more than once
What is the difference between a permutation and a combination?
Show answerA permutation considers order significant, while a combination does not

23 more cards in the app

Study this set free