Backtrack-ing
Paths
Algorithms
Other Classes
Free for All
100

An attempted solution at any stage of backtracking

What is a configuration

100

A social network is an example of this Abstract Data type

What is a graph?

100

An algorithm that makes the decision based on what appears to be the most optimal choice at the time

What is a greedy algorithm 
100

Classes defined within another class

What are inner classes or nested classes

100

A high-level description of what we would like the computer to do?

What is pseudo-code?

200
A valid solution to the problem
What is a goal
200

The time complexity of Depth-First Search

what is O(v+e)

200

The problem of greedy Algorithms

What is they don't guarantee the best result

200
What method allows you to change the way an enum is printed to the console

what is the toString method

200

What is the visibility of an enum constructor?

What is private

300

Breaks the rules of the problem being solved

What is an Invalid Configuration
300

Searching algorithm that uses a queue and a map to find the shortest path

What is Breadth-First Search?

300

The best possible answer for the problem

What is the optimal solution or global optimum

300

Classes that are unnamed and 1 time use

What is an anonymous class?

300

public aspects of an inner class can be accessed with the following notation.

What is the dot notation

(example: OuterClass.InnerClass myClass =
new OuterClass.InnerClass ();)

400

A configuration is one where one of the possible next choices has been made

What is a Successor configuration

400
A path-finding algorithm that finds the path with the least cost.

What is Dijkstra's algorithm?

400

The greedy algorithm that solves the Traveling salesman problem

What is nearest neighbors

400

code that is only executed once when the class containing the block is loaded by the program

what is  a static code block

400

A copy whose properties do not share the same references as the source from which the copy is made

What is a DEEP COPY

500

A Configuration interface is needed to implement a backtracking algorithm. This interface contains these three methods.

What are isValid(), isGoal(), getSuccessors()

500

The data structure that allows Dijkstra's algorithm to be used

What is a weighted graph
500

The name of a problem that has a greedy and optimal solution that uses maximum weights and values to fill a bag.

What is the knapsack problem 

500

One condition that an anonymous class must do, another that it may do

What is an anonymous class must override any inherited abstract methods at the time of creation

What is an anon. class may override other methods as well.

500

The better SI Leader

Who is neither of us we are both amazing. -500 for anyone who dares say otherwise