Data Structures Quiz

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/32

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

33 Terms

1
New cards

ArrayList

an array that’s a list

2
New cards

Type Parameter

tells the class what kind of values will be in the data structure

3
New cards

Linked List

nodes that point to other nodes

4
New cards

Nodes

a class that contains data and a pointer

5
New cards

Tree

a data structure that is made up of nodes with parents and children

6
New cards

Binary Tree

a tree in which nodes have up to 2 children

7
New cards

Parent

a node that points to another node in a tree

8
New cards

Child

a node that is being pointed to by another node in the tree

9
New cards

Root

the starting node in the tree, that is NOT pointed to by anything

10
New cards

Leaf

a node in a tree with no children

11
New cards

Sub-tree

a portion of the tree that could be its own tree

12
New cards

Level

the distance from the root to a certain node

13
New cards

Height

goes in the opposite direction from level and refers to the whole tree

14
New cards

Binary Search Tree

a binary tree in which items are sorted

15
New cards

Full Tree

a tree where all the nodes have either 0 or 2 children

16
New cards

Complete Tree

a tree that is continuous until it’s done, it’s completed left to right with no spots missed

17
New cards

Wrapper Class

the class for types because type parameters must be a class (e.g. Integer, Double, etc.)

18
New cards

Boxing

putting a primitive variable in an object

19
New cards

Unboxing

converting a wrapper type object into its corresponding primitive value

20
New cards

Hashing

using hash functions

21
New cards

Hash Function

turning data into hash code

22
New cards

Hash Code

a number that represents a value/data

23
New cards

Collision

when multiple data points get to the same index

24
New cards

Chaining

creating a linked list to resolve collisions

25
New cards

Mapping

creates an x → y relation for any type

26
New cards

Key

the lookup type, or type that is associated with a value

27
New cards

Value

the type that is associated to

28
New cards

2D Array

an array of arrays

29
New cards

Ragged Array

a 2D array where the inner arrays have different lengths

30
New cards

Arrays of Objects

an array of pointers that point to objects

31
New cards

Stack

a data structure in which you only have direct access to the most recently added element

32
New cards

Call Stack

functions that call functions that call functions

33
New cards

LIFO

idea that the last to start is the first to finish