JpaRepository

->JpaRepository interface given Spring Data JPA Module. ->The Use of JpaRepository is To Perfrom CRUD operations and sorting and paginations operation with Any relational Data base.

IMPLEMENTED METHODS

1.findAll();

2.findAll(Sort sort); 4.saveAll(Iterable<S> entities);

3.findAllById(Iterable<ID> ids);

5.flush();

6.saveAndFlush(S entity);

7.deleteInBatch(Iterable<D entities):

8.deleteAllInBatch():

9.getOne(ID id); 10.findAll(Example<S> example);

11.findAll(Example<S> example, Sort sorty,

Post URL : https://reqres.in/api/login

PUT URL

STS zip file

Just download extract n run

Don't delete any folder that is created once extraction done open application

Data Structures
A data structure is a model where data is organized, managed and stored in a format that enables efficient access and modification of data.

Different forms of data may require different types of data structures.

A program built using improper data structures will be therefore inefficient or unnecessarily complex. It is necessary to have a good knowledge of data structures and understand where to use the best one.

Inbuilt Data Structures

Inbuilt data structures are provided by most programming languages. They may be used to derive other data structures.

Arrays
Stores elements of the same type in a contiguous block of memory, can accessed by a common identifier.
Visit Website
Open navigation menu
Data Structures Handbook
Data Structures
A data structure is a model where data is organized, managed and stored in a format that enables efficient access and modification of data.

Different forms of data may require different types of data structures.

A program built using improper data structures will be therefore inefficient or unnecessarily complex. It is necessary to have a good knowledge of data structures and understand where to use the best one.
Inbuilt Data Structures

Inbuilt data structures are provided by most programming languages. They may be used to derive other data structures.
Structures
Creates a data type that can be used to group items of different types into a single type.
Abstract Data Type (ADT)

Abstract Data Types are defined by its behaviour from the point of view of the user of the data. It defines it in terms of possible values, operations on data, and the behaviour of these operations.

The definition of ADT only mentions what operations are to be performed but not how these operations will be implemented. It does not specify how the data is being handled under the hood, this is known as abstraction.
Linked Lists
Consists of nodes, where each node points to some other node forming a sequence.
Stacks
The insertion and deletion operations are performed at only one end. It follows the LIFO principle.