-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBasic_ques.java
More file actions
179 lines (154 loc) · 4.36 KB
/
Basic_ques.java
File metadata and controls
179 lines (154 loc) · 4.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
import java.util.*;
import javax.print.event.PrintEvent;
public class Basic_ques {
public static void main(String args[]){
Scanner sc= new Scanner(System.in);
System.out.println("reverse string : ");
String d=sc.next();
System.out.println(reverse_string(d));
int i= sc.nextInt();
int j= sc.nextInt();
int k= sc.nextInt();
System.out.println("sum of two number ");
System.out.println(two_sum(i, j));
System.out.println(" print largest number: ");
largest_num(i, j, k);
System.out.println("fabnacci series");
System.out.println(factorial_number(i));
System.out.println("swaping two number without third number");
System.out.println(swap_number(i,j));
System.out.println("reverse number: ");
System.out.println(reverse_number(k));
System.out.println("prime number are");
prime_num(k);
System.out.println("palindrone number");
palindrone_number(i);
System.out.println(" armstrong number: ");
armstrong_number(k);
}
//1. write a function to swap two number without using 3rd variable
public static int swap_number(int x,int y){
x=x+y;
y=x-y;
x=x-y;
System.out.print("after swap: "+x+" ");
return y;
}
//2. print the reverse of the given number
public static int reverse_number(int x) {
int reverse=0;
while(x>0){
int rem= x%10;
reverse=reverse*10+rem;
x=x/10;
}
return reverse;
}
//3. print the reverse of the string
public static String reverse_string(String x){
StringBuilder sb=new StringBuilder(x);
sb.reverse();
return sb.toString();
}
//4. print first five prime number
public static void prime_num(int x){
for(int i=1; i<=x; i++){
int counter =0;
for(int j=1; j<=i; j++){
if(i%j==0){
counter++;
}
}
if(counter==2){
System.out.println(i);
}
}
}
//5. what is palindrone number
public static void palindrone_number(int x){
int sum=0;
int temp=x;
int rem;
while(x>0){
rem=x%10;
sum = sum*10+rem;
System.out.println(sum);
x=x/10;
}
if(temp==sum){
System.out.println("its palindrone");
}else{
System.out.println("not palindron");
}
}
//6. what is armstrong number
public static void armstrong_number(int x){
int temp = x;
int r;
int sum=0;
while(x>0){
r=x%10;
x=x/10;
sum=sum+r*r*r;
System.out.println(sum);
if(temp==sum){
System.out.println(" its armstrong number ");
}
else{
System.out.println(" its not a armstrong number");
}
}
}
//7. print binary search.
//8. sum of two number enter by user
public static int two_sum(int x, int y){
return(x+y);
}
//9. java program to check if the number is odd or even
public static boolean odd_or_even(int x){
if(x%2==0)
return true;
else
return false;
}
//10. check if the number is prime or not
public static boolean is_prime(int x) {
for(int i=1; i<=x; i++){
int count=0;
for (int j=1; j<=i;j++){
if(i%j==0){
count++;
}
}
if(count==2){
return true;
}
}
return false;
}
//11. calculate factorial
public static int factorial_number(int x){
int c;
int a =0;
int b= 1;
for(int i=2; i<=x;i++){
c=a+b;
System.out.println(" "+c);
a=b;
b=c;
}
return(x);
}
//12. largest among three number
public static void largest_num(int x, int y , int z){
if(x>y && x>z){
System.out.println(x);
}
else if(y>x && y>z){
System.out.println(y);
}
else{
System.out.println(z);
}
}
}