Give an overview of WINDOWS 2000 file management.

Windows makes use of the NTFS and File Allocation Table file systems. The Older versions of the FAT file system had file name length limits plus had restrictions on the maximum size of FAT-formatted partitions or disks.

NTFS initiated with the Windows NT operating system that allowed ACL-based permission control. Multiple file streams, Hard links, attribute indexing, quota tracking, compression and mount-points for other file systems (called "junctions") are as well supported, though not all well-documented.

Unlike several other operating systems, Windows utilizes a drive letter abstraction at the user level to distinguish one disk or partition from another. For instance the path C:\WINDOWS\ stand for a directory WINDOWS on the partition represented by the letter C. The C drive is the major commonly used for the primary hard disk partition on which Windows is installed as well as from which it boots. This "tradition" has turn into so firmly ingrained that bugs came about in older versions of Windows which made assumptions that the drive that the operating system was installed on was C. The tradition of using "C" for the drive letter is able to be traced to MS-DOS where the letters A and B were reserved for up to two floppy disk drives in a common configuration A would be the 3½-inch floppy drive, and B the 5¼-inch one. Network drives may as well be mapped to drive letters.

Ever since Windows interacts with the user via a graphical user interface its documentation refers to directories as a folder which contains files and is represented graphically with a folder icon.

 

 

Posted Date: 6/21/2013 6:41:44 AM | Location : United States

Ask an Expert

Related Discussions:- Give an overview of windows 2000 file management, Assignment Help, Ask Question on Give an overview of windows 2000 file management, Get Answer, Expert's Help, Give an overview of windows 2000 file management Discussions

Write discussion on Give an overview of windows 2000 file management
Your posts are moderated

Write your message here..

Related Questions

Different levels of a multilevel queuing system, Q. What merit is there in ... Q. What merit is there in having different time-quantum sizes on different levels of a multilevel queuing system? Answer: Processes that require more frequent servicing for ins

Explain and differentiate programmed and interrupt i/o, Question 1 Explain... Question 1 Explain the structure of operating system in detail Question 2 Explain the following scheduling algorithm                                     1) First come Firs

Name the hardware to support demand paging, The hardware to support demand ... The hardware to support demand paging is as follows Page table: This table has the skill to mark an entry invalid though a valid-invalid bit or particular value of protectio

Multiprogramming, explain how response time are reduced by allowing time sh... explain how response time are reduced by allowing time sharing on top of multiprogramming

Implementing group policies in a windows environment, Question: (a) As... Question: (a) As a System administrator, elaborate on how you can manage computer accounts in Active Directory of Windows Server 2008? (b) Explain the following user p

Explain the sequence of messages in rpc mechanism, Q. Once more considering... Q. Once more considering the RPC mechanism consider the exactly once semantic. Does the algorithm for implementing this semantic implement correctly even if the ACK message back to

Explain worst fit algorithm, Worst Fit Algorithm Here we obtain the la... Worst Fit Algorithm Here we obtain the largest space available for the smallest. Therefore after that process entered there will be much more space remaining. In this space we

Aggregate planning, Prepare a report that motivates alternatives reactive s... Prepare a report that motivates alternatives reactive strategies that can be used by wind Mud clothing factory

Explain fifo page replacement, FIFO page replacement This is the easie... FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute

Long term scheduler, Long term scheduler calculates which processes are a... Long term scheduler calculates which processes are admitted to the machine for processing. It accepts the degree of multiprogramming. Once accepted, a job converts a process.