Do you want to know how to develop your skillset to become a Java Rockstar?

Subscribe to our newsletter to start Rocking right now!

To get you started we give you our best selling eBooks for FREE!

 

1. JPA Mini Book

2. JVM Troubleshooting Guide

3. JUnit Tutorial for Unit Testing

4. Java Annotations Tutorial

5. Java Interview Questions

 

and many more ....

 

 

Insertion Sort Java Example

In this article, we will learn about the sorting algorithm, specifically the Insertion sort Java algorithm. We will look at what Insertion sort is and how does it work. We will discuss when this performs the best and when it performs the worst and will also look into the time and space complexity of it. 1. Introduction Sorting refers to ...

Read More »

Is Java Safe ?

Is Java Safe to install and download to any version of Windows and mostly at Windows 10 version? Nearly half of the enterprise applications written in Java in the last 15 years making it the ubiquitous language in the enterprise world. Being so popular means applications written in Java are more prone to security threats. So we can answer the ...

Read More »

Java Float Datatype Example

In Java, the Float class wraps a value of primitive type float in an object. An object of type Float contains a single field whose type is float. In addition, this class provides several methods for converting a float to a String and a String to float, as well as other constants and methods useful when dealing with float. Let ...

Read More »

Java Hash Example

In this post, we feature a comprehensive article on Java Hash. We shall explain what are hashes in Java and how to use them in a data structure called Map. Table Of Contents 1. What is a hash 2. When we should use a hash 3. Hashing in Java 3.1 Deprecated map data structures 3.2 HashMap 3.3 Other Map types ...

Read More »

Redis in Microservices Architecture Example

This post features a comprehensive tutorial with code examples on Redis in Microservices Architecture. 1. Redis – A brief overview Redis is an open source, in-memory data structure store, used as a database, cache and message broker. Fig. 1. Redis in Microservices It supports data structures such as strings, hashes, lists, sets, sorted sets with range queries, bitmaps, hyperloglogs, geospatial ...

Read More »

Java this Keyword Example

In this article, we will try to understand the Java this keyword with the help of examples. this, self, and Me are keywords used in some computer programming languages to refer to the object, class, or other entity of which the currently running code is a part. The entity referred to by these keywords thus depends on the execution context (such as which object is having its method called). ...

Read More »

How to download and install Java plugin in a browser

Java plugins are nothing but the Java Applets. Java Applets are the small Java applications delivered to users in the form of Java byte code. Typically applets are delivered through web browsers. Once applets are downloaded they run in as a separate process from the browser. They can be run in a separate browser frame or Java AppletViewer or standalone ...

Read More »

Introduction to Monolithic Architecture

In this article, we will discuss the characteristics of a monolithic architecture. 1. Introduction We’ve heard about microservices and how they allow for a more agile software development approach to developing applications. However, there are still many software projects that use a monolithic architecture when developing an application. In fact, many microservices projects started out as monolithic applications. Let’s take ...

Read More »

Java Snake Game Example

1. Introduction In this post, we look at how to develop and design a Snake Game with Eclipse using Java and Java Swing. Eclipse setup is also included in this article. 2. Java Snake Game Example The snake game was created back in 1970. In 1980, a new version of the snake game evolved. In the 1990s, Nokia had this ...

Read More »

Selection Sort Java Example

1. Introduction Selection sort Java ‘s simple algorithm can divide the array into sorted and unsorted parts. Initially, the sorted part is empty; the unsorted part is the entire array. It starts by finding the smallest element from the unsorted part and swaps it with the left-most element of the unsorted part. Each finding reduces the unsorted part by one. ...

Read More »