In this assignment, you will implement some operations for a toy in-memory File System, MemFS. It has to keep all blocks in memory, not in a storage device.
All the File System definitions are in a header file, memfs.h. It works as following: MemFS is made of a collection of contiguous blocks, each one of 512 bytes in size.
These blocks are not in a storage device, but in user memory. The number of blocks is configurable when instantiating the File System. In MemFS there are two types of files, either regular ones (text files, images, etc), or directories (which can contain other files).
Both types of files are represented by a struct called a mem_inode. This struct contains information about the type of file, its last modification time, and its contents. Contents of a file are stored in other blocks.
For regular files, the content blocks will contain text, data, etc depending on the type of file, and for directories, the blocks contain directory entries. There are a set of pre-allocated blocks that contain all the inodes in the system, and we can identify those inodes by a number.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of