Writing and Deleting files on hard drives with NTFS
Journal Title: Computer Science and Mathematical Modelling - Year 2018, Vol 0, Issue 8
Abstract
The goal of this article was to present detailed information about writing and deleting process on the NTFS (New Technology File System) formatted drives. The most important are the algorithms used by computer to write data BFA (Best Fit Algorithm) and FFA (First-Free Algorithm) to update $MFT (Master File Table). The naming convention of the areas of the drive is presented. The proposed rules of writing and deleting algorithm were successfully validated with real NTFS volume.<br/><br/>
Authors and Affiliations
Fryderyk Darnowski, Andrzej Chojnacki
Keywords
Related Articles
- EP ID EP519279
- DOI 10.5604/01.3001.0013.1457
- Views 120
- Downloads 0
Software environment for rapid prototyping of graph and network algorithms
The article presents an innovative software environment for rapid prototyping of graph and network algorithms. The environment consists of two main components: an editor of graphs & networks and an editor of algorithms’...
Economical assigning weapons to targets
Some upper and lower bound are proposed to use in branch and bound method for solving Weapon-Target Assignment (WTA) problems. Analyze of WTA inspires to formulate another problem to economize the number of weapons unde...
Transformation of the Network Model with Complete Information of the Network Structure into a Network Model with Incomplete Information of the Network Structure - A Game Theory Approach
In this paper we consider the formation of directed networks, i.e. networks represented by directed graphs. By information (a rather common use of this term) we mean good information that flows in the network. Each membe...
Simulation efficiency analysis method of Java Enterprise Edition application
In this article efficiency analysis method of Java EE applications was presented. Efficiency’s measures of such kind of applications were described. Furthermore, discrete-event simulation modelling method Event Graph and...
Modelling quantum register disentanglement
Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible ent...