From c373383ceefa76a470772b98a596a2972a337c3c Mon Sep 17 00:00:00 2001 From: Bambang Supriadi Date: Mon, 26 Oct 2020 19:55:30 +0700 Subject: [PATCH 01/13] added palindrome checker program --- palindrome-checker.java | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 palindrome-checker.java diff --git a/palindrome-checker.java b/palindrome-checker.java new file mode 100644 index 0000000..705ce89 --- /dev/null +++ b/palindrome-checker.java @@ -0,0 +1,24 @@ +import java.util.Scanner; +class PalindromeExample +{ + public static void main(String args[]) + { + int r,sum=0,temp; + int n; + + Scanner sc = new Scanner(System.in); + System.out.println("Enter the number:"); + n = sc.nextInt(); + temp=n; + while(n>0) + { + r=n%10; + sum=(sum*10)+r; + n=n/10; + } + if(temp==sum) + System.out.println("palindrome number "); + else + System.out.println("not palindrome"); + } +} From 434a66c79e6932048a97982858ffd45029fb3c07 Mon Sep 17 00:00:00 2001 From: Dikshit Kaushal Date: Tue, 27 Oct 2020 11:17:15 +0530 Subject: [PATCH 02/13] Post_order_tree_traversal program --- Postordertraversal.java | 54 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 Postordertraversal.java diff --git a/Postordertraversal.java b/Postordertraversal.java new file mode 100644 index 0000000..2ecdd71 --- /dev/null +++ b/Postordertraversal.java @@ -0,0 +1,54 @@ +# https://www.facebook.com/dikshit.kaushal.564/posts/103324861581146 +# Subscribed By Dikshit Kaushal + +class Node { + int item; + Node left, right; + + public Node(int key) { + item = key; + left = right = null; + } +} + +class Tree { + // Root of Binary Tree + Node root; + + Tree() { + root = null; + } + + void postorder(Node node) { + if (node == null) + return; + + // traverse the left child + postorder(node.left); + + // traverse the right child + postorder(node.right); + + // traverse the root node + System.out.print(node.item + "->"); + } + + public static void main(String[] args) { + + // create an object of Tree + Tree tree = new Tree(); + + // create nodes of the tree + tree.root = new Node(1); + tree.root.left = new Node(12); + tree.root.right = new Node(9); + + // child nodes of left child + tree.root.left.left = new Node(5); + tree.root.left.right = new Node(6); + + // postorder tree traversal + System.out.println("Postorder traversal"); + tree.postorder(tree.root); + } +} From 03cb318729c6421b230a9c8422e960f1e2306ad8 Mon Sep 17 00:00:00 2001 From: sjain117 <60775494+sjain117@users.noreply.github.com> Date: Thu, 29 Oct 2020 18:53:26 +0530 Subject: [PATCH 03/13] added complex number program using java --- complex_number.java | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 complex_number.java diff --git a/complex_number.java b/complex_number.java new file mode 100644 index 0000000..a4391fd --- /dev/null +++ b/complex_number.java @@ -0,0 +1,31 @@ +#https://www.facebook.com/shruti.buchha.7/posts/3341900509242443 +#subscribed by shruti buchha +import java.util.*; +import java.lang.*; +import java.io.*; +public class ComplexNumber{ + + double real, img; + + ComplexNumber(double r, double i){ + this.real = r; + this.img = i; + } + + public static ComplexNumber sum(ComplexNumber c1, ComplexNumber c2) + { + + ComplexNumber temp = new ComplexNumber(0, 0); + + temp.real = c1.real + c2.real; + temp.img = c1.img + c2.img; + + return temp; + } + public static void main(String args[]) { + ComplexNumber c1 = new ComplexNumber(5.5, 4); + ComplexNumber c2 = new ComplexNumber(1.2, 3.5); + ComplexNumber temp = sum(c1, c2); + System.out.printf("Sum is: "+ temp.real+" + "+ temp.img +"i"); + } +} From 2f7f332b783481ade75902e27b0b53e0f879f62c Mon Sep 17 00:00:00 2001 From: Srishti Agrawal Date: Thu, 29 Oct 2020 18:57:19 +0530 Subject: [PATCH 04/13] Added Pallindrome --- Palindrome | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 Palindrome diff --git a/Palindrome b/Palindrome new file mode 100644 index 0000000..00f167d --- /dev/null +++ b/Palindrome @@ -0,0 +1,21 @@ +//https://www.facebook.com/srishti.agrawal.714/posts/162113345582696 +//Subscribed by Code House +import java.util.Scanner; +class Palindrome { + public static void main(String args[]) { + Scanner input=new Scanner(System.in); + int rem,sum=0,rev; + int n=input.nextInt();//It is the number variable to be checked for palindrome + + rev=n; + while(n>0) { + rem=n%10; //getting remainder + sum=(sum*10)+rem; + n=n/10; + } + if(rev==sum) + System.out.println("It is a palindrome number "); + else + System.out.println("It is not a palindrome number"); +} +} From b492ecaf06cf7b1f1d97af49a313357da4b1dee0 Mon Sep 17 00:00:00 2001 From: Srishti Agrawal Date: Thu, 29 Oct 2020 19:47:58 +0530 Subject: [PATCH 05/13] Factorial --- Factorial | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 Factorial diff --git a/Factorial b/Factorial new file mode 100644 index 0000000..6b6ee15 --- /dev/null +++ b/Factorial @@ -0,0 +1,13 @@ +//https://www.facebook.com/srishti.agrawal.714/posts/162113345582696 +//Subscribed by Srishti Agrawal +public class Factorial +{ + public static void main(String[] args) + { + int n=Integer.parseInt(args[0]); + int f=1; + for(int i=1;i<=n;i++) + f*=i; + System.out.println("Factorial is "+ f); + } +} From 0147e93a39dfbbc3316f212398f2187b78bff93a Mon Sep 17 00:00:00 2001 From: RaudraWarrior007 <45724841+RaudraWarrior007@users.noreply.github.com> Date: Sat, 31 Oct 2020 22:47:03 +0530 Subject: [PATCH 06/13] Create Hello World --- HelloWorld | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 HelloWorld diff --git a/HelloWorld b/HelloWorld new file mode 100644 index 0000000..e1a0fdb --- /dev/null +++ b/HelloWorld @@ -0,0 +1,5 @@ +class HelloWorld { + public static void main(String[] args) { + System.out.println("Hello, World!"); + } +} From 66800be3150d0011b834867a3e12f91eddc53f23 Mon Sep 17 00:00:00 2001 From: RaudraWarrior007 <45724841+RaudraWarrior007@users.noreply.github.com> Date: Sat, 31 Oct 2020 22:50:25 +0530 Subject: [PATCH 07/13] Create PrimeNumber --- CheckPrimeNumber | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 CheckPrimeNumber diff --git a/CheckPrimeNumber b/CheckPrimeNumber new file mode 100644 index 0000000..f7f0b9e --- /dev/null +++ b/CheckPrimeNumber @@ -0,0 +1,19 @@ +public class PrimeExample{ + public static void main(String args[]){ + int i,m=0,flag=0; + int n=3;//it is the number to be checked + m=n/2; + if(n==0||n==1){ + System.out.println(n+" is not prime number"); + }else{ + for(i=2;i<=m;i++){ + if(n%i==0){ + System.out.println(n+" is not prime number"); + flag=1; + break; + } + } + if(flag==0) { System.out.println(n+" is prime number"); } + }//end of else +} +} From 4ada693028db246de8dcf793fa4778b55d67963e Mon Sep 17 00:00:00 2001 From: RaudraWarrior007 <45724841+RaudraWarrior007@users.noreply.github.com> Date: Sat, 31 Oct 2020 22:52:49 +0530 Subject: [PATCH 08/13] Create Fibonacci Series --- Fibonacci Series | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Fibonacci Series diff --git a/Fibonacci Series b/Fibonacci Series new file mode 100644 index 0000000..e0f0779 --- /dev/null +++ b/Fibonacci Series @@ -0,0 +1,17 @@ +public class Fibonacci { + + public static void main(String[] args) { + + int n = 10, t1 = 0, t2 = 1; + System.out.print("First " + n + " terms: "); + + for (int i = 1; i <= n; ++i) + { + System.out.print(t1 + " + "); + + int sum = t1 + t2; + t1 = t2; + t2 = sum; + } + } +} From a4720c5590fb3bfbf5ce42d62c5d52a4afb00b97 Mon Sep 17 00:00:00 2001 From: RaudraWarrior007 <45724841+RaudraWarrior007@users.noreply.github.com> Date: Sat, 31 Oct 2020 22:55:10 +0530 Subject: [PATCH 09/13] Create Factorial in java --- FactorialProgram | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 FactorialProgram diff --git a/FactorialProgram b/FactorialProgram new file mode 100644 index 0000000..335fbca --- /dev/null +++ b/FactorialProgram @@ -0,0 +1,10 @@ +class FactorialExample{ + public static void main(String args[]){ + int i,fact=1; + int number=5;//It is the number to calculate factorial + for(i=1;i<=number;i++){ + fact=fact*i; + } + System.out.println("Factorial of "+number+" is: "+fact); + } +} From aa7ac635262f378a2eabfc31ef8dc77bb57cad6c Mon Sep 17 00:00:00 2001 From: cjwarrior7 <51403051+cjwarrior7@users.noreply.github.com> Date: Sat, 31 Oct 2020 23:20:07 +0530 Subject: [PATCH 10/13] Create Reverse String in java --- Reverse | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 Reverse diff --git a/Reverse b/Reverse new file mode 100644 index 0000000..bbaaa75 --- /dev/null +++ b/Reverse @@ -0,0 +1,21 @@ +public class JavaReverseString { + + public static void main(String[] args) { + System.out.println(reverseString("abc")); + System.out.println(reverseString("123!@#098*")); + } + + public static String reverseString(String in) { + if (in == null) + return null; + StringBuilder out = new StringBuilder(); + + int length = in.length(); + + for (int i = length - 1; i >= 0; i--) { + out.append(in.charAt(i)); + } + + return out.toString(); + } +} From fbf755dfece1fb8b6fbded5594fe235bfe560541 Mon Sep 17 00:00:00 2001 From: cjwarrior7 <51403051+cjwarrior7@users.noreply.github.com> Date: Sat, 31 Oct 2020 23:21:47 +0530 Subject: [PATCH 11/13] Create Fibonacci Series --- Fibonacci | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Fibonacci diff --git a/Fibonacci b/Fibonacci new file mode 100644 index 0000000..52aa8eb --- /dev/null +++ b/Fibonacci @@ -0,0 +1,19 @@ +public class FibonacciSeries { + + public static void main(String[] args) { + printFibonacciSeries(10); + } + + public static void printFibonacciSeries(int count) { + int a = 0; + int b = 1; + int c = 1; + for (int i = 1; i <= count; i++) { + System.out.print(a + ", "); + a = b; + b = c; + c = a + b; + } + + } +} From 211fc2b03af659f89df383e90fc833b1a2f5905d Mon Sep 17 00:00:00 2001 From: cjwarrior7 <51403051+cjwarrior7@users.noreply.github.com> Date: Sat, 31 Oct 2020 23:25:18 +0530 Subject: [PATCH 12/13] Create Area&CircumfrenceofCircle --- Area&CircumfrenceofCircle | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Area&CircumfrenceofCircle diff --git a/Area&CircumfrenceofCircle b/Area&CircumfrenceofCircle new file mode 100644 index 0000000..2a96580 --- /dev/null +++ b/Area&CircumfrenceofCircle @@ -0,0 +1,19 @@ +import java.util.Scanner; +class CircleDemo +{ + static Scanner sc = new Scanner(System.in); + public static void main(String args[]) + { + System.out.print("Enter the radius: "); + /*We are storing the entered radius in double + * because a user can enter radius in decimals + */ + double radius = sc.nextDouble(); + //Area = PI*radius*radius + double area = Math.PI * (radius * radius); + System.out.println("The area of circle is: " + area); + //Circumference = 2*PI*radius + double circumference= Math.PI * 2*radius; + System.out.println( "The circumference of the circle is:"+circumference) ; + } +} From 18b0e5cb2d80438d76b6d85b5109b0777486770a Mon Sep 17 00:00:00 2001 From: cjwarrior7 <51403051+cjwarrior7@users.noreply.github.com> Date: Sat, 31 Oct 2020 23:28:34 +0530 Subject: [PATCH 13/13] Create MyHelloWorld --- MyHelloWorld | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 MyHelloWorld diff --git a/MyHelloWorld b/MyHelloWorld new file mode 100644 index 0000000..e1a0fdb --- /dev/null +++ b/MyHelloWorld @@ -0,0 +1,5 @@ +class HelloWorld { + public static void main(String[] args) { + System.out.println("Hello, World!"); + } +}