levo

Data Structures: Arrays, Records and Hash Tables

One-dimensional arrays and indexing

  • 3 things to know
  • Component 1

Overview

Index in an array, why an array is described as a random access structure and traversing an array.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

What is an array?

Key term

Why must every element of an array share the same data type?

Key term

What is an index in an array?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    What is an array?

    Model answer

    An array is an ordered set of data items of the same data type stored under one identifier. Each item is reached by its index.

  2. 2

    Why must every element of an array share the same data type?

    Model answer

    A shared data type gives every element the same size in memory. The address of an element can then be calculated from its index.

  3. 3

    What is an index in an array?

    Model answer

    An index is the position number that identifies one element of an array. The index is written in brackets after the identifier.

  4. 4

    State the number of elements in an array declared with indices 0 to 9.

    Model answer

    The array holds ten elements. Index 0 counts as the first of them.

  5. 5

    What does it mean to say an array is static?

    Model answer

    A static array has its size fixed when the program is written. The number of elements cannot change while the program runs.

  6. 6

    Give one advantage of using an array rather than a set of separate variables.

    Model answer

    An array lets a loop process every value with one line of code. One identifier replaces many separate variable names.

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.