Question: A database uses record identifiers that are alphanumeric strings in which the 10 decimal digits and 26 upper-case letters are valid symbols. The criteria

A database uses record identifiers that are alphanumeric strings in which the

A database uses record identifiers that are alphanumeric strings in which the 10 decimal digits and 26 upper-case letters are valid symbols. The criteria that define a valid record identifier are recursive. A valid record identifier of length n > 2 can be constructed in the following ways: beginning with any upper-case letter other than D and followed by any valid record identifier of length n 1; beginning with 1C, 2K, or 7J and followed by any valid record identifier of length n - 2; or | beginning with D and followed by any string of n 1 decimal digits. Let r(n) denote the number of valid record identifiers of length n. We take r(0) = 1 and note that r(1) = 26. Find a recursion for r(n) when n > 2 and use it to compute r(5).

Step by Step Solution

3.34 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve this problem we need to find a recursive formula for rn which represents the number of vali... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!