Algorithms & Data Structures Samenvatting
Lukas van der Gaag - HBO ICT - Software Engineer - 2022/2023
Inhoud
Inhoud 0
Generics 2
Classes 2
Methods 2
Functional Interfaces 2
Recursion 3
Searching Algorithms 3
Linear search 3
Binary search 3
Efficiency of Algorithms 4
Order Of Magnitude 4
Time Complexities 4
Sorting Algorithms 5
Selection Sort 5
Insertion Sort 5
Bubble Sort 5
Merge Sort 5
Quick Sort 6
Java Data Structures 6
Stack 6
Queue 6
Deque 6
Priority Queue 7
LinkedList 7
Set 7
Map 7
Heap 7
Hashing 8
Graphs 8
Directed Graph 8
Balanced Search Tree 8
Undirected Graph 9
, Euler Graphs 9
Hamilton Graphs 9
Tree 9
Adjacency List 9
Adjacency Matrix 9
Searching 10
Depth-First Search (DFS) 10
Breadth-First Search (BFS) 10
Minimum Spanning Trees Algorithms 10
Prim’s Algorithm 10
Kruskal’s Algorithm 10
Dijkstra Shortest Path Algorithm 11
Traversing (Traversals) 11
Pre-order traversal 11
In-order traversal 11
Post-order traversal 11
Streams 11
Operations 11
Collectors 12
1
Lukas van der Gaag - HBO ICT - Software Engineer - 2022/2023
Inhoud
Inhoud 0
Generics 2
Classes 2
Methods 2
Functional Interfaces 2
Recursion 3
Searching Algorithms 3
Linear search 3
Binary search 3
Efficiency of Algorithms 4
Order Of Magnitude 4
Time Complexities 4
Sorting Algorithms 5
Selection Sort 5
Insertion Sort 5
Bubble Sort 5
Merge Sort 5
Quick Sort 6
Java Data Structures 6
Stack 6
Queue 6
Deque 6
Priority Queue 7
LinkedList 7
Set 7
Map 7
Heap 7
Hashing 8
Graphs 8
Directed Graph 8
Balanced Search Tree 8
Undirected Graph 9
, Euler Graphs 9
Hamilton Graphs 9
Tree 9
Adjacency List 9
Adjacency Matrix 9
Searching 10
Depth-First Search (DFS) 10
Breadth-First Search (BFS) 10
Minimum Spanning Trees Algorithms 10
Prim’s Algorithm 10
Kruskal’s Algorithm 10
Dijkstra Shortest Path Algorithm 11
Traversing (Traversals) 11
Pre-order traversal 11
In-order traversal 11
Post-order traversal 11
Streams 11
Operations 11
Collectors 12
1
