| hw-02 | programming language design - fall'2007, dr. s. yurttas - solution |
| rationale |
| problem |
|
This is another 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++ or Java or C# to compose and structure an application using multiple [packages/namespaces]/functions/methods/classes. |
| problem |
You'll write an event-driven application either in C++|C#|Java
to replace every occurrence of a given pattern with
another pattern in the given sequence as follows:
-> dna filenames : dna-filenames.txt
[ input sequences -
dna-00 :
ATCTCTAGTCATA
TATCTATCTCTCT
ACTCCTCTTCTCG
TAGACTAGGACCT
TCTTATCTATTCG
GCCTTGTGGACCC
dna-01 :
.
.
.
]
-> matching pattern : tc
-> replacing pattern : gg
-> output filename : dna-replaced.txt
[
dna-00 :
AGGGGTAGGGATA
TAGGTAGGGGGGT
ACGGCGGTGGGGG
TAGACTAGGACCT
GGTTAGGTATGGG
GCCTTGTGGACCC
dna-01 :
.
.
.
]
|
| credit : 20 points due October 8 by 11pm. |