CS 2.1 -definitions (ALEVEL)

Question 1

multi -dimensional arrays

Answer 1

array where each data item is located using multiple indices

Question 2

single-dimensional arrays

Answer 2

array where each data item can be located using single index

Question 3

dictionaires

Answer 3

data structure consisting of set of keys that are mapped to corresponding values

Question 4

dynamic structures

Answer 4

data structure whose memory allocation size can change throughout execution of program

Question 5

graphs

Answer 5

data structure consisting of set of vertices connected by edges

Question 6

Hash tables

Answer 6

data structure where hashing algorithm creates a mapping between keys and values, data item can be directly accessed by recalculation without any search

Question 7

queues

Answer 7

FIFO

Question 8

stack

Answer 8

LIFO

Question 9

Static structures

Answer 9

data structure that is allocated a fixed amount of memory space, which does not change throughout the execution of program

Question 10

Trees

Answer 10

data structure that uses set of linked nodes to form a hierarchical structure starting at root node, each node is a child of a parent node

Question 11

vectors

Answer 11

data structure representing a quantity with both magnitude and direction

Question 12

Stacks - peek

Answer 12

allows users to view the top element of stack without modifying

Question 13

stack - pop

Answer 13

removes the most recently added element

Question 14

stack - push

Answer 14

adds an element to top of stack

Question 15

Graphs - adjacency list

Answer 15

representation of a graph by storing a list of connected nodes to each node

Question 16

adjacency matrix

Answer 16

matrix representation of a graph that stores the edges connecting all possible nodes

Question 17

directed nodes

Answer 17

graph where order of vertices paired in an edge matter

Question 18

edge

Answer 18

connection that represents a relationship before two nodes

Question 19

undirected graph

Answer 19

graph where order of vertices in an edge does not matter, edges are bidirectional

Question 20

vertex

Answer 20

the representation of an object on a graph is capable of being related to other such objects

Question 21

weighted graphs

Answer 21

graphs where each edge has an associated value

Question 22

binary trees

Answer 22

rooted tree in which each nodes has at most 2 children

Question 23

trees

Answer 23

a connected, undirected graph with no cycles

Question 24

hash tables - collisions

Answer 24

when two key values compare to same hash

Question 25

hashing algorithm

Answer 25

algorithm that calculates a value to determine the unique index where a date item is to be stored in a hash table

Question 26

rehashing

Answer 26

returning the hashing algorithm in event of collision

Question 27

convex combination of two vectors

Answer 27

any vector that can be expressed as a linear combination of the two vectors

Question 28

dot product of 2 vectors

Answer 28

A = [1,4,6] B = [3,7,9] dot product = (1)(3) + (4)(7) +(6)(9)]