| hw-00 | programming language design - spring'2007, dr. s. yurttas - solution |
| rationale |
|
This is your first assignment to practice and show that
you're able to compose an application using
given components by adapting/extending
to new uses other than given types.
You'll practice the fundamentals of programming using imperative language abstraction mechanisms in C++ and Java or C# to compose and structure an application using multiple functions/methods. |
| problem |
You'll write an application either in C++ and in C# or Java
to locate and count the frequency of any pattern
in a range(n1throughn2 inclusive)
for each sequence as follows:
-> dna filenames : dna-filenames.txt
[ input sequences -
dna-00 :
ATCTCTAGTCATA
TATCTATCTCTCT
ACTCCTCTTCTCG
TAGACTAGGACCT
TCTTATCTATTCG
GCCTTGTGGACCC
dna-01 :
.
.
.
]
-> input pattern : tc
-> range begin : 2
end : 6
-> output filename : dna-counts.txt
[
dna-00 :
ATCTCTAGTCATA - 2
TATCTATCTCTCT - 1
ACTCCTCTTCTCG - 1
TAGACTAGGACCT - 0
TCTTATCTATTCG - 0
GCCTTGTGGACCC - 0
dna-01 :
.
.
.
]
|
| credit : 10 points due February 9 by 11pm. |