Data Structures

Question 1

Array

Answer 1

Store multiple items of same data type, homogenous

Static

Question 2

Record

Answer 2

Collection of related fields (variable, each diff data types)
Define, declare and assign
Array of records to store multiple records

Question 3

Tuple

Answer 3

Immutable
Static
Better for memory than lists

Question 4

Stack

Answer 4

LIFO
Pop, push
Functions:
call stack (keep track of addresses control must return to when subroutine ends)

Question 5

Queues

Answer 5

FIFO
enQueue(), deQueue()
Functions:
Output waiting to be printed

Linear queue (items move up when removed or pointers)
Circular queue
Priority Queue

Question 6

List

Answer 6

Dynamic tuple

Question 7

Linked list

Answer 7

Versatile data structure

Items not in contiguous data locations

Question 8

Graphs

Answer 8

Dynamic data structures
Undirected/directed
Weighted/unweighted

Question 9

Adjacency matrix vs list

Answer 9

Graph storing
Poor for memory

Vs

Better for memory

Question 10

Depth first

Answer 10

Use stack
Start at root down 1 branch as far as possible
Backtrack

Question 11

Breadth first

Answer 11

Use queue

Root, scan left to right

Question 12

Binary Search Tree

Answer 12

Max 2 children
Data placed left if smaller and right if smaller
Hierarchy

Question 13

Hash table

Answer 13

Combine arrays and linked list 
Fast search 
Index physical address on file where data is held used
Hash junction is used 
Collision can occur

Question 14

Variable vs Constant

Answer 14

Identifier that refers to memory location, value of which changes during run time

Vs

“” - does not change