Data Structures

Question 1

Abstract Data Type (ADT)

Answer 1

a data type whose properties are specified independently of any particular programming language

Question 2

Contiguous Memory Locations

Answer 2

memory locations for consecutive blocks of memory for a file/process

Question 3

Data Cube

Answer 3

another word for tuple, a three-dimensional array

Question 4

Data Model

Answer 4

a method of describing the data, its structure, the way it is interrelated and the constraints that apply to it for a given system or organisation

Question 5

Directed Graph

Answer 5

a diagram consisting of vertices, joined by directed edges

Question 6

Dot Syntax

Answer 6

involves adding a dot after the structure name, which makes the IDE display all available options

Question 7

Dynamic Data Structure

Answer 7

data structure with no fixed size, prevents memory being wasted but is harder to program

Question 8

FIFO

Answer 8

First In First Out

items are always removed from the front and added at the back

Question 9

Hash Table

Answer 9

a data structure that stores data in an associative manner, where each item maps to another

Question 10

Immutable

Answer 10

where data values are fixed and cannot be changed over time

Question 11

Labelled or Weighted Graph

Answer 11

graph in which the edges are labelled or given a value called its weight

Question 12

List

Answer 12

a dynamic data structure

Question 13

Linear List

Answer 13

a one-dimensional list with separate entries

Question 14

Linked List

Answer 14

dynamic data structure where data is not necessarily stored in order or in contiguous memory locations, a multi-dimensional list where each entry has a link to the next

Question 15

Tree

Answer 15

a hierarchical data structure used to represent and organised data in a way that is easy to navigate and search

Question 16

Binary Tree

Answer 16

a tree where each node can only have two children, referred to as left child and right child

Question 17

Booking Tree

Answer 17

a tree use specifically for searching

Question 18

Hierarchical Tree

Answer 18

often more interlinked than other forms of tree

Question 19

Queue

Answer 19

a FIFO data structure with pointers indicating the front and back, though the rear pointer may indicate the next free space instead of the last item in the queue

Question 20

Circular Queue

Answer 20

a type of queue that is extended so that the first element is connected to the second element; unless full, a circular queue loops back to the beginning when the end of the queue is recorded

Question 21

Linear Queue

Answer 21

generally referred to as just as queue, operates as a FIFO dynamic data structure

Question 22

Magnitude

Answer 22

also known as the absolute value, can be found by taking a negative binary number and switching all the 1s to 0s and all the 0s to 1s

Question 23

Enqueue

Answer 23

adding to a queue. Before anything can be added, queue_size must be less than max_size, then the rear pointer is moved on one

Question 24

Dequeue

Answer 24

removing from a queue. Before anything can be removed, it must first be ascertained if the queue is empty, in which case, an underflow error must be generated

Question 25

Dot Syntax

Answer 25

involves adding a dot after the structure name, which makes the IDE display all available options

Question 26

Multi-Dimensional Array

Answer 26

array with many dimensions

Question 27

List

Answer 27

one-dimensional array

Question 28

Table

Answer 28

two-dimensional array

Question 29

Tuple

Answer 29

three-dimensional array

Question 30

Series

Answer 30

a set of instructions or data with no specific order

Question 31

Sequence

Answer 31

a set of instructions or data with a specific order

Question 32

Stack

Answer 32

a dynamic data structure operating Last In First Out

Question 33

Static Data Structure

Answer 33

have a fixed size, cannot change whilst program runs, should use constants

Question 34

Array

Answer 34

used to store a collection of related information in contiguous memory locations when all data is of the same type, must be declared so space can be reserved in memory and the name, data type and maximum size must be declared

Question 35

Record

Answer 35

a static data structure which contains a collection of related data items, an be fixed or variable length, can contain data of different types and are accessed using dot syntax

Question 36

Heap

Answer 36

data structure used when it is necessary to repeatedly remove the object with the highest priority

Question 37

Monolithic Array

Answer 37

a self-contained application that handles all aspects of that particular application from the user interface

Question 38

Pointer

Answer 38

a variable that contains a memory address by pointing to the memory location with that address

Question 39

Pointer Type

Answer 39

variable of pointer type that stores an address of a data value

Question 40

Popping

Answer 40

removing items from a top, always from a top

Question 41

Priority Queue

Answer 41

queue with items in priority order as the queue sorts items into priority order before executing

Question 42

Pushing

Answer 42

adding items to a stack, always at the top

Question 43

Semi-Structured Data

Answer 43

data that does not follow conventional structures, but is structured

Question 44

Stack Pointer

Answer 44

points to the top of the stack, is incremented when items are pushed onto the stack or decremented when items are popped off the stack, when the stack is empty, the pointer equals -1 or null

Question 45

Structured Data

Answer 45

data in established record formats

Question 46

Tabular Data

Answer 46

refers to data that is organized in a table with rows and columns

Question 47

Traveller's Problem

Answer 47

solution finds a route that visits each city exactly once before returning to the starting point

Question 48

Unstructured Data

Answer 48

data that is not within an established record format, includes comments on social media, images within a video stream

Question 49

User Space

Answer 49

refers to all code that runs outside the operating system’s kernel

Question 50

Volumetrics

Answer 50

measurement or assessment of the volume of data that a system will be required to process and store

Question 51

Nodes

Answer 51

items in a list containing data and a pointer to the next item