File Allocation Table
ฝัง
- เผยแพร่เมื่อ 22 ก.พ. 2015
- In this video, you'll get a comprehensive introduction to the File Allocation Table format.
If you enjoyed this video and want to dive deeper into the world of programming, then be sure to check out our full catalog: bit.ly/3Vr0uRo. Forge your future in tech with Udacity!
---
Connect with us on social! 🌐
Instagram: / udacity
LinkedIn: / udacity
Facebook: / udacity
X/Twitter: / udacity
![โกหกเธอทั้งนั้น (Pinocchio) - SERIOUS BACON [Official MV]](http://i.ytimg.com/vi/P1HhTYwrR5A/mqdefault.jpg)
Dude, thank you so much. I've spent upwards of 3 hours researching this, I just couldn't seem to get my head around it for some reason, you just did it in under 3 minutes. THANK YOU.
Y, for some knowledge, video demonstration is way better than txt
y4 taHnak sbr0
3 minutes understanding is a compound knowledge of 3 hours researching for this, I think ;)
You fit a good amount of information in such a short video, great job!
Thank youuu i have been looking for a concise description of FAT file system and this is the best one...Have an internet cookie!
I thought this would take hours to learn. Learnt it in 5 mins thanks to this video, thanks!
Ikr Br065
Clear and concise lecture, thanks.
Great video in a short time! Thanks a lot!
Thankyou sooooo much! you explained this concept really well in no time at all!
Wow, my mind BLOWNNN!!! Thanks for making this video! now I have a better understanding of this. Thank you!
Thank you so much. More power to you
Brilliant, Thank you!!!
Thank you! so much to summarise ...... it helps a lot.
is that the same as Cursor Implementation of Linked Lists
Crisp and clear.
Wow thank, super informative
So in this example i would say that block with id 1 is a Folder/directory also for the id 4.
If i am wrong please correct me.
Excelente, gracias
Thank you
Isn't FAT typically a Windows thing? For Unix, seems we should talk about inode.
Yeah, Inodes are used for Unix. But I doubt Windows uses FAT still.
@@DeadJuicebox linux uses ext4 (fourth version of extended fs) witch is the similiar concept as FAT, the differenceis that you have an index table with all the metadata (where all inodes are) about the file stored there and if you need to extend files size you just link two inodes together.
theres more to this way of organizing the file system but thats the gist of it...
so what happens if a file is deleted?
Basically, all the blocks that are marked as "busy" will be reset. This basically tells the OS that those blocks are now free and they can be overwritten at any time. So the blocks are marked as "free" which is the same as "not busy."
Now this is fine for a standard file. But what happens if we are deleting a directory? And what if that directory contains other directories? This is where the simple approach becomes a bit more complicated. The solution is to use recursion. What does this mean? You need to do this delete action on the contents of the directory so that all the blocks for its content are marked as "free". The same thing needs to be done for directories inside the directory, and so on and so on. When this is done, we can delete the blocks for the directory itself. This last part where we get back to the initial directory is known as the "base case" for the recursion.
thank you
if partitions 20 gb and used fat32 how instructions to calculation size of cluster plz i need it
Thanks!!!
y3 br0 1 MILION VVeWZ
The same " file systems table" ?
Where is the data stored for the block?
At the end?
In the sector on the track.
basically the file system declares a constant value at compile time, than block id is just how many times we move the lenght of any offset. so an example:
block size = const offset
block id * block size = move this many bytes from begining of the disk and than load the next X bytes into memeory, where X is block size.
I love you
So easy... why do we even need teachers.
He i s a teacher ;)
Fi
foo