Please answer all section!! Prion Iron Corporation tracks the number o.docx

•Als DOCX, PDF herunterladen•

0 gefällt mir•9 views

Please answer all section!! Prion Iron Corporation tracks the number of units purchased and sold throughout each year but applies its inventory costing method at the end of the year, as if it uses a periodic inventory system. Assume its accounting records provided the following information at the end of the annual accounting period, December 31 . Required: 1. Calculate the number and cost of goods avalable for sale. 2. Calculate the number of units in ending inventory. 3. Compute the cost of ending inventory and cost of goods sold under (b) FIFO, (b) L.FO, and (c) weighted average cost. 4. Prepare an income statement that shows under the FIFO method, LFF method and weighted average method. 6. Which inventory costing method minimizes income taxes? Complete this question by entering your answers in the tabs below. Calculate the number and cost of ooods avaliable for sale. at the end of the year, as if it uses a periodic inventory system. Assume its accounting records provided the following information at the end of the annual accounting period, December 31 . required: 1. Calculate the number and cost of goods available for sale. 2. Colculate the number of units in ending inventory. 3. Compute the cost of ending inventory and cost of goods sold under (a) FIFO, (b) LIFO, and (c) weighted average cost. 4. Prepare an income statement that shows under the FIFO method, UFO method and weighted average method. 6. Which inventory costing method minimizes income taxos? Complete this question by entering your answers in the tabs below. Calculate the number of units in ending inventory. 1. Caiculate the number and cost of goods available for sale. 2. Calculate the number of units in ending inventory. 3. Compute the cost of ending inventory and cost of goods sold under (a) FIFO, (b) LIFO, and (c) weighted average cost. 4. Prepare an income statement that shows under the FIFO method, LIFO method and weighted average method. 6. Which inventory costing method minimizes income taxes? Complete this question by entering your answers in the tabs below. Compute the cost of ending inventory and cost of goods sold under (a) FIFO, (b) UFO, and (c) weighted average cost. (Do not round intermediate calculations. Round your final answers to the nearest dollar amount.) Required: 1. Calculate the number and cost of goods available for sale. 2. Calculate the number of units in ending inventory. 3. Compute the cost of ending inventory and cost of goods sold under (a) FIFO, (b) LIFO, and (c) weighted average cost. 4. Prepare an income statement that shows under the FIFO method, LIFO method and weighted average method. 6. Which inventory costing method minimizes income taxes? Complete this question by entering your answers in the tabs below. Prepare an Income Statement that shows under the FIFO method, LFO method and weighted average method. .

Bildung

Weitere ähnliche Inhalte

Mehr von cgraciela1

Please give examples on all of the following titles and solve them as.docx

cgraciela1

please give the answer please give the answer A product's life cycl.docx

cgraciela1

please give a details explanation- i tried but i keep getting erronou.docx

cgraciela1

Please explain, Thank you! 3. Show intermediate steps of sorting the array 17 , 10 , 15 , 13 , 4 , 12 , 7 , 9 , 16 , 8 , 5 , 14 , 3 with Quick Sort. Show the result after picking a pivot for each sublist and arranging the list in such a way that all elements < pivot are on the left side of the pivot, and all elements >= pivot are on the right. Pick the middle element of a sublist as the pivot. 17 , 10 , 15 , 13 , 4 , 12 , 7 , 9 , 16 , 8 , 5 , 14 , 3 Original array .

Please explain- Thank you! 3- Show intermediate steps of sorting the a.docx

cgraciela1

Please explain why the answer is B instead of D 5. Which of the following statements is false? (4 points) A) An expense is a cost incurred to generate revenues. B) Revenues result in an increase in net income and additional paid-in capital. C) Revenues are reported on the income statement as they are earned. D) Incurring an expense occurs with a decrease in assets or an increase in liabilities. .

Please explain why the answer is B instead of D 5- Which of the follow.docx

cgraciela1

Please Drawing this numbers using python Draw these follow.docx

cgraciela1

PLEASE don't copy and paste from a previous answer because it was incorrect. I'm looking for some help in proving that this encryption scheme does not have CCA security by showing in a proof why it is insecure, with an explanation as well. 1. Let 1 and 2 be two (possibly different) encryption schemes with the same message space M . Below we define an encryption scheme : Show that does not have CCA security, even if both 1 and 2 have CCA (yes, CCA) security. .

PLEASE don't copy and paste from a previous answer because it was inco.docx

cgraciela1

Please draw concept map Cdc45 Cdc6 Cdt1 Clamp Clamp loader CMG complex Ctf4 DDK Dna Pol a DNA Pol d DNA Pol g DNA helicase DNA Replication Dna B Dna G Dpb111 Eukaryote GINS Helicase loading Helicase activation Leading strand synthesis Lagging strand synthesis Mcm 2-7 Mcm 10 Ori ORC OCCM complex PCNA Polymerasae III Prokaryote Pre-loading complex Replisome assembly Replicsome RNA Polymerase ScdK Sld 3 Sld 2 T complex .

Please draw concept map Cdc45 Cdc6 Cdt1 Clamp Clamp loader CMG comp.docx

cgraciela1

Please dont copy paste a-What is customer service- b- Main theories o.docx

cgraciela1

PLEASE DONT COPY ANSWER Draw a DFA that accepts the strings that repre.docx

cgraciela1

Please do this for me!! I would gladly appreciate it. Write one results sentences that describe what the boxplot shows (discuss variation, median, mean, and the statistical significance). Include important information about how the data was generated. Write one discussion sentences that interpret what the boxplot shows. What do you think the biological significance of the result is? NSP13 glycosylation .

Please do this for me!! I would gladly appreciate it- Write one result.docx

cgraciela1

Please copy and paste the code and explain why it won't work. It is supposed to take a maze and return the exits and number of exits. import java.util.Scanner; import java.io.File; import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Arrays; public class MazeSolver { int numRows; int numCols; int startRow; int startCol; int rows; int col; public static void loadMaze(){ int numRows; int numCols; int startRow; int startCol; int rows; int col; try{ Scanner input = new Scanner(System.in); System.out.println("Please enter file name:"); String filename = input.nextLine(); File file = new File(filename); Scanner fileInput = new Scanner(file); numRows = fileInput.nextInt(); numCols = fileInput.nextInt(); ArrayList column= new ArrayList<String>(); ArrayList row = new ArrayList<String>(); char[][] maze= new char[numRows][numCols]; //for the row, get array start row and column index for (int i = 0; i < numRows; i++) { String line = fileInput.next(); for (int j = 0; j < numCols; j++) { char empt = ' '; maze[i][j] = if (maze[i][j] == empt){ startRow = i; startCol = j; System.out.println(i); //solveMaze(maze[i][j]); } else{ return; } } } fileInput.close(); } catch(FileNotFoundException e) { System.out.println("File not found."); loadMaze(); } } // Method to solve the maze public void solveMaze(char[][] maze) { ArrayList<Integer> exitRows = new ArrayList<Integer>(); ArrayList<Integer> exitCols = new ArrayList<Integer>(); boolean[][] visited = new boolean[numRows][numCols]; // Call recursive method to explore the maze exploreMaze(startRow, startCol, visited, maze, exitRows, exitCols); // Print number of exits found System.out.println("Number of exits found: " + exitRows.size()); // Print positions of exits for (int i = 0; i < exitRows.size(); i++) { System.out.println("Exit found at: (" + exitRows.get(i) + ", " + exitCols.get(i) + ")"); } } public void exploreMaze(int row, int col, boolean[][] visited, char[][] maze, ArrayList<Integer> exitRows, ArrayList<Integer> exitCols) { // Recursive method to explore the maze if (row < 0 || col < 0 || row >= numRows || col >= numCols || visited[row][col]) { // Base case: if current position is out of bounds or already visited return; } // Base case: if current position is an exit if (maze[row][col] == 'E'){ exitRows.add(row); exitCols.add(col); return; } // Mark current position as visited visited[row][col] = true; exploreMaze(row-1, col, visited, maze,exitRows, exitCols); // up exploreMaze(row, col+1, visited, maze,exitRows, exitCols); // right exploreMaze(row+1, col, visited, maze,exitRows, exitCols); // down exploreMaze(row, col-1, visited, maze,exitRows, exitCols); // left // Recursively explore neighboring positions } } .

Please copy and paste the code and explain why it won't work- It is su.docx

cgraciela1

