Unlike with "let", variables declared with this keyword cannot be reassigned later.
const
Two parter:
1) This is a value passed to a function when it is invoked.
2) This is the variable present in the function definition.
1) Argument
2) Parameter
An algorithm that includes a doubly nested loop will have a time complexity of at least this.
O(n^2)
Quadratic time
An occurrence of any object that is based upon a class.
Instance
What data structure is this?
Stack
const odd = [1,3,5];
const combined = [2,4,6, ...odd];
console.log(combined);
What gets logged to the console?
[ 2, 4, 6, 1, 3, 5 ]
This is a function that has been passed to another function as an argument.
Callback function
O(1)
Constant time
A special method of a class for creating and initializing an object instance of that class.
Constructor
In this type of data structure, each value can be accessed with a corresponding key.
Object
console.log(typeof NaN)
logs this to the console.
'number'
The process in which a function calls itself continually until a "base case" (a stopping condition) is met.
Recursion
O(n)
Linear time
A blueprint for creating objects, providing initial values for state and implementations of behavior.
Class
Two parter:
1) This word is used when moving through the nodes of a linked list.
2) is a linked list indexed?
1) Traverse
2) No, each node references another via the “next” property. However, it is ordered, via the references.
This array method creates a new array populated with the results of calling a provided function on every element in the calling array.
This type of function must satisfy at least one of two criteria:
1) It accepts another function as an argument
2) It returns a function
Higher order function
The Big O time complexity of Binary Search.
O(log n)
Logarithmic time
A procedure in which one class receives the attributes and methods of another class.
Inheritance
Stacks and Queues are referred to as LiFo and FiFo. Which is which, and what does each acronym mean?
Stacks are LiFo (last in, first out) and Queues are FiFo (first in, first out).
Reference type
This type of function runs instantly after it's defined.
IIFE (Immediately Invoked Function Expression, pronounced "iffy")
The Big O time complexity of merge sort, heap sort, and the built in JavaScript .sort method.
It's the best possible Big O of any sorting algorithms.
O (n log n)
Linearithmic time
This is one of the four core principles of OOP that “shows'' only essential attributes and “hides” unnecessary information.
Abstraction
Name one or more non-linear data structures.
Tree, Binary Search Tree, Graph