16.5.2. Non-Onto Functions

Try these first

1. 1.

   Define a non-onto function.

   Hint

   Think of functions that leave elements out in their mapping.

2. 2.

   What is a recurrence relation?

   Hint

   They often involve addition of earlier terms.

3. 3.

   What constitutes a non-onto function?

   • It covers all elements
   • It covers some elements
   • It covers none

   Hint

   Think about missing mappings.

4. 4.

   True or False: Recurrence relations can exist without prior sequences.

   • True
   • False

   Hint

   Consider their definition and reliance.

5. 5.

   Calculate the number of valid sequences for n = 5 using the derived recurrence relations.

   Hint

   Break down into smaller parts.

6. 6.

   How would you explain the presence of forbidden substrings in bit strings?

   Hint

   Think about what conditions lead to these forbidden strings.