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

Describe commonly used asymptotic notations, Q.1 Compare two functions n 2 ...

Q.1 Compare two functions n 2 and 2 n for various values of n. Determine when second becomes larger than first. Q.2 Why do we use asymptotic notation in the study of algorit

Define different types of sparse matrix, Q1. Define a sparse matrix. Explai...

Q1. Define a sparse matrix. Explain different types of sparse matrices? Evaluate the method to calculate address of any element a jk of a matrix stored in memory. Q2. A linear

Implement a min-heap, Description A heap is an efficient tree-based data...

Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera

The best average behaviour, The best average behaviour is shown by  Qui...

The best average behaviour is shown by  Quick Sort

Algorithm to count number of nodes, Write an algorithm to count number of n...

Write an algorithm to count number of nodes in the circular linked list.                            Ans. Counting No of Nodes in Circular List Let list be a circular h

Sorting, explain quick sort algorithm

explain quick sort algorithm

Illustrate the varieties of arrays, Varieties of Arrays In some languag...

Varieties of Arrays In some languages, size of an array should be established once and for all at program design time and can't change during execution. Such arrays are known a

Binary search tree, Objectives The purpose of this project is to give yo...

Objectives The purpose of this project is to give you significant exposure to Binary Search Trees (BST), tree traversals, and recursive code. Background An arbitrary BST i

Explain about the preconditions assertion, Preconditions assertion A ...

Preconditions assertion A precondition is an assertion which should be true at the initiation of an operation. For instance, a square root operation can't accept a negative a

Recursion, differences between direct and indirect recursion

differences between direct and indirect recursion

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