1/61
Comprehensive vocabulary review cards covering Java Object-Oriented Programming (classes, variables, methods, constructors, access modifiers, inheritance) and fundamental Data Structures and Algorithms (stacks, queues, linked lists, operations, and time complexities).
Class
A blueprint used for creating objects.
Object
An instance of a class.
Attributes
Variables that store data inside a class.
Instance variable
A variable that is unique for each object.
Static variable
A variable that is shared by all objects of a class.
Methods
Blocks of code that define the actions and behavior of a class.
void
A return type keyword indicating that a method has no return value.
return
A keyword and statement that sends a value back from a method.
Getter
An accessor method used to read a value.
Setter
A mutator method used to change a value.
Static Methods
Methods that belong to the class itself rather than to individual objects.
this Reference
A keyword that refers to the current object.
Method Overloading
Defining methods with the same name but different parameters.
Constructor
A special method that has the same name as the class, no return type, and is called to initialize objects.
Constructor overloading
Defining multiple constructors within the same class with different parameters.
this()
A constructor call that invokes another constructor in the same class, and must be the first statement.
Package
A mechanism used to group related classes.
Import
A keyword used to access and use classes from other packages.
java.lang
A standard Java package that is automatically imported into programs.
CLASSPATH
An environment setting that tells Java where to find classes and packages, using ; as a separator on Windows and : on Linux.
public (Access Modifier)
An access modifier that makes members accessible everywhere.
private (Access Modifier)
An access modifier that restricts accessibility to the same class only.
protected (Access Modifier)
An access modifier that allows access within the same package and subclasses (allows inherited access).
default (Access Modifier)
An access modifier level where access is restricted to the same package only.
Java Class Library (JCL)
A collection of ready-made classes and packages in Java that provides existing methods and functions so programmers do not need to create everything themselves.
Inheritance
An OOP concept that allows a class to inherit fields and methods from another class.
extends
A keyword used in class declarations to inherit from a class.
super()
A statement used to call the parent class constructor.
super(value)
A statement used to call a parent constructor with arguments.
Stack
A linear data structure that follows LIFO (Last In, First Out), where the last element added is the first one removed.
LIFO
Last In, First Out.
PUSH
The basic stack operation used to add an element.
POP
The basic stack operation used to remove the top element.
TOP/PEEK
An operation used to view the top element of a stack.
ISEMPTY
An operation used to check if the stack or data structure is empty.
Overflow
An error condition that occurs when attempting to add an element when the data structure is full.
Underflow
An error condition that occurs when attempting to remove an element when the data structure is empty.
Queue
A linear data structure that follows FIFO (First In, First Out), where the first element added is the first one removed.
FIFO
First In, First Out.
ENQUEUE
The basic queue operation used to add an element.
DEQUEUE
The basic queue operation used to remove the first element.
FRONT
The first element or head position of a queue.
REAR
The last element or tail position of a queue.
Circular Queue
A queue type where the last position connects back to the first.
Priority Queue
A queue type where elements are removed based on priority.
Deque
A queue type that allows insertion and deletion at both ends.
Linked List
A linear data structure made of nodes, where each node contains data and a pointer to the next node.
DATA (Node)
The part of a node that stores the value (also referred to as INFO).
NEXT/LINK
The part of a node that stores the address or pointer pointing to the next node.
Singly Linked List
A linked list type where each node points only to the next node.
Doubly Linked List
A linked list type where nodes point to both previous and next nodes.
Circular Linked List
A linked list type where the last node connects back to the first node.
START/HEAD
The pointer or reference pointing to the first node in a linked list.
NULL
A pointer value in a linked list indicating there is no next node.
Traversal
A basic operation that visits each node in a linked list.
Stack Push (Time Complexity)
The typical time complexity is O(1).
Stack Pop (Time Complexity)
The typical time complexity is O(1).
Queue Enqueue (Time Complexity)
The typical time complexity is O(1).
Queue Dequeue (Time Complexity)
The typical time complexity is O(1).
Linked List Traversal (Time Complexity)
The typical time complexity is O(n).
Linked List Search (Time Complexity)
The typical time complexity is O(n).
Linked List Insert at Beginning (Time Complexity)
The typical time complexity is O(1).