What are the different file operations?, Operating System

Assignment Help:

What are the different file operations?

Create: - Space for the file in the file system update directory table.
Write: - file name and data to be written is passed into the kernel and it write pointer points to the next possible location to which we can write.
Read:-file name is passed to the kernel and Read pointer points to the current position.
Delete a file:-kernel checks in the directory as well as removes the file from there.
Truncation: - Erase (remove) the content of the file.

Related Discussions:- What are the different file operations?

What are the advantages of indexed allocation, What are the advantages of I...

What are the advantages of Indexed allocation? The benefits are a. No external-fragmentation problem b. Solves the size-declaration problems. c. Supports direct access

What is an operating system, What is an operating system? An operating ...

What is an operating system? An operating system is a program that manages the computer hardware. It acts as an intermediate among users of a computer and the computer hardware

Linux kernel components, Example 1. The diagram illustrating the data stru...

Example 1. The diagram illustrating the data structures of in-memory VFS objects and on-disk objects and their relationships on slide 24 of the lecture notes OSD.4. This diagram i

What is linked allocation, What is linked allocation, as detailed in text? ...

What is linked allocation, as detailed in text? Directory has pointers to first and last blocks of file. Every block of file (except last) has pointer to the next block.

Race condition, list the prevention of mechanism for race condition with op...

list the prevention of mechanism for race condition with operating system

Memory management, 4. Describe priority scheduling algorithm. Consider the ...

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p

Define lru page replacement algorithm, Define LRU Page Replacement Algorith...

Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti

Process execution priorities, Priority Scheduling leads to the risk of star...

Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p

Explain hierarchical paging, Hierarchical paging Single way is to use a...

Hierarchical paging Single way is to use a two-level paging algorithm, in which the page table itself is also paged. A logical address is separated into a page number and a pag

Networking and distributed systems, Networks and operating systems have a l...

Networks and operating systems have a lot of overlap. In this course, however,we are not going to discuss networking in detail, but rather focus on the networking abstractions prov

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages