delete

Expert Solution

Equity method income accrual for 2018
25% of $589,000 for ½ year	$ 73,625
21% of $589,000 for ½ year	$ 61,845
Total income accrual	$ 135,470
Gain on sale (Refer Below)	$ 118,680
Total income statement effect–2018	$ 254,150

Gain on sale of 13,800 shares of Halstead
Initial acquisition- 2016	$ 1,510,000
25% income accrual- 2016: (25% × $362,000)	$ 90,500
Dividend - 2016 (25%*137,000)	$ (34,250)
25% income accrual- 2017: (25% × $505,000)	$ 126,250
Dividend - 2017 (25%*134,000)	$ (33,500)
25% income accrual for ½ year- 2018	$ 73,625
(25%*589000/2)
25% of dividends for ½ year- 2018	$ (20,625)
(25%*165000/2)
Book value of 80,000 shares on July 1, 2018	$ 1,712,000


Cash proceeds from the sale of 13,800 shares	$ 414,000
(13,800*30)
Less: Book value of shares sold	$ 295,320
($1,712,000*(13,800 ÷ 80,000))

Gain on Sale	$ 118,680

ekkarill92 answered 10 months ago

unix Delete the second character from every line in a file Delete the last word from...

unix Delete the second character from every line in a file Delete the last word from every line in a file. Swap the first and second letter of every line in a file. Swap the first and last characters of every line in a file.

The programming language is Python Instructions: Create a function that will delete a node in a...

The programming language is Python Instructions: Create a function that will delete a node in a Linked List based on position number. On below example, if you want to delete position #2, it will remove the Banana (arrangement of nodes below is Apple, Banana, Cherry, Grapes, Orange). myLinkedList = LinkedList() myLinkedList.append("Banana") myLinkedList.append("Cherry") myLinkedList.append("Grapes") myLinkedList.append("Orange") myLinkedList.prepend("Apple") myLinkedList.deleteByPositionNum(2) node = myLinkedList.head while node: print(node.value, " ") node = node.next_node You may start with the function head: def deleteByPositionNum(self, positionNum):

Delete an item from a circular queue and return the index of the next item. (in...

Delete an item from a circular queue and return the index of the next item. (in Java)

Data Manipulation In this lab, you will be manipulating the database to add, delete and modify...

Data Manipulation In this lab, you will be manipulating the database to add, delete and modify the values in the database. Please use a "select * from..." after each query to show the effects of your data manipulation query. 1. The title 'Time Flies' now has a new track, the 11th track 'Spring', which is 150 seconds long and has only a MP3 file. Insert the new track into Tracks table (Don’t hand-code any data for insert that can be...

2. Take data sets A and B and delete duplicated values such that each value is...

2. Take data sets A and B and delete duplicated values such that each value is unique even when pooling the two data sets. Just like with the previous problem, treat data sets A and B as hypothetical data on the weights of children whose parents smoke cigarettes, and those whose parents do not respectively. a) Calculate the expected value of the wilcoxon Rank-Sum test statistic E(Wx) assuming the null hypothesis of equal medians being true. b) Conduct a Wilcoxon-Rank-Sum...

---In the code, create add and delete a student by ID number when prompted /////////////////////////////////////////////////////////////// import...

---In the code, create add and delete a student by ID number when prompted /////////////////////////////////////////////////////////////// import java.util.Scanner; public class COurseCom666 { private String courseName; private String [] students = new String[1]; private int numberOfStudents; public COurseCom66(String courseName) { this.courseName = courseName; } public String[] getStudents() { return students; } public int getNumberOfStudents() { return numberOfStudents; } public String getCourseName() { return courseName; } public...

Write an algorithm to delete an element from a hash table that uses linear probing as...

Write an algorithm to delete an element from a hash table that uses linear probing as its clash resolution strategy. Analyze your algorithm and show the results using order notation?

Extend the custom unorderedLinkedList class by adding the following operation: Find and delete the node with...

Extend the custom unorderedLinkedList class by adding the following operation: Find and delete the node with the smallest info in the list. Delete only the first occurrence and traverse the list only once. The function's prototype is deleteSmallest() use this code #include <ctime> #include <iostream> #include <random> #include "unorderedLinkedList.h" using namespace std; int main() { default_random_engine e(1918); uniform_int_distribution<int> u(10, 99); int size = 12; unorderedLinkedList ul; while (ul.getnelts() < size) { int elt = u(e); ul.append(elt); ul.show(); cout << endl;...

Question