Back to marketplace

Data structures and abstract data types

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

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

Card preview (19)

#1
Front (Question)

Define primitive data type and give an example

Back (Answer)

They can only contain one data value. e.g. Integer, Boolean, Real etc

#2
Front (Question)

Define composite/compound data type and give an example

Back (Answer)

They’re built by combining primitive data types e.g. Records, Class

#3
Front (Question)

Define data structures

Back (Answer)

A collection of data that is organised to allow efficient processing. This means a wide range of sorting algorithms can be used

#4
Front (Question)

Define abstract data types

Back (Answer)

A conceptual model that describes how data is organised and which operations can be carried out from the perspective of an end user with no background knowledge

#5
Front (Question)

How do static data structures deal with memory?

Back (Answer)

They reserve enough memory for a set amount of data established in advance. The structure can not be resized

#6
Front (Question)

How are static data structures efficient and inefficient?

Back (Answer)

They’re very memory efficient as they can access elements directly by index. They’re inefficient if the wrong amount of memory is allocated leading to wastage or errors

#7
Front (Question)

How do dynamic data structures deal with memory?

Back (Answer)

The memory capacity is not fixed and the number of elements it can hold is only limited by the memory allocation for the whole program

#8
Front (Question)

Name an advantage and disadvantage of dynamic data structures

Back (Answer)

Advantage is that the memory size is not pre set A disadvantage is that elements can not be accessed directly- only by memory location which is sequential

#9
Front (Question)

What is a memory heap?

Back (Answer)

The amount of memory allocated to a program at run time that data structures can access

#10
Front (Question)

Definition of an array

Back (Answer)

A data structure that holds a number of elements of the same data type

#11
Front (Question)

How are arrays declared & processed?

Back (Answer)

Declared under a single identifier and processed efficiently using iteration techniques

#12
Front (Question)

How do arrays use indexes?

Back (Answer)

Each position is identified by an index, usually using zero-based indexing. Data is stored contiguously( next to each other) in main memory so each position is directly acessible

#13
Front (Question)

Are the values in an array mutable?

Back (Answer)

Yes, they can be changed while the program is running

#14
Front (Question)

What are the three steps to declaring a one dimensional array?

Back (Answer)

Create an identifier Specify the data type of the elements Specify the number of positions in the array

#15
Front (Question)

What’s another name for a 2D array?

Back (Answer)

A Matrix

#16
Front (Question)

What 2 values do you need to access an element in a 2D array?

Back (Answer)

A column index and a row index

#17
Front (Question)

Define a record

Back (Answer)

A data structure which consists of a fixed number of variables called fields

#18
Front (Question)

What does every field have to have?

Back (Answer)

A field name (Identifier) and a data type

#19
Front (Question)

Name a simple way of storing data

Back (Answer)

Text files