DP2_2023 (Reflection Wall) by Swati Shirude [EISB]

1D Array - Ritthick (Thinking and self-management skills)

2022-03-22 04:24:34 UTC

import java.util.*;
public class adaptdatastructure
{
public static void main(String args[])
{
int i;
int j;
int temp;
Scanner input = new Scanner(System.in);
System.out.println("Enter class strength");
int n=input.nextInt();
int a[]=new int[n];
int c[]=new int[n];
for(i=0;i {
System.out.println("Enter roll number");
a[i]=input.nextInt();
System.out.println("Enter Student Marks for roll number "+a[i]);
c[i]=input.nextInt();
}
int max=c[0];
for (i = 0; i < n; i++)
{
for (j = i + 1; j < n; j++)
{
if (c[i] > c[j])
{
temp = c[i];
c[i] = c[j];
c[j] = temp;
}
}
}
System.out.println("Highest marks is "+c[n-1]);
}
}

1D Array Task1- Chiranjith. ATL SKILLS : Thinking skills and Self management skills.

chiranjithpradeep — 2022-03-24 03:07:48 UTC

import java.util.*;
public class Task {
public static void main (String[]args) {
int max = 0;
int[] n = new int[20];
int index = 0;
Scanner kb = new Scanner (System.in);
System.out.print("Enter the marks of the students in the roll number order: ");
for (int i=0;i<20;i++) {
n[i]= kb.nextInt();
}
for (int i=0;i<20;i++) {
if (n[i] > max) {
max = n[i];
index = i;
}
}
System.out.print("The role number of the student with the highest mark" + index);

}
}

2D Array task 2- Chiranjith. ATL SKILLS : Thinking skills and Self management skills.

chiranjithpradeep — 2022-03-24 03:09:41 UTC

import java.util.*;
public class Sum_of_2D_array {
public static void main (String[]args) {
int n [][] = new int [2][2];
Scanner kb = new Scanner(System.in);
for (int i=0; i<3;i++) {
for (int j=0; j<3; j++) {
n[i][j] = kb.nextInt();
}
}
int sum = 0;
for (int i=0; i<3;i++) {
for (int j=0; j<3; j++) {
sum = n[i][j] + sum;
}
}
System.out.print("Sum of all the numbers: " + sum);
for (int i=0; i<3;i++) {
for (int j=0; j<3; j++) {
int sum2 = 0;
sum2 = n[i][j] + sum2;
System.out.print("Sum of row " + (i+1) + ": " + sum2);
}
}
for (int i=0; i<3;i++) {
for (int j=0; j<3; j++) {
int sum3= 0;
sum3= n[j][i] + sum3;
System.out.print("Sum of coloum " + (j+1) + ": " + sum3);
}
}

}
}

NITHISH- critical thinking

2022-03-24 03:11:00 UTC

import java.util.*;
public class 1darray
{
public static void main(String args[])
{
int i;
int j;
Scanner input = new Scanner(System.in);
System.out.println("Enter No of students");
int n=input.nextInt();
int a[]=new int[n];
int c[]=new int[n];
for(i=0;i {
System.out.println("Enter roll number");
a[i]=input.nextInt();
System.out.println("Enter Students Marks for roll number "+a[i]);
c[i]=input.nextInt();
}
int max=c[0];
for (i = 0; i < n; i++)
{
for (j = i + 1; j < n; j++)
{
if (c[i] > c[j])
{
temp = c[i];
c[i] = c[j];
c[j] = temp;
}
}
}
System.out.println("Highest marks is "+c[n-1]);
}

Recursion - Prakriti : Critical thinking

2022-03-25 03:07:02 UTC

import java.util.*;
public class recursion
{
public static long fact (int n)
{
if(n<=1)
{
return 1;
}
else
{
return n*fact(n-1);
}
}
public static void main(String args[])
{
Scanner kb =new Scanner(System.in);
System.out.println("Enter a number :");
int x = kb.nextInt();
System.out.println(fact(x));
}
}

Recursion fibonacci

2022-03-25 03:08:56 UTC

Recursion fibonacci:
import java.util.*;
public class Recursion_fibonacci
{
public static long fibonach (int n)
{
if(n<=1)
{
return 0;
}
else if(n==2)
{
return 1;
}
else
{
return fibonach(n-1) + fibonach(n-2);
}
}
public static void main(String args[])
{
Scanner kb =new Scanner(System.in);
System.out.println("Enter a number :");
int n = kb.nextInt();
for(int i=1;i<=n;i++)
{
System.out.println(fibonach(i));
}

}
}