Passwords of length 10 are formed using the character set S = {a, b, c, …,...

Passwords of length 10 are formed using the character set S = {a, b, c, …, z, A, B, …, Z, 0, 1, 2, .., 9}. Thus the set S consists of 62 different characters. For each part below, you must include a few words that describe your counting strategy.
(a) How many passwords of length 10 use the character Q exactly two times?
(b) How many passwords of length 10 use at most one of the “upper case” letters (the A, B, …, Z letters)?
(c) How many passwords of length 10 repeats at least one character?
(d) How many passwords of length 10 repeats at least one character and also include the character M at least
once?

Expert Solution

a) The number of passwrods of length 10 that use the character Q exactly two times here is computed here as:
= Number of ways to select 2 positions from the 10 positions which will have Q * Number of ways to choose from 61 letters for each of the remaining 8 positions

b) The number of passwords of length 10 that use at most one of the “upper case” letters (the A, B, …, Z letters) is computed here as:
= Number of passwords that dont use the “upper case” letters (the A, B, …, Z letters) + Number of passwords that use exactly 1 “upper case” letters (the A, B, …, Z letters)

c) The number of passwrods of length 10 that repeats at least one character here is computed as:

= Total number of passwords possible - Number of passwords with no character repetition

d) Now the number of passwords of length 10 that repeats at least one character and also include the character M at least once is computed here as:

= Total number of passwords of length 10 that repeats at least one character - Total number of passwords of length 10 that repeats at least one character and dont have an M

This is the required expression here.

orchestra answered 2 years ago

Consider passwords of length 8 using symbols from the set of lower case letters: {a, b,...

Consider passwords of length 8 using symbols from the set of lower case letters: {a, b, c, ..., z}. (a) How many such passwords use the letter p exactly two times and the letter q exactly two times? To illustrate, both akpqbqop and quaqpoop satisfy this condition. Include a brief indication of your strategy. (b) How many such passwords use the letter p exactly once and the letter q exactly once and also have letters arranged so the p is...

Using the pigeonhole theorem prove that any set of 220 10-character strings over the alphabet {a,b,c,d}...

Using the pigeonhole theorem prove that any set of 220 10-character strings over the alphabet {a,b,c,d} contains a pair of anagrams.

Let S = {a, b, c}. Draw a graph whose vertex set is P(S) and for...

Let S = {a, b, c}. Draw a graph whose vertex set is P(S) and for which the subsets A and B of S are adjacent if and only if A ⊂ B and |A| = |B| − 1. (a) How many vertices and edges does this graph have? (b) Can you name this graph? (c) Is this graph connected? (d) Does it have a perfect matching? If yes, draw a sketch of the matching. (e) Does it have a...

(In C)Set hasDigit to true if the 3-character passCode contains a digit.

Set hasDigit to true if the 3-character passCode contains a digit. (in C) #include <stdio.h> #include <string.h> #include <stdbool.h> #include <ctype.h> int main(void) { bool hasDigit; char passCode[50]; hasDigit = false; scanf("%s", passCode); /* Your solution goes here */ if (hasDigit) { printf("Has a digit.\n"); } else { printf("Has no digit.\n"); } return 0; }

(C++)Set hasDigit to true if the 3-character passCode contains a digit.

C++. Set hasDigit to true if the 3-character passCode contains a digit. #include #include #include using namespace std; int main() {bool hasDigit;string passCode; hasDigit = false;cin >> passCode; /* Your solution goes here */ if (hasDigit) {cout

Let S = {a, b, c, d} and P(S) its power set. Define the minus binary...

Let S = {a, b, c, d} and P(S) its power set. Define the minus binary operation by A − B = {x ∈ S | x ∈ A but x /∈ B}. Show that (by counter-examples) this binary operation is not associative, and it does not have identity

Let S{a, b, c, d} be a set of four positive integers. If pairs of distinct...

Let S{a, b, c, d} be a set of four positive integers. If pairs of distinct elements of S are added, the following six sums are obtained:5,10, 11,13,14,19. Determine the values of a, b, c, and d. (There are two possibilities. )

Let the schema R = (A,B,C) and the set F = {A → B,C → B}...

Let the schema R = (A,B,C) and the set F = {A → B,C → B} of FDs be given. Is R in 3NF? Why or why not?

Same topic: 1. Consider all passwords of length 10 made up of numbers, lower-case letters, and...

Same topic: 1. Consider all passwords of length 10 made up of numbers, lower-case letters, and upper-case letters (from the English alphabet). a) If you pick such a password at random, what is the likelihood that it contains exactly 5 lower-case letters? b) If you pick such a password at random, what is the likelihood that it contains at most 9 lower-case letters? 2. Suppose you’re an ornithologist who specializes in American crows (Corvus brachyrhynchos), and you’ve collected data on...

[02] For n ≥ 1, how many strings of length n using letters a,b,c are there...

[02] For n ≥ 1, how many strings of length n using letters a,b,c are there if the letter a must occur an even number of times?

Question