Files structures, Data Structure & Algorithms

Assignment Help:

The structures of files vary from operating system to operating system. In this unit, we will discuss the fundamentals of file structures with the generic file organisations.

A file may be described as a collection of records. Though, a text file doesn't conform to this definition at the first glance, it is also a set of records and records are words in the file.

Let a file consisting of information regarding students. We may name such a file as Student file. The typical records of such file are illustrated in Figure

Enum

Name

Ph no

Country

Programme

012786345

John

999896708965

USA

BCA

98387123

mandy

99997854775

USA

MCA

                             Figure: Typical records of a Student file

A file should always be stored in such a way that the fundamental operations on it can be performed easily. In other terms, queries must be able to be executed without much hassle. We target, in this unit, on the ways of storing the files on external storage devices. Selection of a specific way of storing the file on the device based on factors such as retrieval records, the way the queries can be put onto the file, the total number of keys in each of record etc.

After learning this unit, you must be able to

  • Study the terminology of file structures;
  • learn the underlying concepts of Sequential files, and
  • know about the Indexed sequential file organization.

Related Discussions:- Files structures

Multilist file organisation, what is multilist length file organisation? ex...

what is multilist length file organisation? explain with an example

Time complexity of merge sort and heap sort algorithms, What is the time co...

What is the time complexity of Merge sort and Heap sort algorithms? Time complexity of merge sort is O(N log2 N) Time complexity of heap sort is   O(nlog2n)

STACK, WHAT IS THE PURPOSE OF STACK IN C

WHAT IS THE PURPOSE OF STACK IN C

How can the third dimension be displayed on the screen, How can the third d...

How can the third dimension be displayed on the screen The main problem in visualization is the display of three-dimensional objects and scenes on two-dimensional screens. How

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

Find the optimal control, 1. Use the Weierstrass condition, find the (Stron...

1. Use the Weierstrass condition, find the (Strongly) minimizing curve and the value of J min for the cases where x(1) = 0, x(2) = 3. 2. The system = x 1 + 2u; where

Generate a single sorted list of all n elements, Q. Assume that we have sep...

Q. Assume that we have separated n elements in to m sorted lists. Explain how to generate a single sorted list of all n elements in time O (n log m )?

Breadth-first search , 1. Apply the variant Breadth-First Search algorithm ...

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

Algorithms for push and pop operation, Q. Suggest a method of implementing ...

Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd