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
Program segment for All pairs shortest paths algorithm AllPairsShortestPaths(int N, Matrix C, Matrix P, Matrix D) { int i, j, k if i = j then C[i][j] = 0  for ( i =


algorithm for multiple queue with example program

c program to represent a graph as an adjacency multilist form

Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

the deference between insertion,selection and bubble sort

1) Which graph traversal uses a queue to hold vertices which are to be processed next ? 2) Which of the graph traversal is recursive by nature? 3) For a dense graph, Prim's a

What are the conditions under which sequential search of a list is preferred over binary search?


Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre