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

Abstract data type-tree, Definition: A set of data values & related operati...

Definition: A set of data values & related operations that are accurately specified independent of any particular implementation. As the data values and operations are described

Explain almost complete binary tree, Almost Complete Binary Tree :-A binary...

Almost Complete Binary Tree :-A binary tree of depth d is an almost whole binary tree if: 1.Any node and at level less than d-1 has two children. 2. for any node and in the tree wi

space, What is Space complexity of an algorithm? Explain

What is Space complexity of an algorithm? Explain.

Hash table, Programming for hash table?

Programming for hash table?

Double linked list, In a doubly linked list, also called as 2 way list, eac...

In a doubly linked list, also called as 2 way list, each node is divided into 3 parts. The first part is called previous pointer field. It contains the address of the preceding

Deletion algorithm for dequeue, Deletion Algorithm for dequeue Step 1:...

Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front

What are expression trees, What are expression trees?  The leaves of an...

What are expression trees?  The leaves of an expression tree are operands, like as constants or variable names, and the other nodes have operators. This certain tree happens to

Python programming, how to write a function of area of a circle using pytho...

how to write a function of area of a circle using python

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

Operations on sequential files, Insertion: Records has to be inserted at t...

Insertion: Records has to be inserted at the place dictated by the sequence of keys. As is obvious, direct insertions into the main data file would lead to frequent rebuilding of

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