- How does swapping result in better memory management?
- Give an example of a Process State.
Ans:During regular intervals that are set by the operating system, processes can be copied from
main memory to a backing store, and then copied back later. Swapping allows more processes to be run that can fit into memory at one time.
Ans:Process may be in any state at a time out of the following:
- New State – means a process is being created
- Running – means instructions are being executed
- Waiting – means a process is waiting for certain conditions or events to occur
- Ready – means a process is waiting for an instruction from the main processor
- Terminate – means a process is done executing
Ans:A socket provides a connection between two applications. Each endpoint of a communication is a socket.
Ans:Direct Access method is based on a disk model of a file, such that it is viewed as a numbered sequence of blocks or records. It allows arbitrary blocks to be read or written. Direct access is advantageous when accessing large amounts of information.
Ans:Trashing refers to an instance of high paging activity. This happens when it is spending more
time paging instead of executing.
Ans:The best paging size varies from system to system, so there is no single best when it comes to
page size. There are different factors to consider in order to come up with a suitable page size, such as page table, paging time, and its effect on the overall efficiency of the operating system.
Ans:Typically, the different attributes for a file structure are naming, identifier, supported file types, and location for the files, size, and level of protection.
Ans:Root partition is where the operating system kernel is located. It also contains other potentially important system files that are mounted during boot time.
Ans:Device drivers provides a standard means of representing I/O devices that maybe manufactured
by different companies. This prevents conflicts whenever such devices are incorporated in a systems unit.
Ans:VFS, or Virtual File System, separates file system generic operations from their implementation
by defining a clean VFS interface. It is also based on a file-representation structure known as vnode, which contains a numerical designator needed to support network file systems.
Ans:A CPU contains:
- Index Registers
- Stack Pointer
- General Purpose Registers