Debug : // This pseudocode should create a report that contains an

// apartment complex rental agent's commission. The

// program accepts the ID number and name of the agent who

// rented the apartment, and the number of bedrooms in the

// apartment. The commission is $100 for renting a three-bedroom

// apartment, $75 for renting a two-bedroom apartment, $55 for

// renting a one-bedroom apartment, and $30 for renting a studio

// (zero-bedroom) apartment. Output is the salesperson’s

// name and ID number and the commission earned on the rental.

start

Declarations

num salesPersonID

string salesPersonName

num numBedrooms

num COMM_3 = $100.00

num COMM_2 = $75.00

num COMM_1 = $55.00

num COMM_STUDIO = $30.00

num QUIT = 9999

getReady()

while salesPersonID <> QUIT

detailLoop()

endwhile

finish()

stop

getRead

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

You are almost finished updating a web site. as part of the update, you have converted all pages from html 4.0 to html5. the project is currently on schedule. however, your project manager has been asked by the marketing team manager to justify a day of time spent validating the site's html5 pages. the marketing team manager does not have technical knowledge of the internet or the web. which is the most appropriate explanation to provide to the marketing team manager?

Jason is working on a microsoft excel worksheet and he wants to create a print preview shortcut. his teacher asks him to access the customization option to create the new shortcut. which two tabs should jason select to place the print preview shortcut on the worksheet toolbar? a. new tab (custom) and new group (custom) b. new file tab (custom) and new tab (custom) c. new custom group and new command d. new custom tab and new command