Each of the 10 letters can be posted in any of the 5 boxes.

So, the first letter has 5 options, so does the second letter and so on and so forth for all of the 10 letters.

i.e. 5*5*5*….*5 (upto 10 times) = 5 ^ 10.

There are seven positions to be filled.

The first position can be filled using any of the 7 letters contained in PROBLEM.

The second position can be filled by the remaining 6 letters as the letters should not repeat.

The third position can be filled by the remaining 5 letters only and so on.

Therefore, the total number of ways of rearranging the 7 letter word = 7*6*5*4*3*2*1 = 7! ways.

Both of them are relation ship constraints

LDI is the capacity to change the conceptual schema without having to change external schemas or application programs.

The description of a data base is called the database schema , which is specified during database design and is not expected to change frequently . A displayed schema is called schema diagram .We call each object in the schema as schema construct.

ABACUS is a 6 letter word with 3 of the letters being vowels.

If the 3 vowels have to appear together, then there will 3 other consonants and a set of 3 vowels together.

These 4 elements can be rearranged in 4! Ways.

The 3 vowels can rearrange amongst themselves in 3!/2! ways as "a" appears twice.

Hence, the total number of rearrangements in which the vowels appear together are (4! x 3!)/2!

The first letter is E and the last one is R.

Therefore, one has to find two more letters from the remaining 11 letters.

Of the 11 letters, there are 2 Ns, 2Es and 2As and one each of the remaining 5 letters.

The second and third positions can either have two different letters or have both the letters to be the same.

Case 1: When the two letters are different. One has to choose two different letters from the 8 available different choices. This can be done in 8 * 7 = 56 ways.

Case 2: When the two letters are same. There are 3 options - the three can be either Ns or Es or As. Therefore, 3 ways.

Total number of possibilities = 56 + 3 = 59

Since order does not matter it is a combination. 

The word AND means multiply. 

Given 4 basketball, 3 volleyball, 2 soccer. 

We want 2 basketball games and 1 other event. There are 5 choices left. 

C(n,r) 

C(How many do you have, How many do you want) 

C(have 4 basketball, want 2 basketball) x C(have 5 choices left, want 1) 

C(4,2) x C(5,1) = (6)(5) = 30

Therefore there are 30 different ways in which you can go to two basketball games and one of the other events.