Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
231 views

Assignment 2

Uploaded by

BB ki Vince
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
231 views

Assignment 2

Uploaded by

BB ki Vince
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

1.

Write a program which creates an integer array and displays sum of its elements

import java.util.Scanner;
class array {
static int add(int n, int[] arr) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += arr[i];
}
return sum;
}

public static void main(String[] args) {


Scanner sc = new Scanner(System.in);
System.out.println("Enter size number");
int n = sc.nextInt();
int[] arr = new int[n];
System.out.println("enter array elements");
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
int a = add(n, arr);
System.out.println(a);
}

2.Write a program which performs addition of elements which are stored in two
arrays of type double.
import java.util.*;
class doublesum {
static Double[] Doublesum(Double[] a, int n1, Double[] b, int n2)
{
int size;
if(n1>n2) {
size=n1;
}else {
size=n2;
}
Double[] sum = new Double[size];
for (int i = 0; i < size; i++) {
double k=i<a.length?a[i]:0;
double m=i<b.length?b[i]:0;
sum[i] = k + m;
}
return sum;
}
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
System.out.println("Enter the array1 size");
int n1 = s.nextInt();
Double[] array1 = new Double[n1];
System.out.println("Enter the array1 elements");
for (int i = 0; i < n1; i++) {
array1[i] = s.nextDouble();
}
System.out.println("Enter the array2 size");
int n2 = s.nextInt();
Double[] array2 = new Double[n2];
System.out.println("Enter the array2 elements");
for (int k = 0; k < n2; k++) {
array2[k] = s.nextDouble();
}
s.close();
Double[] sum = Doublesum(array1, n1, array2, n2);
System.out.println("The array sum is " +
Arrays.toString(sum));
}
}

