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

Give example of assertion and abstract data type, Give example of assertion... Give example of assertion and abstract data type For illustration, consider Natural ADT whose carrier set is the set of non-negative integers and whose operations are the usual

If a node having two children is deleted from a binary tree, If a node havi... If a node having two children is deleted from a binary tree, it is replaced by?? Inorder successor

An algorithm to insert a node in beginning of linked list, Q. Write down an... Q. Write down an algorithm to insert a node in the beginning of the linked list.                         Ans: /* structure containing a link part and link part

Frequency count, i:=1 while(i { x:=x+1; i:=i+1; } i:=1 while(i { x:=x+1; i:=i+1; }

The # of times an algorithm executes, for(int i = 0; i for (int j = n -... for(int i = 0; i for (int j = n - 1; j >= i ; j--){ System.out.println(i+ " " + j);

What is diffuse illumination, Diffuse Illumination Diffuse illuminatio... Diffuse Illumination Diffuse illumination means light that comes from all directions not from one particular source. Think about the light of a grey cloudy day as compared to

Define big omega notation, Define Big Omega notation Big Omega notatio... Define Big Omega notation Big Omega notation (?) : The lower bound for the function 'f' is given by the big omega notation (?). Considering 'g' to be a function from the non-n

Splaying procedure, For splaying, three trees are maintained, the central, ... For splaying, three trees are maintained, the central, left & right sub trees. At first, the central subtree is the complete tree and left and right subtrees are empty. The target

Time complexity, Run time complexity of an algorithm is depend on Run time complexity of an algorithm is depend on

Time complexity, how to learn about time complexity of a particular algorit... how to learn about time complexity of a particular algorithm