Data Structures

Question 1

Contiguous Memory Locations

Answer 1

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

Question 2

Data Cube

Answer 2

another word for tuple, a three-dimensional array

Question 3

Dot Syntax

Answer 3

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

Question 4

Dynamic Data Structure

Answer 4

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

Question 5

FIFO

Answer 5

First In First Out

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

Question 6

Hash Table

Answer 6

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

Question 7

List

Answer 7

a data structure separated by commas

Question 8

Linear List

Answer 8

a one-dimensional list with separate entries

Question 9

Linked List

Answer 9

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 10

Tree

Answer 10

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

Question 11

Binary Tree

Answer 11

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

Question 12

Booking Tree

Answer 12

a tree use specifically for searching

Question 13

Hierarchical Tree

Answer 13

often more interlinked than other forms of tree

Question 14

Queue

Answer 14

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 15

Circular Queue

Answer 15

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 16

Linear Queue

Answer 16

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

Question 17

Magnitude

Answer 17

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 18

Enqueue

Answer 18

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 19

Dequeue

Answer 19

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 20

Dot Syntax

Answer 20

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

Question 21

Multi-Dimensional Array

Answer 21

array with many dimensions

Question 22

List

Answer 22

one-dimensional array

Question 23

Table

Answer 23

two-dimensional array

Question 24

Tuple

Answer 24

three-dimensional array

Question 25

Series

Answer 25

a set of instructions or data with no specific order

Question 26

Sequence

Answer 26

a set of instructions or data with a specific order

Question 27

Stack

Answer 27

a collection of independent components that work together to support the execution of an application

Question 28

Static Data Structure

Answer 28

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

Question 29

Array

Answer 29

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 30

Record

Answer 30

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 31

Heap

Answer 31

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

Question 32

Monolithic Array

Answer 32

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

Question 33

Popping

Answer 33

removing items from a top, always from a top

Question 34

Priority Queue

Answer 34

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

Question 35

Pushing

Answer 35

adding items to a stack, always at the top

Question 36

Stack Pointer

Answer 36

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 37

Tabular Data

Answer 37

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

Question 38

User Space

Answer 38

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

Question 39

Nodes

Answer 39

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