Java Programming Concepts

A fundamental object-oriented design technique used to create and organize reusable classes. It allows a new class to inherit properties and methods from an existing class.

The class that provides the properties and methods for a derived class.

The class that inherits properties and methods from a parent class.

A relationship where a derived class is a specialized version of the base class.

Means that a subclass inherits properties and methods not only from its direct parent class but also from all the parent classes in the inheritance hierarchy.

A method declared without a body. It defines the method's signature but leaves the implementation to derived classes.

A class that cannot be instantiated directly. It provides a common structure for derived classes to inherit from.

Allows different objects to respond to the same message in different ways, based on their own specific implementations.

The process of arranging a list of items in a particular order. It involves comparing elements and swapping them to their correct positions.

A comparison method used to determine the relative order of two objects. It returns a negative value if the first object is less than the second, zero if they are equal, and a positive value if the first object is greater than the second.

A situation that occurs during program execution that disrupts the normal flow of the program.

A list of method calls that led to the exception, showing the order of execution.

It allows you to handle potential errors in your code gracefully without crashing the program. It defines different code blocks for 'try' (attempting execution) and 'catch' (handling exceptions).

The process where an exception, thrown by a method higher in the call stack, travels down the stack until it's caught or the program terminates.

A class that represents any object that can be thrown as an exception.

The standard input stream that represents the keyboard.

The standard output stream that represents the console window.

The standard error stream, which represents the console window, used to display error messages.

The process of defining something in terms of itself. It involves breaking down a problem into smaller subproblems until a base case is reached.

The condition that stops the recursive process, allowing the method calls to return to their origin.

A data structure that stores elements in a specific order, allowing for insertion, deletion, and retrieval of elements.

A sorting algorithm where elements with the same value appear in the output array in the same order as they were in the input array.

A sorting algorithm where the order of elements with the same value may change during the sorting process.

A collection of data and the operations that can be performed on that data.

A data structure that has a fixed, predetermined size.

A data structure that can dynamically grow or shrink in size as needed.

A reference used to connect objects in a dynamic data structure, allowing them to be linked together.

A linear data structure where elements are linked together in a sequential manner. Each element has a value and a pointer to the next element.

A dynamic data structure that follows the LIFO (Last In First Out) principle.

A dynamic data structure that follows the FIFO (First In First Out) principle.

A non-linear data structure that uses nodes and edges to represent relationships.

A type of graph where the connections are one-directional.

A type of graph where the connections are two-directional.

A data structure that stores key-value pairs, allowing efficient retrieval of values based on their keys.

A map implementation using a tree structure to organize the keys.

A map implementation using a hash table to store key-value pairs.

A concise way to define anonymous functions in a single line of code. Useful for processing data in collections like lists, trees, and maps.