# Genome Sequencing (Bioinformatics II) Coursera Quiz Answers

## All Weeks Genome Sequencing (Bioinformatics II) Coursera Quiz Answers

### Genome Sequencing (Bioinformatics II) Week 01 Quiz Answers

Q1. True or False: The human genome is not the longest genome of any organism on Earth.

• True
• False

Q2. What is a cycle that visits every edge in a graph called?

• Hamiltonian
• Erdosian
• Eulerian
• de Bruijnian
• Nashlike

Q3. Below is the adjacency list of a graph. Which of the following is a Hamiltonian cycle in this graph? (Select all that apply.)

1 -> 2,3,5

2 -> 4,5

3 -> 1,2,5

4 -> 1,3

5 -> 2,4

• 1 -> 3 -> 5 -> 2 -> 4 -> 1
• 1 -> 3 -> 2 -> 5 -> 4 -> 1
• 1 -> 5 -> 4 -> 3 -> 2 -> 1
• 2 -> 4 -> 3 -> 5 -> 2

Q4. Which of the following are 3-universal linear binary strings? (Select all that apply.)

• 1000101110
• 1100011011
• 1101000111
• 0011100100
• 0101010100
• 1110001011

Q5. What is the indegree of GTA in the de Bruijn graph constructed for the following collection of 4-mers? (Hint: how can you answer this question without having to construct the de Bruijn graph?)

• GCGA
• CAAG
• AAGA
• GCCG
• ACAA
• AGTA
• TAGG
• AGTA
• ACGT
• AGCC
• TTCG
• AGTT
• AGTA
• CGTA
• GCGC
• GCGA
• GGTC
• GCAT
• AAGC
• TAGA
• ACAG
• TAGA
• TCCT
• CCCC
• GCGC
• ATCC
• AGTA
• AAGA
• GCGA
• CGTA

### Genome Sequencing (Bioinformatics II) Week 02 Quiz Answers

Q1. Give a linear string having the following 4-mer composition.

• AAAT
• AATG
• ACCC
• ACGC
• ATAC
• ATCA
• ATGC
• CAAA
• CACC
• CATA
• CATC
• CCAG
• CCCA
• CGCT
• CTCA
• GCAT
• GCTC
• TACG
• TCAC
• TCAT
• TGCA

Q2. Below is the adjacency list of a graph. What is the minimum number of edges we must add to this graph in order to make each node balanced? (You may add duplicate edges connecting the same two nodes, but do not add new nodes.)

• 1 -> 2,3,5
• 2 -> 1,4
• 3 -> 2,5
• 4 -> 1,2,5
• 5 -> 3

Q3. There is a single (linear) string with the following (3,1)-mer composition. Find it.

• (ACC|ATA)
• (ACT|ATT)
• (ATA|TGA)
• (ATT|TGA)
• (CAC|GAT)
• (CCG|TAC)
• (CGA|ACT)
• (CTG|AGC)
• (CTG|TTC)
• (GAA|CTT)
• (GAT|CTG)
• (GAT|CTG)
• (TAC|GAT)
• (TCT|AAG)
• (TGA|GCT)
• (TGA|TCT)
• (TTC|GAA)

Q4. True or False: every Eulerian path in the de Bruijn graph constructed from a k-mer composition must spell out a solution to the String Reconstruction Problem.

• True
• False

Q5. True or False: read breaking cannot transform reads with imperfect coverage into reads with perfect coverage.

• True
• False

### Genome Sequencing (Bioinformatics II) Week 03 Quiz Answers

Q1. True or False: Tyrocidine B1 is synthesized by NRP synthetase.

• True
• False

Q2. Which of the following RNA strings could translate into the amino acid string PRTEIN? (Select all that apply.)

• CCCAGUACCGAAAUUAAC
• CCGAGGACCGAAAUCAAC
• CCCAGGACUGAGAUCAAU
• CCCCGUACGGAGAUGAAA

Q3. How many DNA strings transcribe and translate into the amino acid string MASS?

Q4. What is the integer mass of tryptophan?

Q5. Which of the following cyclic peptides could have generated the theoretical spectrum 0 71 101 113 131 184 202 214 232 285 303 315 345 416? (Select all that apply.)

• TLAM
• MAIT
• MTAI
• TAIM
• TALM
• TMIA

Q6. Which of the following linear peptides is consistent with Spectrum = {0 71 99 101 103 128 129 199 200 204 227 230 231 298 303 328 330 332 333}? (Select all that apply.)

• AQV
• CTV
• TCQ
• VAQ
• TCE
• QCV

### Genome Sequencing (Bioinformatics II) Week 04 Quiz Answers

Q1. True or False: In practice, we need to account for the charge of a fragment ion when dealing with real spectra.

• True
• False

Q2. True or False: Increasing the size of the leaderboard cannot increase the likelihood of LeaderboardCyclopeptideSequencing identifying a highest-scoring peptide.

• True
• False

Q3. If Peptide = MAMA and Spectrum = {0 71 71 71 131 131 131 156 198 199 199 202 202 202 333 333 333 404 404}, then what is Score(Peptide, Spectrum)?

Q4. If Peptide = PEEP and Spectrum = {0 97 97 129 129 194 203 226 226 258 323 323 323 355 403 452}, then what is LinearScore(Peptide, Spectrum)?

Q5. What element has largest multiplicity in the spectral convolution of Spectrum = {0 86 160 234 308 320 382}?