Drawback of sequential file, Data Structure & Algorithms

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







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
Related Questions
Almost Complete Binary Tree :-A binary tree of depth d is an almost whole binary tree if: 1.Any node and at level less than d-1 has two children. 2. for any node and in the tree wi

In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

This section prescribes additional exercise with the recursive and iterative handling of a binary search tree. Adding to the Binary Search Tree Recursively Add implementation

algorithm for multiplication of two sparse matrices using linked lists..

Polynomials like  5x 4    +  2x 3    +  7x 2     +  10x  -  8  can  be  represented by using arrays. Arithmetic operations such as addition & multiplication of polynomials are com


It offers an effective way to organize data while there is a requirement to access individual records directly. To access a record directly (or random access) a relationship is

In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the

DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper through visiting unvisite

A full binary tree with 2n+1 nodes have n non-leaf nodes