COM3113 -- Fundamentals of Programming -- Assignments
College of Computer Science -- Northeastern University
Fall Quarter 2002
Lab Test
December 3rd, 2002
This is a lab test. It's open book and open notes. But you are not suppose to ask others for help.
Requirements:
1. Please hand in your code by 9:00p.m. no matter you finish it or not.
2. Please write a simple document which explains your idea for this code, e.g. what you want to do and you have done so far.
Question 1 (35 points)
Given two arbitrary sequences, match the two bases in the same position of these sequences using dot plot graph.
For two given sequences, if the two bases in the same position are the same, then it's called match. Otherwise, it doesn't match. We can use "X" in the dot plot to represent the match pair.
More details:
1. The two sequences are not necessary the same lengths.
2. Your code should work for any two given sequences.
3. Please use Java Applet in this program. For example, you can take Sequence 1 and Sequence 2 as input from textfields or textareas and use an 'update' button to update the dotplot graph.
One example can be the following:
given the sequences "ATGCCGATGCCG" and "ATTCGCACGCCT".
They have same bases at position 1,2,4,7,9,10 and 11. (Use 1 as the first index here)
The dot plot graph looks like
Question 2 (35 points)
Please write a program that can reverse an given string, i.e. given a string as input, the output will the reversed string. For example, with input "ab c10defg" the output will be "gfed01c ba".
Note: You can use either console input/output interface or Java Applet.
Question 3 (30 points)
In this question, please write a Java Applet program which will combine your assignment 4 and assignment 5 together.
In your Applet, please read the given DNA sequence as an input. There are checkboxes for the user to choose what is the output, the translated protein sequence or the longest ORF or both. The following is an example. But you can implement the Applet in your own way.
Back to course homepage