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

Circularly linked lists implementation, CIRCULARLY LINKED LISTS IMPLEMENTAT...

CIRCULARLY LINKED LISTS IMPLEMENTATION A linked list wherein the last element points to the first element is called as CIRCULAR linked list. The chains do not specified first o

Give example of assertion and abstract data type, Give example of assertion...

Give example of assertion and abstract data type For illustration, consider Natural ADT whose carrier set is the set of non-negative integers and whose operations are the usual

Algorithm, Ask question #MWhich of the following is not a characteristic of...

Ask question #MWhich of the following is not a characteristic of good algorithm? inimum 100 words accepted#

Quick sort, This is the most extensively used internal sorting algorithm. I...

This is the most extensively used internal sorting algorithm. In its fundamental form, it was invented by C.A.R. Hoare in the year of 1960. Its popularity lies in the easiness of i

Heap sort, We will start by defining a new structure called Heap. Figure 3 ...

We will start by defining a new structure called Heap. Figure 3 illustrates a Binary tree. Figure: A Binary Tree A complete binary tree is said to assure the 'heap con

Algorithm for inorder traversals, Step-1: For the current node, verify whet...

Step-1: For the current node, verify whether it contain a left child. If it has, then go to step-2 or else go to step-3 Step-2: Repeat step-1 for left child Step-3: Visit (th

Depth-first search (dfs) , In this respect depth-first search (DFS) is the...

In this respect depth-first search (DFS) is the exact reverse process: whenever it sends a new node, it immediately continues to extend from it. It sends back to previously explore

Algorithm that inputs the codes for all items in stock, A shop sells books,...

A shop sells books, magazines and maps. Every item is identified by a unique 4 - digit code. All books have a code which starts with 1, all maps have a code starting with 2 and all

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