Please complete all the code as per instructions in Java programming import org.w3c.dom.Node; import javax.xml.crypto.NodeSetData; import java.awt.*; import java.util.Iterator; import java.util.NoSuchElementException; /** * This class implements an acyclic (non-cyclic), doubly-linked list. * @param */ public class CiscDoublyLinkedList implements CiscList { /** * A reference to the first node in the list (or null if list is empty). */ private Node head; /** * A reference to the last node int the list (or null if list is empty). */ private Node tail; /** * Number of elements in the list. */ private int size; /** * Returns the number of elements in this list. * * * @return the number of elements in this list */ @Override public int size() { return size; } /** * Returns {@code true} if this list contains no elements. * * * @return {@code true} if this list contains no elements */ @Override public boolean isEmpty() { if (size == 0){ return true; } return false; } /** * Returns {@code true} if this list contains the specified element (compared using the {@code equals} method). * * * @param o element whose presence in this list is to be tested * @return {@code true} if this list contains the specified element * @throws NullPointerException if the specified element is null */ @Override public boolean contains(Object o) { if(o == null) { throw new NullPointerException(); } Node node = head; while(node != null) { if(node.data.equals(o)){ return true; } node = node.next; } return false; } /** * Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not * contain the element (compared using the {@code equals} method). * * * @param o element to search for * @return the index of the first occurrence of the specified element in this list, or -1 if this list does not * contain the element * @throws NullPointerException if the specified element is null */ @Override public int indexOf(Object o) { if (o == null){ throw new NullPointerException(); } for(int i =0; i = size){ throw new IndexOutOfBoundsException(); } return null; } /** * Appends the specified element to the end of this list. * * * Lists may place the specified element at arbitrary locations if desired. In particular, an ordered list will * insert the specified element at its sorted location. List classes should clearly specify in their documentation * how elements will be added to the list if different from the default behavior (end of this list). * * @param e element to be appended to this list * @return {@code true} * @throws NullPointerException if the specified element is null */ @Override public boolean add(E e) { if(e == null){ throw new NullPointerException(); } return false; } /** * Replaces the element at the specified position in this list with the specified element. * * * @param index index of the element to replace * @param element element to be stored at the specified position * @return the element previously at the specified position *.

Please complete all the code as per instructions in Java programming.docx

cgraciela1

Please code in C language. Please do part 1 and 2. Do not recycle answers and implement the starter code Starter code: #include <stdio.h> #include <ctype.h> #include <stdlib.h> #include <string.h> #include "linkedlist.h" // print an error message by an error number, and return // the function does not exit from the program // the function does not return a value void error_message(enum ErrorNumber errno) { char *messages[] = { "OK", "Memory allocaton failed.", "Deleting a node is not supported.", "The number is not on the list.", "Sorting is not supported.", "Reversing is not supported.", "Token is too long.", "A number should be specified after character d, a, or p.", "Token is not recognized.", "Invalid error number."}; if (errno < 0 || errno > ERR_END) errno = ERR_END; printf("linkedlist: %s\n", messages[errno]); } node *new_node(int v) { node *p = malloc(sizeof(node)); // Allocate memory if (p == NULL) { error_message(ERR_NOMEM); exit(-1); } // Set the value in the node. p->v = v; // you could do (*p).v p->next = NULL; return p; // return } node *prepend(node *head, node *newnode) { newnode->next = head; return newnode; } node *find_node(node *head, int v) { while (head != NULL) { if (head->v == v) return head; head = head->next; } return head; } node *find_last(node *head) { if (head != NULL) { while (head->next != NULL) head = head->next; } return head; } node *append(node *head, node *newnode) { node *p = find_last(head); newnode->next = NULL; if (p == NULL) return newnode; p->next = newnode; return head; } node *delete_list(node *head) { while (head != NULL) { node *p = head->next; free(head); head = p; } return head; } void print_list(node *head) { printf("["); while (head) { printf("%d, ", head->v); head = head->next; } printf("]\n"); } void print_node(node *p) { printf("%p: v=%-5d next=%p\n", p, p->v, p->next); } void print_list_details(node *head) { while (head) { print_node(head); head = head->next; } } // functions that have not been implemented node *delete_node(node *head, int v) { // TODO error_message(ERR_NODELETE); return head; } /* * Given a pointer to the head node of an acyclic list, change the * next links such that the nodes are linked in reverse order. * Allocating new nodes or copying values from one node to another * is not allowed, but you may use additional pointer variables. * Return value is a pointer to the new head node. */ node *reverse_list(node *head) { // TODO error_message(ERR_NOREVERSE); return head; } Part 1. Delete node. The linked list example we have studied in lecture maintains a singly linked list of integers. The program can append and prepend integers to the list. Type help in the program to see a list of commands. Note that if the number to be added is already on the list, the program prints the information about the node that stores the number and does not add the number twice. The list is displayed every time an integer is processed. Currently, the program does not support the delete function..

Please code in C language- Please do part 1 and 2- Do not recycle answ.docx

cgraciela1

please ask and answer questions in internet technologies in the following topics 1.introduction 2.wan technologies and routing 3.Network ownership 4.protocols and layering 5.internetworking concepts 6.Ip:internet protocol 7.binding protocol address 8.ip datagrams and datagrams forwarding 9.ip encapsulation,fragmentation 10.the future up(ipv6) ask a minimum of 10 exam standard questions from each topic please do as told or else I we put a thumbs down .

please ask and answer questions in internet technologies in the follo.docx

cgraciela1

Please answer the multiple choice questions with detailed explanation 1.11 Which of the following statements is/are true? (1) The IFRS Interpretations Committee is a forum for the International Accounting Standards Board (the Board) to consult with the outside world. (2) The IFRS Foundation produces IFRS Standards. The IFRS Foundation is overseen by the Board. (3) One of the objectives of the IFRS Foundation is to bring about convergence of national accounting standards and IFRS Standards. 1 and 3 only 2 only 2 and 3 only 3 only (2 marks) 1.12 What is the role of the International Accounting Standards Board (the Board)? Oversee the standard setting and regulatory process Formulate IFRS Standards Review defective accounts Control the accountancy profession (2 marks) 1.13 Which of the following is NOT an objective of the IFRS Foundation? Through the International Accounting Standards Board (the Board), develop a single set of globally accepted IFRS Standards Promote the use and rigorous application of IFRS Standards Ensure IFRS Standards focus primarily on the needs of global, multi-national organisations Bring about the convergence of national accounting standards and IFRS Standards (2 marks) .

Please answer the multiple choice questions with detailed explanation.docx

cgraciela1

Please answer the following questions about the network of streets in Indianapolis: a. Are Indianapolis's streets public goods, club goods, common goods, or private goods? Is their classification constant or does it change throughout the day/week? Explain your answers. b. In 2006, Governor Mitch Daniels leased the rights to the Indiana Toll Road, which runs east-west across the northem portion of the state, to a consortium made up of Cintra, a Spanish construction firm, and Macquarie Atlas Roads, an Australian firm. In effect, Govemor Daniels privatized operation of the Indiana Toll Road, which had been public property. What type of good is the Indiana Toll Road? What is the most likely economic justification for Governor Daniels's decision (assuming there is one)? Explain your answers. c. Suppose someone invents technology that can track precisely where cars are at all times, such that the technology's user could charge a fee for each mile driven on a network of roads. As Indianapolis and its suburbs expand, should they use private property ownership and the market to extend the network of roads needed to serve the larger metropolitan area? Put differently, will private property ownership and the market deliver the socially optimal (efficient) network of roads for a new areas? Explain your .

Please answer the following questions about the network of streets in.docx

cgraciela1

Please answer 16-29. thank you P4: Dissection of the Fetal Pig Ventral Body Cavities and Endocrine System QUESTIONS 16-29: Identify the labeled structures in the diagram. Select your answers from the list below. a. Spleen h. Lung b. Urinary bladder i. Gallbladder c. Thyroid gland j. Small intestine d. Stomach k. Pancreas c. Liver 1. Thymus gland f. Umbilical cord m. Heart g. Large intestine n. Duodenum (first part of the small intestine) 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. .

Please answer 16-29- thank you P4- Dissection of the Fetal Pig Ventr.docx

cgraciela1

Please answer the 3 questions. Case Study 2 Too Much Fatigue and Stress? You Decide Job fatigue and stress are significant problems faced by employees and their managers. Unfortunately, when a case of depression arises as a result, trying to resolve the problem may be difficult-sometimes leading to conflict_as this case illustrates. Donald Knolls was an air traffic control supervisor for International Gateway Airport (IGA), an airport serving a major metropolitan area. In 2011, Donald began to experience depression-related problems largely due to severe stress and fatigue on the job. A few months later, he requested and was granted a disability leave for treatment of his illness. After eight months, his personal physician, an expert in depression treatment and a licensed consulting psychologist, agreed that he was sufficiently improved to return to his former position. IGA then sent Donald to the physician it had used when Donald first requested his disability leave. After an extensive evaluation, the doctor concluded that while Donald had made considerable strides in overcoming his depression, he should not be immediately returned to his former supervisory position because the conditions of the job had not changed and he was apt to find the stress too great. Instead, he recommended that Donald be returned to a nonsupervisory position on a six-month trial basis, with the case to be reviewed at the end of that time. IGA followed the advice of its doctor and did not return Donald to a supervisory position. Donald, angered by management's decision, filed a grievance through IGA's alternative dispute resolution procedure, a procedure that could end in binding arbitration. During several meetings between Donald and management, the employer maintained that it had the right to rely on the medical opinion of "a fair and impartial" doctor who had determined that Donald should not be returned to the position that was the cause of his original stress-related emotional problems. Additionally, management pointed out to Donald that IGA's disability leave provision states that it "may require appropriate medical documentation if it believes an employee is not fit to return to his or her former position." Donald responded, through an attorney he hired to represent his position, that the disability leave provisions were clear but, nevertheless, biased against an employee because they completely disregarded the opinion of his physician and psychologist. According to Donald, "Why bother to get expert medical opinions if they are dismissed?" He further noted, "I have never felt better. I'm really ready to get back to my job." Finally, Donald's lawyer contended that Donald was the victim of discrimination based on his former state of depression: "What happened to Donald would not have happened if his illness had been a more conventional physical injury." 1. When conflicting medical opinions are presented, should the advice of a medical expert count more heavily t.

Please answer the 3 questions- Case Study 2 Too Much Fatigue and Stres.docx

cgraciela1

Please answer the 4 questions using C. The expected output is shown below. Thank you! --------------------------------------------------------------------------------------------------- // Write your name here // Write the compiler used: Visual studio or gcc // Reminder that your file name is incredibly important. Please do not change it. // Reminder that we are compiling on Gradescope using GCC. // READ BEFORE YOU START: // You are given a partially completed program that creates a list of game items like you'd see in a folder. // Each item has this information: item's name, game's name, type of item, item ID. // The struct 'itemRecord' holds information of one item. Variety is an enum. // An array of structs called 'list' is made to hold the list of items. // To begin, you should trace through the given code and understand how it works. // Please read the instructions above each required function and follow the directions carefully. // You should not modify any of the given code, the return types, or the parameters. Otherwise, you risk getting compilation errors. // You are not allowed to modify main(). // You can use string library functions. // WRITE COMMENTS FOR IMPORANT STEPS IN YOUR CODE. #include <stdio.h> #include <stdlib.h> #include <string.h> #pragma warning(disable: 4996) // for Visual Studio Only #define MAX_ITEMS 15 #define MAX_NAME_LENGTH 25 typedef enum { Health = 0, Equip, Etc } itemType; // enum type struct itemRecord { // struct for item details char itemName[MAX_NAME_LENGTH]; char gameName[MAX_NAME_LENGTH]; itemType variety; unsigned int itemID; }; struct itemRecord list[MAX_ITEMS]; // declare list of items int count = 0; // the number of items currently stored in the list (initialized to 0) // functions already implmented void flushStdIn(); void executeAction(char); void save(char* fileName); void display(); // functions that need implementation: int add(char* itemName_input, char* gameName_input, char* variety_input, unsigned int idNumber_input); // 10 points void sort(); // 10 points int delete(unsigned int idNumber_input); // 10 points void load(char* fileName); // 10 points int main() { char* fileName = "Item_List.txt"; load(fileName); // load list of items from file (if it exists). Initially there will be no file. char choice = 'i'; // initialized to a dummy value do { printf("\nEnter your selection:\n"); printf("\t a: add a new item\n"); printf("\t d: display item list\n"); printf("\t r: remove an item from list\n"); printf("\t s: sort item list by ID\n"); printf("\t q: quit\n"); choice = getchar(); flushStdIn(); executeAction(choice); } while (choice != 'q'); save(fileName); // save list of items to file (overwrites file, if it exists) return 0; } // flush out leftover '\n' characters void flushStdIn() { char c; do c = getchar(); while (c != '\n' && c != EOF); } // ask for details from user for the given selection and perform that action .

Please answer the 4 questions using C- The expected output is shown be.docx

cgraciela1

Mehr von cgraciela1 (20)