Back to marketplace

1.4.2 Data Structures

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

What is an array?

Back (Answer)

An ordered, finite set of elements of a single type.

#2
Front (Question)

What type of array is a linear array?

Back (Answer)

A one dimensional array.

#3
Front (Question)

How can you visualise a two dimensional array?

Back (Answer)

You can visualise it as a spreadsheet/table.

#4
Front (Question)

How can you visualise a three dimensional array?

Back (Answer)

A three dimensional array can be visualised as a multi-page spreadsheet.

#5
Front (Question)

What is a record also known as?

Back (Answer)

A row in a file

#6
Front (Question)

What is a record made up of?

Back (Answer)

A record is made up of fields.

#7
Front (Question)

How can you select a field from a record using pseudo code?

Back (Answer)

recordName.fieldName

#8
Front (Question)

What is the definition of a list?

Back (Answer)

A data structure consisting of a number of items, where the items can occur more than once.

#9
Front (Question)

What are the main differences between arrays and lists?

Back (Answer)

• Lists can store data non-continuously whereas arrays store data in order. • Lists can store data of more than one data type.

#10
Front (Question)

What is a tuple?

Back (Answer)

An immutable, ordered set of values of any type.

#11
Front (Question)

What is the difference between a tuple and an array?

Back (Answer)

Tuples are initialised using regular brackets instead of square brackets.

#12
Front (Question)

What is a stack?

Back (Answer)

A last in first out data structure, where items can only be removed from and added to the top of the list.

#13
Front (Question)

Give an example of where stacks may be used.

Back (Answer)

• Back button in a web page - Undo buttons

#14
Front (Question)

What is a queue?

Back (Answer)

A first in first out data structure, where items are added to the end of the queue and removed from the front of the queue.

#15
Front (Question)

What does the operation isEmpty() do?

Back (Answer)

Checks to see if the stack is empty.

#16
Front (Question)

What does the operation push(value) do?

Back (Answer)

Adds a new value to the top of the stack.

#17
Front (Question)

What does the operation peek() do?

Back (Answer)

Returns the top value of the stack without removing it.

#18
Front (Question)

What does the operation pop() do?

Back (Answer)

Returns and removed the value at the top of the stack

#19
Front (Question)

What does the operation size() do?

Back (Answer)

It returns the size of the stack.

#20
Front (Question)

What does the operation isFull() do?

Back (Answer)

Checks to see if the stack is full.

#21
Front (Question)

What does the operation enQueue(value) do?

Back (Answer)

Adds the value to the end of the queue.

#22
Front (Question)

What does the operation deQueue() do?

Back (Answer)

Removes the item from the end of the queue.

#23
Front (Question)

What does the operation isEmpty() do?

Back (Answer)

It checks to see if the queue is empty

#24
Front (Question)

What does the operation isFull() do?

Back (Answer)

Checks to see if the queue is full.