Anonymous Quiz
43%
.java
42%
.class
9%
.exe
6%
.byc
Forwarded from TechShiksha by Badkul Technology
Can you write a program to rotate array by one place? Example below
Input 1 2 3 4 5 6 7
Output 2 3 4 5 6 7 1
Input 1 2 3 4 5 6 7
Output 2 3 4 5 6 7 1
Anonymous Poll
56%
Yes
22%
No
23%
Share solution video
👍1😁1
Forwarded from TechShiksha by Badkul Technology
YouTube
Rotate Array N Times | Learn java programming from beginning.
This video explains How to Rotate an Array in Java N times
Basic java playlist.
https://www.youtube.com/watch?v=xDLoM-ab--g&list=PLqDGM2q_T_BxGzXiCntA67UzhMfk2Nlgp
If you face any problem post that in comment section or post that in below telegram channel.…
Basic java playlist.
https://www.youtube.com/watch?v=xDLoM-ab--g&list=PLqDGM2q_T_BxGzXiCntA67UzhMfk2Nlgp
If you face any problem post that in comment section or post that in below telegram channel.…
#Quiz_Java (Question - 90)
How much memory does short data type consume (in bytes)? Note :- 1byte = 8bits
How much memory does short data type consume (in bytes)? Note :- 1byte = 8bits
Anonymous Quiz
28%
4
20%
1
31%
2
21%
8
/* Question - 04
Java Program To Find Given Number Is Armstrong Number Or Not
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num,Rem,Sum=0,Var;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Number :");
Num = s.nextInt();
Var = Num;
while(Num!=0) {
Rem = Num%10;
Sum = Sum+Rem*Rem*Rem;
Num = Num/10;
}
if(Sum==Var)
{
System.out.println(Var+" Is A Armstrong Number");
}
else
{
System.out.println(Var+" Is Not A Armstrong Number");
}
}
}
Java Program To Find Given Number Is Armstrong Number Or Not
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num,Rem,Sum=0,Var;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Number :");
Num = s.nextInt();
Var = Num;
while(Num!=0) {
Rem = Num%10;
Sum = Sum+Rem*Rem*Rem;
Num = Num/10;
}
if(Sum==Var)
{
System.out.println(Var+" Is A Armstrong Number");
}
else
{
System.out.println(Var+" Is Not A Armstrong Number");
}
}
}
👍3
/* Question - 05
Java Program To Find The Sum Of Digits Of A Given Number
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num,Rem,Sum=0;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Number :");
Num = s.nextInt();
while(Num!=0) {
Rem = Num%10;
Sum = Sum+Rem;
Num = Num/10;
}
System.out.println("Sum Of Digits Of A Number :"+Sum);
}
}
Java Program To Find The Sum Of Digits Of A Given Number
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num,Rem,Sum=0;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Number :");
Num = s.nextInt();
while(Num!=0) {
Rem = Num%10;
Sum = Sum+Rem;
Num = Num/10;
}
System.out.println("Sum Of Digits Of A Number :"+Sum);
}
}
👍4
/* Question - 07
Java Program To Find Whether The Given Number Is Prefect Number Or Not
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num,Count=0,Sum=0,Var;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Number :");
Num = s.nextInt();
Var = Num;
for(int i=1;i<Num;i++)
{
if(Num%i==0)
{
Sum = Sum + i;
}
}
if(Sum==Var)
{
System.out.println(Num+" Is A Perfect Number");
}
else
{
System.out.println(Num+" Is Not A Perfect Number");
}
}
}
Java Program To Find Whether The Given Number Is Prefect Number Or Not
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num,Count=0,Sum=0,Var;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Number :");
Num = s.nextInt();
Var = Num;
for(int i=1;i<Num;i++)
{
if(Num%i==0)
{
Sum = Sum + i;
}
}
if(Sum==Var)
{
System.out.println(Num+" Is A Perfect Number");
}
else
{
System.out.println(Num+" Is Not A Perfect Number");
}
}
}
👍2
/* Question - 06
Java Program To Find Quadratic Equations
*/
package ABC;
import java.lang.Math;
import java.util.*;
public class Main {
public static void main(String[] args) {
double A,B,C;
double P,Q;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Value Of A :");
A = s.nextDouble();
System.out.print("Enter The Value Of B :");
B = s.nextDouble();
System.out.print("Enter The Value Of C :");
C = s.nextDouble();
double discrement = B*B-4*A*C;
if(discrement>0)
{
P = ((-B+Math.sqrt(discrement))/2*A);
Q = ((-B-Math.sqrt(discrement))/2*A);
System.out.printf("The Quadratic Equations Are P:"+P+" Q:"+Q);
}
else if (discrement == 0.0)
{
double r1 = -B / (2.0 * A);
System.out.println("The root is " + r1);
}
else
{
System.out.println("Roots are not real.");
}
}
}
Java Program To Find Quadratic Equations
*/
package ABC;
import java.lang.Math;
import java.util.*;
public class Main {
public static void main(String[] args) {
double A,B,C;
double P,Q;
Scanner s = new Scanner(System.in);
System.out.print("Enter The Value Of A :");
A = s.nextDouble();
System.out.print("Enter The Value Of B :");
B = s.nextDouble();
System.out.print("Enter The Value Of C :");
C = s.nextDouble();
double discrement = B*B-4*A*C;
if(discrement>0)
{
P = ((-B+Math.sqrt(discrement))/2*A);
Q = ((-B-Math.sqrt(discrement))/2*A);
System.out.printf("The Quadratic Equations Are P:"+P+" Q:"+Q);
}
else if (discrement == 0.0)
{
double r1 = -B / (2.0 * A);
System.out.println("The root is " + r1);
}
else
{
System.out.println("Roots are not real.");
}
}
}
👍1
Forwarded from TechShiksha by Badkul Technology
YouTube
Rotate Array N Times | Learn java programming from beginning.
This video explains How to Rotate an Array in Java N times
Basic java playlist.
https://www.youtube.com/watch?v=xDLoM-ab--g&list=PLqDGM2q_T_BxGzXiCntA67UzhMfk2Nlgp
If you face any problem post that in comment section or post that in below telegram channel.…
Basic java playlist.
https://www.youtube.com/watch?v=xDLoM-ab--g&list=PLqDGM2q_T_BxGzXiCntA67UzhMfk2Nlgp
If you face any problem post that in comment section or post that in below telegram channel.…
Anonymous Quiz
6%
char
36%
boolean
54%
String
5%
float
Next in our written exam solution series
Sherlock number this was asked in Mindtree 21st and 22nd Feb
https://youtu.be/H-COtpDvupo
Sherlock number this was asked in Mindtree 21st and 22nd Feb
https://youtu.be/H-COtpDvupo
YouTube
Sherlock Number | Learn java programming from beginning.
This video explains How to check if a number is Sherlock number or not
Basic java playlist.
https://www.youtube.com/watch?v=xDLoM-ab--g&list=PLqDGM2q_T_BxGzXiCntA67UzhMfk2Nlgp
If you face any problem post that in comment section or post that in below telegram…
Basic java playlist.
https://www.youtube.com/watch?v=xDLoM-ab--g&list=PLqDGM2q_T_BxGzXiCntA67UzhMfk2Nlgp
If you face any problem post that in comment section or post that in below telegram…
Forwarded from Java programming for beginners
👍1
Anonymous Quiz
26%
concatenate()
57%
concat()
12%
add()
5%
merge()
/* Question - 19
Java Program To Find Fibonacci Series
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num1=0,Num2=1,Num3,Total_Num;
Scanner S = new Scanner(System.in);
System.out.print("Fibonacci Series Upto :");
Total_Num = S.nextInt();
for(int i=1;i<=Total_Num;++i)
{
System.out.print(Num1+",");
// Printing The Next Terms
Num3 = Num1 + Num2;
Num1 = Num2;
Num2 = Num3;
}
}
}
Java Program To Find Fibonacci Series
*/
package ABC;
import java.util.*;
public class Main {
public static void main(String[] args) {
int Num1=0,Num2=1,Num3,Total_Num;
Scanner S = new Scanner(System.in);
System.out.print("Fibonacci Series Upto :");
Total_Num = S.nextInt();
for(int i=1;i<=Total_Num;++i)
{
System.out.print(Num1+",");
// Printing The Next Terms
Num3 = Num1 + Num2;
Num1 = Num2;
Num2 = Num3;
}
}
}
Newly Joined Members subscribe to our channel to learn programming and crack written exams.
https://www.youtube.com/c/frbjava
https://www.youtube.com/c/frbjava