Terminology used for files structures, Data Structure & Algorithms

Assignment Help:

Given are the definitions of some important terms:

1) Field: This is an elementary data item characterized by its size, length and type.

For instance,

Name                   :           a character type of size 10

Age                      :           a numeric type

2) Record: This is a collection of associated fields that can be treated as a unit from an application viewpoint.

For example:

A university could employ a student record with the fields, namely, University enrolment no. and names of courses.

3) File: Data is organized for storage in files. A file is a collection of similar, associated records. It has an identifying name.

For instance, "STUDENT" could be a file containing student records for all the students in a university.

4) Index: An index file corresponds to a data file. Its records have a key field and a pointer to that record of the data file that has the similar value of the key field.

The data stored in files is accessed by software that can be divided into the following two categories:

i) User Programs: Usually these are written by a programmer to manipulate retrieved data in the manner attained by the application.

ii) File Operations: this deal along with the physical movement of data, in and out of files. User programs effectively employ file operations through appropriate programming language syntax The File Management System handle the independent files and behaves as the software interface among the user programs and the file operations.

File operations can be categorized as

  • CREATION of the file
  • INSERTION of records into the file
  • UPDATION of earlier inserted records
  • RETRIEVAL of earlier inserted records
  • DELETION of records
  • DELETION of the file.

Related Discussions:- Terminology used for files structures

Hashing, what is hashing? what are diffrent method of hashing?

what is hashing? what are diffrent method of hashing?

Complexity of algorithm, The simplest implementation of the Dijkstra's algo...

The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through

Illustrate the back face detection method, Illustrate the Back Face Detecti...

Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Write an algorithm to find outputs number of cars, A company is carrying ou...

A company is carrying out a survey by observing traffic at a road junction. Every time a car, bus or lorry passed by road junction it was noted down. 10 000 vehicles were counted d

Non-recursive implementation of binary tree traversals, As we have seen, as...

As we have seen, as the traversal mechanisms were intrinsically recursive, the implementation was also easy through a recursive procedure. Though, in the case of a non-recursive me

State about the pre- and post conditions, State about the pre- and post con...

State about the pre- and post conditions Programmers can easily document other pre- and post conditions and class invariants, though, and insert code to check most value preco

Which data structure is used for implementing recursion, Which data structu...

Which data structure is used for implementing recursion Stack.

Tree structure, We would like to implement a 2-4Tree containing distinct in...

We would like to implement a 2-4Tree containing distinct integer keys. This 2-4Tree is defined by the ArrayList Nodes of all the 2-4Nodes in the tree and the special 2-4Node Root w

Deletion of a node from a binary search tree, The algorithm to delete any n...

The algorithm to delete any node having key from a binary search tree is not simple where as several cases has to be considered. If the node to be deleted contains no sons,

Calculates partial sum of an integer, Now, consider a function that calcula...

Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L

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