Random 1
Random 2
Data structures
Inheritance
GUI
100

An intermediate level of code meant to be interpreted, e.g. by the Java Virtual Machine.

What is byte code?

100

An attempted solution at any stage of backtracking


What is a configuration?

100

A first-in, first-out (FIFO) data structure; elements are removed in the same order that they were added.

What is a Queue

100

May define but not implement methods. May also implement methods, and declare fields and constructors. Cannot be instantiated.

What is abstract class?

100

the top level JavaFX container

What is stage?

200

Having multiple methods in a class with the same method name but different parameters

What is overloading?

200

A specialized tree structure where nodes are only sorted in relation to their parents. Items are added left to right.

What is a heap?

200

Stores unique elements, meaning that duplicates are ignored. Elements are not maintained in any particular order

What is a set?

200

The parent class in a parent/child relationship

What is superclass?

200

Defines the interface that must be implemented by a class that wishes to be notified when a particular event occurs

What is an observer?

300

The part of the program where the variable can be used

What is scope?

300

A feature that allows types (classes andinterfaces) to be parameters when defining classes, interfaces, and methods 

What are generics?

300

The interface needed to use an object in a for-each loop

What is iterable?

300

Keyword that allows you to access parts of the parent class.

What is super?

300

Contains the core application logic.  Maintains the state of the application.  Notifies observers when the state changes.

What is the model?

400

Belongs to the class, rather than a specific instance

What is static?

400

What is the difference between Comparable and Comparator(short anwser question)

Comparable takes in one object of the same type and defines a natural order.

Comparator takes in two objects and you can have multiple different implementations.

400

What is the time complexity of inserting an element into the middle of a linked list

What is O(N)?

400

Can define only 1 method

What is a functional interface?

400

Specific type of event that is created when the user clicks on a button in a JavaFX GUI

What is action event?

500

What is the order that BFS would visit these nodes from 0 to 2. Assume neighbors are in ascending order.

0,1,3,4,2

500

An algorithm that makes the best choice at each stage, without regard for the overall solution

What is a greedy algorithm?

500

Search algorithm used in backtracking

What is DFS?

500

the ability of objects of different classes to be treated as objects of a common parent class

What is polymorphism?

500

The term for the basic building blocks of a JavaFX GUI  

What is node?

M
e
n
u