Blog

The principal ledger that contains all the business accounts is called the general ledger.

When supplies are used, which account is debited:

An increase in an expense will ultimately decrease owner’s equity (the worth of the business).

The worksheet

An estimate of the amount which an asset can be sold at the end of its useful life is called residual value.

Assets that last longer than a year and are intangible are classified as fixed assets.

Problem 5 (14 points) In this problem, we use a Union-Find data structure. However, instead of using the standard link-by-size algorithm discussed in class, this implementation uses a modified linking rule. Assume the elements are initially: {1,2,3,4,5,6,7,8} Initially, every element is in its own set. Therefore, every element is the root of a tree with height 0. The modified algorithm uses link-by-height. In other words, when performing union(x,y): 1. Use find to determine the roots of the two sets.2. Compare the heights of the two root trees.3. The root of the shorter tree becomes a child of the root of the taller tree.4. In order to ensure we end up with the same answer, if the two trees being combined have the same height, the root with the smaller label becomes the parent. Task After each union operation, report the height of every tree currently in the Union-Find data structure. For this problem, you should only report the height of trees using their root nodes. Do not report heights for nodes that are no longer roots. For example, initially every element is in its own tree, so every element is a root with height 0: 1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0 Now consider the operation: union(1,2) Both trees have height 0, so the tie-breaking rule is used. Since 1

Problem 3 (14 points) In this problem, you will simulate a modified version of the extract-min operation for a binary heap. This is not the standard extract-min algorithm discussed in class. Instead, the pseudocode below contains a small modification. Your job is to execute the algorithm exactly as written. Do not modify the algorithm, even if the resulting heap is not a valid min-heap. As the algorithm executes, the heap stored in the array is printed along with a letter prepended to the output. The letter identifies which PRINT-HEAP statement produced that output. You will perform two complete extract-min operations. The second operation should begin using the heap produced by the first operation. Assume the heap is stored in an array beginning at index 1. The initial heap is: [1,3,2,7,6,5,4] Execute the pseudocode below and record every output produced by PRINT-HEAP that was called from the EXTRACT-MIN function. Use the heap produced by the first extraction as the starting heap for the second extraction. Output formatting: Please help the autograder by not putting any spaces in your answer. For example, if your answer is: x,1,2,3,4 do not type: x, 1, 2, 3, 4 Instead, enter it exactly as: x,1,2,3,4 To avoid giving away the answer, a small number of extra print statements may have been added. If you are finished and have more PRINT-HEAP outputs to provide an answer for, simply write: EXTRA for that answer. MAIN(): // Code that creates a heap A. The heap is stored in an array A as [1,3,2,7,6,5,4] and size == 7 PRINT-HEAP(A, “a”) //

Describe how to model this problem as a graph. What are the vertices?

Describe how to model this problem as a graph. Are the edges weighted or unweighted?