Index

Symbols

$< $@ $^ -c -g

-o -O0, -O1, -O2, -O3 -std=c++14 -Wall ./main .gitignore

A

Acceptance test Accessor Actual parameters

Acyclic Graph, [1] Adjacency, [1] Ancestor (Tree)

B

Bash Best case, worst case, and average case

Branch Breadth-first search (BFS), [1] Bucket (hash table)

C

cd Chaining, [1] Child Code Memory Region Collision (hash table), [1] (hashing) Collision resolution (hash table) Command Arguments and Options (g++)

Command-line Command Command-line Interface (CLI) Comment Commit Compilation step Complete binary tree Computational complexity Constant time operation Constructor Cyclic Graph, [1]

D

DataFrame DataSet Degree of a node (Tree) Degree of a tree Depth-first search (DFS, Graph), [1] Deque ADT Descendant (Tree)

Destructor Directed graph, [1] Distance (Graph), [1] Distance between two nodes (tree) Documentation Dummy Node (linked-list) Dynamic Data

E

Edge/Arc (Graph), [1] Edge/Link (Tree)

Editor/IDE Executable Expression

F

Formal parameters Full binary tree Full graph, [1] Function call Function Call Matching

Function declaration Function definition Function name Function overloading Function Parentheses

G

g++ g++ arguments g++ options gcc GCC (GNU Compiler Collection) git git add git clone <URI>

git commit git config git init git log git pull git push git status Growth rate

H

Hash Function Hash function (hash table) Hash map, [1] Hash set, [1]

Hash Table Header file Heap Memory Region Height of a tree (tree)

I

Identifier

Integration test Internal node

K

Key (hash table), [1] (hashing)

Key space / Domain (hashing)

L

Leaf node Length of path (Graph), [1] Level/Depth of a node (tree) Link Linked-List Linking step

Linux List ADT Literal Load factor (hash table) Logic error ls Lvalue

M

make man Map ADT

Memory Leak mkdir Mutator

N

Neighbors (Graph), [1]

Node (linked-list)

O

Open addressing, [1]

Ordered Tree

P

Parameter Passing Parent Path (Graph), [1] Path between two nodes (Tree) Perfect binary tree pragmas

Precedence rule Preprocessing step Prerequisites Priority Queue ADT Private helper Probing, [1]

Q

Queue ADT

R

RDD (Resilient Distributed Dataset) Recipe Rehashing (hash table) Remote Repository

Reserved word (keyword) Return statement rm Root Runtime error Rvalue

S

Scope Set ADT Sibling Source Code Source code file Space complexity SparkContext Sparse graph, [1] ssh

Stack ADT Stack Frame Stack Memory Region Staging area (a.k.a. git index) Static Memory Region Structured block Subtree Synchronization Syntax error System test

T

Target Testing framework Threads (OpenMP)

Time complexity Toolchain Tree Type

U

Undirected graph, [1]

Unit test Unordered Tree

V

valgrind Value (hash table), [1] (hashing) Value space / Range (hashing)

Variable Variable initialization Variable Scope (OpenMP) Vertex/Node (Graph), [1]

W

Weighted graph, [1]

Working directory (a.k.a. working tree) WSL