CS609 Final Term Subjective Paper Solved with references March (2014)

Size: px
Start display at page:

Download "CS609 Final Term Subjective Paper Solved with references March (2014)"

Transcription

1 CS609 Final Term Subjective Paper Solved with references March (2014) Q1. How larger file contents can be managed using FAT? 2 marks - Larger files would be comprised of numerous clusters. The first Cluster # can be read from FCB for rest of the Cluster, a chain is maintained within the FAT. As large files would be composed of many clusters the first Cluster number is obtained from FCB and the subsequent clusters can be obtained from FAT by using the previous cluster Number to obtain the next cluster number and so on. In order for FAT to manage files with satisfactory efficiency, it groups sectors into larger blocks referred to as clusters. A cluster is the smallest unit of disk space that can be allocated to a file, which is why clusters are often called allocation units. Each cluster can be used by one and only one resident file. Only the "data area" is divided into clusters, the rest of the partition is simply sectors. Cluster size is determined by the size of the disk volume and every file must be allocated an even number of clusters. Cluster sizing has a significant impact on performance and disk utilization. Larger cluster sizes result in more wasted space because files are less likely to fill up an even number of clusters. Q:2 When we talk about FAT32, what is the size of FS Info block? 2 marks On a FAT32 volume, the FAT can be a large data structure, unlike on FAT16 where it is limited to a maximum of 128K worth of sectors and FAT12 where it is limited to a maximum of 6K worth of sectors. FS Info block contains information required at the time of allocation/de-allocation to the file. Size of FAT 32 is huge at allocation/de-allocation time so calculating these values is not feasible, therefore these are stored in FS Info block. Q:3 Which control information PSP contains? 2m PSP is situated before the start of a process. Contains control information like DTA (Disk Transfer Area) and command line parameters. Contains the Segment address of the PSP and the program controlled by MCB. The Sony PSP contains technology that is fairly advanced. This webpage details all the different PSP models ranging from the original PSP (from now on called PSP Fat), to the later PSP Slim, PSP Brite, and PSP Go. Main PSP Features One of the main features of the PSP is being a high tech gaming gear. The gaming engine hardware is as powerful as a full size PS2, but at a quarter of the size. The PSP allows game playing mainly through UMD discs, but you can also load the game via the Memory Stick (or

2 internal Flash in the PSP Go). The /PSP/GAME directory of the Memory Stick can contain any directory having an EBOOT.PBP file (the game executable), which will end up showing in the "GAME->Memory Stick" XMB menu screen. From there, you can select it to run it. Although the gaming functionality is the main selling point of the machine, after using it awhile, you will start appreciating the picture viewer, MP3 player (with speakers) and MPEG4 video player. You can actually squeeze a DVD movie onto a memory stick and play it on the wide-screen LCD display. Q:4 Which is the location of timer count in BIOS data area? Timer location in BIOS data area is 40:6CH. 2 Marks Q:5 Explain the purpose of file control block(fcb)? 3 Marks Control information about files is maintained in a data structure called the File control block (FCB). The FCB for each file is created and stored in the disk. We can get information about the file such as size, date time of creation, data time of last modification etc from FCB. Further we can also impose restrictions on file such as read only, archived etc using FCB. A file control block (FCB), also called a file descriptor, is a type of data structure that is temporarily allocated by a computer operating system to maintain the status of a data file that is being created or otherwise manipulated. In most instances, a file control block is used to store basic information about a file, such as its name, extension and location on a logical drive, as well as dynamic information such as the current address within the file that is being read. Originally, a file control block was a very well-defined structure under certain operating systems, but it since has become a more generic term for the structure used to track information about an actively handled file. One important purpose of a file control block is to help the file system keep track of what state the file is in to prevent different operations from attempting to modify the file in conflicting ways, such as reading from an area of the file that is currently being written to. The structure not only is used for data files, but also can be used to track information about directories, although the data structure usually is shortened to remove unnecessary fields, because a directory cannot contain data. Q:6 In NTFS, where the backups of boot block are stored and why? 3 Marks The NTFS "Backup Boot Sector" is not really part of the NTFS Volume; it's actually stored in a sector immediately following the last sector of the Volume, which makes an NTFS Volume's partition size 1 sector larger than its Volume size! If the NTFS boot sector is damaged, data cannot be accessed. Windows will prompt the drive is not formatted, do you want to format it now? Linux mount will display wrong fs type, bad option, and bad superblock. TestDisk can use the backup boot sector to fix a corrupted NTFS boot sector. The primary boot sector is sector zero of the file system and the backup NTFS boot sector is located near the end of the file system. Even if the boot sector is accidentally overwritten, the backup should be intact. TestDisk checks the boot sector and the backup boot sector.

3 Q:7 What are three different kinds of computer viruses? 3 Marks Types of Viruses Partition Table Virus Boot Sector Virus File Viruses Q:8 Write a C program that should print your name using int 21H with the help of int86 function See Page#19 for idea solution detail Idea solution: #include <dos.h> union REGS regs; main() { regs.h.ah = 0; regs.h.al = 1; int86( 0x10, &regs, &regs ); printf("fourty by Twenty-Five color mode."); Q:9 What will be the impact of placing E5 in place of first character of file name? 5 marks DOS perform file deletion by placing 0xE5 at the first byte of it FCB entry and placing 0's (meaning available) in the entries for the file clusters in the FAT. The only difference that has occurred is that the first character has been replaced by a byte with the value 0xE5. Two tasks should be performed successfully to undelete a file -- Replacing the 0xE5 entry in FCB by a valid file name character. -- placing the appropriate values in FAT for representation of file cluster chain. If any one of the above cannot be done then the file cannot be fully re cove re d. Q:10 How partition table virus fools DOS about conventional memory? 5 marks The transient part of Command.Com loads itself such that its last byte is loaded in the last byte of Conventional Memory. If somehow there is some Memory beyond Command.Com s transient part it will not be accessible by DOS.

4 At 40:13H a word contains the amount of KBs in Conventional Memory which is typically 640. If the value at 40:13H is somehow reduced to 638 the transient part of Command.Com will load itself such that its last byte is loaded at the last byte of 638KB mark in Conventional RAM. In this way last 2KB will be left unused by DOS. This amount of memory is used by the Virus according to its own size. Q:11 Write down a TSR program, when ever user presses a key it displays it thrice. For example if user has pressed "A" it will display "AAA"? 5 marks #include <dos.h> Void interrupt (*old)( ); Void interrupt newfunc ( ); Void main ( ) { old = getvect(0x09); setvect (0x09,newfunc); keep(0,1000); void interrupt newfunc ( ) { (*old)( ); (*old)( ); (*old)( ); This program simply intercepts the keyboard interrupt and places the address of newint in the IVT. The newint simply invokes the original interrupt 9 thrice. Therefore the same character input will be placed in the keyboard buffer thrice i.e. three characters will be received for each character input. Paper 2: Q:2 Write down autonomy of NTFS file system?

5 In NTFS based system. The FAT and root Directory has been replaced by the MFT. It will generally have two copies the other copy will be a mirror image of the original. Rests of the blocks are reserved for user data. In the middle of the volume is a copy of the first 16 MTF records which are very important to the system. Write the limitation of bios disk()? Large sized disk are available now with thousands of tracks But this BIOS routine only is capable of accessing a max. Of 1024 tracks. Hence if a large disk is being used not whole of the disk can be accessed using this routine This function uses the int 13H services. The parameter sizes provided by these services may not be sufficient to hold the track number of block to be accessed. Q: 6 LSN = 0 and LBA = 0 are same things? Why if yes or no? Why not? 3m LBA = 0 is not the same as LSN=0. The LBA=0 block is the first block on disk. Whereas each logical partition has LSN=0 block which is the first block in logical drive and is not necessarily the first block on physical drive. Q:7 Major enhancements on FAT 32 comparing with FAT 12 and FAT 16? The major difference between FAT 16 and FAT 32 is of course the FAT size. FAT32 evidently will contain more entries and can hence manage a very large disk whereas FAT16 can manage a space of 2 GB maximum practically. The numerals in the names FAT12, FAT16, and FAT32 refer to the number of bits required for a file allocation table entry. FAT12 uses a 12-bit file allocation table entry (2 12 clusters). FAT16 uses a 16-bit file allocation table entry (2 16 clusters). FAT32 uses a 32-bit file allocation table entry. However, Windows 2000 reserves the first 4 bits of a FAT32 file allocation table entry, which means FAT32 has a theoretical maximum of 2 28 clusters. Q:8 In DMA what is purpose of count register? Number of bytes to be loaded is placed in the count register. The lower 16bits are loaded in the base address register and the number of bytes to be loaded is placed in the

