1.4.2 Data Structures

Question 1

what does dynamic and static mean

Answer 1

Dynamic - size can change
Static - Size cannot change

Question 2

how does a stack work

Answer 2

First in last out
adds data to the top of the stakc

Question 3

What are the operations for a stack

Answer 3

push -add item to the top
Pop - remove item from the top
isfull - check if stack is full
isEmpty - check stack is empty

Question 4

define array

Answer 4

A data structure where a contiguous section of data is allocated to RAM
Single data type

Question 5

define record

Answer 5

Multiple values under one identifier can be different data types
row in a table

Question 6

what are the features of a list

Answer 6

Mutable (items can change)
can store multiple data types

Question 7

What are the features of an Array

Answer 7

Mutable (items can change)
only one datatype

Question 8

What are the features of a Tuple

Answer 8

Immutble (items cant change)
can store multiple data types

Question 9

define graph

Answer 9

an abstract data structure representing complex relationships

Question 10

what are the features of a graph

Answer 10

not heirarchial
can be directed
can be weighted
can have cycles or loops

Question 11

what are the characteristics of a tree

Answer 11

Heircahial data structure
Data stored in nodes
Has leaf nodes
no cycles or loops

Question 12

why use a hash table

Answer 12

when searching through a large data set binary search becomes exponentially quicker
but may take a long time to sort data
however a hash table can find an address almost instantly

Question 13

what are the four key operations on a Queue

Answer 13

Append - enqueue
dequeue
isEmpty
isFull

Question 14

describe how an array can be used ot store and access data in a stack [4]

Answer 14

Pointer to the next free space (top of the stack)
when data added
added to pointer position/pointer+1
check if stack is full
pointer incremented
when removing data
check empty
pointer = pointer -1
pop and push