User defined methods in java: Functions are called methods in java. Like in C, java programming has similar user defined methods. There are basically four types of user defined methods. They’re: Methods with parameter and with return typeMethods with parameter and without return typeMethods without parameter and with return typeMethods without parameter and without return

Break and continue statement in java : Like goto statement in c, there is break and continue statement to transfer control in the program. Whenever certain condition matches in the code, you may won’t to transfer your code’s flow to some other parts of the code. In such scenario, we use break and continue statement.

Java Program to find Prime Number : Prime Number is a positive integer number that is divisible by only two numbers, that is 1 and the number itself. Note: 1 is not a prime number as it isn’t divisible by two number. The prime numbers are 2, 3, 5, 7, 11……. Prime Numbers Java Program

C Programming for beginners. C is a high level and general purpose programming language that is fast, portable and available in all platforms. It is a procedural programming language which was initially developed by Dennis Ritchie between 1969 and 1973. The main features of C language include low-level access to memory, simple set of keywords,

Postman to test REST API. We’ve created REST API in our previous tutorial. Now we’re going to test our REST API using postman. You can download postman from here. After downloading postman, you’ll get something like this. Note: make sure you’ve successfully deployed EJB-JPA-CRUD-Rest in glassfish server. Before using postman, know the some HTTP methods. GET

In this tutorial, you’ll learn how to develop Rest API with EJB, JPA and CRUD operation. Before going through this tutorial make sure you’ve gone through my previous tutorial. In the previous tutorial, I’ve clearly mentioned how to use glassfish server and make connection pools, and as well as using Sqlyog Database. After this tutorial, I’ll

The fundamental theorem of arithmetic states that every natural number greater than 1 can be written as a unique product of prime numbers. So, for instance, 6936=2*2*2*3*17*17. A method named encodeNumber will encode a number n as an array that contains the prime numbers that, when multipled together, will equal n. So encodeNumber(6936) would return

A number n>0 is called cube-powerful if it is equal to the sum of the cubes of its digits. Examples: if n is return because 153 1 because 153 = 13 + 53 + 33 370 1 because 370 = 33 + 73 + 03 371 1 because 371 = 33 + 73 + 13

A factor that is a prime number is prime factor. A function named largestPrimeFactor that will return the largest prime factor of a number. If the number is <=1 it should return 0. Recall that a prime number is a number > 1 that is divisible only by 1 and itself, e.g., 13 is prime

A function named largestAdjacentSum that iterates through an array computing the sum of adjacent elements and returning the largest such sum. Examples: if a is return {1, 2, 3, 4} 7 because 3+4 is larger than either 1+2 or 2+3 {18, -12, 9, -10} 6 because 18-12 is larger than -12+9 or 9-10 {1,1,1,1,1,1,1,1,1} 2