Following are some of the drawback of sequential file organisation: Updates are not simply accommodated. By definition, random access is impossible. All records should be structurally identical. If a new field ought to be added, then every record should be rewritten to provide space for the new field. Posted Date: 4/11/2013 6:22:07 AM | Location : United States

Ask an Expert

Related Discussions:- Drawback of sequential file, Assignment Help, Ask Question on Drawback of sequential file, Get Answer, Expert's Help, Drawback of sequential file Discussions

Write discussion on Drawback of sequential file
Your posts are moderated

Write your message here..

Related Questions

Efficient way of storing two symmetric matrices, Explain an efficient way o... Explain an efficient way of storing two symmetric matrices of the same order in memory. A n-square matrix array is said to be symmetric if a[j][k]=a[k][j] for all j and k. For

Algorithm that counts number of nodes in a linked list, Q. Write an algorit... Q. Write an algorithm that counts number of nodes in a linked list.                                       A n s . Algo rithm to Count No. of Nodes in Linked List C

State warnock algorithm, Warnock's Algorithm An interesting approach to... Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but

Dqueue, algorithm of output restricted queue. algorithm of output restricted queue.

Types of tree ?, Binary: Each node has one, zero, or two children. This ... Binary: Each node has one, zero, or two children. This assertion creates many tree operations efficient and simple. Binary Search : A binary tree where each and every left

State the symbols of abstract data type operation, Symbols of ADT oepration... Symbols of ADT oeprations All Symbol ADT operations are implemented in Symbol class, except toSymbol(), which is implemented in classes (like String) which can generate a Symb

A binary tree in which levels except possibly the last, A binary tree in wh... A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as

Array implementation of a dequeue, If a Dequeue is implemented via arrays, ... If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

Creation of a circular linked list, Program: Creation of a Circular linked ... Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

Advanced trees, Linked list representations contain great advantages of fle... Linked list representations contain great advantages of flexibility on the contiguous representation of data structures. However, they contain few disadvantages also. Data structur