Define file organization, Operating System

Assignment Help:

File Organization

    * Sequential

    * Direct

    * Indexed

A file still if it is stored on a magnetic disk or CD-ROM disk may perhaps have a sequential file organization. These records in this type of sequential file (even though the file is on a medium that allows for direct access) may only be retrieved sequentially.

Alternatively, a file on disk is able to support random access to records if its file organization is either Direct or Indexed. With Indexed and Direct file organization random record access is achieved by means of a "key field".

With Direct file organization records are allocate relative record numbers based on a mathematical formula known as a hashing algorithm. For instance you input a Student ID Number a mathematical formula is applied to it, and the resultant value is the value that points to the storage location on disk where the record is able to be found.

An Indexed file comprises a table that relates key values (for example Student ID Number) to storage locations of the corresponding records. This table is called as the index. It is simply like the index of a book where the key value (topic) has a pointer to the storage location (page number) where the information is stored.

File Organization                     Supported Record Access

Sequential                                 Sequential

Direct                                        Sequential or Random

Indexed                                    Sequential or Random


Related Discussions:- Define file organization

What are the various disk-scheduling algorithms, What are the various disk-...

What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling

What are the deadlock prevention methodologies?, What are the deadlock p r...

What are the deadlock p revention methodologies? a.       Necessitate that processes request all resources before starting - if cannot be granted don't run. b.      Process

File management, approaches to identify free memory area in a heap

approaches to identify free memory area in a heap

Difference between threads and processes, Difference between threads and pr...

Difference between threads and processes 1. Thread is flow of implementation. Process is group of instruction which is alike to that of a program except which may be stopped an

Explain short term scheduling, Short term scheduling The short term sch...

Short term scheduling The short term scheduler as well known as the dispatcher executes most frequently and makes the fine grained decision of which process to execute next. Th

Major differences between capability lists and access lists, Q. What are th...

Q. What are the major differences between capability lists and access lists? Answer: An access list is a list for each object consisting of the domains with a nonempty set of

Multilevel queue scheduling algorithm suffer from starvation, 1. Suggest so...

1. Suggest some mechanism(s) to lower the dispatch latency while scheduling for a real-time system. Also, discuss any trade-off or consequent constraint associated with it, if a

Nachos oprating system assignment, i am just wondering if you have expert i...

i am just wondering if you have expert in nachos operating system thank you

Explain components of conflict phase of dispatch latency, Explain Component...

Explain Components of conflict phase of dispatch latency The conflict phase of dispatch latency has two components 1. Preemption of any process running in the kernel. 2.

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