A company stores payment information for their employee working on a project and paid on a project basis, in a text file whose name is entered through keyboard (see a sample input file below). The first line of the file indicates the number of employees and each subsequent line corresponds to information related to an employee payment (employee name, number of hours worked and his/her hourly wage). Write a python program that reads such a file and displays the employees’ names, their hours worked, and their salaries. Finally, it displays the total payment. Your program should consider the following erroneous cases: ● The file does not open/exist

● The format of the data in the file is incorrect (e. g. hours = “1-” or salary = “unkown”)

in which case a RuntimeError exception should be raised and the processing should continue

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

Aconsumer would pay an extra they used the rent to own program to buy the computer, rather than using cash. for all of the items, is the cheapest option over the life of the contract. the most expensive overall option is to use purchase the item.

Which program can damage your computer?