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

Breadth-first search, Breadth-first search starts at a given vertex h, whic...

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Representation of sets?, A set s is conveniently shown in a computer store ...

A set s is conveniently shown in a computer store by its characteristic function C(s). This is an array of logical numbers whose ith element has the meaning "i is present in s". As

Array implementation of a queue, Since the stack is list of elements, the q...

Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

Explain about the structured types - built-in types, Explain about the Stru...

Explain about the Structured types - Built-In Types Values of the carrier set are not atomic, consisting rather than several atomic values arranged in some way. Common illu

What are the properties of colour, Properties of colour Colour descript...

Properties of colour Colour descriptions and specifications generally include three properties: hue; saturation and brightness. Hue associates a colour with some position in th

space, What is Space complexity of an algorithm? Explain

What is Space complexity of an algorithm? Explain.

Dqueue, how can i delete from deque while deletion is restricted from one e...

how can i delete from deque while deletion is restricted from one end

Define merge sort, Define Merge Sort  Merge sort is a perfect example ...

Define Merge Sort  Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two ha

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