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
Q. Let us consider a queue is housed in an array in circular fashion or trend. It is required to add new items to the queue. Write down a method ENQ to achieve this also check whet

List various problem solving techniques. There are two techniques:- 1.  Top down 2.  Bottom- up

Suppose you are given the results of 5 games of rock-paper-scissors. The results are given to you on separate pieces of paper; each piece says either 'A' if the first person won, o

Queue is a linear data structure utilized in several applications of computer science. Such as people stand in a queue to get a specific service, several processes will wait in a q

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

For a queue a physical analogy is a line at booking counter. At booking counter, customers go to the rear (end) of the line & customers are attended to several services from the fr

Define Merge Sort  Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two ha

Program will demonstrate the insertion of an element at desired position /* Inserting an element into contiguous list (Linear Array) at particular position */ /* contiguous_

Representation of data structure in memory is known as: Abstract data type

Midsquare Method :- this operates in 2 steps. In the first step the square of the key value K is taken. In the 2nd step, the hash value is obtained by deleting digits from ends of