Show:
Javascript
Sorting & Searching
Binary, Logic
Data Structures
Misc.
100
What is the value of Math.max([2, 3, 4, 5])?
NaN
100
This search algorithm works by sequentially checking each element of the list for the target value until a match is found or until all the elements have been searched
Linear Search
100
A table used to work out the possible inputs and outputs of logic gates.
Truth table
100
What is the worst case time complexity for looking up an item in a linked list?
O(n)
100
What does [].forEach() return?
undefined
200
What is the value of 4 + 3 + 2 + "1"
91
200
What is the worst case time complexity of bubble sort?
O(n^2)
200
Calculate the following binary logic: 101 & 1101 (bitwise AND)
101
200
Describe two operations that all queues perform.
enqueue and dequeue
200
This notation describes the upper bound on the growth rate of a function.
Big O Notation
300
In what order will the numbers 1-4 be logged to the console when the following code is executed? (function() { console.log(1); setTimeout(function(){console.log(2)}, 1000); setTimeout(function(){console.log(3)}, 0); console.log(4); })();
1, 4, 3, 2
300
What is the worst case time complexity of merge sort?
O(n log n)
300
Given the decimal number 323, apply a bitwise left-shift. What is the resulting decimal number?
646
300
This operation allows the user to read the value at the top of the stack without removing it.
A "peek".
300
Occurs when a computer program incorrectly manages memory allocations in such a way that memory no longer needed is released.
memory leak
400
What will the following function return? function() { return typeof arguments; }
"object"
400
This sorting algorithm works by repeatedly finding the smallest remaining item in an unsorted array, and adds it to the end of a sorted array.
Selection Sort
400
Convert the binary value 111101 into hexadecimal.
3D
400
This process automatically releases allocated memory when it isn't being used anymore.
Garbage collection