Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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
Q. Show the services which provided by operating system? A) Resource Allocation: If there are more than one user or jobs running at the same instance then resource
Write a short note about context switch. Switching the CPU to another process needs saving the state of the old process and loading the saved state for the new process. This ta
Write a short note on disk structure Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer.
Q. Presume that the following processes arrive for execution at the times indicated. Every process will run the listed amount of time. In responding the questions use non pre-empti
Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.
What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f
i need the job to be done within 3days
Explain the Novell NetWare NetWare doesn't really have the concept of processes in the architecture, as the most closely associated element in the NetWare environment to
Find the optimal solution and optimal value of the following linear program. Use both (a) the enumerating the corner points method and (b) the iso-profit line method. Also identify
W hat is hashed page table & method of hashed page table with details
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd