★ Learning Check 2¶
We assume that you’ve already covered (and only covered) all of our previous sessions. The techniques for solving the problems below are, with 100% certainty, covered in the previous three lessons.
Note: This does not mean that they are explicitly mentioned in one of our previous lessons. Recall that we emphasize finding specific commands, options, and tools on your own. However, we have covered the core concepts before.
The problems below do not specify how you should solve them. Instead, we’ll present you with tasks to perform and you’ll need to determine the output.
Additionally, you’ll never need to download any software. Everything you need is on EC2.
In the real world, you’re often on your own when you’re stuck and need help. Reading through Google searches, documentations, tutorials, and manuals is a real life skill.
However, we don’t just want to throw you off the deep end. If you do get stuck on something and you can’t figure it out, you can draft an email and send it to Sabeel. Provide a specific description of 1) what you’re trying to accomplish 2) what issue you’re running into 3) what you’ve already tried to troubleshoot it. If we find many common issues, we’ll send out an FAQ/hints email on Sunday.
Good luck, have fun!¶
Find the 100th Fibonacci number (without Googling!).
You may try to write a recursive solution, but it will not run in time. Perhaps this can help?
In the lab, you’re often not going to be given an explanation (such as provided above) of how to perform a task. This challenge will test your ability to use your resources (internet, documentation, etc.) to extend phylogenetic analysis given only input and output.
In: Many times, phylogenetic trees are exported as XML files. XML stands for eXtensible Markup Language, and is used in a wide range of applications that require storage or transport of data in a structured fashion. Provided are two XML files,
single.xml, containing one phylogenetic tree, and
many.xml, containing many different phylogenetic trees.
Out: When your program is executed, the following should be printed to the terminal for every tree (from both files):
- [Tree Name] or “Unnamed”
- [Tree Description] or “No description”
- [Phylogenetic tree ordered with deepest clades* on top]
*Clade depth is defined by the number of terminal nodes.