CSIT-112 Final Study Guide

A fundamental object-oriented technique where a new class inherits properties and methods from an existing class, promoting code reuse and creating hierarchies of classes.

The initial class from which traits and behaviors are inherited. Also known as a Base Class.

A class that derives its properties and methods from a parent class, creating a specialized version. Also known as a Derived Class.

A relationship that demonstrates clear hierarchy - one class is a specialized version of another.

Inheritance is transitive when a child class can inherit traits from both its parent and the parent's parent, going up a chain.

A method declared without an implementation body, meant to be defined in derived classes. It signifies a function that must be provided in the subclasses.

A class that represents a common concept or structure, often containing abstract methods. It cannot be instantiated directly.

The ability of an object to behave differently based on the context or type it's invoked through. It means one method can have multiple implementations based on the actual type of the object it's being applied to.

The process of arranging a list of items in a specific order, typically ascending or descending.

A method designed to compare two inputs. It returns a negative value if input1 is less than input2, zero if they are equal, and a positive value if input1 is greater than input2.

Problems or unusual situations that may occur in a program, not a "error". Examples include dividing by zero, unable to read a file, an array index out of bounds, math errors, etc.

A structured way to handle exceptions. A 'try' block encloses code that might throw an exception, and a 'catch' block defines how to handle it.

An exception is first thrown from the top of the call stack and if it's not caught, it drops down to the previous method in the call stack.

The Method, file, and line number where an exception occurred.

A special class representing the exception, providing information about the error. It allows us to use 'throw' to explicitly trigger an exception.

The process of defining something in terms of itself. It's used to break down complex problems into smaller subproblems until a base case is reached.

The condition that terminates the recursive processing, allowing the active recursion methods to begin returning to their point of invocation.

The three standard I/O streams in Java: System.out, System.in, and System.err.

Represents the console window, used for displaying output.

Represents the keyboard input, allowing users to type data into the program, similar to a Scanner.

An object that stores a collection of other objects.

Operations that allow you to add, remove, or manage elements in a collection, like 'add,' 'remove,' 'pop,' 'push,' etc.

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 original order of elements with the same value is not preserved in the output array.

A data type that combines a set of data with specific operations allowed on that data.

A data structure with a fixed size that cannot be changed.

A data structure that can grow or shrink as needed.

A reference (or pointer) is a special type of data that points to the memory location of another object. It establishes a link between objects.

Data structures that can be created using references to connect objects, examples include: Trees, Linked Lists, and Graphs.

A linear data structure where each element (node) points to the next element in the sequence.

A linear data structure that follows the First-In, First-Out (FIFO) principle. Items are added to the rear and removed from the front.

The operation used to add an item to the rear of a queue.

The operation used to remove an item from the front of a queue.

A non-linear data structure where data is organized in a hierarchical structure, similar to a family tree. Each node has zero or more children.

A special type of tree where each node has a maximum of two child nodes.

A non-linear data structure where nodes are connected by edges. Unlike trees, there's no specific root node.

A graph where the connections between nodes are directional, indicated by arrows.

A graph where the connections between nodes are not directional, indicated by lines.

A data structure that associates keys with values. Efficient for storing and retrieving information.

A data structure that implements a map using a tree structure. The keys are ordered based on a predefined sorting mechanism.