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

Your posts are moderated

Write your message here..

Related Questions

What is a container taxonomy, What is A Container Taxonomy It's useful ... What is A Container Taxonomy It's useful to place containers in a taxonomy to help understand their relationships to one another and as a basis for implementation using a class

In-order traversal, Write steps for algorithm for In-order Traversal Th... Write steps for algorithm for In-order Traversal This process when implemented iteratively also needs a stack and a Boolean to prevent the execution from traversing any portion

Program, circular queue using c circular queue using c

Shortest path algorithms, A driver takes shortest possible route to attain ... A driver takes shortest possible route to attain destination. The problem which we will discuss here is similar to this type of finding shortest route in any specific graph. The gr

Implementation of stack, Before programming a problem solution those employ... Before programming a problem solution those employees a stack, we have to decide how to represent a stack by using the data structures which exist in our programming language. Stac

Depth First Search Through Un-weighted Connected Graph , Q. Write down the ... Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

Explain optimal binary search trees, Explain Optimal Binary Search Trees ... Explain Optimal Binary Search Trees One of the principal application of Binary Search Tree is to execute the operation of searching. If probabilities of searching for elements

Define chaining process of hashing, Chaining In this method, instead of... Chaining In this method, instead of hashing function value as location we use it as an index into an array of pointers. Every pointer access a chain that holds the element havi

Examination, Write an algorithm for binary search. What are its limitations... Write an algorithm for binary search. What are its limitations? .

Pseudocodes, how to write a pseudo code using Kramer''s rule how to write a pseudo code using Kramer''s rule