Term
|
Definition
| Array is a data structure that represents a collection of the same types of data. |
|
|
Term
|
Definition
| Cannot be used to create objects. Can contain abstract methods, which are implemented in concrete subclasses. |
|
|
Term
|
Definition
| Is used for defining common behavior for classses |
|
|
Term
| Abstract VS Interface Variable |
|
Definition
Abstract - No Restrictions.
Interface - All variables must be public static final |
|
|
Term
| Abstract VS Interface Constructors |
|
Definition
Abstract - Constructors are invoked by subclasses through constructor chaining. An abstract class cannot be instantiated using the new output.
Interface - No constructors. An interface cannot be instantiated using the new operator. |
|
|
Term
| Abstract VS Interface Methods |
|
Definition
Abstract - No Restrictions
Interface - All methods must be public abstract instance methods. |
|
|
Term
| Java Collections Framework |
|
Definition
| Data structures that can be used to organize and manipulate data efficiently. |
|
|
Term
|
Definition
| Stores a group of non duplicate elements |
|
|
Term
|
Definition
| Stores an ordered collection of elements |
|
|
Term
|
Definition
| A type of container for storing key/value pairs |
|
|
Term
|
Definition
| Vector is the same as the ArrayList except synchronized methods for accessing and modifying the vector. |
|
|
Term
|
Definition
| Elements in array must already be in order. Compares key with the element in the middle of the array. |
|
|
Term
|
Definition
| Compares key element sequentiallywith each element in the array |
|
|
Term
|
Definition
| Finds the smallest number in the list and swaps it with the first elements |
|
|
Term
|
Definition
| Sorts a list of values by repeatedly inserting a new element into a sorted sublist until the whole list is sorted. |
|
|
Term
|
Definition
| Compares adjacent array elements and exchanges their values if they are out of order. |
|
|
