Files structures, Data Structure & Algorithms

Assignment Help:

The structures of files vary from operating system to operating system. In this unit, we will discuss the fundamentals of file structures with the generic file organisations.

A file may be described as a collection of records. Though, a text file doesn't conform to this definition at the first glance, it is also a set of records and records are words in the file.

Let a file consisting of information regarding students. We may name such a file as Student file. The typical records of such file are illustrated in Figure

Enum

Name

Ph no

Country

Programme

012786345

John

999896708965

USA

BCA

98387123

mandy

99997854775

USA

MCA

                             Figure: Typical records of a Student file

A file should always be stored in such a way that the fundamental operations on it can be performed easily. In other terms, queries must be able to be executed without much hassle. We target, in this unit, on the ways of storing the files on external storage devices. Selection of a specific way of storing the file on the device based on factors such as retrieval records, the way the queries can be put onto the file, the total number of keys in each of record etc.

After learning this unit, you must be able to

  • Study the terminology of file structures;
  • learn the underlying concepts of Sequential files, and
  • know about the Indexed sequential file organization.

Related Discussions:- Files structures

Create accessors for this data structure, Create a Money data structure tha...

Create a Money data structure that is made up of amount and currency. (a) Write a constructor for this data structure (b) Create accessors for this data structure (c) Writ

Linked lists - implementation, The Linked list is a chain of structures whe...

The Linked list is a chain of structures wherein each structure contains data in addition to pointer, which stores the address (link) of the next logical structure in the list.

Explain first - fit method, First - Fit Method: -    The free list is trave...

First - Fit Method: -    The free list is traversed sequentially to search the 1st free block whose size is larger than or equal to the amount requested. Once the block is found it

Write stream analogues of list processing functions, (a) Write (delay ) as...

(a) Write (delay ) as a special form for (lambda () ) and (force ), as discussed in class. (b) Write (stream-cons x y) as a special form, as discussed in class. (c) Write

Omega notation, The ?-Notation (Lower Bound) This notation provides a l...

The ?-Notation (Lower Bound) This notation provides a lower bound for a function to within a constant factor. We write f(n) = ?(g(n)), if there are positive constants n 0 and

Discuss the brute force algorithm, Question 1 What do you mean by Amortiza...

Question 1 What do you mean by Amortization? Question 2 Explain the following Big Oh notation (O) Omega notation (Ω) Theta notation (Θ)   Question 3 Di

Multiqueue, data structure for multiqueue

data structure for multiqueue

Determine the complexity, 1)    The set of the algorithms whose order is O ...

1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

Determine the disjoint of division method, Determine the Disjoint of divisi...

Determine the Disjoint of division method A polygon is disjoint from the viewport if the x- and y-extents of the polygon do not overlap the viewport anywhere. In this case; reg

Just a quick couple questions, I was wanting to know where this web site wa...

I was wanting to know where this web site was created. My second question is,,, are the online tuters accredited teachers? If they are, are they only working for the website or ma

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