Last in first out method, Data Structure & Algorithms

This method is the reverse of FIFO and assumes that each issue of stock is made from latest items received in the enterprises .Thus if the last lot to be received is not sufficient to meet an issue,then the balance is assumed to come from the previous lot received still available.The stock on hand is valued at the cost of the earliest items received and not drawn.Advocates of this method claims that it gives the most accurate representation of profits because it matches revenue with current costs.

The last in first out (LIFO) method of costing materials issued is based on the premise that materials units issued should carry the cost of the most recent purchase, although the physical flow may actually be different. The method assumes that the most recent cost (the approximate cost to replace the consumed units) is most significant in matching cost with revenue in the income determination procedure.

Under LIFO procedures, the objective is to charge the cost of current purchases to work in process or other operating expenses and to leave the oldest costs in the inventory. Several alternatives can be used to apply the LIFO method. Each procedure results in different costs for materials issued and the ending inventory, and consequently in a different profit. It is mandatory, therefore, to follow the chosen procedure consistently.

Posted Date: 2/28/2013 4:43:44 AM | Location : United States







Related Discussions:- Last in first out method, Assignment Help, Ask Question on Last in first out method, Get Answer, Expert's Help, Last in first out method Discussions

Write discussion on Last in first out method
Your posts are moderated
Related Questions
You are supposed to do the following: Write a parallel implementation of the raytracer using pthreads. Measure and compare the execution times for (i) the sequential ver

what is alphanumerical code

Explain an efficient and effective way of storing two symmetric matrices of the same order in the memory. A n-square matrix array will be symmetric if a[j][k]=a[k][j] for all j

Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

Mid Square method with good example

Explain in detail about the Ruby arrays Ruby arrays have many interesting and powerful methods. Besides indexing operations which go well beyond those discussed above, arrays h

In a sorted list, Binary search is carried out by dividing the list into two parts depends on the comparison of the key. Since the search interval halves each time, the iteration o

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr

Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr