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
The algorithm to delete any node having key from a binary search tree is not simple where as several cases has to be considered. If the node to be deleted contains no sons,

Suppose that there is a Beta(2,2) prior distribution on the probability theta that a coin will yield a "head" when spun in a specified manner. The coin is independently spun 10 tim

Question 1 What do you mean by Amortization? Question 2 Explain the following Big Oh notation (O) Omega notation (Ω) Theta notation (Θ)   Question 3 Di

Q. Explain the term hashing? Explain any five well known hash functions.                         Ans: Hashing method provides us the direct access of record from the f

advanatges of dynamic data structure in programming


Explain Internal and External Nodes  To  draw  the  tree's  extension  by  changing  the  empty  subtrees  by  special nodes. The  extra  nodes shown by little squares are know

Let us assume a sparse matrix from storage view point. Assume that the entire sparse matrix is stored. Then, a significant amount of memory that stores the matrix consists of zeroe

Thread 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 either a stack

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree