java program assigment -2

1. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
/* problem 1 : Write a program to find sum for first n numbers.*/
import java.util.Scanner;
class Sum{
public static void main(String args[]){
int sum=0;
System.out.println("input no.");
Scanner ak=new Scanner(System.in);
int n= ak.nextInt();
for(int i=0;i<=n;i++)
{
sum=sum+i;
}
System.out.println("sum: "+sum);
}
}

2. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
/* problem2 : Write a Java Program to find the maximum of n numbers using do-while
loop.*/
import java.util.Scanner;
class Sum{
public static void main(String args[]){
System.out.println("enter the no. you want to insert: ");
Scanner ak= new Scanner(System.in);
int n=ak.nextInt();
int nu[]=new int[n];
int i=0;
do
{
nu[i]=ak.nextInt();
i++;
}while( i<n);
int max=nu[0];
int min=nu[n-1];
i=0;
int j;
if (n==0){
j=i;
max=nu[i];
}
else
{
do
{
j=n-1;
do{
if(nu[i]>nu[j])
max=nu[i];
else
max= nu[j];
j--;
}while(j>i);
i++;
}while(i<n);}
System.out.println(max);
}
}

3. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.

4. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
/* problem3: .Write a JAVA program to find all Armstrong numbers in the range of 0
and 999*/
class Armstrong{
public static void main( String args[])
{
int i=0;
do{ int n=I,k=0;
if(n>=0||n<=9)
k=1;
if(n>=10||n<=99)
k=2;
if(n>=100||n<=999)
k=3;
int j=n%10; int sum=0;
sum+=Math.pow(j,k);
n=n/10; j=n%10;
sum+=Math.pow(j,k);
n=n/10; j=n%10;
sum+=Math.pow(j,k);
if(sum==i)
System.out.println(sum);
i++;
}while(i<1000)}
}
}

5. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
/* problem4: A common typing error */
import java.util.Scanner;
class Correction
{
public static void main(String args[])
{
String str="";
String s1="qwertyuiop[]asdfghjkl;'zxcvbnm,./ ";
System.out.println("Enter String");
Scanner ak= new Scanner(System.in);
String s4= ak.nextLine();
s4.toUpperCase();
s1.toUpperCase();
for (int i=0;i<s4.length();i++)
{
for(int j=0;j<s1.length();j++)
{
if(s4.charAt(i)==s1.charAt(0)||s4.charAt(i)==s1.charAt(12)||s4.charAt(i)==s1.charAt(2
3)||s4.charAt(i)==s1.charAt(33))
{
str+=s4.charAt(i);
break;
}
if(s4.charAt(i)==s1.charAt(j))
{
str=str+s1.charAt(j-1);
}
}
}
System.out.println(str.toUpperCase());
}
}

6. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.

7. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
/* problem5: Program of gangster Dawood Abrahim .*/
import java.util.Scanner;
class Daoodstreet{
public static void main(String args[]){
Scanner ak=new Scanner(System.in);
int n=ak.nextInt();
int a[ ]=new int[5000];
for(int i=0;i<n;i++){
a[i]=ak.nextInt();
for(int j=1;j<a[i]+1;j++){
a[j]=ak.nextInt();
}
int m;
int sum=0;
if(a[i]%2==0){
m=a[i]/2;
for(int j=1;j<a[i]+1;j++){
sum+=Math.abs(a[j]-a[m]);
}
}
if(a[i]%2!=0){
m=a[i]/2+1;
for(int j=1;j<a[i]+1;j++){
sum+=Math.abs(a[j]-a[m]);
}
}
System.out.println(sum);
}
}
}

8. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.

9. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
import java.util.Scanner;
class Cardsontable{
public static void main(String args[]){
double a,sum;
int i;
Scanner ak=new Scanner(System.in);
do{
sum=ak.nextDouble();
a=sum;
i=2;
while(sum>0.00){
sum-=(1.00/i);
i++;
}if (a==0.00)
break;
System.out.println(i-2+" card(s)");
}while(a!=0.00);
}
}

10. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.

11. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
//WEEK PROBLEM -03
import java.util.Scanner;
class Amax
{
public static void main(String args[])
{ int a,i,j,k=0,max=0,min=0,z;
Scanner ak=new Scanner(System.in);
i=ak.nextInt(); j=ak.nextInt();
a=i; int count[]= new int[(j-i+1)];
for(i=i;i<=j;i++){
int n=i;
while(n>1){
if(n%2==0){
count[k]++;
n/=2; }
else{
count[k]++;
n=(n*3)+1;}
}
if(n==1){
count[k]++;
k++; }
}
max=count[k-1];
for(z=1;z<k;z++){
min=count[z-1];
if(max>=min)
max=max;
else
max=min;}
System.out.println(a+" "+" "+j+" "+max);
}

12. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.

13. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
//Week Problem -04
import java.util.Scanner;
class Exchange
{
public static void main(String args[]){
double sum[],exchange[],a[][];
int z=-1,k=0;
int n[]=new int[1000];
a=new double[1000][1000];
Scanner ak=new Scanner(System.in);
do{
z++;
n[z] =ak.nextInt();
for(int i=0;i<n[z];i++){
a[z][i]=ak.nextDouble();
}
}while(n[z]!=0);
sum=new double[z];
exchange=new double[z];
while(k<z){
for(int i=0;i<n[k];i++){
sum[k]+=a[k][i];
}
sum[k]=(sum[k]/n[k]);
k++;
}
k=0;
while(k<z){
for(int i=0;i<n[k];i++){
if(a[k][i]>sum[k])
exchange[k]+=(a[k][i]-sum[k]);
else
continue;
}
k++;
}
k=0;
while(k<z){
System.out.printf("INR %.2f",exchange[k]);
System.out.println();
k++; }
}

14. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
}

15. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
//Week Problem -05
import java.util.Scanner;
class Alien{
public static void main(String args[]){
Scanner ak =new Scanner(System.in);
int n,d,l;
n=ak.nextInt();
d=ak.nextInt();
l=ak.nextInt();
ak.nextLine();
int i=0;
String s1[]=new String[d];
while(d>i)
{
s1[i]=ak.nextLine();
i++;
}
int t=1;
while(l>=t){
String s2[]=new String[n];
int c=0,z=0;
String r="";
String a=ak.nextLine();
String m[]=a.split("");
for(int j=0;j<m.length;j++){
if(z>=n)
break;
if(m[j].equals("("))
{ r="";
c=1;}
else if(m[j].equals(")"))
{c=0;
s2[z]=r;
z++;}
if (c==0&&(!m[j].equals(")"))){
s2[z]=m[j];
z++;}
else
r+=m[j];
}
int count=0;
for(int x=0;x<d;x++){

16. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.
int p=1;
String w[]=s1[x].split("");
for(i=0;i<n;i++){
if(s2[i].indexOf(w[i])==-1){
p=0;
break;}
}
if(p!=0)
count++;
}
System.out.println("Case #"+t+": "+count);
t++;
}
}
}

17. //Assignment 2
/*Name-Ankit gupta
Branch-CSE
ROLL NO.-16 */
Thisprogram iswrittenbyAnkitGupta.