Homework: Queue II; Genome/String Reassembly


  1. Implement the instance method flip declared as follows (this is a Queue<T>):

  2. Rewrite flip, including the contract, so that it is a static method.

  3. Carefully review the Genome/String Reassembly slides. Then, given the following fragments, reassemble the original string by applying the greedy reassembly algorithm presented in the slides. Show in each step the two strings with the longest overlap and the resulting combination.