Exam (elaborations)
AQA A-level Computer Science- 4.2 Fundamentals of data structures Exam Prep
- Course
- Institution
AQA A-level Computer Science- 4.2 Fundamentals of data structures Exam Prep
[Show more]
Seller
Follow
RevisionKing
Reviews received
Content preview
AQA A-level Computer Science- 4.2Fundamentals of data structures
Exam Prep
Text file - Answer>>"A computer file that is structured as
a sequence of lines of electronic text (usually using the
ASCII or UNICODE character set). Quite often the end of
a text file is denoted by a special End of File (EoF)
marker."
Binary (non-text file) - Answer>>"A computer file stored
in a binary format. It is computer-readable but not human-
readable. All executable programs are stored as binary
files."
Queue - Answer>>"A queue is a dynamic data structure
of the form First In First Out (FIFO)."
Graph - Answer>>"A dynamic data structure used to
often represent more complex relationships. Typically
used to store routing, mapping or network style
relationships and their data."
Tree - Answer>>"A tree is a non-linear dynamic data
structure where data items can be thought of as occurring
at different levels. There are links between items at one
level and their descendants at the next. Each data item
has data that relates in some way to its unique parent
node. The data items are usually called nodes with the
, links known as branches. The top level nodes is called the
root node."
Hash table - Answer>>"A data structure where the
calculated value is used to mark the position in the table
where the data item should be stored, enabling it to be
accessed directly, rather than forcing a sequential search."
Dictionary - Answer>>"A collection of key-value pairs in
which the value is accessible via the associated key."
Vector - Answer>>"A vector can be represented as a list
of numbers, a function, or a way of representing a
geometric point in space."
Static data structure - Answer>>"A data structure which
is a fixed size when in memory. This means the maximum
size needs to be known in advance, as memory cannot be
allocated at a later point."
Dynamic data structure - Answer>>"A data structure
which when in memory has the flexibility to grown and
shrink, this allows a programmer to control exactly how
much memory is utilised at run time."
Linear queue - Answer>>"A straight forward
implementation of a queue data structure. It holds a
sequence of items."
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller RevisionKing. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $7.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
73314 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now