Data Structures and Algorithms

Array

an object which contains elements of similar data type

Stack

a linear data structure that is used to store a collection of objects

Queue

a collection used to hold elements about to be processed and provides various operations like insertion, removal, etc.

First-In First-Out Principle

the first item added to the queue will be the first item removed

Last-In First Out Principle

the last item added to the stack will be the first item removed

Collection Interface

core member of the Java Collections Framework located in the java.util.package

Interface

abstract data types that represent collections

Implementations

reusable data structures

Algorithms

methods used to perform computations, such as sorting and searching on objects that implement collection interfaces

List

an interface that declares the behavior of a collection that stores a sequence of elements

ArrayList

dynamic, resizable arrays that are found in the java.util.package

LinkedList

a linear data structure where elements are not stored in continguous memory locations

Set

a collection that cannot contain duplicate items

Map

an interface that represents a collection of key-value pairs

HashSet

a class that implements the Set interface in which every item is unique

HashMap

a class that implements the Map interface in which every key is unique and maps to a specific value

Linear Search

simple search algorithm that checks for every element in the array until a target has been reached

Binary Search

highly efficient searching algorithm used if the array is sorted

Selection Sort

sorts an array by repeatedly finding the minimum element

Merge Sort

sorting algorithm that uses the divide-and-conquer approach

Bubble Sort

works by swapping the adjacent values if they are not ordered