Unicode 2 bytes per char.
Ascii 7 bits per char.
Extended Ascii 1 byte per char.
(Char meaning character)
Short int: 2.
Long int: 4.
Serial files: *inside joke: like Max Timbs, the serial killer
{Sequential order: data stored in the order that they are created.
Only searchable by going from the beginning to the end.}
{Simple/ bang tidy.}
{Ordered}
{Hard to read from/ inefficient.}
Sequential files:
{Records are stored sequentially according to some key field, for example alphabetically.}
{You can search efficiently through the file using a binary split technique}
{Updating would be slow; have to figure out where to put stuff}
{Creating a unique key is tricky}
Index Sequential file:
{File records are stored using a key field and one or more indexes.}
{Efficient searching.}
{Extra memory needed}
{Index needs updating.}
Random Access File:
{Records are stored in a file according to a mathematical hash algorithm}
{Hash algorithm: set of data values (shoe size and age)}
{Easy to search as you can simply repeat the algorithm}
{Most complicated to implement.}
{Need to know the exact value.}
No comments:
Post a Comment