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

Binary search tree bst, Describe Binary Search Tree (BST)? Make a BST for t...

Describe Binary Search Tree (BST)? Make a BST for the given sequence of numbers. 45, 36, 76, 23, 89, 115, 98, 39, 41, 56, 69, 48 Traverse the obtained tree in Preorder, Inord

Data type, Data type An implementation of an abstract data type on a...

Data type An implementation of an abstract data type on a computer. Therefore, for instance, Boolean ADT is implemented as the Boolean type in Java, and bool type in C++;

Algorithm to find maximum and minimum numbers, Give an algorithm to find bo...

Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.

Explain the representations of graph, Explain the representations of graph....

Explain the representations of graph. The different ways of representing a graph is: Adjacency list representation : This representation of graph having of an array Adj of

Circular linklist, write an algorithm to insert an element at the beginning...

write an algorithm to insert an element at the beginning of a circular linked list?

Depth First Search Through Un-weighted Connected Graph , Q. Write down the ...

Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

Enumerate about the data structure, Enumerate about the Data structure ...

Enumerate about the Data structure An arrangement of data in memory locations to signify values of the carrier set of an abstract data type. Realizing computational mechanis

Physical database design and sql queries, In this part, students are allowe...

In this part, students are allowed to implement the following simplifications in their table and data design. o Availability for the beauty therapists don't have to be considere

Define threaded binary tree, Threaded Binary Tree:- By changing the NUL...

Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

Sorting, Define Hashing. Store the following values in a hash table of tabl...

Define Hashing. Store the following values in a hash table of table size 11 using division method: 25, 42, 96, 101, 102, 162, and 197. In case of collision, use other hash functio

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