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
Conceptually, the stack abstract data type mimics the information kept into a pile on a desk. Informally, first we consider a material on a desk, where we might keep separate stack

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:

Worst Case: For running time, Worst case running time is an upper bound with any input. This guarantees that, irrespective of the type of input, the algorithm will not take any lo

Your objective is to write a generic doubly linked list class called CS228LinkedList that implements the List interface and uses a type variable T. All methods except for subList a

How do collisions happen during hashing? Usually the key space is much larger than the address space, thus, many keys are mapped to the same address. Assume that two keys K1 an

multilist representation of graph

In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

Write an algorithm to calculate a postfix expression.  Execute your algorithm using the given postfix expression as your input : a b + c d +*f ↑ . T o evaluate a postfix expr

compare and contrast the bubble sort,quick sort,merge sort and radix sort

Link list representation of a circular queue is more efficient as it employs space more competently, of course with the added cost of storing the pointers. Program 7 gives the link