COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
10*10
|
|
|
10^10
|
|
|
10!
|
|
|
10+10
|
|
|
log 10
|
Detailed explanation-1: -Combinations are a way to calculate the total outcomes of an event where order of the outcomes does not matter. To calculate combinations, we will use the formula nCr = n! / r! * (n-r)!, where n represents the total number of items, and r represents the number of items being chosen at a time.
Detailed explanation-2: -There is a way you can calculate permutations using a formula. This formula is: P(n, r) = n! ÷ (n-r)! The generalized expression of the formula is, “How many ways can you arrange ‘r’ from a set of ‘n’ if the order matters?"
Detailed explanation-3: -The original 3x3x3 Rubik’s cube has 43 252 003 274 489 856 000 combinations, or 43 quintillion. Again, as pointed out on this website’s main page, this is a manageably imaginable number. It’s a little less than the square of the earth’s population, for example.