Showing posts with label Java. Show all posts
Showing posts with label Java. Show all posts

Thursday 12 April 2018

A program to find SUM AND PRODUCT of a given Digit



class Sum_Product_ofDigit{
public static void main(String args[]){
int num = Integer.parseInt(args[0]);
//taking value as command line argument.
int temp = num,result=0;
//Logic for sum of digit
while(temp>0){
result = result + temp;
temp–;
}
System.out.println(“Sum of Digit for “+num+” is : “+result);
//Logic for product of digit
temp = num;
result = 1;
while(temp > 0){
result = result * temp;
temp–;
}
System.out.println(“Product of Digit for “+num+” is : “+result);
}
}

A program to display a greet message according to Marks obtained by student



class SwitchDemo{
public static void main(String args[]){
int marks = Integer.parseInt(args[0]); //take marks
as command line argument.
switch(marks/10){
case 10:
case 9:
case 8:
System.out.println(“Excellent”);
break;
case 7:
System.out.println(“Very Good”);
break;
case 6:
System.out.println(“Good”);
break;
case 5:
System.out.println(“Work Hard”);
break;
case 4:
System.out.println(“Poor”);
break;
case 3:
case 2:
case 1:
case 0:
System.out.println(“Very Poor”);
break;
default:
System.out.println(“Invalid value Entered”);
}
}
}

A Program that will read a float type value from the keyboard and print the following output



