➢ Elements follow a sequence (e.g., Arrays, Stacks, Queues).

(a)  

➢ Elements are connected hierarchically (e.g., Trees, Graphs).

(a)  

➢ A step-by-step procedure or set of rules used to solve a specific problem.

(a)  

➢ Optimizes Time Complexity (speed) and Space Complexity (memory).

(a)  

➢ Essential for building software that can handle large amounts of data.

(a)  

➢ used to control the flow of execution

➢ This execution order depends on the supplied data values

(a)  

➢ A versatile, high-level, object oriented programming language

➢ Platform independent

(a)  

➢ Wrapping data and methods into a single unit.

➢ Protecting data by bundling it with methods within a class (using private

variables).

(a)  

➢ One class can acquire the properties and methods of another class

➢ Creating a new class based on an existing one (using extends).

(a)  

➢ The ability of a method to perform different task based on the object

➢ Allowing methods to take many forms (Overloading vs. Overriding).

(a)  

➢ Strong implementation details and showing only functionally

➢ Hiding complex logic and showing only essential features to the user.

(a)  

➢ Return me length of the string

(a)  

➢ Return me character at a specific index

(a)  

➢ Extract a portion of the String

(a)  

➢ Compare two thing for extract equality

(a)  

➢ Converts all character to upper case

(a)  

➢ Converts all character to lower case

(a)  

➢ check if the string I empty

(a)  

➢ Removes leading and trailing whitespace

(a)  

➢ Concatenates me specified String to the end

(a)  

➢ FIXED-SIZE DATA STRUCTURE THAT STORES DATA WITH THE SAME DATA TYPE

(a)  

Occurs when accessing an invalid index.

(a)  

Is when a method calls itself to solve a smaller version of the original problem.

(a)  

★ The condition that stops the recursion (prevents infinite loops).

(a)  

★ The part where the method calls itself with a reduced input

(a)  

➢ ACCESSING EACH ELEMENT OF THE ARRAY SEQUENTIALLY

(a)  

➢ ADDING A NEW ELEMENT TO A SPECIFIC POSITION

(a)  

➢ PROCESS OF REMOVING OF ELEMENT IN SPECIFIC POSITION

(a)  

➢ STORES DATA IN A SINGLE LINEAR SEQUENCE

(a)  

➢ TABLES AND MATRICES

(a)  

➢ GRID-LIKE STRUCTURE

(a)  

➢ If ... else

➢ Switch.. Cale

(a)  

➢ while

➢ for

➢ do... while

(a)  

➢ break

➢ continue

(a)  

➢ Decision making

(a)  

➢ Classes and objects make it easier to represent data structure.

(a)  

➢ Built in libraries like java.util for commonly used data structure.

(a)  

➢ Java’s probability makes it ideal for implementing data structure in different environments.

(a)