Multiplication Rule Hint:

Consider the following question:

"A multiple choice test consists of 5 questions each with 4 possible answers, of which only
one is correct. In how many different ways can a student check out one answer to each
question?"
Now recall multiplication rule......
"If an operation can be performed in n1 ways and a second operation can be performed in
n2 ways, then both operations can be performed simultaneously in n1 x n2 ways........"
Now observe in question, number of operations are 5 (i.e. 5 questions to be attempted). And each
operation can be performed in 4 ways(i.e. 4 answers). The 1st question can be answered in 4
ways, similarly the 2nd in 4 ways, the 3rd in 4 ways and so on.So;
Total no. of ways to check an answer= 4x4x4x4x4= 1024 ways.

Choice Multiplication method:

There are 3 ways;
1- Consider the following question:- "How many 3-digit numbers can be formed from the
digits 0,1,2,3,4,5,6 if each digit can be used only once."
In such questions where you just need to form certain numbers without any preference (i.e. even
numbers, odd numbers, greater than 330 etc); start by allocating the maximum choices to the
'Hundreds' position(but without zero digit as we can not place a zero there to form 3-digit
number). So, HUN position can be filled in (7-1)= 6 ways. Now move to tens position. Here you
can place 0, but you cant use the digit number you already used in HUN position,so TEN position
can be filled in (7-1)=6 ways (here 1 is subtracted to eliminate the choice of HUN).
Now move to Units position. UNIT position can be filled in (7-2)=5 ways (-2 to eliminate HUN
& TEN choice).
Total no. of digits formed=6x6x5=180 digits
NOTE: Preference cases include desire for even, odd numbers, for no.s greater than 450, or less
than 600 etc
2-"How many of these are odd numbers."
Now we have a preference for numbers. Odd numbers. So in such questions ALWAYS FILL
THE UNITS POSITION FIRST. Because odd numbers are defined by the digit in the units
position. Here we can only place odd digits (1,3,5). So number of ways to fill units position is 3
ways. Now jump to HUNDREDS position , eliminating the choices of 0 and the digit filled in
Units position , number of ways to fill hun position is (7-2)=5 ways. Now finally, no. ways to fill
tens pos. is (7-2)=5 ways(0 can be placed but the choices in HUN and UNITS can't be used here).

no of digits=5x5x3= 75 digits.
3- Choice-Break case:
Certain preferences like for even numbers,or for numbers greater than 330 lets say, require us to
break choice allocation and then add them. This is because of presence of 0 digit in sample space.
if 0 is present, some choices disappear from actual no. of ways.So whenever zero is inclusive we
will break numbers.
e.g "How many of these are even numbers?"
Now our priority is filling the units position first as there is preference.
Break choice allocation as;
No. of digits ending with zero + No. of digits ending with non-zero ----(eq 1)
For the first part, in units, 1 choice. Jump to HUN pos. No. of choice there is (7-1)=6 (0 cant be
put in HUN and as a 0 is present in UNITS, so there is no need of subtracting another 1 choice,
all digits can be placed here)
In TENS, (7-2)=5 choices. => so No.Ending with zero = 6x5x1=30 ways
For the second part, three digits to place in units to have an even number (2,4,6)=> 3
choices.Jump to HUN, 0 and digit placed in units can't be used here,so (7-2)=5 ways.
finally, in tens, 0 can be placed, but 2 choices used in HUN and UNITS can't be used =>(7-2)=5
ways.
no.ending with non-zero=5x5x3= 75 ways.
eq(1)=>
30=75=105 even numbers.
This can also be done for cases of greater than/less than. As preference is there, Allocation order
will be UNIT>HUN>TEN.