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

Estimate best first search nodes , Given the following search tree, state t... Given the following search tree, state the order in which the nodes will be searched for breadth first, depth first, hill climbing and best first search, until a solution is reache

Explain in brief the asymptotic notations, Question 1 Write the different ... Question 1 Write the different characteristics of an algorithm Question 2 Explain in brief the asymptotic notations Question 3 Write an algorithm of insertion sort and e

Linked lists, algorithms algorithms

Adjacency matrix representation of a graph, An adjacency matrix representat... An adjacency matrix representation of a graph cannot having information of : Parallel edges

Enumerate the types in ruby, Enumerate the Types in Ruby Ruby is a pure... Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

Arrays and pointers, C compiler does not verify the bounds of arrays. It is... C compiler does not verify the bounds of arrays. It is your job to do the essential work for checking boundaries wherever required. One of the most common arrays is a string tha

Unification algorithm, i want to write code for unification algorithm with ... i want to write code for unification algorithm with for pattern matching between two expression with out representing an expression as alist

Determine the comparison of gouraud and phong shading, Comparison of Gourau... Comparison of Gouraud and Phong Shading Phong shading requires more calculations, but produces better results for specular reflection than Gouraud shading in the form of more r

Explain merge sort, Merge sort: Merge sort is a sorting algorithm that ... Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

What are circular queues, What are circular queues?  Circular queue: St... What are circular queues?  Circular queue: Static queues have a very large drawback that once the queue is FULL, even though we erase few elements from the "front" and relieve