/*Small Integer not less than the number. Given Number. Largest Integer not greater than the number. */
class ValueFormat{
public static void main(String args[]){
double i = 34.32; //given number
System.out.println(“Small Integer not greater than the number :”+Math.ceil(i));
System.out.println(“Given Number : “+i);
System.out.println(“Largest Integer not greater than the number :”+Math.floor(i));
}

To Find Minimum of Two Numbers using conditional operator


/* To find minimum of 2 Numbers using ternary operator */
class Minoftwo{
public static void main(String args[]){
//taking value as command line argument. //Converting String format to Integer value
int i = Integer.parseInt(args[0]);
int j = Integer.parseInt(args[1]);
int result = (i<j)?i:j;
System.out.println(result+” is a minimum value”);
}
}

Find Maximum of Two Numbers



/* To Find Maximum of 2 Numbers using if else */
class Maxoftwo{
public static void main(String args[]){
 
//taking value as command line argument. //Converting String format to Integer value
 

int i = Integer.parseInt(args[0]);
int j = Integer.parseInt(args[1]);
if(i > j)
System.out.println(i+” is greater than “+j);
else
System.out.println(j+” is greater than “+i);
}
}

pyramid of numbers using for loops



/* Generate Pyramid For a Given Number Example This Java example shows how to generate a pyramid of numbers for given number using for loop example. */
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class GeneratePyramidExample {
public static void main (String[] args) throws Exception{
BufferedReader keyboard = new BufferedReader (new
InputStreamReader(System.in));
System.out.println(“Enter Number:”);
int as= Integer.parseInt (keyboard.readLine());
System.out.println(“Enter X:”);
int x= Integer.parseInt (keyboard.readLine());
int y = 0;
for(int i=0; i<= as ;i++){
16
for(int j=1; j <= i ; j++){
System.out.print(y + “\t”);
y = y + x;
}
System.out.println(“”);
}
}
}
/* Output of this example would be Enter Number: 5 Enter X: 1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ———————————————- Enter Number: 5 Enter X: 2 0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 ———————————————- Enter Number: 5 Enter X: 3 0 3 6 9 12 15 18 21 24 27 30 33 36 39 42 */

Factorial of a number using recursion


/*This program shows how to calculate Factorial of a number using recursion function. */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class JavaFactorialUsingRecursion {
public static void main(String args[]) throws NumberFormatException,
IOException{
System.out.println(“Enter the number: “);
//get input from the user
BufferedReader br=new BufferedReader(new
InputStreamReader(System.in));
int a = Integer.parseInt(br.readLine());
//call the recursive function to generate factorial
int result= fact(a);
System.out.println(“Factorial of the number is: ” + result);
}
static int fact(int b)
{
if(b <= 1)
//if the number is 1 then return 1
return 1;
else
//else call the same function with the value – 1
return b * fact(b-1);
}
}
/* Output of this Java example would be Enter the number: 5 Factorial of the number is: 120 */

Calculate Circle Area using radius


This program shows how to calculate
area of circle using it’s radius.
 
Example:-
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class CalculateCircleAreaExample {
public static void main(String[] args) {
int radius = 0;
System.out.println(“Please enter radius of a circle”);
try
{
//get the radius from console
BufferedReader br = new BufferedReader(new
InputStreamReader(System.in));
radius = Integer.parseInt(br.readLine());
}
//if invalid value was entered
catch(NumberFormatException ne)
{
System.out.println(“Invalid radius value” + ne);
System.exit(0);
}
catch(IOException ioe)
{
System.out.println(“IO Error :” + ioe);
System.exit(0);
}
/*
* Area of a circle is
* pi * r * r
* where r is a radius of a circle.
*/
//NOTE : use Math.PI constant to get value of pi
double area = Math.PI * radius * radius;
System.out.println(“Area of a circle is ” + area);
}
}

Output:-
Please enter radius of a circle
19
Area of a circle is 1134.1149479459152

Nested Switch


This example shows how to use nested switch statements in a
java program.
Example:-
public class NestedSwitchExample {
public static void main(String[] args) {
/*
* Like any other Java statements, switch statements
* can also be nested in each other as given in
* below example.
*/
int i = 0;
int j = 1;
switch(i)
{
case 0:
switch(j)
{
case 0:
System.out.println(“i is 0, j is 0”);
break;
case 1:
System.out.println(“i is 0, j is 1”);
break;
default:
System.out.println(“nested default
case!!”);
}
break;
default:
System.out.println(“No matching case found!!”);
}
}
}

Output:-
i is 0, j is 1

Reversed pyramid using for loops & decrements operator


Java Pyramid 5 Example
This Java Pyramid example shows how to generate pyramid or triangle
like given below using for loop.
12345
1234
123
12
1

Example:-
public class JavaPyramid5 {
public static void main(String[] args) {
for(int i=5; i>0 ;i–){
for(int j=0; j < i; j++){
System.out.print(j+1);
}
System.out.println(“”);
}
}
}

Output:-
12345
1234
123
12
1

Pyramid of stars using nested for loops


/*
Java Pyramid 1 Example
This Java Pyramid example shows how to generate pyramid or triangle
like given below using for loop.
*
**
***
****
*****
*/

Example:-
public class JavaPyramid1 {
public static void main(String[] args) {
for(int i=1; i<= 5 ;i++){
for(int j=0; j < i; j++){
System.out.print(“*”);
}
//generate a new line
System.out.println(“”);
}
}
}

Output:-
*
**
***
****
*****

Generate prime numbers between 1 & given number


Prime Numbers Java Example
This Prime Numbers Java example shows how to generate prime numbers
between 1 and given number using for loop.

Example:-
public class GeneratePrimeNumbersExample {
public static void main(String[] args) {
//define limit
int limit = 100;
System.out.println(“Prime numbers between 1 and ” + limit);
//loop through the numbers one by one
for(int i=1; i < 100; i++){
boolean isPrime = true;
//check to see if the number is prime
for(int j=2; j < i ; j++){
if(i % j == 0){
isPrime = false;
break;
}
}
// print the number
if(isPrime)
System.out.print(i + ” “);
}
}
}
Output:-
Prime numbers between 1 and 100
1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 8

Palindrome Number


/*
This program shows how to check for in the given list of numbers
whether each number is palindrome or not
*/
public class JavaPalindromeNumberExample {
public static void main(String[] args) {
//array of numbers to be checked
int numbers[] = new int[]{121,13,34,11,22,54};
//iterate through the numbers
for(int i=0; i < numbers.length; i++){
int number = numbers[i];
int reversedNumber = 0;
int temp=0;
/*
* If the number is equal to it’s reversed number, then
* the given number is a palindrome number.
*
* For ex,121 is a palindrome number while 12 is not.
*/
//reverse the number
while(number > 0){
temp = number % 10;
number = number / 10;
reversedNumber = reversedNumber * 10 + temp;
}
if(numbers[i] == reversedNumber)
System.out.println(numbers[i] + ” is a palindrome”);
else
System.out.println(numbers[i] + ” not a palindrome “);
}
}
}
/*
Output:-
121 is a palindrome number
13 is not a palindrome number
34 is not a palindrome number
11 is a palindrome number
22 is a palindrome number
54 is not a palindrome number
*/

Fibonacci Series


/* Fibonacci Series Java Example
This Fibonacci Series Java Example shows how to create and print
Fibonacci Series using Java.
*/
public class JavaFibonacciSeriesExample {
public static void main(String[] args) {
//number of elements to generate in a series
int limit = 20;
long[] series = new long[limit];
//create first 2 series elements
series[0] = 0;
series[1] = 1;
//create the Fibonacci series and store it in an array
for(int i=2; i < limit; i++){
series[i] = series[i-1] + series[i-2];
}
//print the Fibonacci series numbers
System.out.println(“Fibonacci Series upto ” + limit);
for(int i=0; i< limit; i++){
System.out.print(series[i] + ” “);
}
}
}
/*
Output:-
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181
*/

Compare Two Numbers using else-if


/*
Compare Two Numbers Java Example
This Compare Two Numbers Java Example shows how to compare two numbers
using if else if statements.
*/
public class CompareTwoNumbers {
public static void main(String[] args) {
//declare two numbers to compare
int num1 = 324;
int num2 = 234;
if(num1 > num2){
System.out.println(num1 + ” is greater than ” + num2);
}
else if(num1 < num2){
System.out.println(num1 + ” is less than ” + num2);
}
else{
System.out.println(num1 + ” is equal to ” + num2);
}
}
}
/*
Output:-
324 is greater than 234
*/

Factorial of a number


This program shows how to calculate Factorial of a number.
*/
public class NumberFactorial {
public static void main(String[] args) {
int number = 5;
/*
* Factorial of any number is! n.
* For example, factorial of 4 is 4*3*2*1.
*/
int factorial = number;
for(int i =(number – 1); i > 1; i–)
{
factorial = factorial * i;
}
System.out.println(“Factorial of a number is ” + factorial);
}
}
/*
Output of the Factorial program would be
Factorial of a number is 120
*/

Wednesday 11 April 2018

List of even numbers


List Even Numbers Java
This List Even Numbers Java Example shows how to find and list even
numbers between 1 and any given number.
 
*/
public class ListEvenNumbers {
public static void main(String[] args) {
//define limit
int limit = 50;
System.out.println(“Printing Even numbers between 1 and ” +
limit);
for(int i=1; i <= limit; i++){
// if the number is divisible by 2 then it is even
if( i % 2 == 0){
System.out.print(i + ” “);
}
}
}
}
/*
Output of List Even Numbers Java Example would be
Printing Even numbers between 1 and 50
2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50

Recursion


–>Recursion is a process in which a method calls itself continuously. 
A method in java that calls itself is called recursive method.

–>Syntax:-
returntype methodname()
{
//code to be executed
methodname();          //calling same method
}

Example:-
Public Class MyClass
{
// N!=N*(N-1)*(N-2)*………*1.
// 5=5*4*3*2*1
public static int factorial (int N)
{
if(N<=1)
return 1;
else (N*factorial(N-1));     //Call itself method
}
public static void main(string[] args)
System.out println(factorial(5));
}
}

Difference between ArrayList and LinkedList


ArrayList LinkedList
1) ArrayList internally uses dynamic array to store the elements. LinkedList internally uses doubly linked list to store the elements.
2) Manipulation with ArrayList is slow because it internally uses array. If any element is removed from the array, all the bits are shifted in memory. Manipulation with LinkedList is faster than ArrayList because it uses doubly linked list so no bit shifting is required in memory.
3) ArrayList class can act as a list only because it implements List only. LinkedList class can act as a list and queue both because it implements List and Deque interfaces.
4) ArrayList is better for storing and accessing data. LinkedList is better for manipulating data.
Example:-
 Public Class MyClass{
public static void main(String args[])
{
List<String> MyList=new ArrayList<String>();   //creating arraylist    
MyList.add(“Ravi”);        //Adding object in arraylist    
MyList.add(“Vijay”);
MyList.add(“Ravi”);
MyList.add(“Ajay”);
List<String> MyList2=new LinkedList<String>();       //creating linkedlist    
MyList2.add(“James”);     //adding object in linkedlist   
MyList2.add(“Serena”);
MyList2.add(“Swati”);
MyList2.add(“Junaid”);
System.out.println(“arraylist: “+MyList);
System.out.println(“linkedlist: “+MyList2);                                                                                            }

}

LinkList (Java)

Java Linked List class uses doubly linked list to store the elements.

The important points about Java Linked List are:
  • Java Linked List class can contain duplicate elements.
  • Java Linked List class maintains insertion order.
  • Java Linked List class is non synchronized.
  • In Java Linked List class, manipulation is fast because no shifting needs to be occurred.
  • Java Linked List class can be used as list, stack or queue.                                                            Syntax:-                                                                                                                                                      Link List<string>name=new Linked List<string>();                                                                                  {
………………………..    (Description)                                                                                                                                        }                                                                                                                                                                                Example:-
Public Class MyClass
{
pulic static void main(string[] args)
{
LinkList<string>name=new LinkedList<string>();
name.add(“ABC”);      //Add a name in LinkList
name.add(“PQR”);     //Add a name in LinkList
name.add(“XYZ”);     //Add a name in LinkList
for(string:name)
System.out.println(x);
name.addfirst(“Jack”);     //Add First name in LinkList.
name.addlast(“Zack”);     //Add Last name in LinkList.
name.removelast();            //Remove  First name in LinkList.
name.removefirst();         // Remove Last name in LinkList.
name.clear();                    //Delete all the data in LinkList.
System.out.println(name.size());
name.add(index,”element”);      //This is a syntax for add a variable of particular position in LinkList.
name.add(2,”Index”);
name.remove(2);     // Remove a variable of particular position in LinkList
name.set(1,”a”);  //Change a name as particular index.
}
}

Popular Posts

Categories

AI (27) Android (24) AngularJS (1) Assembly Language (2) aws (17) Azure (7) BI (10) book (4) Books (115) C (77) C# (12) C++ (82) Course (62) Coursera (179) coursewra (1) Cybersecurity (22) data management (11) Data Science (91) Data Strucures (6) Deep Learning (9) Django (6) Downloads (3) edx (2) Engineering (14) Excel (13) Factorial (1) Finance (5) flutter (1) FPL (17) Google (19) Hadoop (3) HTML&CSS (46) IBM (25) IoT (1) IS (25) Java (92) Leet Code (4) Machine Learning (44) Meta (18) MICHIGAN (5) microsoft (3) Pandas (3) PHP (20) Projects (29) Python (747) Python Coding Challenge (211) Questions (2) R (70) React (6) Scripting (1) security (3) Selenium Webdriver (2) Software (17) SQL (40) UX Research (1) web application (8)

Followers

Person climbing a staircase. Learn Data Science from Scratch: online program with 21 courses