Advantages of first in first out method, Data Structure & Algorithms

Advantages of First in First out (FIFO) Costing

Advantages claimed for first in first  out (FIFO)  costing method are:

1. Materials used are drawn from the cost record in a logical and systematic manner.

2. Movement of materials in a continuous, orderly, single file manner represents a condition necessary to and consistent with efficient materials control, particularly for materials subject to deterioration, decay and quality are style changes. During periods of inflation the earliest materials that have the lowest purchase price will be issued

3. The method leads to a lower costs of sales calculations and therefore a high profit than would be obtained by using either of the other method, and mostly FIFO is recommended method used in external financial accounting purposes.

FIFO method is recommended whenever:

1. The size and cost of units are large.

2. Materials are easily identified as belonging to a particular purchased lot.

3. Not more than two or three different receipts of the materials are on a materials card at one time.

Disadvantages or Limitations of FIFO Method

1. FIFO method is definitely awkward if frequent purchases are made at different prices and if units from several purchases are on hand at the same time.

2. Added costing difficulties arise when returns to vendors or to the storeroom occur.

Posted Date: 2/28/2013 4:42:34 AM | Location : United States







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

Write discussion on Advantages of first in first out method
Your posts are moderated
Related Questions
Write an algorithm to count number of nodes in the circular linked list.                            Ans. Counting No of Nodes in Circular List Let list be a circular h

The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le


Graphs are data structures which consist of a set of vertices & a set of edges which connect the vertices. A graph where the edges are directed is called directed graph. Or else, i

explain implementation of circular queue insert,delete operations

1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o

what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

A representation of an array structure is a mapping of the (abstract) array with elements of type T onto the store which is an array with elements of type BYTE. The array could be

creation,insertion,deletion of header linked list using c.