repition of data

-
when data is duplicated in a system' it is much more difficult to maintain the integrity of that data. When the data is changed in one location' it must also be changed everywhere that the data exists. In a decentralized environment, this can be difficult at best. If ultimately unusable. also, because the data exists in several locations, the data must be entered more than once. this is time-consuming and wasteful. And because the data is duplicated, it requires more storage space to maintain it.

Popular posts from this blog

-
selection, iteration, sequence ubuntu-12043-desktop-amd64 VirtualBox-438-92456-Win http://medical-dictionary.thefreedictionary.com/Atomic+value http://en.wikipedia.org/wiki/Atomic_value http://www.docstoc.com/docs/26533470/EXAMPLE-FLIGHT-ITINERARY http://www.mulesoft.org/documentation/display/33X/Flight+Reservation+Example
Read more

ch11 review silberschatz operating systems concepts essentials 2nd ed

-
Review Questions Section 11.1 11.1 True or False? Disk blocks are made up of one or more sectors. True 11.2 What is the name of the standard Linux file system? Extended file system (ext3/ext4) 11.3 What is the UNIX term for a file control block? inode Section 11.2 11.4 True or False? UNIX treats a directory exactly the same as a file. True 11.5 What does the acronym VFS refer to? Virtual File system Section 11.3 11.6 What are the two general approaches for implementing a directory? Linear list list of file names with pointers to the data blocks, hash table linear list stores directory entries but a hash data structure is used greatly reducing directory search time Section 11.4 11.7 Provide at least two different approaches for allocating disk blocks to files. contiguous allocation, linked allocation, indexed allocation 11.8 True or False? The UNIX inode is an example of linked allocation. False the unix inode is an example of indexed allocation Section 11.5 11.9 What would the...
Read more