Core Java Tutorials

  • Introduction and Overview of Java Programming
  • Welcome to the Core Java Tutorials series, be here for couple of weeks and follow the series step by step. You guys are going to view one of the best content over internet as if today. Let?s start our journey to be a Core Java expert by following this Java Programming Tutorials series.


  • Install Java and Environment Setup on Windows, Linux or Mac OS
  • In previous article we saw What is Java? Where and Why to use Java? And features of Java programming language. In this particular article we will see how to setup Java environment in local machine.


  • Create a Java Project in Maven and import it in Eclipse IDE
  • In this particular blog we will discuss ?How to create a Java Project in Maven?, ?Import maven java project in eclipse ?. and ?create a jar from java maven project?.


  • Java Basic Syntax and Hello World Example
  • Java is a simple and easy to understand programming language, most of its syntax is inherited from c and c++. In Java, classes are the root of each program written, everything goes under a class.


  • Datatypes and Variables in Java Programming
  • In general programming terms a variable is a symbolic name that points to some reserved storage location. Every storage location that is pointed by a variable can consists of some value or it can be empty, that means a variable is an identifier for some value so that the operations can be performed on that value.


More articles from: Core Java Tutorials

Java Programming Tutorials

More articles from: Java Programming Tutorials

Java Persistence API (JPA) Tutorials

  • JPA one to one mapping with annotation (Java persistence API)
  • n a bi-directional one to one mapping, both sides are responsibve for managing the relationship and hence both entities must have each other's instances setted to their instance using getters and setters, failing so will end up inserting a null in the db foreign key columns and one could not be able to get other object's details with one object.


  • JPA one to many mapping with annotation (Java persistence API)
  • In previous article we have seen, how to configure one to one mapping in JPA in both unidirectional and bidirectional way. In this article we will see how yo configure one to many mappings in JPA using annotations.


  • JPA many to many mapping with annotation (Java persistence API)
  • In previous articles we have seen one to one and one to many mappings in JPA. In this article we will see how to configure and use Many to Many mappings in JPA.


  • JPA Inheritance Strategies using annotations - Table per hierarchy
  • In our previous articles we have seen, one to one, many to one and many to many mappings, in this article we will see how to map a inheritance class structures with JPA. There are three major strategies for doing this. 1) Table per hierarchy 2) Table per concrete class 3) Table per subclass


  • JPA Inheritance Strategies using annotations - Table per concrete class
  • In our previous articles we have seen, one to one, many to one and many to many mappings, in this article we will see how to map a inheritance class structures with JPA. There are three major strategies for doing this. 1) Table per hierarchy 2) Table per concrete class 3) Table per subclass


Spring Framework Tutorials

More articles from: Spring Framework Tutorials

Java 8 Tutorials

More articles from: Java 8 Tutorials

JSP & Servlet Tutorials

More articles from: JSP & Servlet Tutorials

Hibernate Tutorials

More articles from: Hibernate Tutorials

Java Interview Questions

More articles from: Java Interview Questions

Spring Boot Tutorials

More articles from: Spring Boot Tutorials

Data Structure & Algorithms

  • Insertion sort algorithm
  • Insertion sort algorithm is a simple sorting algorithm that works the way we sort playing cards in our hands and builds the final sorted array one item at a time.


  • Bubble sort algorithm
  • Bubble Sort is the simplest sorting algorithm, where array is traversed from first element to last element to repeatedly swap the adjacent elements if they are in wrong order.


  • Selection sort algorithm
  • Selection Sort is one of the simplest sorting algorithm, where array is traversed from first element to last element to repeatedly find the minimum element. In this way the array is divided into two sub-arrays sorted and unsorted, in each pass one element is added to sorted array from unsorted array.


  • Quick Sort algorithm
  • QuickSort is a Divide and Conquer algorithm having an average O(n log n) time complexity, it's one of the most used sorting algorithms, especially in sort() functions of almost all programming languages library.


  • Merge Sort algorithm
  • Merge Sort is one of the most efficient, Divide and Conquer sorting algorithms having an O(n log n) time complexity in all cases. In most implementations Merge Sort produce a stable sort.


More articles from: Data Structure & Algorithms

Like Us

Other Sections

Database

Database Tutorials, Interview Quest...

Big Data and No Sql

Cassndra, Redis, Spark, Hadoop, Map...

Python

Python Tutorials, Interview Questio...

Top Sections