COM3113 -- Fundamentals of Programming -- Assignments
College of Computer Science -- Northeastern University
Fall Quarter 2001
Lab Test
December 3rd, 2001
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.
3. If you can not finish it before 9:00p.m., you can continue work after this lab session and hand in your code after it's finished and before final exam, by the end of Dec. 10th. But there will be 10% late penalty. No hand-in is accepted after final exam.
Question:
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 with some length requirements.
That means, if you hard-coded two sequences in your program, the code should be correct if I only change the values of these two sequences without change any other code.
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
Extra Credit: (20 points out of 100 points)
Take Sequence 1 and Sequence 2 as input from textfields or textareas and use an 'update' button to update the dotplot graph. (i.e. the user can input any two sequences with some requirements on the lengths of these two sequences)
Back to course homepage