Any help on the following T/F would be extremely appreciated! Question 4 Ttrue/F

ID: 3195619 • Letter: A

Question

Any help on the following T/F would be extremely appreciated!

Question 4

Ttrue/False

___ In lexicographical ordering, rst is listed the same as str. 3pt

___ The number of permutations of r objects out of n (r > 1), is greater than the number of combinations of r objects out of n. 3pt

___ To find the number of ways to select 3 items out of 4 distinct objects without regard for the arrangement of the objects, use P(4,3). 3pt

___ The naumbers of ways to select 3 out of 4 distinct objects with repetition allowed is C(6,3). 3pt

In lexicographical ordering, rst is listed the same as str. FALSE

these will be treated as two different strings.

The number of permutations of r objects out of n (r > 1), is greater than the number of combinations of r objects out of n. TRUE

To find the number of ways to select 3 items out of 4 distinct objects without regard for the arrangement of the objects, use P(4,3). FALSE

here, we will use combination not pemutation.So. it will be C(4,3)

The naumbers of ways to select 3 out of 4 distinct objects with repetition allowed is C(6,3) TRUE

If we are selecting an r-combination from n elements with repetition, there are C(n+r1,r)=C(n+r1,n1) ways to do so.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.