Write a function named clonelines that takes two parameters:

1. infile, a string, the name of an input file that exists before clonelines is called
2. outfile, a string, the name of an output file that clonelines creates and writes to

the function clonelines reads the content of infile, line by line, and writes into outfile any line that contains at least one word that occurs more than once on the line. you may assume that the input file contains only lowercase letters, spaces and newline characters.

for example, if the following is the content of the file william. txt:

double double toil and trouble fire burn and caldron bubble

eye of newt and toe of frog fillet of a fenny snake in the caldron boil and bake

double double toil and trouble fire burn and caldron bubble

the following function call:

> > > infile = 'william. txt'

> > > outfile = 'clones. txt'

> > > clonelines (infile, outfile)

should create the file clones. txt with the content:

double double toil and trouble eye of newt and toe of frog double double toil and trouble

Which of the following is a true statement about milestones

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

Write a program that defines symbolic names for several string literals (chars between quotes). * use each symbolic name in a variable definition. * use of symbolic to compose the assembly code instruction set can perform vara = (vara - varb) + (varc - vard); ensure that variable is in unsigned integer data type. * you should also further enhance your symbolic logic block to to perform expression by introducing addition substitution rule. vara = (vara+varb) - (varc+vard). required: debug the disassembly code and note down the address and memory information.