Home » Core Java

Core Java

Java HTTPS Client

Bipartite Graph

Hello. In this tutorial, we will make an https client call from java and log the output on the console. 1. Introduction Java8 programming language supports for TLS 1.2 version where TLS defines the transport-level security and is a successor to the SSL (Secure sockets layer) protocol. It is a cryptographic protocol designed to provide secure communication over the computer ...

Read More »

Tree Map in Java

Bipartite Graph

1. Introduction A Tree Map is a red-black tree-based NavigableMap implementation. A NavigableMap is a SortedMap with some navigation methods – this returns the closest match for given search targets. The sorting is done according to the natural ordering of the keys present in the map. If a Comparator is provided at the creation time then it overrides the natural ...

Read More »

How to use Spies in Mockito

Hello. In this tutorial, we will understand Spy in Mockito. As stubbing is now obsolete I will focus @Spy annotation in this tutorial. 1. Introduction Mockito is a popular framework used to mock the interfaces or classes so that dummy functionality can be added during the unit testing. It is a java based library that helps simplify the test-cases development ...

Read More »

Convert Hex to/from ASCII in Java

Bipartite Graph

Hello. In this tutorial, we will explore HEX to/from ASCII conversion in Java. 1. Introduction In order to convert ASCII to hexadecimal values in Java is done in the following steps – Covert the string to the character array Convert each string to an integer Convert each integer value to toHexString() Hex to ASCII conversion in Java is done in ...

Read More »

Infinite loop in Java

1. Introduction This is an in-depth article related to the Infinite loop in java. Infinite loop is a task which loops without any stopping condition. Typically this happens as an error or intentional requirement. This can be achieved or happens in a for, while, and do while loops. A loop has a start and end condition. Infinite loops do not ...

Read More »

How to find a Bipartite Graph?

Bipartite Graph

Hello there, in this article we will show how to find if a graph is a Bipartite Graph through detailed examples. 1. Introduction In this article, we will define a bipartite graph, explore the properties of a bipartite graph, document an algorithm used to determine whether a graph is bipartite or not, and implement this algorithm in Java. Finally, we ...

Read More »

Top 20 Spring-boot interview questions

Bipartite Graph

1. Introduction Due to the content of this article, in the first section, I will start with a brief introduction about Spring and Spring-Boot framework, what are these frameworks and where to use them. Millions of developers are using Spring and Spring-Boot widely. 1.1. Spring Firstly, let’s start with a brief introduction to Spring frameworks which is a programming and ...

Read More »

Java Logging with MDC

Bipartite Graph

In this article, we will show you how to use MDC logging in java using detailed examples and suggestions. 1. Introduction Most of the current real-world applications have more than one client. These clients talk to the servers simultaneously. In a typical scenario on the server we will have different threads dealing with these separate clients. One way to separate ...

Read More »

Radix Sort in Java

Bipartite Graph

1. Introduction Sorting algorithms were devised in order to make the ordering of elements of a list or array possible. There are many available to choose from, such as Bubble Sort, Quick Sort, Selection Sort, Heap Sort, Merge Sort, just to name a few. Radix Sort is a sorting algorithm that just happens to be fairly efficient. This article will ...

Read More »

Master Theorem

Bipartite Graph

1. Introduction An algorithm is a well-defined instruction set designed to solve a particular problem for the given input data sets Master theorem refers to the fact that you can solve a problem in a divide-and-conquer way to provide an asymptotic analysis. We can use this in the analysis of many divide and conquer algorithms. This algorithm was firstly presented ...

Read More »