3.Write a method that receives a name as parameter and prints on the console.
“Hello, <name>!” Example.
package object;
import java.util.Scanner;
public class name {
static void name(String input){
System.out.println("Hello, "+input+"!");
}

public static void main(String[] args) {


Scanner sc=new Scanner(System.in);
String input=sc.next();
name(input);

4.Create a method GetMax(int a, int b, int c), that returns maximal of three
numbers. Write a program that reads three numbers from the console and prints the
biggest of them.
package lesson1;

import java.util.Scanner;

public class max {


static int GetMax(int a, int b, int c) {
int result;
if (a > b && a > c) {
return a;
} else if (b > a && b > c) {
return b;
} else {
return c;
}
}
public static void main(String[] args) {
Scanner num = new Scanner(System.in);
System.out.println("enter three numbers");
int a = num.nextInt();
int b = num.nextInt();
int c = num.nextInt();
int fina = GetMax(a, b, c);
System.out.println(fina);
}
}
5.Write a method that prints the digits of a given decimal number in a reversed
order.
package object;
import java.util.Scanner;
public class Reverse_number {
static void rev(int n) {
int r,sum=0;
int temp=n;
while(n>0) {
r=n%10;
sum=sum*10+r;
n=n/10;
}
System.out.println("Reverse order is "+sum);

public static void main(String[] args) {


Scanner sc=new Scanner(System.in);
System.out.println("Enter the number ");
int n=sc.nextInt();
rev(n);

6.Write a Boolean method IsPrime(n) that check whether a given integer number n
is prime.
package lesson1;

import java.util.Scanner;

public class IsPrime {


static boolean IsPrime(int n) {
if(n<=1)
{
return false;
}
int count = 0;
for (int i = 2; i < n; i++) {
if (n % i == 0) {
count++;
}
}
if (count == 1) {
return false;
} else {
return true;
}
}

public static void main(String[] args) {


Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
boolean result = IsPrime(n);
System.out.println(result);

}
7.Write a method that calculates all prime numbers in given range and returns them
as list of integers.

package lesson1;

import java.util.ArrayList;
import java.util.Scanner;

public class rangePrime {

public static void main(String[] args) {


Scanner s=new Scanner(System.in);
System.out.println("enter the range");
int n1=s.nextInt();
int n2=s.nextInt();
s.close();
System.out.println(primenum(n1,n2));
}

static ArrayList<Integer> primenum(int n1,int n2){


int count;
ArrayList<Integer> a=new ArrayList<>();
for(int i=n1;i<=n2;i++)
{
count=0;
for(int j=1;j<=i;j++)
{
if(i%j==0)
{
count=count+1;
}
}
if(count==2)
{
a.add(i);
}
}
return a;
}
}
8.Write a program that can calculate the area of four different geometry figures -
triangle, square, rectangle and circle.
package lesson1;
import java.util.Scanner;
public class Area {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("enter figure type");
System.out.println("1.triangle 2.Squre 3.Rectangle 4.circle");
int n=sc.nextInt();
switch (n){
case 1:
System.out.println("enter side and height of triangle");
int s=sc.nextInt();
int h=sc.nextInt();
System.out.println("Area of triangle is "+triangle(s,h));
break;
case 2:
System.out.println("enter side of square");

int l=sc.nextInt();
System.out.println("Area of square is "+square(l));
break;

case 3:
System.out.println("enter length and breadth rectangle");
int a=sc.nextInt();
int b=sc.nextInt();
System.out.println("Area of Rectangle is "+Rectangle(a,b));
break;
case 4:
System.out.println("enter radius of circle");
double r=sc.nextInt();
System.out.println("Area of circle is "+circle(r));
break;
default:
System.out.println("Invalid option");
}
}
private static double circle(double r) {
return 3.44*r*r;
}
private static double Rectangle(int a, int b) {
return a*b;
}
private static double square(int l) {
return l*l;
}
private static double triangle(int s, int h) {
return 0.5*s*h;
}
}

9.Write a method which accepts two integer arrays and returns an array of unique
elements.
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class uniqueElement {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int arr1[]= {10,5,20,15,25,30};
int arr2[]= {50,12,5,30,15,70};
System.out.println("Elements in Array1 is: "+Arrays.toString(arr1));
System.out.println("Elements in Array2 is: "+Arrays.toString(arr2));
uniqElements(arr1,arr2);
sc.close();
}
private static void uniqElements(int[] arr1, int[] arr2){
boolean contains = false;
List<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr2.length; j++) {
if (arr1[i] == arr2[j]) {
contains = true;
break;
}
}
if(!contains){
list.add(arr1[i]);
}
else{
contains = false;
}
}
for (int i = 0; i < arr2.length; i++) {
for (int j = 0; j < arr1.length; j++) {
if (arr2[i] == arr1[j]) {
contains = true;
break;
}
}
if(!contains){
list.add(arr2[i]);
}
else{
contains = false;
}
}
System.out.println(list);
}
}

10.Write a method which accepts two matrices of Size N X N and returns summation
of resultant Matrix.

package lesson1;

import java.util.Scanner;

public class summationMatrix {


public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println("enter row and column of matrix");
int n1=sc.nextInt();
int n2=sc.nextInt();
int arr1[][]=new int[n1][n2];
int arr2[][]=new int[n1][n2];
int res[][]=new int[n1][n2];
for(int i=0;i<n1;i++){
for(int j=0;j<n2;j++){
arr1[i][j]=sc.nextInt();
}
}
for(int i=0;i<n1;i++){
for(int j=0;j<n2;j++){
arr2[i][j]=sc.nextInt();
}
}
for(int i=0;i<n1;i++){
for(int j=0;j<n2;j++){
res[i][j]=arr1[i][j]+arr2[i][j];
}
}
for(int i=0;i<n1;i++){
for(int j=0;j<n2;j++){
System.out.print(res[i][j]+" ");
}
System.out.println();
}

sc.close();
}
}

11.Write a method public static boolean isRowMagic(int[][] a) that checks if the array
is row-magic (this means that every row has the same row sum).
package lesson1;

import java.util.Scanner;

public class isRowMagic {


public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int a=sc.nextInt();
int b=sc.nextInt();
int arr1[][]=new int[a][b];
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
arr1[i][j]=sc.nextInt();
}
}
System.out.println(rowMagic(arr1,a,b));
sc.close();

private static boolean rowMagic(int[][] arr1,int n1,int n2) {


int res[]=new int[n1];
int sum=0;
for(int i=0;i<n1;i++){
for(int j=0;j<n2;j++){
sum+=arr1[i][j];
}
res[i]=sum;
}
for(int i=0;i<n1-1;i++){
if(res[i]!=res[i+1]){
return false;
}
}
return true;
}
}

You might also like