If you are even slightly familiar with the field of computer
science, then you should be familiar with data structures. Data structure is a
catch-all term for any sort of system that is designed to store multiple
versions of the same data type in a specific way. These structures are extremely
important to how our mode
rn world. Without them, we would have a much harder
time sorting and accessing any information on the Internet in any meaningful
manner. These structures can range from the simplistic, like an array or a
linked list, to more complicated fare, like stacks, queue, maps, and trees.
Each one of those structures has a different purpose, and some are better
suited to one task than others. For example, I wouldn’t use a binary tree to
act as the back end of a system that sends print jobs from multiple computers
to a single printer. While it could theoretically be done, it would be a waste
of time to code and be very inefficient; instead I would use a priority queue,
which gives each print job a value that determines the order of printing.
This semester, I am working with a group that is working on
a real world application of a data structure. Our client already has a database running that
stores over 3000 items, and she wants us to put a version of it online that has
some sensitive information redacted. That online version is supposed to be
updated whenever there is a change made in the primary database. Like all
things online security is a very important concern. We have to make sure that
only information about the items is available for viewing online, and that we
try our hardest to ensure that there is no way for any unscrupulous fellows to
access the primary database. It will be
very interesting to hear my fellow team members discuss how to implement this
database.