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
Representation of Linked list in Memory:- Each node has an info part and a pointer to the next node also known as link. The number of pointers is two in case of doubly linked

According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record. The choice of s

1. Apply the variant Breadth-First Search algorithm as shown in Figure 2 to the attached graph. This variant is used for computing the shortest distance to each vertex from the sta

Q. Describe the basic concept of binary search technique? Is it more efficient than the sequential search?         Ans : The bin ary search technique:- This tec

what do you understand by structured programming?explain with eg. top down and bottem up programming technique

Threaded Binary Tree : If a node in a binary tree is not having left or right child or it is a leaf node then that absence of child node is shown by the null pointers. The spac

It is a naturally occurring sorting method exemplified through a card player arranging the cards dealt to him. He picks up the cards like they are dealt & added them into the neede

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

Explain the Abstract data type assertions Generally, ADT assertions translate into assertions about the data types which implement ADTs, which helps insure that our ADT impleme

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