Write in brief on unix file structure, Operating System

Assignment Help:

Write in brief on UNIX file structure.

UNIX considers every file to be a sequence of 8-bit bytes no interpretation of these bits is made by the operating system. This system provides for maximum flexibility except little support. Every application program must include its own code to interpret an input file into the appropriate structure. Though all operating system should support at least one structure that of an executable file so that the system can load and run programs. A File contains two parts

1.      resource fork

2.      data fork

Resource fork enclose information of interest to the user. For example it holds the labels of any of the buttons displayed by the program. The data fork contains program data or code the traditional file contents. In UNIX if a user needs to relabel these buttons in his own language the programmer would require changing and recompiling the source code unless the programmer created his own user-changeable data file.

 


Related Discussions:- Write in brief on unix file structure

Explain the booting process for a windows xp system, Q. Explain the booting...

Q. Explain the booting process for a Windows XP system? Answer: (1) Since the hardware powers on the BIOS begins executing From ROMand loads as well as executes the bootstrap

What are the various file operations, What are the various file operations?...

What are the various file operations? The six basic file operations are Creating a file Reading a file Writing a file Repositioning within a file Tr

Basic server model, Suppose we want to program a Web server; we could easil...

Suppose we want to program a Web server; we could easily do so without using concurrency, as follows: while(true) wait connection read from socket and parse url look up url cont

Define state that process must obtain all resources it needs, Before procee...

Before proceeding with its execution, every process must obtain all the resources it needs is called Hold and wait

Garbage collection, The dynamic memory allocator is a layer between the app...

The dynamic memory allocator is a layer between the application and the OS, managing heap objects. When a program requests memory from the allocator (via malloc(), for instance), t

CPU, TURNAROUND TIME

TURNAROUND TIME

Difference between preemptive and nonpreemptive scheduling, Define the diff...

Define the difference between preemptive and nonpreemptive scheduling. State why strict nonpreemptive scheduling is unlikely to be used in a computer center. Preemptive schedul

Unix process api, Unix process API The two most important function calls...

Unix process API The two most important function calls to use when programming with several processes are fork and exec:  fork() creates a copy of current process. It gives

Multiprogramming, how response times are reduced by allowing time sharing o...

how response times are reduced by allowing time sharing on top of multiprogramming

Lru implementation details, Now, let us discuss two related algorithms for ...

Now, let us discuss two related algorithms for deciding which pages to evict. The clock algorithm is one of the most popular choices. It works by keeping frames in a circular struc

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