Question: Let x be a string of length n , and let y be a string of length n - k , for 1 k n

Let x be a string of length n, and let y be a string of length n-k, for 1 k n. We wish to line up the symbols in x with the symbols in y by adding k blanks to y.

A.) Suppose that we decide to add the k blanks in one continuous block. How many ways are there to do this?

B.)Suppose that we add two separate blocks of blanks, one of size i and one of size k - i, for 1 line up the symbols in x with the symbols in y by i adding k blanks to y. A.) Suppose that we decide to add k. How many ways are there to do this?

Please detail each step taken to get to the answer as I don't completely understand. Also, please don't copy and paste from other answers already given on this Discrete Math problem.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock 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 Databases Questions!

Part 1 Write the Journal Entries On the forms provided on the excel student input file, journalize the following transactions for the month of June for Baxter Company using the following list of...

Let x be a string of length n , and let y be a string of length n k , for 1 k

Let x be a string of length n , and let y be a string of length n ? k , for 1 ? k

Let x be a string of length n , and let y be a string of length n k , for 1 k

1: Refinancing a loan. Suppose someone takes out a home improvement loan for $30,000. The annual interest on the loan is 6% and is compounded monthly. The monthly payment is $600. Let an denote the...

4. A good hash function h(x) behaves in practice very close to the simple uniform hashing assumption analyzed in class, but is a deterministic function. Designing good hash functions is hard, and a...

[36/O39] Consider the following algorithm. QuickSort( Array [1..n] ): If n = 1 then return ; p := [1]; L := (x , x p) in stable order; QuickSort(L);...

The recursive definition given below defines a set S of strings over the alphabet {a, b}: . Base case: A E S and a E S . Recursive rule: if x E S then, o xb E S (Rule 1) o xba E S (Rule 2) This...

The recursive definition given below defines a set S of strings over the alphabet (a, b): Base case: A e S and a S Recursive rule: if x = S then, xb S (Rule 1) xba S (Rule 2) This problem asks you to...

The recursive definition given below defines a set of strings over the alphabet (a, b): Base case: S and a es Recursive rule: if Xe S then, o xD e S (Rule 1) xba e S (Rule 2) This problem asks you to...

stringAlignment (String x, String y). Assume that x is a string of length n and y is a string of length m such that n greaterthanorequalto m. This method returns a string z (obtained by inserting $...

Discuss these questions: Why do we procrastinate? Why is procrastination difficult to deal with? What effective methods do you use to do an unpleasant task? Who do you admire who gets things done...

Lost Dutchman Mines, Inc., is considering investing in Peru. It makes a bid to the government to participate in the development of a mine, the profits of which will be realized at the end of five...

In the CAPM framework, the security beta is defined as the difference between the expected return on the market portfolio and the retur on the risk - free asset.Answer. True I False

For a lump sum payment, use PV=FV/((1+r)^n) For annual payment, use PV=A((1-(1+r)^-n)/(r)) Energy Efficiency Investments (to be completed individually). You are considering an energy-efficient...

2. What strategies does this person employ? What strategies have been the most effective and why?

19. It is not a good idea to become dependent on one person in an organization.

Did the person take the initiative to understand the issue and gather needed information?