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

Write down a module to merge two linked lists, Two linked lists are having ...

Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru

Single pointer pointing to the tail of the queue, Can a Queue be shown by c...

Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Process of analysis, The objective analysis of an algorithm is to determine...

The objective analysis of an algorithm is to determine its efficiency. Efficiency is based on the resources which are used by the algorithm. For instance, CPU utilization (Ti

State the ways to construct container taxonomy, State the ways to construct...

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental

Determine the class invariants- ruby, Determine the class invariants- Ruby ...

Determine the class invariants- Ruby Ruby has many predefined exceptions classes (like ArgumentError) and new ones can be created easily by sub-classing StandardError, so it's

Algorithm of decorated graph, As we talked in class, a program with two int...

As we talked in class, a program with two integer variables is universal. Now, we consider a special form of four variableprograms. Let G = (V; E) be a directed graph, where V is a

Threads in main method, Create main method or a test class that creates 2 E...

Create main method or a test class that creates 2 Element objects that are neighbours of each other, the first element temperature set at 100, the 2nd at 0 and use an appropriate h

..#title, whate is meant by the term heuristic

whate is meant by the term heuristic

Program on radix sort., Write a program that uses the radix sort to sort 10...

Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

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