6 count register. Each DMA channel has associated with it a 16 bit address register and a 16 bit count register. To initiate a data transfer the device driver sets up the DMA channel's address and count registers together with the direction of the data transfer, read or write. It then tells the device that it may start the DMA when it wishes. When the transfer is complete the device interrupts the PC. Whilst the transfer is taking place the CPU is free to do other things. Q:9 Difference between COM file and DOS EXE? The main difference in COM File and DOS EXE File is that the COM File starts its execution from the first instruction, whereas the entry point of execution in EXE File can be anywhere in the Program. COM File is a mirror image of the program code. Its image on disk is as it is loaded into the memory. COM Files are single segment files in which both Code and Data resides. COM File will typically have a Three Bytes near Jump Instruction. The entry point in case of EXE File is tempered by the Virus which is s to red in a 27-byte header in EXE File. Q:11 Calculate the sector no for the following ICH we have the following info blocks per cluster = 8 first user block number = 20 Sector No. = (Clust_no - 2)* Blocks per Clust + First User Block # Sector No. = (2)* 8 +20=36 Q:12 Find the root directory sector where reserved sector = 1 and sector per FAT = 9, use appropriate assumption? Root dir sector=reserved sector+2 *(sector per FAT)=1+2*9=19 2) Suppose we read the contents of Drive parameter block and get the following information. Number of reserved blocks=2 Number of blocks in FAT= 7 Number of blocks in root directory=32 Find the number of systems blocks. Make the appropriate assumptions when needed. Now in the example sector per FAT is unknown. No. of System Area Blocks = Reserved Block + Sector per FAT * No. of FAT's + No. of entries * Root dir =reserved sector+2*sector per FAT

7 2*sector per FAT= Root dir - reserved sector=32-2=30 Sector per FAT=30/2=15 No. of System Area Blocks = * =151 Write three Data Structures for Memory DOS use? MCB (Memory Control Block) EB (Environment Block) PSP (Program Segment Prefix) 2) Scan Disk Surface Scan for Bad Sectors It attempts to write a block. After write it reads back the block contents. Performs the CRC test on data read back. If there is an error then the data on that block is not stable and the cluster of that block should be marked bad. The cluster is marked bad by placing the appropriate code for bad cluster so that they may not be allocated to any file. 5) Structure of Partitioning Table Total size of Partition Table is 512 bytes. First 446 bytes contains code which loads the boot block of active partition and is executed at Boot Time. Rest of the 66 bytes is the Data part. Last two bytes of the Data part is the Partition table signature. 6) Find root dir if reserved sector = 1 and size of fat is 9? Root DIR Sector: Reserved sectors +2 * (size of FAT) = * 9 = 19 Write the functionality of abs read and abs write? abs read( ) is used to read a block given its LSN abs write( ) is used to write a block given its LSN absread(int drive, int nsects, long lsec, void *buffer); abswrite(int drive, int nsects, long lsec, void *buffer);

8 File size is 12k and cluster size is 4 is k shyd blocks find krne thy 2 marks Number of blocks within a cluster is in power of 2=4 2 =16 1st sector no formula 2 marks The boot sector is the first sector in a series of reserved sectors. The size of a sector (in bytes) is recorded in the boot sector; it is typically 512 bytes for hard disks. The CompactFlash specification standardizes a sector to 512 bytes. On hard disks, the first sector is called variously the master boot record, the partition sector, or the partition table. This record or table tells how and whether the disk has been divided into logical partitions (for example, you can divide your hard drive into two logical partitions or drives so that you can load different operating systems on to the disk and switch back of forth).

9 Write the formula of direct addressing? 2 marks segment*10h+offset 1st user block no given, Blocks per cluster is given find the sector. Sector No. = (Clust_no - 2)* Blocks per Clust + First User Block # Name three descriptor table 3 marks 1. Global descriptor table (GDT) 2. Local descriptor table (LDT) 3. Interrupt descriptor table (IDT) If LSN given then how to read a block 3 marks If the LSN address is known the absread () function can be used to read a block and abswrite() can be used to write on it. What is the purpose of control register in DMA 3 marks The purpose of the DMA Control Register for each channel is to control the operations of that DMA channel. lists the purposes of the individual bits in the DMA Control Register. The DMA Control Register is: in CP15 c11 one 32 bit read/write register for each DMA channel common to Secure and Nonsecure worlds Accessible in user and privileged modes. Purpose: Controls the DMA transfer request mechanism. Usage constraints: There are no usage constraints. Configurations: This register is available in all configurations. Attributes: Offset 0xC10, Type RW, Reset 0x , Width32. Address translation from logical to physical 3 marks seg * 10H + offset for Logical to Physical address translation Modem controller register?

10 In case software oriented flow control technique is used the bits 0 and 1 need to be set in that case. Bit #3 need to be set to enable interrupts. Moreover if a single computer is available to a developer the UART contains a self test mode which can be used by the programmer to self test the software. Keyboard writing protocol...5 marks Wait till input buffer is full Write on buffer Wait till output buffer is full Check the acknowledgement byte Repeat the process if it was previously unsuccessful. Mathematical translation for LBA translation? LBA address = (C * H' +H)* S' + S - 1 Where C = Selected cylinder number H' = No. of heads H = Selected head number S'=Maximum Sector number S= Selected Sector number Boot block structure, jmp code part OSName BIOS

11 Parameter Block codepart: A jump instruction (near jump of 3 bytes size) is used to jump to the code part and skip the data part so that it is not interpreted as instructions by the processor. Find root dir sector.5 marks Formula :Root Dir Sector= reserved sectors +2 * (size of FAT) Paper no 3 1. How large file contain can be managed using FAT? Larger files would be comprised of numerous clusters. The first Cluster # can be read from FCB for rest of the Cluster, a chain is maintained within the FAT. Answer in simple words is in green as large files would be composed of many clusters the first Cluster number is obtained from FCB and the subsequent clusters can be obtained from FAT by using the previous cluster Number to obtain the next cluster number and so on. What do you mean by mirroring in FAT32? The FAT and root directory has been replaced by the MFT. It will generally have two copies the other copy will be a mirror image of the original. Rests of the blocks are reserved for user data. In the middle of the volume is a copy of the first 16 MTF records which are very important to the system. On all FAT drives, there may be multiple copies of the FAT. If an error occurs reading the primary copy, the file system will attempt to read from the backup copies. On FAT16 and FAT12 drives, the first FAT is always the primary copy and a modification will automatically be written to all copies. However, on FAT32 drives, FAT mirroring can be disabled, and a FAT other than the first one can be the primary (or "active") copy of the FAT. 3. Enlist all the activities that are to be performed when interrupt 9 occurs? The service 15H/4FH is called the keyboard hook service. This service does not perform any useful output; it is there to be intercepted by applications which need to alter the keyboard layout. It called by interrupt 9H after it has acquired the scan code of input character from the keyboard port while the scan code is in AL register. When this service returns interrupt 9H translates the scan code into ASCII code and places it in buffer. This service normally does nothing and returns as it is but a programmer can intercept it in order to change the scan code in AL and hence altering the input or keyboard layout.

12 Answer is reads scan code then converts to ASCII and Place it in keyboard buffer and return these are the activities performed when interupt 9 occurs. The newint simply invokes the original interrupt 9 thrice. Therefore the same character input will be placed in the keyboard buffer thrice i.e. three characters will be received for each character input. Whenever the interrupt 9 occurs it reads the keyboard port 0x60. If the port contains 83 then it means DEL was pressed, if so it places the code 25 in the buffer and then updates the head in circular manner. The code 25 placed instead of 83 represents the combinations CTRL+Y. The program when resident will cause the program to receive CTRL+Y combination whenever DEL is pressed by the user. i.e. in Borland C environment CTRL+Y combination is used to delete a line, if this program is resident then in Borland C environment a line will be deleted whenever DEL is pressed by the user. Write a Formula to transfer the cluster # in LSN for FAT32 file System. page no No of System area blocks= reserved block+ fat per sector*no of FAT+no of enteries*32 First user block NO. = No of system area blocks Sector No. =(clust_no_2)*blocks per cluster first user block no In reflection of the anatomy of FAT32 based system the method used to translate the cluster # into LSN also varies. The following formula is used for this purpose. Starting Sector # for a Cluster Starting Sector = Reserved Sect. + FatSize *FatCopies + (cluster # - 2) *size of cluster Can we send the data to keyboard yes or not? Yes we can. How many maximum possible entries are there in FAT32 and FAT16? In FAT16 we can have 2^16=65536 entries. FAT32 evidently will contain more entries and can hence manage a very large disk whereas FAT16 can manage a space of 2 GB maximum practically. Anatomy of FAT32?

13 Starting block(s) is /are the boot block(s), immediately after which the FAT (File allocation table) starts. A typical volume will contain two copies of FAT. After FAT the root directory is situated which contain information about the files and folders in the root directory? Whole of this area constitutes the systems area rest of the area is used to store user data and folders. TSR program that sets the caps lock bit in the keyboard status bytes whenever interrupt 8 occurs. #include <dos.h> void interrupt (*old)(); void interrupt new(); char far *scr=(char far* ) 0x ; void main() { old=getvect(0x08); setvect(0x08,new); keep(0,1000); void interrupt new (){ *scr=64; (*old)(); gets the address stored at the vector of interrupt 8 and stores it in the pointer oldint. The address of the interrupt function newint is then placed at the vector of int 8 and the

14 program is made memory resident. From this point onwards whenever interrupt 8 occurs the interrupt function newint is invoked. This function after performing its operation calls the original interrupt 8 whose address has been stored in oldint pointer. Q. What is difference between tracks and sectors? Tracks are the circular division of the disk and the sectors are the longitudinal division of the disk. The tracks are concentric circles around the central spindle on either side of each platter. Tracks physically above each other on the platters are grouped together into cylinders which are then further subdivided into sectors of 512 bytes apiece. The sector is a disk s smallest accessible unit. Drives use a technique called zoned-bit recording in which tracks on the outside of the disk contain more sectors than those on the inside. Q# Write down procedure to convert a cluster number into sector number - NTFS simply the following formula will be used to translate the sector number into cluster number. Sector # = Cluster # * Sector per Cluster Q: In FAT32, what is the size of FSInfo? - On a FAT32 volume, the FAT can be a large data structure, unlike on FAT16 where it is limited to a maximum of 128K worth of sectors and FAT12 where it is limited to a maximum of 6K worth of sectors. In which storage media head touches the surface of disk and in which does not and why it is so? Pg The head is touching the surface of floppy disk which rotates at a low speed of 300 RPM. The head is not touching the surface of hard disk which run at high speeds up to 9600 RPM but is at a few microns distance from the surface What is difference b/w Primary and extended Partition? pg Partition defined in the MBR (Master Boot Record) is primary partition. Each Primary Partition contains information about its respective O.S. However if only one O.S. is to be installed then extended partitions. The extended partition may again be divided into a number of partitions, information about further partitions will be kept in extended partition table which will be the first physical block within extended partition (i.e. it will not the first block of primary partition.). Moreover there can be extended partitions within extended partitions and such that in then end there are number of logical partitions this can go on till the last drive number in DOS.

15 Suppose a disk is divided into two partition and we have read MBR at LBA=0 to get information about primary partition a) How many bytes of code part we need to skip to get information about primary partition? b) How many bytes of code part we need to read information? Define the following terms relating to HDD (Hard Disk Drive). Solution: - (1) Block: - Blocks are the sectors per track, smallest addressable unit in memory; address of block is specified as a unique combination of three parameters. (2) Sector: - Each track can hold many thousands of bytes of data. It would be wasteful to make a track the smallest unit of storage on the disk, since this would mean small files wasted a large amount of space. Therefore, each track is broken into smaller units called sectors. (3) Track: - All information stored on a hard disk is recorded in tracks, which are concentric circles placed on the surface of each platter, much like the annual rings of a tree. The tracks are numbered, starting from zero, starting at the outside of the platter and increasing as you go in. A modern hard disk has tens of thousands of tracks on each platter (4) Cluster: - Cluster is the collection of contiguous blocks. User data is divided into cluster, number of blocks within a cluster is in power of 2. Cluster size can be varying depending upon the size of the disk. (5) Cylinder: - Cylinder is a collection of corresponding tracks if track on platter changes so will the tracks on rest of the platters as all the heads move simultaneously (6) Seek Time: - While accessing a selected block Time required by the head to reach the particular track/cylinder is called seek time (7) Access Time: -

16 The accumulative time that is required to access the selected block is called access time (8) LBA (Logical Block Addressing): - LBA is the address of relative to the start of physical drive i.e. (absolute). (9) LSN (Logical Sector Number): - If the blocks are indexed from the boot block such that the boot block has index = 0. Then this index is called LSN. LSN is relative index from the start of logical drive not the physical drive. (10) DAP (Disk Address Packet): - Disk Address Packet is data structure used by extended in 13H services to address a block and other information for accessing the block. (11) BPB (BIOS Parameter Block): - BIOS Parameter Block is a data structure maintained by DOS in the boot block for each drive. The boot block is typically a 512 byte block it contain some code and data. The data part constitutes the BPB. (12) DPB (Drive Parameter Block): - Beside the BPB there is another data structure can be used equivalently called the DPB. The operating system translates the information in BPB on disk into the DPB which is maintained main memory. This data structure can be accessed using the undocumented services 21H/32H.

17 Current papers: Q. What is the size of FSinfo in FAT32? 512 bytes FSInfo Sector Structure size is 512 -bytes and in FAT32 BPB_FSinfo size is 2 byte at 48 offset Q. First partition table maintains information about ----? 2m The first partition table maintains information about the primary and extended partitions. Q2. Find the root directory sector. Where reserved sector = 1 and sector per FAT = 9. Use appropriate assumption where needed? 5 Marks Root DIR Sector: reserved sectors +2 * (size of FAT) = * 9 = 19 Q. Write the limitation of bios disk ()? Large sized disk are available now with thousands of tracks But this BIOS routine only is capable of accessing a max. of 1024 tracks. Hence if a large disk is being used not whole of the disk can be accessed using this routine This function uses the int 13H services. The parameter sizes provided by these services may not be sufficient to hold the track number of block to be accessed. Q. How DMA works in Block transfer mode? In block transfer mode the DMA is programmed to transfer a block and does not pause or halt until the whole block is transferred irrespective of the requests received meanwhile. In Single transfer mode the DMA transfers a single byte on each request and updates the counter registers on each transfer and the registers need not be programmed again. On the next request the DMA will again transfer a single byte beginning from the location it last ended. Q. How cross reference of clusters can be detected?

18 If a cluster lies in more than one file chain, then its s aid to be Cross Referenced. Cross references can pose great Problems. Cross references can be detected easily by traversing through the chain of all files and marking the cluster # during traversal. If a cluster is referenced more than once then it indicates a cross reference. To solve the problem only one reference should be maintained. Q. LSN = 0 and LBA = 0 are same things? Why if yes or no? LBA = 0 is not the same as LSN=0. The LBA=0 block is the first block on disk. Whereas each logical partition has LSN=0 block which is the first block in logical drive and is not necessarily the first block on physical drive. Q3. Calculate the sector no for the following I C H we have the following info blocks per cluster = 8 first user block number = 20 - Sector No. = (Clust_no 2)* Blocks per Clust + First User Block # Sector No. = (2)* 8 +20=36 1) Write three Data Structures for Memory DOS use? MCB (Memory Control Block) MCB is a 16-bytes large structure. MCB is us ed to control an allocated blo ck in memory. Every allocated block will have a MCB before the start of block. EB (Environment Block) Contains Environment information like Environment variables and file paths for that program PSP (Program Segment Prefix is situated before the start of a process. contains control information like DTA (Disk Transfer Area) and command line parameters. 2) Scan Disk Surface Scan for Bad Sectors? It attempts to write a block. After write it reads back the block contents.

19 Performs the CRC test on data read back. If there is an error then the data on that block is not stable and the cluster of that block should be marked bad. The cluster is marked bad by placing the appropriate code for bad cluster so that they may not be allocated to any file. 3) How to recover a Deleted Files? How can we recover the deleted contents of file? Explain each step of recovery in detail. 0xE5 at the start of file entry is used to mark the file as deleted. The contents of file still remain on disk. The contents can be recovered by placing a valid file name, character in place of E5 and then recovering the chain of file in FAT. If somehow the clusters used by deleted file have been overwritten by some other file, it cannot be recovered. In the contents of the above given root directory notice an entry named SECOND. The attribute byte of this entry is 0x20 which indicates that it s a directory, the size is 0 which shows that there is now user data in it, but even though the size 0 it has a first cluster which is 0x12. Converting 0x12 into LSN and then reading its contents we get the following dump. This shows that this cluster contains the FCBs for all the file and folders within this directory. Q. Possible entries in FAT12 and FAT16 2 marks FAT is a simple table which contains cluster number of each file. FAT12 will have 12-bit wide entries and can have 2^12 entries maximum. A FAT theoretically will contain 2 n entries where n is 12 for FAT 12 and 16 for FAT16. Q. What is highest capacity of disk using IDE and extended Bios Function? 2 marks Hence highest physical capacity of the disk according to the IDE interface is 255x16x65536x512 = 127GB. Extended BIOS functions allow to access disk with sizes greater than 504 MB through LBA translation. Q. What does it indicates if the value of first byte of data part of the partition table is 80h? 2 80H if Bootable, 0 if Not

20 Boot Indicator. Indicates whether the partition is the system partition. Legal values are: 00 = Do not use for booting. 80 = System partition. If it is 00, then the partition is not the active partition (does not contain the boot loader). If it is 80 or greater, as in the example, this means it is the active (bootable) partition. Only one partition can be marked as active. The second piece of information applies to fixed disks. If the first fixed disk contains the active partition, this number will be 80. If it were the second fixed disk, this number would be 81, and so on. Q. What are three different kinds of computer viruses? 3 Marks Types of Viruses Partition Table Virus Boot Sector Virus File Viruses Q. How the descriptor table and what are the attributes of segments? 3 marks How descriptor describes a memory segment and what are the attributes of memory segment? 5m Descriptor table describes the memory segment by storing its attributes related to that memory segment and their significant attributes are: Base address, length and limit, right access. If the Descriptor describes a memory segment then the Access Rights Byte will have the following meaning. P DPL S E X RW A Descriptors are structures, which must with the Prozessor a length of 8 byte possess and "somewhere" in the main memory be. They describe (therefore it also the name: Descriptor; tons describe, English, describe) a segment in the memory. A descriptor records thereby the following characteristics of a segment: the physical start address within the memory (32 bits), the length of the segment (20 bits) and Additional information, like rights of access or the Segmentyp (data or code segment). Q. How Accessing NTFS volume in DOS? 5 marks How a NTFS volume can be accessed in DOS? 2m NTFS volume cannot be accessed in DOS using DOS based function like absread ( ) etc. DOS device drivers do not understand the NTFS data structures like MFT etc. If NTFS volume is accessed in DOS, it will fire the error of Invalid Media.

21 Q# Write down procedure to convert a cluster number into sector number No of System area blocks= reserved block+ fat per sector*no of FAT+no of enteries*32 First user block NO. = No of system area blocks Sector No. =(clust_no_2)*blocks per cluster first user block no 1. How can content of large and small file manage in MFT? This design makes file access very fast. Consider, for example, the FAT file system, which uses a file allocation table to list the names and addresses of each file. FAT directory entries contain an index into the file allocation table. When you want to view a file, FAT first reads the file allocation table and assures that it exists. Then FAT retrieves the file by searching the chain of allocation units assigned to the file. With NTFS, as soon as you look up the file, it's there for you to use. Directory records are housed within the master file table just like file records. Instead of data, directories contain index information. Small directory records reside entirely within the MFT structure. Large directories are organized into B-trees, having records with pointers to external clusters containing directory entries that could not be contained within the MFT structure. 2. Possible factors that will be affected by changing disk capacity? The possible factors is Size of cluster will be affected by changing disk capacity. Because, as size of disk increase cluster size increases. 3. Which file system keeps the back up of its boot block? How is the first filesystem (called the root filesystem, because it contains the root directory) mounted, since it obviously can't be mounted on another filesystem? Well, the answer is that it is done by magic. The root filesystem is magically mounted at boot time, and one can rely on it to always be mounted. If the root filesystem can't be mounted, the system does not boot. The name of the filesystem that is magically mounted as root is either compiled into the kernel, or set using LILO or rdev.

22 There are many MS-DOS defragmentation programs that move blocks around in the filesystem to remove fragmentation. For other filesystems, defragmentation must be done by backing up the filesystem, re-creating it, and restoring the files from backups. Backing up a filesystem before defragmenting is a good idea for all filesystems, since many things can go wrong during the defragmentation. 5. Advantages and disadvantages of FAT32 5 marks FAT32 evidently will contain more entries and can hence manage a very large disk whereas FAT16 can manage a space of 2 GB maximum practically. No fixed space reserved for root directory. In the FAT32 there is another special reserved block called FS Info sector. The block contains some information required by the operating system while cluster allocation/deal location to files. Advantages of FAT32 include: FAT32 has some advantages over the FAT 16 file system in regards to improved reliability. For example, under the FAT 16 file system, the root directory is located only at the beginning of the hard disk. If anything were to happen to this section of the hard disk, such as the development of bad sectors, the whole drive will become unusable as the file index will become damaged. Therefore, one will have to seek out special disk recovery tools to try to recover the data, which more than likely will be unsuccessful. By using the FAT 32 file system, the root directory can be located anywhere on the hard disk. Therefore, if anything happens to the section of the hard disk storing the root directory, the FAT 32 file system s built in utilities will be able to move the root directory to a safe location on the hard disk and repair the defective area. In addition, the FAT 32 file system can use both the default and the backup copy of the File Allocation Table. This means that if something were to happen to the default FAT, your system will continue to run by using the backup copy until the default can be repaired. Disadvantages of FAT32 include: The largest FAT32 volume that Windows 2000 can format is 32 GB. FAT32 volumes are not directly accessible from operating systems other than Windows 95 OSR2 and Windows 98. If you have a startup failure, you cannot start the computer by using an MS-DOS or Windows 95 (excluding version OSR2 and later) bootable floppy disk. There is no built-in file system security or compression scheme with FAT Where head touch where don't touch the surface of the disk? The head is touching the surface of floppy disk which rotates at a low speed of 300 RPM. The head is not touching the surface of hard disk which runs at high speeds up to 9600 RPM but is at a few microns distance from the surface.

23 Advantages of FAT16 Advantages of FAT16 include: MS-DOS, Windows 95, Windows 98, Windows NT, Windows 2000, and some UNIX operating systems can use FAT16. There are many software tools that can address problems and recover data on FAT16 volumes. If you have a startup failure, you can start the computer by using an MS-DOS bootable floppy disk to troubleshoot the problem. FAT16 is efficient, in speed and storage, on volumes smaller than 256 MB. Top Of Page Disadvantages of FAT16 Disadvantages of FAT16 include: The root folder can manage a maximum of 512 entries. The use of long file names (LFNs) can significantly reduce the number of available entries. FAT16 is limited to 65,536 clusters, but because certain clusters are reserved, it has a practical limit of 65,524. The largest FAT16 volume on Windows 2000 is limited to 4 GB and uses a cluster size of 64 KB. To maintain compatibility with MS-DOS, Windows 95, and Windows 98, a volume cannot be larger than 2 GB. FAT16 is inefficient on larger volume sizes, as the size of the cluster increases. The space allocated for storing a file is based on the size of the cluster allocation granularity, not the file size. For example, a 10-KB file stored on a 1.2-GB volume, which uses a 32-KB cluster, wastes 22 KB of disk space. The boot sector is not backed up. There is no built-in file system security or compression scheme with FAT16. Top Of Page Advantages of FAT32 FAT32 has the following enhancements: The root folder on a FAT32 drive is an ordinary cluster chain and can be located anywhere on the volume. For this reason, FAT32 does not restrict the number of entries in the root folder. FAT32 uses smaller clusters (4 KB for volumes up to 8 GB), so it allocates disk space more efficiently than FAT16. Depending on the size of your files, FAT32 creates the potential for tens and even hundreds of megabytes of additional free disk space on larger volumes compared to FAT16. FAT32 can automatically use the backup copy of the file allocation table instead of the default copy (with FAT16, only a disk repair tool such as Chkdsk can implement the backup). The boot sector is automatically backed up at a specified location on the volume, so FAT32 volumes are less susceptible to single points of failure than FAT16 volumes. Top Of Page Disadvantages of FAT32 Disadvantages of FAT32 include: The largest FAT32 volume that Windows 2000 can format is 32 GB. FAT32 volumes are not directly accessible from operating systems other than Windows 95 OSR2 and Windows 98. If you have a startup failure, you cannot start the computer by using an MS-DOS or Windows 95 (excluding version OSR2 and later) bootable floppy disk. There is no built-in file system security or compression scheme with FAT32. CS609 - Final Term Papers Fall 2012 Q#1 In how many ways higher PC can operate? - (Page 319) Higher PCs can operate in two modes

24 REAL MODE PROTECTED MODE Q#2 In FAT32, what is the size of FSInfo? On a FAT32 volume, the FAT can be a large data structure, unlike on FAT16 where it is limited to a maximum of 128K worth of sectors and FAT12 where it is limited to a maximum of 6K worth of sectors. Q#3 A disk is divided into three partition. What type of information is represented in code part of partition table? - (Page 219) code part contains valid executable code Q#4 Differences between FAT16 and FAT32 Q#5 How ISR sends EOI (End of interrupt) signals to master and slave.required statement must be in C program void irq_handler(registers_t regs) { // Send an EOI (end of interrupt) signal to the PICs. // If this interrupt involved the slave. if (regs.int_no >= 40) { // Send reset signal to slave. outb(0xa0, 0x20); // Send reset signal to master. (As well as slave, if necessary).

25 outb(0x20, 0x20); if (interrupt_handlers[regs.int_no]!= 0) { isr_t handler = interrupt_handlers[regs.int_no]; handler(&regs); Q#7 Distinguish between and (Page 170) If the sign of infinity can be reversed than the coprocessor is otherwise its Q#8 Write down procedure to convert a cluster number into sector number - (Page 308) NTFS simply the following formula will be used to translate the sector number into cluster number. Sector # = Cluster # * Sector Per Cluster Q#9 How a PC operates in protected mode? - (Page 326) PC has to be shifted to Protected Mode if originally boots in Real Mode. In Protected Mode whole of the RAM is accessible that includes the Conventional, Expanded and Extended Memories. OS like Windows has a memory management system for Protected Mode. A privilege level can be assigned to a memory area restricting its access. Q#10 Describe how a chain of cluster in FAT12 is managed? - (Page 291)

26 CS609 - Final Term Papers Fall marks. How larger file contents can be managed using FAT? - (Page 264) Larger files would be comprised of numerous clusters. The first Cluster # can be read from FCB for rest of the Cluster, a chain is maintained within the FAT. what is the control information in PSP (program segment prefix) contain? - (Page 321) It contains control information like DTA (Disk Transfer Area) and command line parameters. How many possible entries are there in FAT12 and FAT16? - Click here for detail FAT12 and FAT16 media typically use 512 root directory entries.

27 Write down the names of three data structure used for memory management? - (Page 321) DOS makes use of various Data Structures for Memory Management: MCB ( Memory Control Block ) EB ( Environment Block ) PSP ( Program Segment Prefix ) 5 Marks. What are interrupt function pointers? Explain with examples. - (Page 22) Interrupt pointers and functions Interrupt functions are special function that as compared to simple functions for reasons discussed earlier. It can be declared using the keyword interrupt as shown in the following examples. void interrupt newint ( ) { Similarly a pointer to such interrupt type function can also be declared as following void interrupt (*intptr) ( ); where intptr is the interrupt pointer and it can be assigned an address using the getvect() function intptr = getvect(0x08); Now interrupt number 8 can be invoked using the interrupt vector as following (*intptr) ( ); What is fragmentation? And how we remove it using defragmentation. - (Page 316)

28 Fragmentation means that clusters of a same file are not contiguously placed, rather they are far apart, increasing seek time hence access time. So its desirable that files clusters may be placed contiguously, this can be done by compaction or defragme notation. Defragmentation Software reserves space for each file in contiguous block by moving the data in clusters and Re-adjusting. As a result of defragmentation the FAT entries will change and data will move from one cluster to other localized cluster to reduce seek time. Defragmentation has high computation cost and thus cannot be performe d frequently. What is cluster? Describe it key characteristics. - (Page 342) A cluster is a collection of contiguous blocks. User Data is divided into clusters Number of blocks within a cluster is in power of 2. Cluster size can vary depending upon the size of the disk. DOS has a built in limit of 128 blocks per cluster. But practically limit of 64 blocks per cluster has been established. A cluster is not the same as block and also there are no system calls available which use the cluster number. All the system calls use the LSN address. If the cluster number is known it should be converted into LSN to access the blocks within the cluster. Moreover all the information about file management uses the cluster number rather than the LSN for simplicity and for the purpose of managing large disk space. So here we devise a formula to convert the cluster number into LSN. After calculating the sector number for the cluster the contents of the file can be accessed by reading all the blocks within the cluster. In this way only the starting cluster will be read. If the file contains a number of cluster the subsequent clusters numbers within the file chain can be accessed from the FAT. Int 0*0f can be used to perform program interrupt printer I/O. what are the requirements to enable it. - (Page 96) The interrupt should be enabled in the printer control register; secondly it should also be unmasked in the IMR in

29 PIC. The program can then intercept or set the vector of interrupt 0x0f by placing the address of its function newint(); The newint() will now be called whenever the printer can perform output. This newint() function writes the next byte in buffer to the data registers and then send a pulse on the strobe signal to tell the printer that data has been sent to it. When whole of the buffer has been sent the int 0x0f vector is restored, interrupt is masked and the memory for the program is de-allocated. CS609 - Final Term Papers Fall 2012 Q4) What is the difference between the getvect and sectvect function? - setvect() :- Get Interrupt Vector Entry Setvect() stores the address of an interrupt handler (which must be declared to be of type void interrupt) in the specified interrupt vector. For example, the code needed to store the address of kb_ih() (the keyboard interrupt handler) in interrupt vector location KEY_INT (with the value 9) is: setvect(key_int, kb_ih); getvect() :- Set Interrupt Vector Entry The getvect() function returns a copy of the 32-bit interrupt address stored in a specific interrupt vector. For example, the code to obtain a copy of the original clock handler's address stored in interrupt vector 8(defined in i8259.h as CLK_INT) and to store it in the variable old_clock (declared to be of type void interrupt), would be: void interrupt (*old_clock)();... old_clock = getvect(clk_int); Q2) what is MFT? - Each file on an NTFS volume is represented by a record in a special file called the master file table (MFT). NTFS reserves the first 16 records of the table for special information. Q3) Write the names of three different viruses? - (Page 332) Partition Table Virus

30 Boot Sector Virus File Viruses Q4) Name the registers used by program interrupt controller(pci)? - (Page 50) ISR, IMR and IRR 4 question of 5 marks Q1) Write down the TSR program that intercepts the interrupt 17H and gives all the spaces in print document. - (Page 88) #include <dos.h> void interrupt (*old)( ); void interrupt newint ( ); main( ) { old = getvect(0x17); setvect(0x17,newint); keep(0,1000); void interrupt new () { if (_AH==0) { if ((_AL=='A') (_AL=='Z')) //corrected return; (*old)(); Q3) How disk scan identify the bad sectors?

31 - (Page 315) It attempts to write a block. After write it reads back the block contents. Performs the CRC test on data read back. If there is an error then the data on that block is not stable the cluster of that block should be marked bad. The cluster is marked bad by placing the appropriate code for bad cluster so that they may not be allocated to any file. Q4) Write down an algorithm that can be used to extract the entries from a FAT12 data structure? - (Page 267) offset = cluster No * 3/2 temp = cluster No * 3%2 if (temp == 0) { Then the entry is even, consider the word at this offset. Make a 12-bit value, by selecting the low Nibble of the high byte of this. Use this Nibble as the higher 4-bits. And use the low byte as the lower eight bits. else { The entry is odd, consider the word at this offset. Select the high Nibble of the low byte as lower 4-bits. And select high byte as the higher 8-bits. CS609 - Final Term Papers Spring ) Recovery of deleted contents of file write all steps?

32 - (Page 279) The contents can be recovered by placing a valid file name, character in place of E5 and then recovering the chain of file in FAT. If somehow the clusters used by deleted file have been overwritten by some other file, it cannot be recovered. 5) Write down state of viruses only name? - (Page 331) Dormant State Activation State Infection State 8) On interrupt 13H/42H write down the states of DS:SI registers? - (Page 216) DS:SI= far address of Disk address packet 9) What is COM File? - (Page 333) COM File is a mirror image of the program code. Its image on disk is as it is loaded into the memory. COM Files are single segment files in which both Code and Data resides. COM File will typically have a Three Bytes Near Jump Instruction as the first instruction in program which will transfer the execution to the Code Part of the Program. 10) De fragmentation has high computation cost explain why & how? - (Page 316) Defragmentation Software reserves space for each file in contiguous block by moving the data in clusters and readjusting. As a result of defragmentation the FAT entries will change and data will move from one cluster to other localized cluster to reduce seek time Defragmentation has high computation cost and thus cannot be performe d frequently. CS609 - Final Term Papers Spring 2012 DTE want to communicate with DCE sing RC232c protocol,how does this

CS609 Final Term Subjective Paper Solved with references March (2014)

CS609 Final Term Subjective Paper Solved with references March (2014) CS609 Final Term Subjective Paper Solved with references March (2014) Solved by: Saher/Aqualeo www.freeittips.com Q:1 How large file contents can be managed using FAT? 2 marks Larger files would be comprised

More information

CS609 FINAL TERM CURRENT 2014 SUBJECTIVE PAPERS

CS609 FINAL TERM CURRENT 2014 SUBJECTIVE PAPERS CS609 FINAL TERM CURRENT 2014 SUBJECTIVE PAPERS Current papers of CS609 CS609 SUBJECTIVE CURRENT PAPERS SOLVED BY GHAZAL KANGAN Solved Subjective Current Papers Question:1 How large file contents can be

More information

CS609 - Final Term Papers Fall 2012

CS609 - Final Term Papers Fall 2012 CS609 - System Programming Solved Subjective From Final term Papers July 10,2013 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 CS609 - Final Term Papers Fall 2012 Q#1 In how many ways higher

More information

CS609 Final Term Solved MCQs with References Without Repetitions 14/02/2013

CS609 Final Term Solved MCQs with References Without Repetitions 14/02/2013 1 CS609 Final Term Solved MCQs with References Without Repetitions 14/02/2013 In BPB, root directory is saved in. (BIOS parameter block) Cluster#0 Cluster#1 (Ref) Cluster#2 Cluster#3 In NTFS, total sizes

More information

Hard Disk Organization. Vocabulary

Hard Disk Organization. Vocabulary Hard Disk Organization Vocabulary Platter: one ceramic plate, covered with magnetizable film where the bits are actually stored. Both sides of a platter can be used. Increasing the number of platters is

More information

Question: How to generate.com file? Answer: For BorlandC 3.1: 1- copy myfile.c into BIN folder of BORLANDC. 2- From command prompt goto BIN

Question: How to generate.com file? Answer: For BorlandC 3.1: 1- copy myfile.c into BIN folder of BORLANDC. 2- From command prompt goto BIN Question: How to generate.com file? Answer: For BorlandC 3.1: 1- copy myfile.c into BIN folder of BORLANDC. 2- From command prompt goto BIN directory. You will see C:\BORLANDC\BIN> at command prompt. 3-

More information

makes floppy bootable o next comes root directory file information ATTRIB command used to modify name

makes floppy bootable o next comes root directory file information ATTRIB command used to modify name File Systems File system o Designed for storing and managing files on disk media o Build logical system on top of physical disk organization Tasks o Partition and format disks to store and retrieve information

More information

CHAPTER 11: IMPLEMENTING FILE SYSTEMS (COMPACT) By I-Chen Lin Textbook: Operating System Concepts 9th Ed.

CHAPTER 11: IMPLEMENTING FILE SYSTEMS (COMPACT) By I-Chen Lin Textbook: Operating System Concepts 9th Ed. CHAPTER 11: IMPLEMENTING FILE SYSTEMS (COMPACT) By I-Chen Lin Textbook: Operating System Concepts 9th Ed. File-System Structure File structure Logical storage unit Collection of related information File

More information

CS609 - System Programming FAQs By

CS609 - System Programming FAQs By CS609 - System Programming FAQs By How to generate.com file? For BorlandC 3.1: 1- copy myfile.c into BIN folder of BORLANDC. 2- From command prompt goto BIN directory. You will see C:\BORLANDC\BIN> at

More information

Initial Bootloader. On power-up, when a computer is turned on, the following operations are performed:

Initial Bootloader. On power-up, when a computer is turned on, the following operations are performed: Initial Bootloader Introduction On power-up, when a computer is turned on, the following operations are performed: 1. The computer performs a power on self test (POST) to ensure that it meets the necessary

More information

CS609 - System Programing Final-Term Papers Solved MCQS with Reference (1 to 45 lectures) by Arslan Arshad (Zain Nasar)

CS609 - System Programing Final-Term Papers Solved MCQS with Reference (1 to 45 lectures) by Arslan Arshad (Zain Nasar) CS609 - System Programing Final-Term Papers Solved MCQS with Reference (1 to 45 lectures) by Arslan Arshad (Zain Nasar) June 21,2016 PH # 0300-2462284 http://lmshelp.blogspot.com/ Arslan.arshad01@gmail.com

More information

File System: Interface and Implmentation

File System: Interface and Implmentation File System: Interface and Implmentation Two Parts Filesystem Interface Interface the user sees Organization of the files as seen by the user Operations defined on files Properties that can be read/modified

More information

Advanced Operating Systems

Advanced Operating Systems Advanced Operating Systems File Systems: File Allocation Table, Linux File System, NTFS Lecture 10 Case Studies of File Systems File Allocation Table (FAT) Unix File System Berkeley Fast File System Linux

More information

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University File System Case Studies Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics The Original UNIX File System FFS Ext2 FAT 2 UNIX FS (1)

More information

Hard facts. Hard disk drives

Hard facts. Hard disk drives Hard facts Text by PowerQuest, photos and drawings Vlado Damjanovski 2004 What is a hard disk? A hard disk or hard drive is the part of your computer responsible for long-term storage of information. Unlike

More information

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University File System Case Studies Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics The Original UNIX File System FFS Ext2 FAT 2 UNIX FS (1)

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 24 File Systems Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Questions from last time How

More information

File Management By : Kaushik Vaghani

File Management By : Kaushik Vaghani File Management By : Kaushik Vaghani File Concept Access Methods File Types File Operations Directory Structure File-System Structure File Management Directory Implementation (Linear List, Hash Table)

More information

OPERATING SYSTEMS CS136

OPERATING SYSTEMS CS136 OPERATING SYSTEMS CS136 Jialiang LU Jialiang.lu@sjtu.edu.cn Based on Lecture Notes of Tanenbaum, Modern Operating Systems 3 e, 1 Chapter 4 FILE SYSTEMS 2 File Systems Many important applications need to

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 22 File Systems Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Disk Structure Disk can

More information

Chapter 11: File System Implementation. Objectives

Chapter 11: File System Implementation. Objectives Chapter 11: File System Implementation Objectives To describe the details of implementing local file systems and directory structures To describe the implementation of remote file systems To discuss block

More information

FILE SYSTEM IMPLEMENTATION. Sunu Wibirama

FILE SYSTEM IMPLEMENTATION. Sunu Wibirama FILE SYSTEM IMPLEMENTATION Sunu Wibirama File-System Structure Outline File-System Implementation Directory Implementation Allocation Methods Free-Space Management Discussion File-System Structure Outline

More information

Introduction to OS. File Management. MOS Ch. 4. Mahmoud El-Gayyar. Mahmoud El-Gayyar / Introduction to OS 1

Introduction to OS. File Management. MOS Ch. 4. Mahmoud El-Gayyar. Mahmoud El-Gayyar / Introduction to OS 1 Introduction to OS File Management MOS Ch. 4 Mahmoud El-Gayyar elgayyar@ci.suez.edu.eg Mahmoud El-Gayyar / Introduction to OS 1 File Management Objectives Provide I/O support for a variety of storage device

More information

IT ESSENTIALS V. 4.1 Module 5 Fundamental Operating Systems

IT ESSENTIALS V. 4.1 Module 5 Fundamental Operating Systems IT ESSENTIALS V. 4.1 Module 5 Fundamental Operating Systems 5.0 Introduction 1. What controls almost all functions on a computer? The operating system 5.1 Explain the purpose of an operating system 2.

More information

Chapter 12: File System Implementation

Chapter 12: File System Implementation Chapter 12: File System Implementation Silberschatz, Galvin and Gagne 2013 Chapter 12: File System Implementation File-System Structure File-System Implementation Allocation Methods Free-Space Management

More information

COMP091 Operating Systems 1. File Systems

COMP091 Operating Systems 1. File Systems COMP091 Operating Systems 1 File Systems Media File systems organize the storage space on persistent media such as disk, tape, CD/DVD/BD, USB etc. Disk, USB drives, and virtual drives are referred to as

More information

CS3600 SYSTEMS AND NETWORKS

CS3600 SYSTEMS AND NETWORKS CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 11: File System Implementation Prof. Alan Mislove (amislove@ccs.neu.edu) File-System Structure File structure Logical storage unit Collection

More information

There is a general need for long-term and shared data storage: Files meet these requirements The file manager or file system within the OS

There is a general need for long-term and shared data storage: Files meet these requirements The file manager or file system within the OS Why a file system? Why a file system There is a general need for long-term and shared data storage: need to store large amount of information persistent storage (outlives process and system reboots) concurrent

More information

File System Implementation. Sunu Wibirama

File System Implementation. Sunu Wibirama File System Implementation Sunu Wibirama File-System Structure Outline File-System Implementation Directory Implementation Allocation Methods Free-Space Management Discussion File System Structure File

More information

Typical File Extensions File Structure

Typical File Extensions File Structure CS 355 Operating Systems File Systems File Systems A file is a collection of data records grouped together for purpose of access control and modification A file system is software responsible for creating,

More information

Long-term Information Storage Must store large amounts of data Information stored must survive the termination of the process using it Multiple proces

Long-term Information Storage Must store large amounts of data Information stored must survive the termination of the process using it Multiple proces File systems 1 Long-term Information Storage Must store large amounts of data Information stored must survive the termination of the process using it Multiple processes must be able to access the information

More information

Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto

Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Slides based on the book Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter B. Galvin and Greg Gagne,

More information

Operating Systems. Operating Systems Professor Sina Meraji U of T

Operating Systems. Operating Systems Professor Sina Meraji U of T Operating Systems Operating Systems Professor Sina Meraji U of T How are file systems implemented? File system implementation Files and directories live on secondary storage Anything outside of primary

More information

EI 338: Computer Systems Engineering (Operating Systems & Computer Architecture)

EI 338: Computer Systems Engineering (Operating Systems & Computer Architecture) EI 338: Computer Systems Engineering (Operating Systems & Computer Architecture) Dept. of Computer Science & Engineering Chentao Wu wuct@cs.sjtu.edu.cn Download lectures ftp://public.sjtu.edu.cn User:

More information

OPERATING SYSTEM. Chapter 12: File System Implementation

OPERATING SYSTEM. Chapter 12: File System Implementation OPERATING SYSTEM Chapter 12: File System Implementation Chapter 12: File System Implementation File-System Structure File-System Implementation Directory Implementation Allocation Methods Free-Space Management

More information

Chapter 12: File System Implementation

Chapter 12: File System Implementation Chapter 12: File System Implementation Chapter 12: File System Implementation File-System Structure File-System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency

More information

Older geometric based addressing is called CHS for cylinder-head-sector. This triple value uniquely identifies every sector.

Older geometric based addressing is called CHS for cylinder-head-sector. This triple value uniquely identifies every sector. Review: On Disk Structures At the most basic level, a HDD is a collection of individually addressable sectors or blocks that are physically distributed across the surface of the platters. Older geometric

More information

Segmentation with Paging. Review. Segmentation with Page (MULTICS) Segmentation with Page (MULTICS) Segmentation with Page (MULTICS)

Segmentation with Paging. Review. Segmentation with Page (MULTICS) Segmentation with Page (MULTICS) Segmentation with Page (MULTICS) Review Segmentation Segmentation Implementation Advantage of Segmentation Protection Sharing Segmentation with Paging Segmentation with Paging Segmentation with Paging Reason for the segmentation with

More information

Chapter 11: Implementing File Systems

Chapter 11: Implementing File Systems Chapter 11: Implementing File Systems Operating System Concepts 99h Edition DM510-14 Chapter 11: Implementing File Systems File-System Structure File-System Implementation Directory Implementation Allocation

More information

Chapter 11: Implementing File

Chapter 11: Implementing File Chapter 11: Implementing File Systems Chapter 11: Implementing File Systems File-System Structure File-System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency

More information

OPERATING SYSTEMS II DPL. ING. CIPRIAN PUNGILĂ, PHD.

OPERATING SYSTEMS II DPL. ING. CIPRIAN PUNGILĂ, PHD. OPERATING SYSTEMS II DPL. ING. CIPRIAN PUNGILĂ, PHD. File System Implementation FILES. DIRECTORIES (FOLDERS). FILE SYSTEM PROTECTION. B I B L I O G R A P H Y 1. S I L B E R S C H AT Z, G A L V I N, A N

More information

File Systems Management and Examples

File Systems Management and Examples File Systems Management and Examples Today! Efficiency, performance, recovery! Examples Next! Distributed systems Disk space management! Once decided to store a file as sequence of blocks What s the size

More information

Chapter 11: Implementing File Systems. Operating System Concepts 9 9h Edition

Chapter 11: Implementing File Systems. Operating System Concepts 9 9h Edition Chapter 11: Implementing File Systems Operating System Concepts 9 9h Edition Silberschatz, Galvin and Gagne 2013 Chapter 11: Implementing File Systems File-System Structure File-System Implementation Directory

More information

Windows File System. File allocation table (FAT) NTFS - New Technology File System. used in Windows 95, and MS-DOS

Windows File System. File allocation table (FAT) NTFS - New Technology File System. used in Windows 95, and MS-DOS Windows File System Windows File System File allocation table (FAT) used in Windows 95, and MS-DOS NTFS - New Technology File System 2 Key features of NTFS NTFS uses clusters(rather than sectors) as units

More information

Da-Wei Chang CSIE.NCKU. Professor Hao-Ren Ke, National Chiao Tung University Professor Hsung-Pin Chang, National Chung Hsing University

Da-Wei Chang CSIE.NCKU. Professor Hao-Ren Ke, National Chiao Tung University Professor Hsung-Pin Chang, National Chung Hsing University Chapter 11 Implementing File System Da-Wei Chang CSIE.NCKU Source: Professor Hao-Ren Ke, National Chiao Tung University Professor Hsung-Pin Chang, National Chung Hsing University Outline File-System Structure

More information

Introduction. Secondary Storage. File concept. File attributes

Introduction. Secondary Storage. File concept. File attributes Introduction Secondary storage is the non-volatile repository for (both user and system) data and programs As (integral or separate) part of an operating system, the file system manages this information

More information

Chapter 10: File System Implementation

Chapter 10: File System Implementation Chapter 10: File System Implementation Chapter 10: File System Implementation File-System Structure" File-System Implementation " Directory Implementation" Allocation Methods" Free-Space Management " Efficiency

More information

Chapter 11: Implementing File Systems. Operating System Concepts 8 th Edition,

Chapter 11: Implementing File Systems. Operating System Concepts 8 th Edition, Chapter 11: Implementing File Systems, Silberschatz, Galvin and Gagne 2009 Chapter 11: Implementing File Systems File-System Structure File-System Implementation Directory Implementation Allocation Methods

More information

Process size is independent of the main memory present in the system.

Process size is independent of the main memory present in the system. Hardware control structure Two characteristics are key to paging and segmentation: 1. All memory references are logical addresses within a process which are dynamically converted into physical at run time.

More information

FILE SYSTEMS. CS124 Operating Systems Winter , Lecture 23

FILE SYSTEMS. CS124 Operating Systems Winter , Lecture 23 FILE SYSTEMS CS124 Operating Systems Winter 2015-2016, Lecture 23 2 Persistent Storage All programs require some form of persistent storage that lasts beyond the lifetime of an individual process Most

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 25 File Systems Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ Q 2 Data and Metadata

More information

ECE 598 Advanced Operating Systems Lecture 14

ECE 598 Advanced Operating Systems Lecture 14 ECE 598 Advanced Operating Systems Lecture 14 Vince Weaver http://www.eece.maine.edu/~vweaver vincent.weaver@maine.edu 19 March 2015 Announcements Homework #4 posted soon? 1 Filesystems Often a MBR (master

More information

Microsoft File Allocation Table

Microsoft File Allocation Table Microsoft File Allocation Table CSC362, Information Security originally appeared in late 1970s for small disks with simple folder structures uses a FAT to index files (naturally) the original FAT- 12 gave

More information

Computer Systems. Assembly Language for x86 Processors 6th Edition, Kip Irvine

Computer Systems. Assembly Language for x86 Processors 6th Edition, Kip Irvine Computer Systems Assembly Language for x86 Processors 6th Edition, Kip Irvine Chapter 15: Disk Fundamentals Yonsei University Department of Computer Science Jaekyung Kim(kimjk@cs.yonsei.ac.kr) (c) Pearson

More information

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University File System Case Studies Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics The Original UNIX File System FFS Ext2 FAT 2 UNIX FS (1)

More information

Week 12: File System Implementation

Week 12: File System Implementation Week 12: File System Implementation Sherif Khattab http://www.cs.pitt.edu/~skhattab/cs1550 (slides are from Silberschatz, Galvin and Gagne 2013) Outline File-System Structure File-System Implementation

More information

BASIC OPERATIONS. Managing System Resources

BASIC OPERATIONS. Managing System Resources 48 PART 2 BASIC OPERATIONS C H A P T E R 5 Managing System Resources CHAPTER 5 MANAGING SYSTEM RESOURCES 49 THE part of Windows Vista that you see the Vista desktop is just part of the operating system.

More information

bytes per disk block (a block is usually called sector in the disk drive literature), sectors in each track, read/write heads, and cylinders (tracks).

bytes per disk block (a block is usually called sector in the disk drive literature), sectors in each track, read/write heads, and cylinders (tracks). Understanding FAT 12 You need to address many details to solve this problem. The exercise is broken down into parts to reduce the overall complexity of the problem: Part A: Construct the command to list

More information

File Management. Ezio Bartocci.

File Management. Ezio Bartocci. File Management Ezio Bartocci ezio.bartocci@tuwien.ac.at Cyber-Physical Systems Group Institute for Computer Engineering Faculty of Informatics, TU Wien Motivation A process can only contain a limited

More information

File Systems. ECE 650 Systems Programming & Engineering Duke University, Spring 2018

File Systems. ECE 650 Systems Programming & Engineering Duke University, Spring 2018 File Systems ECE 650 Systems Programming & Engineering Duke University, Spring 2018 File Systems Abstract the interaction with important I/O devices Secondary storage (e.g. hard disks, flash drives) i.e.

More information

Chapter 12: File System Implementation. Operating System Concepts 9 th Edition

Chapter 12: File System Implementation. Operating System Concepts 9 th Edition Chapter 12: File System Implementation Silberschatz, Galvin and Gagne 2013 Chapter 12: File System Implementation File-System Structure File-System Implementation Directory Implementation Allocation Methods

More information

Chapter 12: File System Implementation

Chapter 12: File System Implementation Chapter 12: File System Implementation Silberschatz, Galvin and Gagne 2013 Chapter 12: File System Implementation File-System Structure File-System Implementation Directory Implementation Allocation Methods

More information

Introduction Disks RAID Tertiary storage. Mass Storage. CMSC 420, York College. November 21, 2006

Introduction Disks RAID Tertiary storage. Mass Storage. CMSC 420, York College. November 21, 2006 November 21, 2006 The memory hierarchy Red = Level Access time Capacity Features Registers nanoseconds 100s of bytes fixed Cache nanoseconds 1-2 MB fixed RAM nanoseconds MBs to GBs expandable Disk milliseconds

More information

Chapter. Chapter. Magnetic and Solid-State Storage Devices

Chapter. Chapter. Magnetic and Solid-State Storage Devices Chapter Chapter 9 Magnetic and Solid-State Storage Devices Objectives Explain how magnetic principles are applied to data storage. Explain disk geometry. Identify disk partition systems. Recall common

More information

WINDISK: A File and disk Editor

WINDISK: A File and disk Editor s WINDISK: A File and disk Editor Table of content Introduction Loading a file Saving the edited file DBCS files DBCS language selection SBCS files Disk geometry Print view Printer Setup Save view to file

More information

UC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara

UC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara Operating Systems Christopher Kruegel Department of Computer Science http://www.cs.ucsb.edu/~chris/ Input and Output Input/Output Devices The OS is responsible for managing I/O devices Issue requests Manage

More information

ECE 650 Systems Programming & Engineering. Spring 2018

ECE 650 Systems Programming & Engineering. Spring 2018 ECE 650 Systems Programming & Engineering Spring 2018 File Systems Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) File Systems Disks can do two things: read_block and write_block

More information

Chapter 12: File System Implementation

Chapter 12: File System Implementation Chapter 12: File System Implementation Virtual File Systems. Allocation Methods. Folder Implementation. Free-Space Management. Directory Block Placement. Recovery. Virtual File Systems An object-oriented

More information

A+ Guide to Managing and Maintaining your PC, 6e. Chapter 8 Hard Drives

A+ Guide to Managing and Maintaining your PC, 6e. Chapter 8 Hard Drives A+ Guide to Managing and Maintaining your PC, 6e Chapter 8 Hard Drives Introduction Hard drive: most important secondary storage device Hard drive technologies have evolved rapidly Hard drive capacities

More information

V. File System. SGG9: chapter 11. Files, directories, sharing FS layers, partitions, allocations, free space. TDIU11: Operating Systems

V. File System. SGG9: chapter 11. Files, directories, sharing FS layers, partitions, allocations, free space. TDIU11: Operating Systems V. File System SGG9: chapter 11 Files, directories, sharing FS layers, partitions, allocations, free space TDIU11: Operating Systems Ahmed Rezine, Linköping University Copyright Notice: The lecture notes

More information

A+ Guide to Hardware, 4e. Chapter 7 Hard Drives

A+ Guide to Hardware, 4e. Chapter 7 Hard Drives A+ Guide to Hardware, 4e Chapter 7 Hard Drives Objectives Learn how the organization of data on floppy drives and hard drives is similar Learn about hard drive technologies Learn how a computer communicates

More information

THOMAS RUSSELL, Information Technology Teacher

THOMAS RUSSELL, Information Technology Teacher THOMAS RUSSELL, Information Technology Teacher Historical/Conceptual After installing the hard drive it needs to be partitioned. Partitioning is the process of electronically subdividing the physical hard

More information

Secondary Storage (Chp. 5.4 disk hardware, Chp. 6 File Systems, Tanenbaum)

Secondary Storage (Chp. 5.4 disk hardware, Chp. 6 File Systems, Tanenbaum) Secondary Storage (Chp. 5.4 disk hardware, Chp. 6 File Systems, Tanenbaum) Secondary Stora Introduction Secondary storage is the non volatile repository for (both user and system) data and programs. As

More information

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. One OS function is to control devices

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. One OS function is to control devices Introduction Operating Systems Input/Output Devices (Ch12.1-12.3, 12.7; 13.1-13.3, 13.7) One OS function is to control devices significant fraction of code (80-90% of Linux) Want all devices to be simple

More information

Preview. COSC350 System Software, Fall

Preview. COSC350 System Software, Fall Preview File System File Name, File Structure, File Types, File Access, File Attributes, File Operation Directories Directory Operations File System Layout Implementing File Contiguous Allocation Linked

More information

Disk Scheduling COMPSCI 386

Disk Scheduling COMPSCI 386 Disk Scheduling COMPSCI 386 Topics Disk Structure (9.1 9.2) Disk Scheduling (9.4) Allocation Methods (11.4) Free Space Management (11.5) Hard Disk Platter diameter ranges from 1.8 to 3.5 inches. Both sides

More information

Boot Process in details for (X86) Computers

Boot Process in details for (X86) Computers Boot Process in details for (X86) Computers Hello,,, Let's discuss what happens between the time that you power up your PC and when the desktop appears. In fact we should know that the boot process differs

More information

Introduction to Network Operating Systems

Introduction to Network Operating Systems File Systems In a general purpose operating system the local file system provides A naming convention A mechanism for allocating hard disk space to files An method for identifying and retrieving files,

More information

File System Concepts File Allocation Table (FAT) New Technology File System (NTFS) Extended File System (EXT) Master File Table (MFT)

File System Concepts File Allocation Table (FAT) New Technology File System (NTFS) Extended File System (EXT) Master File Table (MFT) File System Concepts File Allocation Table (FAT) New Technology File System (NTFS) Extended File System (EXT) Master File Table (MFT) 1 FILE SYSTEM CONCEPTS: FILE ALLOCATION TABLE (FAT) Alex Applegate

More information

Chapter 11: Implementing File-Systems

Chapter 11: Implementing File-Systems Chapter 11: Implementing File-Systems Chapter 11 File-System Implementation 11.1 File-System Structure 11.2 File-System Implementation 11.3 Directory Implementation 11.4 Allocation Methods 11.5 Free-Space

More information

,879 B FAT #1 FAT #2 root directory data. Figure 1: Disk layout for a 1.44 Mb DOS diskette. B is the boot sector.

,879 B FAT #1 FAT #2 root directory data. Figure 1: Disk layout for a 1.44 Mb DOS diskette. B is the boot sector. Homework 11 Spring 2012 File Systems: Part 2 MAT 4970 April 18, 2012 Background To complete this assignment, you need to know how directories and files are stored on a 1.44 Mb diskette, formatted for DOS/Windows.

More information

Project 3 Help Document

Project 3 Help Document Project 3 Help Document Hard disk drive structure Since the FAT32 file system is originally designed for hard disk drives, it is necessary to understand the structure of a hard drive because FAT32 organize

More information

File System. Preview. File Name. File Structure. File Types. File Structure. Three essential requirements for long term information storage

File System. Preview. File Name. File Structure. File Types. File Structure. Three essential requirements for long term information storage Preview File System File System File Name, File Structure, File Types, File Access, File Attributes, File Operation Directories Directory Operations Contiguous Allocation Linked List Allocation Linked

More information

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. One OS function is to control devices

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. One OS function is to control devices Introduction Operating Systems Input/Output Devices (Ch12.1-12.3, 12.7; 13.1-13.3, 13.7) One OS function is to control devices significant fraction of code (80-90% of Linux) Want all devices to be simple

More information

ECE 598 Advanced Operating Systems Lecture 17

ECE 598 Advanced Operating Systems Lecture 17 ECE 598 Advanced Operating Systems Lecture 17 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 3 April 2018 Announcements Project Topics Should have gotten response on project topic

More information

Chapter 11: File System Implementation

Chapter 11: File System Implementation Chapter 11: File System Implementation File System Structure File System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency and Performance Recovery Log-Structured

More information

Paragon Exact Image. User Manual CONTENTS. Introduction. Key Features. Installation. Package Contents. Minimum System Requirements.

Paragon Exact Image. User Manual CONTENTS. Introduction. Key Features. Installation. Package Contents. Minimum System Requirements. Paragon Exact Image User Manual CONTENTS Introduction Key Features Installation Package Contents Minimum System Requirements Basic Concepts Backup Operations Scheduling Interface Overview General Layout

More information

The Operating System. Chapter 6

The Operating System. Chapter 6 The Operating System Machine Level Chapter 6 1 Contemporary Multilevel Machines A six-level l computer. The support method for each level is indicated below it.2 Operating System Machine a) Operating System

More information

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. (done)

Introduction. Operating Systems. Outline. Hardware. I/O Device Types. Device Controllers. (done) Introduction Operating Systems Input/Output Devices (Ch 13.3, 13.5; 14.1-14.3) One OS function is to control devices significant fraction of code (80-90% of Linux) Want all devices to be simple to use

More information

IA32 Intel 32-bit Architecture

IA32 Intel 32-bit Architecture 1 2 IA32 Intel 32-bit Architecture Intel 32-bit Architecture (IA32) 32-bit machine CISC: 32-bit internal and external data bus 32-bit external address bus 8086 general registers extended to 32 bit width

More information

Chapter 12 File-System Implementation

Chapter 12 File-System Implementation Chapter 12 File-System Implementation 1 Outline File-System Structure File-System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency and Performance Recovery Log-Structured

More information

How To Reinstall Grub In Windows 7 Without Losing Data And Programs

How To Reinstall Grub In Windows 7 Without Losing Data And Programs How To Reinstall Grub In Windows 7 Without Losing Data And Programs So if I install Windows 7 using CD again, will I lose Ubuntu? then yes you will lose Ubuntu, however if you reinstall Windows without

More information

CS 167 Final Exam Solutions

CS 167 Final Exam Solutions CS 167 Final Exam Solutions Spring 2016 Do all questions. 1. The implementation given of thread_switch in class is as follows: void thread_switch() { thread_t NextThread, OldCurrent; } NextThread = dequeue(runqueue);

More information

Physical Representation of Files

Physical Representation of Files Physical Representation of Files A disk drive consists of a disk pack containing one or more platters stacked like phonograph records. Information is stored on both sides of the platter. Each platter is

More information

CS333 Intro to Operating Systems. Jonathan Walpole

CS333 Intro to Operating Systems. Jonathan Walpole CS333 Intro to Operating Systems Jonathan Walpole File Systems Why Do We Need a File System? Must store large amounts of data Data must survive the termination of the process that created it Called persistence

More information

File Systems. CS 4410 Operating Systems. [R. Agarwal, L. Alvisi, A. Bracy, M. George, E. Sirer, R. Van Renesse]

File Systems. CS 4410 Operating Systems. [R. Agarwal, L. Alvisi, A. Bracy, M. George, E. Sirer, R. Van Renesse] File Systems CS 4410 Operating Systems [R. Agarwal, L. Alvisi, A. Bracy, M. George, E. Sirer, R. Van Renesse] The abstraction stack I/O systems are accessed through a series of layered abstractions Application

More information

Memory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts

Memory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts Memory management Last modified: 26.04.2016 1 Contents Background Logical and physical address spaces; address binding Overlaying, swapping Contiguous Memory Allocation Segmentation Paging Structure of

More information

Memory management. Requirements. Relocation: program loading. Terms. Relocation. Protection. Sharing. Logical organization. Physical organization

Memory management. Requirements. Relocation: program loading. Terms. Relocation. Protection. Sharing. Logical organization. Physical organization Requirements Relocation Memory management ability to change process image position Protection ability to avoid unwanted memory accesses Sharing ability to share memory portions among processes Logical

More information

UNIT 4 Device Management

UNIT 4 Device Management UNIT 4 Device Management (A) Device Function. (B) Device Characteristic. (C) Disk space Management. (D) Allocation and Disk scheduling Methods. [4.1] Device Management Functions The management of I/O devices

More information

FreeBSD and the IBM PC BIOS

FreeBSD and the IBM PC BIOS FreeBSD and the IBM PC BIOS Bruce M. Simpson bms@freebsd.org 27th December 2002 1 Introduction This document is intended as a source of technical information for individuals wishing to support FreeBSD

More information