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
Q. Sort the sequence written below of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55                                                                      Ans:

Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.

how to write an algorithm for unions & intersection of two linklists?

What is algorithm's Optimality? Optimality  is  about  the  complexity  of  the  problem  that  algorithm  solves.  What  is  the  minimum amount  of  effort  any  algorithm  w

Q. Write down any four applications or implementation of the stack.                                     Ans. (i)       The Conversion of infix to postfix form (ii)

What do you understand by term structured programming? Explain the structured programming as well.                                 Ans. S tructured Programming is expla

Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of

Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be

#why all the 4 operations i.e. insertion n deletion from rear end and front end is valid in input restricted DEQUE

human resource management project work in c++