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
algorithm and flow chart to find weather the given numbers are positive or negative or neutral

Question 1 What do you mean by Amortization? Question 2 Explain the following Big Oh notation (O) Omega notation (Ω) Theta notation (Θ)   Question 3 Di

What do you understand by tree traversal? The algorithm walks by the tree data structure and performs some computation at everynode in the tree. This process of walking by the

Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

Q.   Draw the expression tree of the infix expression written below and then  convert it intoPrefix and Postfix expressions. ((a + b) + c * (d + e) + f )* (g + h )

Explain in brief about the Container An entity which holds finitely many other entities. Just as containers such as boxes, baskets, bags, pails, cans, drawers, and so for

Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi

Q. Create a heap with the given list of keys: 8, 20, 9, 4, 15, 10, 7, 22, 3, 12                                                  Ans: Creation

Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

A graph with n vertices will absolutely have a parallel edge or self loop if the total number of edges is greater than n-1