PLEASE READ & HELP
Read the following paragraph.
A verbal may belong to one of three categories. It may be a participle, which is used only as an adjective. It may be a gerund, which always ends in -ing and functions as a noun. Finally, it may be an infinitive, which is preceded by to and functions as a noun, adjective, or even an adverb. Yet verbals still look very much like verbs.
Which one of six types of expository structure does this paragraph illustrate?
order of importance
Find a formula for the total number of swap operations performed by the iteration of INSERT(x, A) with the values of priorities of inserted processes equal to n, n-1, n-2, …, 1. Assume that the priority queue A is initially empty. Leave your answer in the form of a sum.
procedure INSERT(x: processtype; var A: PRIORITYQUEUE);
A.last := A.last + 1;
A.contents[A.last] := x;
i := A.last;
while (i > 1) and (p(A.contents[i]) < p(A.contents[i div 2])) do begin
temp := A.contents[i];
A.contents[i] := A.contents[i div 2];
A.contents[i div 2] := temp;
i := i div 2;
Operating vs Capital Lease under FAS 13: We want to rent a facility. And we need to do a cap lease test. The monthly rent payments will be increased YoY based on the HICP-index (some kind of consumer index). This index today is about 3% higher then last year.In the 7d-test we need to calculate the monthly lease payments. Do we need to apply this index in a compounded way (3% Y2, 6% Y3, …) or do we need to keep it flat over the full term of the rent ?Could anyone provide an answer and eventually provide some clear evidences/examples from trustworthy sources ?
The symmetric difference of sets A and B is defined as the set consisting of the elements contained in A, but not in B, and in B, but not in A. Implement operation SYMMETRIC_DIFFERENCE for sorted singly-linked list representation of sets. Do not use other SET ADT operations, directly operate on linked lists. Give the order of magnitude of the running time of your implementation when it is applied to sets of size m, n.
Type S Streptococcus pneumoniae bacterium is lethal and will kill its host. If heat inactivated the S strain becomes nonlethal. Type R Streptococcous pneumoniae is a nonvirulent strain of bacteria. What would occur if one were to inject both the R strain and heat-killed S strains into a host organism such as the mouse?
technology is ubiquitous in today’s workplace. Electronic data interchange (EDI) is the generic name for technology that involves a computer-to-computer exchange of business information. Image processing is a method for translating an image into digital format. As an auditor, you must be aware of how advances in technology, such as EDI and image processing, can affect audit evidence and documentation.
make a post describing the following:
- EDI (electronic data interchange) and image-processing systems
- The implications of each for the auditor’s consideration of audit evidence
In your initial post, support your description and the implications that you have presented with at least one scholarly source in addition to your textbook.
Potassium superoxide is a deep blue-purple solid that forms on the surface of freshly cut potassium metal. The superoxide ion has a formula of O2-. Using this information, which of the following is the best chemical formula for potassium superoxide?
Depth-first search dfs and breath-first search bfs graph traversal algorithms are applied to a rectangular grid of size n times n. The vertices of the rectangular grid have the form (i,j), where i,j=1,2,3,…,n, and the edges connect pairs (i,j), (i+1,j) and (i,j), (i,j+1). What are the maximal number of vertices occurring inside the stack of the dfs and inside the queue of bfs during execution? How many back arcs are in the case of the dfs are there? How many cross arcs in the case of the bfs are there? Draw the spanning trees for both algorithms in the case n=4. Assume lexicographic ordering of vertices, I.E. (i1,j1) < (i2,j2) if and only if i1 < i2 or (i1 = i2 and j1 < j2).
procedure dfs(v: vertex);
S: STACK of vertex;
mark[v] := visited;
while not EMPTY(S) do begin
x := TOP(S):
if there is an unvisited vertex y inside L[x] then begin
mark[y] := visited;
procedure bfs(v: vertex);
Q: QUEUE of vertex;
mark[v] := visited;
while not EMPTY(Q) do begin
x := FRONT(Q);
for each vertex y inside L[x] do
if mark[y] := unvisited then begin
mark[y] := visited;
On January 1, 2018, Rick’s Pawn Shop leased a truck from Chumley Motors for a six-year period with an option to extend the lease for three years. Rick’s had no significant economic incentive as of the beginning of the lease to exercise the 3-year extension option. Annual lease payments are $16,000 due on December 31 of each year, calculated by the lessor using a 6% interest rate. The agreement is considered an operating lease. (
The time (t) required to empty a tank varies inversely as the rate (r) of pumping. A pump can empty a tank in 90 minutes at the rate of 1200 L/min. How long will the pump take to empty the tank at 3000 L/min?