Sorting Algorithms
ADTs
Remember This?
Miscellaneous
100

The most overall efficient sorting algorithm you have learned about so far.

What is merge sort?

100

The traversal order current node -> left subtree -> right subtree is known as...

What is pre-order traversal?
100

Function calls live in this part of the memory model.

What is the function call stack?

100

The ancestral class of all classes in Java.

What is Object?

150

The definition of Big-O notation and what it means.

What is the upper-bound on the behaviour of a function/algorithm as the input tends towards infinity?

150

This ADT allows arbitrary adding/removing from both ends.

What is a dequeue?

150
Single vs. double quote mark usage in Java.

What is single quotes are for character literals and double quotes are for strings?

150

The parts required for recursion.

What is a base case and a recursive case?

200

What makes Quicksort efficient most of the time?

What is on average, the partition will be near the middle?
200

Example of LIFO and FIFO ADTs.

What are the stack and queue?

200
Hidden methods are also known as...

What is a static method?

200

Child classes do NOT inherit this.

What are the constructors of the parent class?

250

This step in Merge sort is responsible for the log(n) in its O(nlogn) running time.

What is the division/partitioning of the array/list?

250

The 3 functions/actions are costly for a singly-linked list to perform.

What are

1) Adding to an arbitrary position (not either end)

2) Removing from an arbitrary position (not either end)

3) Search for an item in the list?

250

The type of binding for static, private, and final methods.

What is compile-time/early/static binding?

250

Why Java does not support multiple inheritance.

What is the diamond problem, where the compiler cannot determine which parent class to call a method from?

300

The worst sorting algorithm.

What is Bogo/Random Sort?

300

The 3 cases of remove(x) in a BST and how to execute them.

What is 

1) A leaf node you just remove

2) If the node has a single child, just splice it and the single child replaces it

3) If the node has 2 children, splice it out and replace it with the smallest node larger than it in the subtree

300

The keyword new for arrays means things live in this part of the memory model and the memory has a special trait.

What is 'the heap' and the memory is contiguous?

300

final static Boolean Comparable(String s)

public Integer Foobar(Node n, Integer i)

public static void main(String[] args)

Are examples of...

What is a method signature?