levo

Data Structures: Arrays, Records and Hash Tables

Records and fields

  • 3 things to know
  • Component 1

Overview

Term field, what happens when one field of a record is updated and record used in a school system.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

How can one record sit inside another, and how is a record's size found?

Key term

What is a record?

Key term

How does a record differ from an array?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    What is a record?

    Model answer

    A record is a data structure holding related items of different data types under one identifier. Each item within it is called a field.

  2. 2

    How does a record differ from an array?

    Model answer

    An array holds items of one data type reached by an index. A record holds fields of different data types reached by name.

  3. 3

    Define the term field.

    Model answer

    A field is one named item of data inside a record. Each field has its own data type.

  4. 4

    Name four fields you would expect in a record describing a library book.

    Model answer

    A book record would hold an ISBN, a title, an author and a loan status. Each field is given the data type suited to its contents.

  5. 5

    Which field of a record singles it out from every other record?

    Model answer

    A key field holds a value that identifies one record uniquely. Two records in the same file never share a key value.

  6. 6

    How is a single field of a record referred to in pseudo-code?

    Model answer

    A field is written as book.title, using the record identifier, a dot and the field name. Dot notation reaches one field at a time.

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book
2Open book
3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Data Structures: Arrays, Records and Hash Tables
Stacks, Queues, Linked Lists and Trees
Boolean Logic and Simplification
Algorithms, Pseudo-Code and Programming Constructs

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

KDW to HAT.
decryptsencryptscompresses

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

AThe two are not the same.
BOpen source refers to the availability of the code.
CMuch open source software is free of charge.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

Backup means the copy of the data.
TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Data Structures: Arrays, Records and Hash Tables, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Or £46 a year, about £3.83 a month. Cancel anytime.