Wednesday, 28 November 2012

INTRODUCTION

 

File

A data structure in a file system which maps to names to file system objects such as files or other directories.
File Structure
A pattern for arranging data in a file.
Algorithm
A finite set of well-defined rules for the solution of a problem in a finite number of steps.
Data Structure
         A pattern for organizing data in a program.
 

 File Access

 

  • volatile storage
Storage which loses its contents when power is removed.
  • non-volatile storage
Storage which retains its contents when power is removed.
  • persistent data
Information which is retained after execution of the program which created it.
Goals for Design of File Structures and Algorithms
 
  • Minimize the number of disk accesses.
  • If possible, transfer all information needed in one access.
  • Group related information physically so it can be accessed together.

Problems and Concerns

  • File data is frequently dynamic - that is, it changes from time to time.
  • Designing file structures for changes adds complexity.
  • Typical file sizes are growing.
  • Solutions which work for small files may be inadequate for large files.
  • File structures, algorithms, and data structures must work together.

                        
                                 

2 comments:

  1. GOOD EVENIN ,
    i am a master degree student. in fact , i have this subject "File structure" this year and I have been told by my teacher it is the most difficult subject i will never seen in my life and i know teacher shouldn't be saying that instead should be encouraging and motivating to go on no matter what obstacles we face ! I want to know in brief what are the major points to handle this subject professionally ? I want to master it.

    ReplyDelete
  2. It's very helpful to me.. Thank you
    sir

    ReplyDelete