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

Define graph, A graph is a mathematical structure giving of a set of vertex... A graph is a mathematical structure giving of a set of vertexes (v1, v2, v3) and a group of edges (e1, e2, e3). An edge is a set of vertexes. The two vertexes are named the edge en

Find the adjacency matrix, Consider the digraph G with three vertices P1,P2... Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1. a. Sketch the digraph. b. Find the a

Link list, algorithm for multiplication of two sparse matrices using link l... algorithm for multiplication of two sparse matrices using link list

Best case, for i=1 to n if a[i}>7 for j=2 to n a[j]=a{j}+j for n=2 to n a... for i=1 to n if a[i}>7 for j=2 to n a[j]=a{j}+j for n=2 to n a[k]=a[j]+i else if a[1]>4 && a[1] for 2 to a[1] a[j]= a{j]+5 else for 2to n a[j]=a[j]+i ..

Write down any four applications of queues, Write down any four application... Write down any four applications of queues.            Application of Queue (i)  Queue is used in time sharing system in which programs with the similar priority form a queu

Explain divide and conquer algorithms, Explain divide and conquer algorithm... Explain divide and conquer algorithms  Divide  and  conquer  is  probably  the  best  known  general  algorithm  design  method.  It   work according to the following general p

Time complexity, The  total  of  time  needed  by  an algorithm to run to i... The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

Explain the scan-line algorithm, Explain the Scan-Line Algorithm This i... Explain the Scan-Line Algorithm This image-space method for removing hidden surfaces is an extension of the scan-line algorithm for filling polygon interiors. Instead of fillin

User-specified memory location, You need to implement a function which will... You need to implement a function which will write out a given user-specified memory location to disk in base 10. That means that you have to convert the large number data structure

Tree Traversal, If preorder traversal and post order traversal is given the... If preorder traversal and post order traversal is given then how to calculate the pre order traversal. Please illustrate step by step process