Exam 6: Counting
Exam 1: The Foundations: Logic and Proofs200 Questions
Exam 2: Basic Structures: Sets, Functions, Sequences, Sums, Matrices214 Questions
Exam 3: Algorithms52 Questions
Exam 4: Number Theory and Cryptography154 Questions
Exam 5: Induction and Recursion53 Questions
Exam 6: Counting156 Questions
Exam 7: Discrete Probability53 Questions
Exam 8: Advanced Counting Techniques128 Questions
Exam 9: Relations74 Questions
Exam 10: Graphs127 Questions
Exam 11: Trees97 Questions
Exam 12: Boolean Algebra77 Questions
Exam 13: Modeling Computation71 Questions
Select questions type
Find the number of positive integers not exceeding 1000 that are not divisible by 4, 6, or 9.
(Short Answer)
4.7/5
(41)
How many subsets with an odd number of elements does a set with 10 elements have?
(Short Answer)
4.9/5
(44)
Using the ordinary alphabet and allowing repeated letters, find the number of words of length 8 that have at
least one
C.
(Short Answer)
4.9/5
(35)
Aprocomputerve that someis programmedsubset musttohaprinve bteensubsetsprintedof at{1,least2, 3, 4t,wice.5} at random. If the computer prints 40 subsets,
(Short Answer)
4.9/5
(40)
In questions suppose you have a class with 30 students - 10 freshmen, 12 sophomores, and 8 juniors.
-In how many ways can you get a committee of 7?
(Short Answer)
4.8/5
(45)
If the permutations of 1,2,3,4,5,6 are written in lexicographic order, with 123456 in position # 1,123465 in position #2, etc., find the permutation immediately after 246531 .
(Short Answer)
4.9/5
(41)
In questions let A be the set of all bit strings of length 10.
-How many bit strings of length 10 have more 0's than 1's?
In questions 45-48 suppose you have 30 books (15 novels, 10 history books, and 5 math books). Assume that
all 30 books are different. In how many ways can you
(Short Answer)
4.7/5
(28)
You have 20 cards and 12 envelopes (labeled 1, 2, . . . , 12). In how many ways can you put the 20 cards into
the envelopes if
(a) the cards are distinct.
(b) the cards are identical.
(c) the cards are identical and no envelope can be left empty.
(Short Answer)
4.8/5
(41)
In questions let A be the set of all strings of decimal digits of length five. For example 00312 and 19483
are strings in
-How many strings in A have exactly three
(Short Answer)
5.0/5
(35)
Find the number of words of length eight of distinct letters of the alphabet so that the words do not have
both A and B in them.
(Short Answer)
4.8/5
(40)
Find the number of subsets of S = {1, 2, 3, . . . , 10} that contain neither 5 nor 6.
(Short Answer)
4.9/5
(38)
How many ways are there to select 6 students from a class of 25 to serve on a committee?
(Short Answer)
4.9/5
(43)
How many different strings can be made using all the letters in the word GOOGOL?
(Short Answer)
5.0/5
(33)
How many permutations of the seven letters A, B, C, D, E, F, G have E in one of the first two positions?
(Short Answer)
4.8/5
(46)
In questions suppose that a "word" is any string of seven letters of the alphabet, with repeated letters
allowed.
-How many words begin with a vowel or end with a vowel?
(Short Answer)
4.7/5
(47)
Findeven. the number of subsets of S = {1, 2, 3, . . . , 10} that contain exactly five elements, the sum of which is
(Short Answer)
4.9/5
(37)
Explain how the Pigeonhole Principle can be used to show that among any 11 integers, at least two must have
the same last digit.
(Short Answer)
4.9/5
(39)
Showing 101 - 120 of 156
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)