Hi, Please find my codeimport java.util.Random;public class Pro.pdf
•
0 likes•2 views
Hi, Please find my code: import java.util.Random; public class ProcessArray { private int rows; //The attribute for number of rows in matrix private int columns; //The attribute for number of columns in matrix private int[][] firstArray; //The attribute for the first array private int[][] secondArray; //The attribute for the second array public int[][] getFirstArray() { return firstArray;} public int[][] getSecondArray() { return secondArray;} public ProcessArray(int rows, int columns){ //Constructor of object ProcessArray this.rows = rows; this.columns = columns; int[][] array = new int[rows][columns]; initializeArray(array); randomlyFillArray(); computeArrayValues(); printArray(secondArray); } public void initializeArray(int[][] array){ //Initializes first and second arrays and sets each value to 0 firstArray = new int[rows][columns]; secondArray = new int[rows][columns]; } public void randomlyFillArray(){ //Fills first array with random numbers for(int i = 0; i < firstArray.length;i++){ for(int j = 0; j < firstArray[0].length;j++){ Random r = new Random(); int num = r.nextInt(16); firstArray[i][j] = num; } } } public void computeArrayValues(){ int col = firstArray[0].length; int row = firstArray.length; for(int i = 0; i < row; i++){ for(int j = 0; j< col; j++){ secondArray[i][j] = 0; if((i - 1) >=0){ secondArray[i][j] += firstArray[i-1][j]; if((j+1) < col) secondArray[i][j] += firstArray[i-1][j+1]; if(j > 0) secondArray[i][j] += firstArray[i-1][j-1]; } if((j+1) < col) secondArray[i][j] += firstArray[i][j+1]; if(j > 0) secondArray[i][j] += firstArray[i][j-1]; if((i+1) < row){ secondArray[i][j] += firstArray[i+1][j]; if((j+1) < col) secondArray[i][j] += firstArray[i+1][j+1]; if(j > 0) secondArray[i][j] += firstArray[i+1][j-1]; } } } } public void printArray(int[][] Array){ System.out.println(\"\ Initial Array Filled With Random Numbers: \ \"); for(int a = 0; a < firstArray.length; a++){ for(int b = 0; b < firstArray[0].length; b++){ if(b == 0) System.out.printf(\"%d \", firstArray[a][b]); else System.out.printf(\"%d \", firstArray[a][b]); }System.out.println(); }System.out.println(); System.out.println(\"Computed Array: \ \"); for(int a = 0; a < secondArray.length; a++){ for(int b = 0; b < secondArray[0].length; b++){ if(b == 0) System.out.printf(\"%d \", secondArray[a][b]); else System.out.printf(\"%d \", secondArray[a][b]); } System.out.println(); }System.out.println(); } public static void main(String[] args) { ProcessArray pr = new ProcessArray(3, 4); } } /* Sample Output: Initial Array Filled With Random Numbers: 7 3 6 12 10 2 11 10 12 14 1 7 Computed Array: 15 36 38 27 38 64 55 37 26 36 44 22 */ Solution Hi, Please find my code: import java.util.Random; public class ProcessArray { private int rows; //The attribute for number of rows in matrix private int columns; //The attribute for number of columns in matrix private int[][] firstArray; //The attribute for the first array private int[][] secondArray; //The attribute for the second arr.
Report
Share
Report
Share
Download to read offline
![Hi, Please find my code:
import java.util.Random;
public class ProcessArray {
private int rows; //The attribute for number of rows in matrix
private int columns; //The attribute for number of columns in matrix
private int[][] firstArray; //The attribute for the first array
private int[][] secondArray; //The attribute for the second array
public int[][] getFirstArray() { return firstArray;}
public int[][] getSecondArray() { return secondArray;}
public ProcessArray(int rows, int columns){ //Constructor of object ProcessArray
this.rows = rows;
this.columns = columns;
int[][] array = new int[rows][columns];
initializeArray(array);
randomlyFillArray();
computeArrayValues();
printArray(secondArray);
}
public void initializeArray(int[][] array){ //Initializes first and second arrays and sets each value
to 0
firstArray = new int[rows][columns];
secondArray = new int[rows][columns];
}
public void randomlyFillArray(){ //Fills first array with random numbers
for(int i = 0; i < firstArray.length;i++){
for(int j = 0; j < firstArray[0].length;j++){
Random r = new Random();
int num = r.nextInt(16);
firstArray[i][j] = num;
}
}
}
public void computeArrayValues(){
int col = firstArray[0].length;
int row = firstArray.length;](https://image.slidesharecdn.com/hipleasefindmycodeimportjava-230413072851-058d67a5/85/Hi-Please-find-my-codeimport-java-util-Random-public-class-Pro-pdf-1-320.jpg)
![for(int i = 0; i < row; i++){
for(int j = 0; j< col; j++){
secondArray[i][j] = 0;
if((i - 1) >=0){
secondArray[i][j] += firstArray[i-1][j];
if((j+1) < col)
secondArray[i][j] += firstArray[i-1][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i-1][j-1];
}
if((j+1) < col)
secondArray[i][j] += firstArray[i][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i][j-1];
if((i+1) < row){
secondArray[i][j] += firstArray[i+1][j];
if((j+1) < col)
secondArray[i][j] += firstArray[i+1][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i+1][j-1];
}
}
}
}
public void printArray(int[][] Array){
System.out.println(" Initial Array Filled With Random Numbers: ");
for(int a = 0; a < firstArray.length; a++){
for(int b = 0; b < firstArray[0].length; b++){
if(b == 0)
System.out.printf("%d ", firstArray[a][b]);
else
System.out.printf("%d ", firstArray[a][b]);
}System.out.println();
}System.out.println();
System.out.println("Computed Array: ");](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Java AssignmentWrite a program using sortingsorting bubble,sele.pdf
Java Assignment
Write a program using sorting
sorting: bubble,selection,insertion,quick,merge
Solution
Bubble Sort:
import java.util.Scanner;
class SortBubble {
public static void main(String []args) {
int number, c, d, swap;
Scanner in = new Scanner(System.in);
System.out.println(\"Please enter the number of elements to be sorted\");
number = in.nextInt();
int ar[] = new int[number];
System.out.println(\"Enter \" + number + \" integers\");
for (int i = 0; i < number; i++)
ar[i] = in.nextInt();
for (int i = 0; i < ( number - 1 ); i++) {
for (int j = 0; j < number - c - 1; j++) {
if (ar[j] > ar[j+1])
{
swap = ar[j]];
ar[j] = ar[j+1];
ar[j+1] = swap;
}
}
}
System.out.println(\"Sorted list of numbers\");
for (int c = 0; c < number; c++)
System.out.println(ar[c]);
}
}
b) Selection Sort:
public class SortSelection {
public static int[] sort(int[] arr){
for (int i = 0; i < arr.length - 1; i++)
{
int index = i;
for (int j = i + 1; j < arr.length; j++)
if (arr[j] < arr[index])
index = j;
int temp= arr[index];
arr[index] = arr[i];
arr[i] = temp;
}
return arr;
}
public static void main(String a[]){
int[] arr1 = {10,34,2,56,7,67,88,42};
int[] arr2 = sort(arr1);
for(int i:arr2){
System.out.print(i);
System.out.print(\", \");
}
}
}
c) Insertion
public class SortInsertion {
public static void main(String[] args) {
int[] array= { 4, 2, 9, 6, 23, 12, 34, 0, 1 };
sort(array);
}
static void printNumbers(int[] input) {
for (int i = 0; i < array.length; i++) {
System.out.print(array[i] + \", \");
}
System.out.println(\"\ \");
}
public static void sort(int array[]) {
int n = array.length;
for (int j = 1; j < n; j++) {
int key = array[j];
int i = j-1;
while ( (i > -1) && ( array [i] > key ) ) {
array [i+1] = array [i];
i--;
}
array[i+1] = key;
printNumbers(array);
}
}
}
d) Quick Sort:
public class SortQuick {
int array[];
int length;
public void sort(int[] inputArr) {
if (inputArr == null || inputArr.length == 0) {
return;
}
this.array = inputArr;
length = inputArr.length;
quickSort(0, length - 1);
}
private void quickSort(int lowerIndex, int higherIndex) {
int i = lowerIndex;
int j = higherIndex;
int pivot = array[lowerIndex+(higherIndex-lowerIndex)/2];
while (i <= j) {
while (array[i] < pivot) {
i++;
}
while (array[j] > pivot) {
j--;
}
if (i <= j) {
exchangeNumbers(i, j);
i++;
j--;
}
}
if (lowerIndex < j)
quickSort(lowerIndex, j);
if (i < higherIndex)
quickSort(i, higherIndex);
}
private void exchangeNumbers(int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
public static void main(String a[]){
MyQuickSort sorter = new MyQuickSort();
int[] input = {24,2,45,20,56,75,2,56,99,53,12};
sorter.sort(input);
for(int i:input){
System.out.print(i);
System.out.print(\" \");
}
}
}.
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.java
public class OrderTest {
/**
* Get an array of specified size and pass it to Order.order().
* Report the results.
*/
public static void main(String[] args) {
if (args.length != 1) {//1
System.out.println(\"Usage: java OrderTest sizeOfArray\ \"
+ \"\\tor\ \\tjava OrderTest arrayFile\");
System.exit(1);
}
// create or read the int[]
int size = 0;
int[] array = new int[0];//5
try {
size = Integer.parseInt(args[0]);
array = ArrayOfInts.randomizedArray(size);
} catch (NumberFormatException nfe) {//8
try {
array = ArrayOfInts.arrayFromFile(args[0]);
size = array.length;
} catch (Exception e) {
System.err.println(\"unable to read array from \" + args[0]);
System.exit(1);//14
}
}
System.out.println(\"before:\");//15
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);//1
}
int myNum = Order.order(array); //this is the call we want to measure
System.out.println(\"\ after:\");//18
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);
}
System.out.println(myNum);
}
}
ArrayOfInts.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ArrayOfInts {
/**
* Returns an array of consecutive ints from 1 to size.
*/
public static int[] orderedArray(int size) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = i+1;
}
return a;
}
/**
* Returns a randomized array containing ints from 1 to size.
*/
public static int[] randomizedArray(int size) {
ArrayList aL = new ArrayList();
for (int i = 0; i < size; i++) {
aL.add(i+1);
}
Collections.shuffle(aL);
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = aL.get(i);
}
return a;
}
/**
* Writes an int[] to a plain-text file with ints separated by spaces.
* Useful for creating input files for repeatable tests.
*/
public static void arrayToFile(int[] array, String outfile) {
try {
FileWriter fw = new FileWriter(outfile);
BufferedWriter bw = new BufferedWriter(fw);
PrintWriter outFile = new PrintWriter(bw);
for (int i : array) {
outFile.print(i + \" \");
}
outFile.close();
} catch (IOException e) {
System.err.println(\"Could not write to \" + outfile + \"\ \" + e);
}
}
/**
* Read ints from a file and return them in an int[]
*/
public static int[] arrayFromFile(String infile) throws FileNotFoundException,
InputMismatchException {
Scanner scan = new Scanner(new File(infile));
ArrayList aL = new ArrayList();
while (scan.hasNext()) {
aL.add(scan.nextInt());
}
scan.close();
int[] a = new int[aL.size()];
for (int i = 0; i < a.length; i++) {
a[i] = aL.get(i);
}
return a;
}
}
Order.java
public class Order {
/**
* Take an int[] and reorganize it so they are in ascending order.
*/
public static int order(int[] array) .
Recommended
Java AssignmentWrite a program using sortingsorting bubble,sele.pdf
Java Assignment
Write a program using sorting
sorting: bubble,selection,insertion,quick,merge
Solution
Bubble Sort:
import java.util.Scanner;
class SortBubble {
public static void main(String []args) {
int number, c, d, swap;
Scanner in = new Scanner(System.in);
System.out.println(\"Please enter the number of elements to be sorted\");
number = in.nextInt();
int ar[] = new int[number];
System.out.println(\"Enter \" + number + \" integers\");
for (int i = 0; i < number; i++)
ar[i] = in.nextInt();
for (int i = 0; i < ( number - 1 ); i++) {
for (int j = 0; j < number - c - 1; j++) {
if (ar[j] > ar[j+1])
{
swap = ar[j]];
ar[j] = ar[j+1];
ar[j+1] = swap;
}
}
}
System.out.println(\"Sorted list of numbers\");
for (int c = 0; c < number; c++)
System.out.println(ar[c]);
}
}
b) Selection Sort:
public class SortSelection {
public static int[] sort(int[] arr){
for (int i = 0; i < arr.length - 1; i++)
{
int index = i;
for (int j = i + 1; j < arr.length; j++)
if (arr[j] < arr[index])
index = j;
int temp= arr[index];
arr[index] = arr[i];
arr[i] = temp;
}
return arr;
}
public static void main(String a[]){
int[] arr1 = {10,34,2,56,7,67,88,42};
int[] arr2 = sort(arr1);
for(int i:arr2){
System.out.print(i);
System.out.print(\", \");
}
}
}
c) Insertion
public class SortInsertion {
public static void main(String[] args) {
int[] array= { 4, 2, 9, 6, 23, 12, 34, 0, 1 };
sort(array);
}
static void printNumbers(int[] input) {
for (int i = 0; i < array.length; i++) {
System.out.print(array[i] + \", \");
}
System.out.println(\"\ \");
}
public static void sort(int array[]) {
int n = array.length;
for (int j = 1; j < n; j++) {
int key = array[j];
int i = j-1;
while ( (i > -1) && ( array [i] > key ) ) {
array [i+1] = array [i];
i--;
}
array[i+1] = key;
printNumbers(array);
}
}
}
d) Quick Sort:
public class SortQuick {
int array[];
int length;
public void sort(int[] inputArr) {
if (inputArr == null || inputArr.length == 0) {
return;
}
this.array = inputArr;
length = inputArr.length;
quickSort(0, length - 1);
}
private void quickSort(int lowerIndex, int higherIndex) {
int i = lowerIndex;
int j = higherIndex;
int pivot = array[lowerIndex+(higherIndex-lowerIndex)/2];
while (i <= j) {
while (array[i] < pivot) {
i++;
}
while (array[j] > pivot) {
j--;
}
if (i <= j) {
exchangeNumbers(i, j);
i++;
j--;
}
}
if (lowerIndex < j)
quickSort(lowerIndex, j);
if (i < higherIndex)
quickSort(i, higherIndex);
}
private void exchangeNumbers(int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
public static void main(String a[]){
MyQuickSort sorter = new MyQuickSort();
int[] input = {24,2,45,20,56,75,2,56,99,53,12};
sorter.sort(input);
for(int i:input){
System.out.print(i);
System.out.print(\" \");
}
}
}.
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.java
public class OrderTest {
/**
* Get an array of specified size and pass it to Order.order().
* Report the results.
*/
public static void main(String[] args) {
if (args.length != 1) {//1
System.out.println(\"Usage: java OrderTest sizeOfArray\ \"
+ \"\\tor\ \\tjava OrderTest arrayFile\");
System.exit(1);
}
// create or read the int[]
int size = 0;
int[] array = new int[0];//5
try {
size = Integer.parseInt(args[0]);
array = ArrayOfInts.randomizedArray(size);
} catch (NumberFormatException nfe) {//8
try {
array = ArrayOfInts.arrayFromFile(args[0]);
size = array.length;
} catch (Exception e) {
System.err.println(\"unable to read array from \" + args[0]);
System.exit(1);//14
}
}
System.out.println(\"before:\");//15
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);//1
}
int myNum = Order.order(array); //this is the call we want to measure
System.out.println(\"\ after:\");//18
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);
}
System.out.println(myNum);
}
}
ArrayOfInts.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ArrayOfInts {
/**
* Returns an array of consecutive ints from 1 to size.
*/
public static int[] orderedArray(int size) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = i+1;
}
return a;
}
/**
* Returns a randomized array containing ints from 1 to size.
*/
public static int[] randomizedArray(int size) {
ArrayList aL = new ArrayList();
for (int i = 0; i < size; i++) {
aL.add(i+1);
}
Collections.shuffle(aL);
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = aL.get(i);
}
return a;
}
/**
* Writes an int[] to a plain-text file with ints separated by spaces.
* Useful for creating input files for repeatable tests.
*/
public static void arrayToFile(int[] array, String outfile) {
try {
FileWriter fw = new FileWriter(outfile);
BufferedWriter bw = new BufferedWriter(fw);
PrintWriter outFile = new PrintWriter(bw);
for (int i : array) {
outFile.print(i + \" \");
}
outFile.close();
} catch (IOException e) {
System.err.println(\"Could not write to \" + outfile + \"\ \" + e);
}
}
/**
* Read ints from a file and return them in an int[]
*/
public static int[] arrayFromFile(String infile) throws FileNotFoundException,
InputMismatchException {
Scanner scan = new Scanner(new File(infile));
ArrayList aL = new ArrayList();
while (scan.hasNext()) {
aL.add(scan.nextInt());
}
scan.close();
int[] a = new int[aL.size()];
for (int i = 0; i < a.length; i++) {
a[i] = aL.get(i);
}
return a;
}
}
Order.java
public class Order {
/**
* Take an int[] and reorganize it so they are in ascending order.
*/
public static int order(int[] array) .
Utility.ppt
Provides a detailed a about new features of java 17 . Depicts us how to enhance our Java code with new features
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
import java.util.Scanner;public class ArrayOperation { inp.pdf
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413
Solution
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413.
Lecture 7 arrays
An array is an important topic in any language but in java Array is treated as an object.
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from Xmin to Xmax using a
step size of step
A)Draw a picture of what is going on.
B) Write a expression for n the total number of samples involved (in terms of Xmin, Xmax and
step)
C) Write out the sequence of x-samples
D) Write a direct and general expression for xi that captures the sequence
E) Write a recursive expression for the sequence
F) Write a program to compute and store the x-samples over the range -5x5 using a step size of
0.1 do everything in main ()
2 . We talked about the following string functions that are available in C (as long as you include
string.h):
int strlen(char str[])
void strcpy(char str1[], char str2[])
void strcat(char str1[], str2[])
Write your own versions of these functions; for example: int paul_strlen(int char str[]). Hint: for
your version of the strlen function, start at the first character in the array and keep counting until
you find the ‘\\0’ character (use a while loop for this). Note: Use your version of the strlen
function in the strcpy and strcat functions.
9. We want to insert a number into an array.
(a) Formulate the problem mathematically with two sequences: x and y. (b) Write a function of
the form:
insertNumIntoArray(int n, int array[], int num, int index)
The function inserts num into the array at the specified index. The rest of the array then follows.
For example, if num = 9 and index = 3 and array = [7 2 8 8 3 1 2] then the function will produce:
array = [7 2 8 9 8 3 1 2]
Note: assume that array is properly dimensioned to have at least 1 extra space for storage.
10. Repeat #2 by for the delete operation; that is, we want to delete a single element (at a
specified index) from an array; for example, suppose index = 3 and array = [50 70 10 90 60 20],
then the result will be
array: [50 70 10 60 20]
11. Repeat #2 by for an insert operation where we are inserting several values into the array. The
function should be of the form:
int insertArrayIntoArray(int n, int inArray[],
int nInsert, int insertArray[], int outArray[], int index)
The dimension of outArray is returned (explicitly). For example:
inArrayarray: [7 2 8 6 3 9]
insertArray: [50 60 70]
index: 2
outArray: [7 2 50 60 70 8 6 3 9]
Assume that outArray is large enough to hold all n + nInsert values.
Solution
#include
//Simulates strlen() library function
int paul_strlen(char str[])
{
int l;
for(l = 0; str[l] != \'\\0\'; l++) ;
return l;
}
//Simulates strcpy() library function
void paul_strcpy(char str1[], char str2[])
{
int c;
for(c = 0; str1[c] != \'\\0\'; c++)
str2[c] = str1[c];
str2[c] = \'\\0\';
printf(\"\ Original String: %s\", str1);
printf(\"\ Copied String: %s\", str2);
}
//Simulates strcat() library function
void paul_strcat(char str1[], char str2[])
{
int i, j;
for(i = 0; str1[i] != \'\\0\'; i++) ;
for (j = 0; str2[j] != \'\\0\'; i++, j++)
{
str1[i] = str2[j];
}
str1[i] = \'\\0\';
printf(\"\ Concatenated String: %s\", str1);
}
int main()
{
char data1[20], data2[20];
pri.
Refer to my progress on this assignment belowIn this problem you w.pdf
Refer to my progress on this assignment below
In this problem you will make it “more” object-oriented in the following ways:
-You will change its name to SortedList
-You will change the constructor that takes no arguments to be more traditional and initialize the
member fields to dummy values.
-You will add a constructor that takes in an initialized array and a size
-You will add an insert function that adds a value to the list and maintains its sorted-ness
-You will add a quicksort function check the below code.
-You will make updates as necessary to the main function so that it still runs and tests your code.
The code below seems to sort correctly but it skips over some items in the array and I am not
sure what is happening. Please help! Thanks!
import java.util.Scanner;
class SortedList
{
private static int array[];
private static int n;
public SortedList()
{
Scanner in = new Scanner(System.in);
System.out.println(\"Enter number of elements\");
n = in.nextInt();
array = new int[n];
if(n == 0) {
System.out.print(\"Since no arguments array set to: \");
} else {
System.out.print(\"Creating array size \" + n + \": \");
}
for(int i = 0; i < n; i++)
{
array[i] = 0;
}
//System.out.println(\"Enter \" + n + \" integers in ascending order\");
/*for (c = 0; c < n; c++)
array[c] = in.nextInt();*/
for(int i = 0; i < n; i++)
{
System.out.print(array[i] + \" \");
}
System.out.print(\"\ \");
}
public SortedList(int a[], int size)
{
array = a;
n = size;
}
public int binsearch(int search)
{
int first, last, middle;
first = 0;
last = n - 1;
middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
//System.out.println(search + \" found at location \" + (middle + 1) + \".\");
return middle+1;//+1 for the non-CS people who don\'t start counting at zero.
}
else
last = middle - 1;
middle = (first + last)/2;
}
return -1;
//System.out.println(search + \" is not present in the list.\ \");
}
public static int partition(int input[], int p, int r)
{
int pivot = input[r];
while(p < r)
{
while(input[p] < pivot)
{
p++;
}
while(input[r] > pivot)
{
r--;
}
if(input[p] == input[r])
{
p++;
}
else if(p < r)
{
int tmp = input[p];
input[p] = input[r];
input[r] = tmp;
}
}
return r;
}
public static void quicksort(int input[], int p, int r)
{
if(p < r)
{
int j = partition(input, p, r);
quicksort(input, p, j-1);
quicksort(input, j+1, r);
}
}
public static void insert(int value, int cell)
{
array[cell] = value;
quicksort(array, 0, n-1);
}
public static void main(String args[])
{
int c;
Scanner in = new Scanner(System.in);
SortedList b = new SortedList();
System.out.println(\"Input numbers\");
for(int i = 0; i < n; i++)
{
c = in.nextInt();
in.nextLine();
insert(c, i);
}
in.close();
for(int j = 0; j < n; j++)
{
System.out.print(array[j] + \", \");
}
}
}
Solution
//the whole program that you wrote is correct except one line , when you call the quicksort
everytime you insert a //value dont pass n pass the i.
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...Sunil Kumar Gunasekaran
The Art of Clean Code
Have you ever wanted to add a new feature to your code but instead found yourself spending hours trying to understand the existing code? Or adding a new feature and then finding out you've broken something else, supposedly unrelated, that used to work?
These slides hold a few tips on how to write code that'll be easier to understand, nicer to read and more simple to maintain.
import javautilLinkedList import javautilQueue import .pdf
import java.util.LinkedList; import java.util.Queue; import java.util.Stack; class
Sudoku_Solver_question { public static int type = 0; public static int height = 0; // Node exploration
holds the sudoku board in every iteration private static class Exploration { char[][] board; int curCell
= 0; // constructor method public Exploration(char[][] board, int curCell) { this.board =
cloneBoard(board); this.curCell = curCell; } // clones the board for every state private char[][]
cloneBoard(char[][] board) { char[][] newBoard = new char[board.length][board[0].length];
copyIntoBoard(board, newBoard); return newBoard; } } public static boolean BFS(char[][] board) {
// TODO write BFS search algorithm } public static boolean DFS(char[][] board) { // TODO write
DFS search algorithm } /** * parameter: index * return: index * Returns the index of a row based on
type(6x6 / 9x9) of the board */ private static int getRowForIndex(int idx) { return idx / type; } /** *
parameter: index * return: index * Returns the index of a column based on type(6x6 / 9x9) of the
board */ private static int getColumnForIndex(int idx) { return idx % type; } /** * Parameters: source
board & destination board * return: null * Copies the source board to destination board in every
state */ protected static void copyIntoBoard(char[][] src, char[][] dst) { for (int i = 0; i < src.length;
i++) { System.arraycopy(src[i], 0, dst[i], 0, src[i].length); } } /** * Parameters: Board & box index
number * returns: true / false * Validates the box, returns true if there is no duplicate number in the
box else false */ private static boolean isValidSquare(char[][] board, int s) { boolean[] isPresent =
new boolean[board.length+1]; for (int r = (s / 3) * height; r < ((s / 3) + 1) * height; r++) { for (int c =
(s % 3) * height; c < ((s % 3) + 1) * height; c++) { char value = board[r][c]; if (value == '.') {
continue; } int intVal = Character.getNumericValue(value); if (isPresent[intVal]) { return false; }
isPresent[intVal] = true; } } return true; } /** * Parameters: Board & column index number * returns:
true / false * Validates the box, returns true if there is no duplicate number in the column else false
*/ private static boolean isValidColumn(char[][] board, int c) { boolean[] isPresent = new
boolean[board.length+1]; for (int i = 0; i < board.length; i++) { char value = board[i][c]; if (value ==
'.') { continue; } int intVal = Character.getNumericValue(value); if (isPresent[intVal]) { return false; }
isPresent[intVal] = true; } return true; } /** * Parameters: Board & row index number * returns: true /
false * Validates the box, returns true if there is no duplicate number in the row else false */ private
static boolean isValidRow(char[][] board, int r) { boolean[] isPresent = new
boolean[board.length+1]; for (int i = 0; i < board.length; i++) { char value = board[r][i]; if (value ==
'.') { continue; } int intVal = Character.getNumericValue(value); if (isPresent[intVal]) { return false; }
isPre.
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
1. import java.util.Scanner;
public class Alphabetical_Order
{
public static void main(String[] args)
{
int n;
String temp;
Scanner s = new Scanner(System.in);
n = 3;
String names[] = new String[3];
Scanner s1 = new Scanner(System.in);
System.out.println(\"Enter all the names:\");
for(int i = 0; i < n; i++)
{
names[i] = s1.nextLine();
}
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (names[i].compareTo(names[j])>0)
{
temp = names[i];
names[i] = names[j];
names[j] = temp;
}
}
}
System.out.print(\"Names in Sorted Order:\");
for (int i = 0; i < n - 1; i++)
{
System.out.print(names[i] + \",\");
}
System.out.print(names[n - 1]);
}
}
2.
import java.util.Scanner;
class prime
{
public static void main(String[] args)
{
int n,p;
Scanner s=new Scanner(System.in);
System.out.println(“Enter upto which number prime numbers are needed”);
n=s.nextInt();
for(int i=2;i<=n;i++)
{
p=0;
for(int j=2;j=1 && n<=10)
break;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
System.out.print(i*j);
}
System.out.print(\'\ \');
}
}
}
Solution
1. import java.util.Scanner;
public class Alphabetical_Order
{
public static void main(String[] args)
{
int n;
String temp;
Scanner s = new Scanner(System.in);
n = 3;
String names[] = new String[3];
Scanner s1 = new Scanner(System.in);
System.out.println(\"Enter all the names:\");
for(int i = 0; i < n; i++)
{
names[i] = s1.nextLine();
}
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (names[i].compareTo(names[j])>0)
{
temp = names[i];
names[i] = names[j];
names[j] = temp;
}
}
}
System.out.print(\"Names in Sorted Order:\");
for (int i = 0; i < n - 1; i++)
{
System.out.print(names[i] + \",\");
}
System.out.print(names[n - 1]);
}
}
2.
import java.util.Scanner;
class prime
{
public static void main(String[] args)
{
int n,p;
Scanner s=new Scanner(System.in);
System.out.println(“Enter upto which number prime numbers are needed”);
n=s.nextInt();
for(int i=2;i<=n;i++)
{
p=0;
for(int j=2;j=1 && n<=10)
break;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
System.out.print(i*j);
}
System.out.print(\'\ \');
}
}
}.
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] = \"p\' \'file.txt\'\\0\";
char command[100];
command[0] = \'\\0\';
strcat(command,cmd_p1);
strcat(command,cmd_p2);
strcat(command,cmd_p3);
//usleep(line_number);
char cmd[100] = \" | tr [:space:] \'\\\ \' | grep -v \'^\\\\s*$\' | sort | uniq -c | sort\\0\";
strcat(command,cmd);
FILE *in;
in= popen(command, \"r\");
rewind(in);
char buff[50];
int counter = 0;
while(fgets(buff,sizeof(buff),in))
{
char c=\' \';
int i = 0;
int cnt = atoi(buff);
arr[line_number-1].count[counter] = cnt;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+6];
i++;
}
int cnnt = 0;
while(c!=\' \')
{
c = buff[cnnt];
cnnt++;
}
i=0;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+cnnt];
i++;
}
sprintf(arr[line_number-1].wordlist[counter],\"%s\",buff);
counter++;
}
arr[line_number-1].count[counter] = -1;
fclose(in);
return NULL;
}
int main(void)
{
FILE *fp;
fp = fopen(\"file.txt\",\"r\");
char a[200];
lines = 0;
void *status = NULL;
while(fgets(a,sizeof(a),fp) !=NULL)
{
lines++;
}
fclose(fp);
arr = (struct return_val*) calloc(lines, sizeof(struct return_val) * lines);
threads = malloc(sizeof(pthread_t)*lines);
int i;
for(i=0;i= 0)
{
if(arr[i].count[ctr] > 0)
{
strcpy(final[final_ctr],arr[i].wordlist[ctr]);
final_cnt[final_ctr] = arr[i].count[ctr];
arr[i].count[ctr] = 0;
int sum = aggregate(arr[i].wordlist[ctr]);
final_cnt[final_ctr] += sum;
printf(\"%d %s\",final_cnt[final_ctr],final[final_ctr]);
}
ctr++; final_ctr++;
}
i++;
if(i==lines)
{
break;
}
}
free(arr);
return 0;
}
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] .
pH = pKa + log (Sa) where S =moles of salt a = m.pdf
pH = pKa + log (S/a) where S =moles of salt a = moles of acid pH = 4.745 + log
(0.025 / 0.1) = 4.143
Solution
pH = pKa + log (S/a) where S =moles of salt a = moles of acid pH = 4.745 + log
(0.025 / 0.1) = 4.143.
H is reduced, while Fe is oxidized. Note the oxi.pdf
H is reduced, while Fe is oxidized. Note: the oxidation state of H changes from +1
In HI to 0 in H2. the oxidation state of Fe changes from 0 in Fe(CO)5 to +2 in Fe(CO)4I2. CO is
a neutral ligand.
Solution
H is reduced, while Fe is oxidized. Note: the oxidation state of H changes from +1
In HI to 0 in H2. the oxidation state of Fe changes from 0 in Fe(CO)5 to +2 in Fe(CO)4I2. CO is
a neutral ligand..
Elastic fluids Nonmetals Metals Earths .pdf
Elastic fluids Nonmetals Metals Earths
Solution
Elastic fluids Nonmetals Metals Earths.
More Related Content
Similar to Hi, Please find my codeimport java.util.Random;public class Pro.pdf
Utility.ppt
Provides a detailed a about new features of java 17 . Depicts us how to enhance our Java code with new features
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
import java.util.Scanner;public class ArrayOperation { inp.pdf
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413
Solution
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413.
Lecture 7 arrays
An array is an important topic in any language but in java Array is treated as an object.
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from Xmin to Xmax using a
step size of step
A)Draw a picture of what is going on.
B) Write a expression for n the total number of samples involved (in terms of Xmin, Xmax and
step)
C) Write out the sequence of x-samples
D) Write a direct and general expression for xi that captures the sequence
E) Write a recursive expression for the sequence
F) Write a program to compute and store the x-samples over the range -5x5 using a step size of
0.1 do everything in main ()
2 . We talked about the following string functions that are available in C (as long as you include
string.h):
int strlen(char str[])
void strcpy(char str1[], char str2[])
void strcat(char str1[], str2[])
Write your own versions of these functions; for example: int paul_strlen(int char str[]). Hint: for
your version of the strlen function, start at the first character in the array and keep counting until
you find the ‘\\0’ character (use a while loop for this). Note: Use your version of the strlen
function in the strcpy and strcat functions.
9. We want to insert a number into an array.
(a) Formulate the problem mathematically with two sequences: x and y. (b) Write a function of
the form:
insertNumIntoArray(int n, int array[], int num, int index)
The function inserts num into the array at the specified index. The rest of the array then follows.
For example, if num = 9 and index = 3 and array = [7 2 8 8 3 1 2] then the function will produce:
array = [7 2 8 9 8 3 1 2]
Note: assume that array is properly dimensioned to have at least 1 extra space for storage.
10. Repeat #2 by for the delete operation; that is, we want to delete a single element (at a
specified index) from an array; for example, suppose index = 3 and array = [50 70 10 90 60 20],
then the result will be
array: [50 70 10 60 20]
11. Repeat #2 by for an insert operation where we are inserting several values into the array. The
function should be of the form:
int insertArrayIntoArray(int n, int inArray[],
int nInsert, int insertArray[], int outArray[], int index)
The dimension of outArray is returned (explicitly). For example:
inArrayarray: [7 2 8 6 3 9]
insertArray: [50 60 70]
index: 2
outArray: [7 2 50 60 70 8 6 3 9]
Assume that outArray is large enough to hold all n + nInsert values.
Solution
#include
//Simulates strlen() library function
int paul_strlen(char str[])
{
int l;
for(l = 0; str[l] != \'\\0\'; l++) ;
return l;
}
//Simulates strcpy() library function
void paul_strcpy(char str1[], char str2[])
{
int c;
for(c = 0; str1[c] != \'\\0\'; c++)
str2[c] = str1[c];
str2[c] = \'\\0\';
printf(\"\ Original String: %s\", str1);
printf(\"\ Copied String: %s\", str2);
}
//Simulates strcat() library function
void paul_strcat(char str1[], char str2[])
{
int i, j;
for(i = 0; str1[i] != \'\\0\'; i++) ;
for (j = 0; str2[j] != \'\\0\'; i++, j++)
{
str1[i] = str2[j];
}
str1[i] = \'\\0\';
printf(\"\ Concatenated String: %s\", str1);
}
int main()
{
char data1[20], data2[20];
pri.
Refer to my progress on this assignment belowIn this problem you w.pdf
Refer to my progress on this assignment below
In this problem you will make it “more” object-oriented in the following ways:
-You will change its name to SortedList
-You will change the constructor that takes no arguments to be more traditional and initialize the
member fields to dummy values.
-You will add a constructor that takes in an initialized array and a size
-You will add an insert function that adds a value to the list and maintains its sorted-ness
-You will add a quicksort function check the below code.
-You will make updates as necessary to the main function so that it still runs and tests your code.
The code below seems to sort correctly but it skips over some items in the array and I am not
sure what is happening. Please help! Thanks!
import java.util.Scanner;
class SortedList
{
private static int array[];
private static int n;
public SortedList()
{
Scanner in = new Scanner(System.in);
System.out.println(\"Enter number of elements\");
n = in.nextInt();
array = new int[n];
if(n == 0) {
System.out.print(\"Since no arguments array set to: \");
} else {
System.out.print(\"Creating array size \" + n + \": \");
}
for(int i = 0; i < n; i++)
{
array[i] = 0;
}
//System.out.println(\"Enter \" + n + \" integers in ascending order\");
/*for (c = 0; c < n; c++)
array[c] = in.nextInt();*/
for(int i = 0; i < n; i++)
{
System.out.print(array[i] + \" \");
}
System.out.print(\"\ \");
}
public SortedList(int a[], int size)
{
array = a;
n = size;
}
public int binsearch(int search)
{
int first, last, middle;
first = 0;
last = n - 1;
middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
//System.out.println(search + \" found at location \" + (middle + 1) + \".\");
return middle+1;//+1 for the non-CS people who don\'t start counting at zero.
}
else
last = middle - 1;
middle = (first + last)/2;
}
return -1;
//System.out.println(search + \" is not present in the list.\ \");
}
public static int partition(int input[], int p, int r)
{
int pivot = input[r];
while(p < r)
{
while(input[p] < pivot)
{
p++;
}
while(input[r] > pivot)
{
r--;
}
if(input[p] == input[r])
{
p++;
}
else if(p < r)
{
int tmp = input[p];
input[p] = input[r];
input[r] = tmp;
}
}
return r;
}
public static void quicksort(int input[], int p, int r)
{
if(p < r)
{
int j = partition(input, p, r);
quicksort(input, p, j-1);
quicksort(input, j+1, r);
}
}
public static void insert(int value, int cell)
{
array[cell] = value;
quicksort(array, 0, n-1);
}
public static void main(String args[])
{
int c;
Scanner in = new Scanner(System.in);
SortedList b = new SortedList();
System.out.println(\"Input numbers\");
for(int i = 0; i < n; i++)
{
c = in.nextInt();
in.nextLine();
insert(c, i);
}
in.close();
for(int j = 0; j < n; j++)
{
System.out.print(array[j] + \", \");
}
}
}
Solution
//the whole program that you wrote is correct except one line , when you call the quicksort
everytime you insert a //value dont pass n pass the i.
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...Sunil Kumar Gunasekaran
The Art of Clean Code
Have you ever wanted to add a new feature to your code but instead found yourself spending hours trying to understand the existing code? Or adding a new feature and then finding out you've broken something else, supposedly unrelated, that used to work?
These slides hold a few tips on how to write code that'll be easier to understand, nicer to read and more simple to maintain.
import javautilLinkedList import javautilQueue import .pdf
import java.util.LinkedList; import java.util.Queue; import java.util.Stack; class
Sudoku_Solver_question { public static int type = 0; public static int height = 0; // Node exploration
holds the sudoku board in every iteration private static class Exploration { char[][] board; int curCell
= 0; // constructor method public Exploration(char[][] board, int curCell) { this.board =
cloneBoard(board); this.curCell = curCell; } // clones the board for every state private char[][]
cloneBoard(char[][] board) { char[][] newBoard = new char[board.length][board[0].length];
copyIntoBoard(board, newBoard); return newBoard; } } public static boolean BFS(char[][] board) {
// TODO write BFS search algorithm } public static boolean DFS(char[][] board) { // TODO write
DFS search algorithm } /** * parameter: index * return: index * Returns the index of a row based on
type(6x6 / 9x9) of the board */ private static int getRowForIndex(int idx) { return idx / type; } /** *
parameter: index * return: index * Returns the index of a column based on type(6x6 / 9x9) of the
board */ private static int getColumnForIndex(int idx) { return idx % type; } /** * Parameters: source
board & destination board * return: null * Copies the source board to destination board in every
state */ protected static void copyIntoBoard(char[][] src, char[][] dst) { for (int i = 0; i < src.length;
i++) { System.arraycopy(src[i], 0, dst[i], 0, src[i].length); } } /** * Parameters: Board & box index
number * returns: true / false * Validates the box, returns true if there is no duplicate number in the
box else false */ private static boolean isValidSquare(char[][] board, int s) { boolean[] isPresent =
new boolean[board.length+1]; for (int r = (s / 3) * height; r < ((s / 3) + 1) * height; r++) { for (int c =
(s % 3) * height; c < ((s % 3) + 1) * height; c++) { char value = board[r][c]; if (value == '.') {
continue; } int intVal = Character.getNumericValue(value); if (isPresent[intVal]) { return false; }
isPresent[intVal] = true; } } return true; } /** * Parameters: Board & column index number * returns:
true / false * Validates the box, returns true if there is no duplicate number in the column else false
*/ private static boolean isValidColumn(char[][] board, int c) { boolean[] isPresent = new
boolean[board.length+1]; for (int i = 0; i < board.length; i++) { char value = board[i][c]; if (value ==
'.') { continue; } int intVal = Character.getNumericValue(value); if (isPresent[intVal]) { return false; }
isPresent[intVal] = true; } return true; } /** * Parameters: Board & row index number * returns: true /
false * Validates the box, returns true if there is no duplicate number in the row else false */ private
static boolean isValidRow(char[][] board, int r) { boolean[] isPresent = new
boolean[board.length+1]; for (int i = 0; i < board.length; i++) { char value = board[r][i]; if (value ==
'.') { continue; } int intVal = Character.getNumericValue(value); if (isPresent[intVal]) { return false; }
isPre.
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
1. import java.util.Scanner;
public class Alphabetical_Order
{
public static void main(String[] args)
{
int n;
String temp;
Scanner s = new Scanner(System.in);
n = 3;
String names[] = new String[3];
Scanner s1 = new Scanner(System.in);
System.out.println(\"Enter all the names:\");
for(int i = 0; i < n; i++)
{
names[i] = s1.nextLine();
}
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (names[i].compareTo(names[j])>0)
{
temp = names[i];
names[i] = names[j];
names[j] = temp;
}
}
}
System.out.print(\"Names in Sorted Order:\");
for (int i = 0; i < n - 1; i++)
{
System.out.print(names[i] + \",\");
}
System.out.print(names[n - 1]);
}
}
2.
import java.util.Scanner;
class prime
{
public static void main(String[] args)
{
int n,p;
Scanner s=new Scanner(System.in);
System.out.println(“Enter upto which number prime numbers are needed”);
n=s.nextInt();
for(int i=2;i<=n;i++)
{
p=0;
for(int j=2;j=1 && n<=10)
break;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
System.out.print(i*j);
}
System.out.print(\'\ \');
}
}
}
Solution
1. import java.util.Scanner;
public class Alphabetical_Order
{
public static void main(String[] args)
{
int n;
String temp;
Scanner s = new Scanner(System.in);
n = 3;
String names[] = new String[3];
Scanner s1 = new Scanner(System.in);
System.out.println(\"Enter all the names:\");
for(int i = 0; i < n; i++)
{
names[i] = s1.nextLine();
}
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if (names[i].compareTo(names[j])>0)
{
temp = names[i];
names[i] = names[j];
names[j] = temp;
}
}
}
System.out.print(\"Names in Sorted Order:\");
for (int i = 0; i < n - 1; i++)
{
System.out.print(names[i] + \",\");
}
System.out.print(names[n - 1]);
}
}
2.
import java.util.Scanner;
class prime
{
public static void main(String[] args)
{
int n,p;
Scanner s=new Scanner(System.in);
System.out.println(“Enter upto which number prime numbers are needed”);
n=s.nextInt();
for(int i=2;i<=n;i++)
{
p=0;
for(int j=2;j=1 && n<=10)
break;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
System.out.print(i*j);
}
System.out.print(\'\ \');
}
}
}.
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] = \"p\' \'file.txt\'\\0\";
char command[100];
command[0] = \'\\0\';
strcat(command,cmd_p1);
strcat(command,cmd_p2);
strcat(command,cmd_p3);
//usleep(line_number);
char cmd[100] = \" | tr [:space:] \'\\\ \' | grep -v \'^\\\\s*$\' | sort | uniq -c | sort\\0\";
strcat(command,cmd);
FILE *in;
in= popen(command, \"r\");
rewind(in);
char buff[50];
int counter = 0;
while(fgets(buff,sizeof(buff),in))
{
char c=\' \';
int i = 0;
int cnt = atoi(buff);
arr[line_number-1].count[counter] = cnt;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+6];
i++;
}
int cnnt = 0;
while(c!=\' \')
{
c = buff[cnnt];
cnnt++;
}
i=0;
while(c!=\'\\0\')
{
c=buff[i];
buff[i]=buff[i+cnnt];
i++;
}
sprintf(arr[line_number-1].wordlist[counter],\"%s\",buff);
counter++;
}
arr[line_number-1].count[counter] = -1;
fclose(in);
return NULL;
}
int main(void)
{
FILE *fp;
fp = fopen(\"file.txt\",\"r\");
char a[200];
lines = 0;
void *status = NULL;
while(fgets(a,sizeof(a),fp) !=NULL)
{
lines++;
}
fclose(fp);
arr = (struct return_val*) calloc(lines, sizeof(struct return_val) * lines);
threads = malloc(sizeof(pthread_t)*lines);
int i;
for(i=0;i= 0)
{
if(arr[i].count[ctr] > 0)
{
strcpy(final[final_ctr],arr[i].wordlist[ctr]);
final_cnt[final_ctr] = arr[i].count[ctr];
arr[i].count[ctr] = 0;
int sum = aggregate(arr[i].wordlist[ctr]);
final_cnt[final_ctr] += sum;
printf(\"%d %s\",final_cnt[final_ctr],final[final_ctr]);
}
ctr++; final_ctr++;
}
i++;
if(i==lines)
{
break;
}
}
free(arr);
return 0;
}
#include
#include
#include
#include
/*Structure for storing words received from each thread*/
struct return_val{
char wordlist[100][100];
int count[100];
} *arr;
pthread_t *threads;
int lines;
/*Aggregates Frequency Sum of different threads*/
int aggregate(char *a)
{
int sum = 0;
int i=0;
while(1)
{
if(i==lines) break;
int count = 0;
while(1)
{
if(arr[i].count[count] == -1)
{
break;
}
if(strcmp(a,arr[i].wordlist[count]) == 0)
{
sum += arr[i].count[count];
arr[i].count[count] = 0;
}
count++;
}
i++;
}
return sum;
}
/*Function executed by each thread on separate line*/
void *word_count(void* num)
{
int *ln = num;
unsigned int line_number = *ln;
line_number++;
char cmd_p1[9] = \"sed -n \'\\0\";
char cmd_p2[2];
sprintf(cmd_p2,\"%d\",line_number);
char cmd_p3[14] .
Similar to Hi, Please find my codeimport java.util.Random;public class Pro.pdf (19)
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
import java.util.Scanner;public class ArrayOperation { inp.pdf
import java.util.Scanner;public class ArrayOperation { inp.pdf
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
1sequences and sampling. Suppose we went to sample the x-axis from X.pdf
Refer to my progress on this assignment belowIn this problem you w.pdf
Refer to my progress on this assignment belowIn this problem you w.pdf
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
import javautilLinkedList import javautilQueue import .pdf
import javautilLinkedList import javautilQueue import .pdf
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
#include stdio.h#include stdlib.h#include string.h#inclu.pdf
More from anujsharmaanuj14
pH = pKa + log (Sa) where S =moles of salt a = m.pdf
pH = pKa + log (S/a) where S =moles of salt a = moles of acid pH = 4.745 + log
(0.025 / 0.1) = 4.143
Solution
pH = pKa + log (S/a) where S =moles of salt a = moles of acid pH = 4.745 + log
(0.025 / 0.1) = 4.143.
H is reduced, while Fe is oxidized. Note the oxi.pdf
H is reduced, while Fe is oxidized. Note: the oxidation state of H changes from +1
In HI to 0 in H2. the oxidation state of Fe changes from 0 in Fe(CO)5 to +2 in Fe(CO)4I2. CO is
a neutral ligand.
Solution
H is reduced, while Fe is oxidized. Note: the oxidation state of H changes from +1
In HI to 0 in H2. the oxidation state of Fe changes from 0 in Fe(CO)5 to +2 in Fe(CO)4I2. CO is
a neutral ligand..
Elastic fluids Nonmetals Metals Earths .pdf
Elastic fluids Nonmetals Metals Earths
Solution
Elastic fluids Nonmetals Metals Earths.
Vehicle.javapublic class Vehicle { Declaring instance var.pdf
Vehicle.java
public class Vehicle
{
//Declaring instance variables
private int max_no_passengers;
private int top_speed;
private double miles_travelled;
//Parameterized constructor
public Vehicle(int max_no_passengers, int top_speed, double miles_travelled) {
super();
this.max_no_passengers = max_no_passengers;
this.top_speed = top_speed;
this.miles_travelled = miles_travelled;
}
//Getters and setters
public int getMax_no_passengers() {
return max_no_passengers;
}
public void setMax_no_passengers(int max_no_passengers) {
this.max_no_passengers = max_no_passengers;
}
public int getTop_speed() {
return top_speed;
}
public void setTop_speed(int top_speed) {
this.top_speed = top_speed;
}
public double getMiles_travelled() {
return miles_travelled;
}
public void setMiles_travelled(double miles_travelled) {
this.miles_travelled = miles_travelled;
}
/* This getInfor() method returns the information about this vehicle class object
* Params: void
* Return:String
*/
public String getInfo()
{
String str=\"\ Maximum No of Passengers :\"+getMax_no_passengers()+
\"\ Top Speed :\"+getTop_speed()+
\"\ Total Miles Travelled :\"+getMiles_travelled();
return str;
}
}
_____________________________________________
FoodTruck.java
import java.util.ArrayList;
public class FoodTruck extends Vehicle{
//Declaring instance variables
private String name;
private ArrayList menu;
//Parameterized constructor
public FoodTruck(int max_no_passengers, int top_speed,
double miles_travelled, String name, ArrayList menu) {
super(max_no_passengers, top_speed, miles_travelled);
this.name = name;
this.menu = menu;
}
//Getters and setters
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public ArrayList getMenu() {
return menu;
}
public void setMenu(ArrayList menu) {
this.menu = menu;
}
/* This getInfor() method returns the information about this Food truck class Object
* And also the information about the Vehicle class Object.
* Params: void
* Return:String
*/
@Override
public String getInfo() {
String str=\"Food Truck Name : \"+name+
\"\ Menu of items : \"+menu+super.getInfo();
return str;
}
}
________________________________________________
Test.java
import java.util.ArrayList;
public class Test {
public static void main(String[] args) {
//Creating an ArrayList Object which holds List of Menu Items
ArrayList menu1=new ArrayList();
//Adding menu items to the ArrayList
menu1.add(\"Burger\");
menu1.add(\"Pizza\");
menu1.add(\"Chips\");
//Creating FoodTruck Object by passing parameters.
FoodTruck truck1=new FoodTruck(15,100,10000,\"Mobile Food Court\",menu1);
//Displaying the Truck1 Information.
System.out.println(\"__________Truck 1 Details__________\");
System.out.println(truck1.getInfo());
//Creating an ArrayList Object which holds List of Menu Items
ArrayList menu2=new ArrayList();
//Adding menu items to the ArrayList
menu2.add(\"Tea\");
menu2.add(\"Coffe\");
menu2.add(\"Cool Drinks\");
//Creating FoodTruck Object by passing parameters.
Ionization energy is the energy required to remove theouter most ele.pdf
Ionization energy is the energy required to remove theouter most electron from the gaseous
atom.
The electronic configuration (E.C.) of O (8) is [He]2s2 2p4
The electronic configuration (E.C.) of S (16) is [Ne]3s2 3p4
The electronic configuration (E.C.) of S (16) is [Ne]3s2 3p4
The electronic configuration (E.C.) of P (15) is [Ne]3s2 3p3
The electronic configuration (E.C.) of Al (13) is [Ne]3s2 3p1
The electronic configuration (E.C.) of K(19) is [Ar]4s1
The electronic configuration (E.C.) of Na (11) is [Ne]3s1
1)O & S belongs to same group so on moving from top tobottom atomc size increases ,so for the
removal of e- from S iseasier than O ==> ionization energy is more for O
2)Na &K belongs to same group so on moving from topto bottom atomc size increases ,so for the
removal of e- from K iseasier than Na ==> ionization energy is more for Na
3) Na, Al , & P beleong to the same period.On moving fromleft to right the atomic size will
decreases due the morenuclear charge.So to remove the e- from P is more than that of Alwhich in
ture is more than Na
4)Among P & S , P has half filled configuration of porbitals so more stable than S .Therefore
more energy for P thanS
So the overall order of the ionization energy is O >P > S > Al > Na > K
1)O & S belongs to same group so on moving from top tobottom atomc size increases ,so for the
removal of e- from S iseasier than O ==> ionization energy is more for O
2)Na &K belongs to same group so on moving from topto bottom atomc size increases ,so for the
removal of e- from K iseasier than Na ==> ionization energy is more for Na
3) Na, Al , & P beleong to the same period.On moving fromleft to right the atomic size will
decreases due the morenuclear charge.So to remove the e- from P is more than that of Alwhich in
ture is more than Na
4)Among P & S , P has half filled configuration of porbitals so more stable than S .Therefore
more energy for P thanS
So the overall order of the ionization energy is O >P > S > Al > Na > K
Solution
Ionization energy is the energy required to remove theouter most electron from the gaseous
atom.
The electronic configuration (E.C.) of O (8) is [He]2s2 2p4
The electronic configuration (E.C.) of S (16) is [Ne]3s2 3p4
The electronic configuration (E.C.) of S (16) is [Ne]3s2 3p4
The electronic configuration (E.C.) of P (15) is [Ne]3s2 3p3
The electronic configuration (E.C.) of Al (13) is [Ne]3s2 3p1
The electronic configuration (E.C.) of K(19) is [Ar]4s1
The electronic configuration (E.C.) of Na (11) is [Ne]3s1
1)O & S belongs to same group so on moving from top tobottom atomc size increases ,so for the
removal of e- from S iseasier than O ==> ionization energy is more for O
2)Na &K belongs to same group so on moving from topto bottom atomc size increases ,so for the
removal of e- from K iseasier than Na ==> ionization energy is more for Na
3) Na, Al , & P beleong to the same period.On moving fromleft to right the atomic size will
decreases due the morenuclear charge.So to remove the e- .
D. Both C and N are hybridized sp3 .pdf
D. Both C and N are hybridized sp3
Solution
D. Both C and N are hybridized sp3.
The presence of conjugated Carbon-carbon double bonds causes colorat.pdf
The presence of conjugated Carbon-carbon double bonds causes coloration. When those bonds
are broken, the color fades.
Solution
The presence of conjugated Carbon-carbon double bonds causes coloration. When those bonds
are broken, the color fades..
The amount to be deposited at the start of his studies is found as.pdf
The amount to be deposited at the start of his studies is found as
PV = C [ 1 - ( 1+r)-2 / r ] x ( 1+r)-t
PV = $ 12,300 [ 1 - ( 1+0.06)-2 / 0.06 ] x( 1+0.06) -1
PV = 21,274
Solution
The amount to be deposited at the start of his studies is found as
PV = C [ 1 - ( 1+r)-2 / r ] x ( 1+r)-t
PV = $ 12,300 [ 1 - ( 1+0.06)-2 / 0.06 ] x( 1+0.06) -1
PV = 21,274.
SolutionNet cash provided by operating activities for the year end.pdf
Solution
Net cash provided by operating activities for the year ended December 31, 2014
Eliminate
Depreciation expense
+80000
Adjust revenue and expenses from accrual
accounting to cashNet income151490
Eliminate
Depreciation expense
+80000
Adjust revenue and expenses from accrual
accounting to cashIncrease in account receivable(20370)Decrease in inventory+12840Increase in
prepaid expenses(4370)Decrease in account payable(6480)Increase in accrued expenses
payable+11240Total cash generated by operating activities224360.
SOA ( Service Oriented Architecture)SOA is a type of architectura.pdf
SOA ( Service Oriented Architecture):
SOA is a type of architectural pattern in computer software design where application
components provides services to other components via network.This removes the need for third
party product,vendor or technology.
The main functionality to this type of model is to make it easier for software components
connected over the internet to communicate with each other without human interaction.so every
computer can run any number of services and this can be archeived without changing the main
program itself.SOA provides a cost effective way to evolve and enhance Enterprise information
systems.
Web 2.0 on the other hand is world wide web websites that emphasize user-generated
content,interoperability for end users. Some have agreed that web 2.0 is the best form of
realizing SOA.
1)-2) Interoperability and portability:
SOA can be realized through the help of webservices, because the best characterstic of
webservices is the interoperability.Different distributed web services run on variety of software
platforms and hardware architectures.JAVA j2EE and java WSDP are the best examples.
3) Platform independence:
For example take a case where XML,XML schema are there which are used to
publish,describe,search information. and there are multiple technologies and versions like SOAP,
WSDL, UDDI, and ebXML to do this. For the web services to be functional, we need an
environment of platform independent model.For example consider AJAX (asynchronous
javascript and XML) is not a technology, it is just a technique to createinteractive webpages for
this it supports XHTML,CSS,DOM,XML,XSLT,ATOM,SQL,REST,SOAP etc and uses
javascript to glue it all together.This is a perfect example of SOA present in current trend.
Solution
SOA ( Service Oriented Architecture):
SOA is a type of architectural pattern in computer software design where application
components provides services to other components via network.This removes the need for third
party product,vendor or technology.
The main functionality to this type of model is to make it easier for software components
connected over the internet to communicate with each other without human interaction.so every
computer can run any number of services and this can be archeived without changing the main
program itself.SOA provides a cost effective way to evolve and enhance Enterprise information
systems.
Web 2.0 on the other hand is world wide web websites that emphasize user-generated
content,interoperability for end users. Some have agreed that web 2.0 is the best form of
realizing SOA.
1)-2) Interoperability and portability:
SOA can be realized through the help of webservices, because the best characterstic of
webservices is the interoperability.Different distributed web services run on variety of software
platforms and hardware architectures.JAVA j2EE and java WSDP are the best examples.
3) Platform independence:
For example take a case where XML,XML schema are there which are used to
publis.
P0 = 21.40D1 = 1.07D2 =1.1449D3 = 1.2250P3 = 26.22Growth r.pdf
P0 = 21.40
D1 = 1.07
D2 =1.1449
D3 = 1.2250
P3 = 26.22
Growth rate in dividends: PV= 1.07; FV = 1.2240; N = 2; CPT I/Y; I/Y = 6.9544% Let\'s round
to 7%.
Dividend yield = (d1/P0) = 1.07/21.40 = 0.05
Total return = 7% + 5% = 12%
Solution
P0 = 21.40
D1 = 1.07
D2 =1.1449
D3 = 1.2250
P3 = 26.22
Growth rate in dividends: PV= 1.07; FV = 1.2240; N = 2; CPT I/Y; I/Y = 6.9544% Let\'s round
to 7%.
Dividend yield = (d1/P0) = 1.07/21.40 = 0.05
Total return = 7% + 5% = 12%.
Nt = No er twhere density at time tNo= = starting densityNr=dN.pdf
Nt = No er t
where density at time t
No= = starting density
Nr=dN/dt so r=1/N*dN/dt
t =1
1):- Nt = No er t
if No =1
=1* e-.1*1
=9.047
2):- Nt = No er t
if No=3
=3* e0.1*1=1.105*3=3.3156
3):-Nt = No er t
if No=7=
7*e0.37*1=10.08
4):-Nt = No er t
if No=14
=14*e-0.3*1=10.36
Solution
Nt = No er t
where density at time t
No= = starting density
Nr=dN/dt so r=1/N*dN/dt
t =1
1):- Nt = No er t
if No =1
=1* e-.1*1
=9.047
2):- Nt = No er t
if No=3
=3* e0.1*1=1.105*3=3.3156
3):-Nt = No er t
if No=7=
7*e0.37*1=10.08
4):-Nt = No er t
if No=14
=14*e-0.3*1=10.36.
Normalization is necessay step in creation of database design becaus.pdf
Normalization is necessay step in creation of database design because:
Solution
Normalization is necessay step in creation of database design because:.
For sound intensity,ratio in dB is given byx = 10log(IIo)We.pdf
For sound intensity,
ratio in dB is given by:
x = 10*log(I/Io)
We know, I = P/(4*pi*D^2) <----- I is inversely proportional to D
So, x = 10*log(D^2/(D+d)^2)
where D = original distance from speaker
d = distance he has moved from original distance from speaker
So, -14 = 10*log((D/(D+d))^2)
So, (D+d)/D = 5.01
So, 1 + d/D = 5.01
So, d/D = 4.01
So, d = 4.01*D <-------- So, he is about 4.01 times D away from original distance or 5.01*D
distance away from speaker
So, answer is : 5.01*D
Solution
For sound intensity,
ratio in dB is given by:
x = 10*log(I/Io)
We know, I = P/(4*pi*D^2) <----- I is inversely proportional to D
So, x = 10*log(D^2/(D+d)^2)
where D = original distance from speaker
d = distance he has moved from original distance from speaker
So, -14 = 10*log((D/(D+d))^2)
So, (D+d)/D = 5.01
So, 1 + d/D = 5.01
So, d/D = 4.01
So, d = 4.01*D <-------- So, he is about 4.01 times D away from original distance or 5.01*D
distance away from speaker
So, answer is : 5.01*D.
Exp- Listeria monocytogenes is a facultative anaerobic bacteria tha.pdf
Exp:- Listeria monocytogenes is a facultative anaerobic bacteria that can survive both aerobic
and anaerobic conditions and is responsible for listeriosis disease. The bacterium can undergo
fermentation in absence of oxygen and normal glycolysis and Krebs cycle.The main route of
infection is ingestion of contaminated food.
Solution
Exp:- Listeria monocytogenes is a facultative anaerobic bacteria that can survive both aerobic
and anaerobic conditions and is responsible for listeriosis disease. The bacterium can undergo
fermentation in absence of oxygen and normal glycolysis and Krebs cycle.The main route of
infection is ingestion of contaminated food..
DNA controversy is a dispute about whether Rosalind Franklin and Wil.pdf
DNA controversy is a dispute about whether Rosalind Franklin and Wilkins were given proper
credit for their contribution to the determination of the structure of DNA. In January 1951,
Franklin discovered that there were two forms of DNA by using x-ray diffraction techniques, she
worked as a research associate at King\'s College London in the Medical Research Council\'s
Biophysics Unit. The controversy arose from claims that some of the data were shown to Watson
and Crick, without her knowledge. Her experimental results provided estimates of the water
content of DNA crystals and these reults were consistent with the two sugar-phosphate
backbones being on the outside of the molecule. Franklin personallytold Crick and Watson that
hte X-ray diffraction images collected where the best evidence for the helical nature od DNA.
Crick and Waatson had been to the public seminar presented by Franklin, where they had spoken
to Wilkins about offering him a co-authorship on the article that first described the double helix
structure of DNA. On the completion of their model, Crick and Watson had invited Wilkins to be
a co-author of the paper describing the structure, he turned down this offer as he had taken no
part in building the model. Watson, Francis Crick and Maurice Wilkins were awarded the 1962
Nobel Prize for Physiology or Medicine for their discoveries concerning the molecular structure
of nucleic acids and its significance for information transfer in living material, with the help of
the research of Rosalind Franklin.
There is a little doubt that the significance of Franklin\'s data should have been acknowledged-
the evidence is overwhelming that it played an important role in Watson and Crick\'s modelling
process. Franklin could not share in the 1962 Nobel prize awarded to Watson and Crick because
she had died of ovarian cancer in 1958. Hence, it cannot be concluded that Watson and Crick
were not ethical about their research and also that they donot deserve a nobel prize for their
discovery. And the Historical records contain all the data of the work presented by Franklin and
also by Watson and Crick.
Solution
DNA controversy is a dispute about whether Rosalind Franklin and Wilkins were given proper
credit for their contribution to the determination of the structure of DNA. In January 1951,
Franklin discovered that there were two forms of DNA by using x-ray diffraction techniques, she
worked as a research associate at King\'s College London in the Medical Research Council\'s
Biophysics Unit. The controversy arose from claims that some of the data were shown to Watson
and Crick, without her knowledge. Her experimental results provided estimates of the water
content of DNA crystals and these reults were consistent with the two sugar-phosphate
backbones being on the outside of the molecule. Franklin personallytold Crick and Watson that
hte X-ray diffraction images collected where the best evidence for the helical nature od DNA.
Crick and Waatson had .
Delta is a measures of the change in price of an option for a one po.pdf
Delta is a measures of the change in price of an option for a one point move in the underlying
asset. Delta measure the price sensitivity of underlying assets.
Option (A) is correct answer.
Solution
Delta is a measures of the change in price of an option for a one point move in the underlying
asset. Delta measure the price sensitivity of underlying assets.
Option (A) is correct answer..
consider the cross between White petals and dark blue petalsFlower.pdf
consider the cross between White petals and dark blue petals
Flower color in sweet peas.
Sweet peas - is the classic object of genetic research of traits inheritance. When scientists studied
the color of flowers of this plant, they discover, that in some crosses the ratio of phenotype was
9:7. That is, from the crossing of two pure lines of sweet peas with white flowers, all plants in
first-generation had the purple flowers. And from crossing of these hybrids was obtained the
offspring with the phenotypic ratio : 9 purple: 7 white. If the ratio was 3:1, we could suppose,
that we are dealing with a simple monohybrid crossing, but in this case the ratio is differ. So
obviously, the genetic trait of color of sweet peas flowers is controlled by two nonallelic genes,
which interact each other. For convenience, we mark these genes as \"C\" and \"P\". Thus, the
pure lines will have genotypes \"CCpp\" and \"ccPP\", and first generation hybrids respectively
genotype \"CcPp\". The mechanism of genetic interaction of these genes has become known
recently. It was found that the color of sweet pea flowers depends on the synthesis of pigments -
anthocyanins. The synthesis of anthocyanins occurs in two stages. Gene \"C\" is responsible for
the first stage of the synthesis, while the gene \"P\" for second, and even if only one dominant
allele from these genes is lack, then synthesis of anthocyanins is not occurs. That is to say, that
the presence of a recessive allele in the homozygous state in the genotype of either of the two
genes is blocks the development of trait of flowers coloration. Such interaction of nonallelic
genes is called a double recessive epistasis. We can describe this interaction like this - recessive
allele of each gene in the homozygous state suppresses the expression of a dominant allele of
another ( \"cc\" suppresses \"P\", \"pp\" suppresses \"C\" ). Genetic traits file for this case should
be like this :
Solution
consider the cross between White petals and dark blue petals
Flower color in sweet peas.
Sweet peas - is the classic object of genetic research of traits inheritance. When scientists studied
the color of flowers of this plant, they discover, that in some crosses the ratio of phenotype was
9:7. That is, from the crossing of two pure lines of sweet peas with white flowers, all plants in
first-generation had the purple flowers. And from crossing of these hybrids was obtained the
offspring with the phenotypic ratio : 9 purple: 7 white. If the ratio was 3:1, we could suppose,
that we are dealing with a simple monohybrid crossing, but in this case the ratio is differ. So
obviously, the genetic trait of color of sweet peas flowers is controlled by two nonallelic genes,
which interact each other. For convenience, we mark these genes as \"C\" and \"P\". Thus, the
pure lines will have genotypes \"CCpp\" and \"ccPP\", and first generation hybrids respectively
genotype \"CcPp\". The mechanism of genetic interaction of these genes has bec.
More from anujsharmaanuj14 (20)
pH = pKa + log (Sa) where S =moles of salt a = m.pdf
pH = pKa + log (Sa) where S =moles of salt a = m.pdf
H is reduced, while Fe is oxidized. Note the oxi.pdf
H is reduced, while Fe is oxidized. Note the oxi.pdf
Vehicle.javapublic class Vehicle { Declaring instance var.pdf
Vehicle.javapublic class Vehicle { Declaring instance var.pdf
Ionization energy is the energy required to remove theouter most ele.pdf
Ionization energy is the energy required to remove theouter most ele.pdf
The presence of conjugated Carbon-carbon double bonds causes colorat.pdf
The presence of conjugated Carbon-carbon double bonds causes colorat.pdf
The amount to be deposited at the start of his studies is found as.pdf
The amount to be deposited at the start of his studies is found as.pdf
SolutionNet cash provided by operating activities for the year end.pdf
SolutionNet cash provided by operating activities for the year end.pdf
SOA ( Service Oriented Architecture)SOA is a type of architectura.pdf
SOA ( Service Oriented Architecture)SOA is a type of architectura.pdf
pH= -log(1x10-8)= 8SolutionpH= -log(1x10-8)= 8.pdf
pH= -log(1x10-8)= 8SolutionpH= -log(1x10-8)= 8.pdf
P0 = 21.40D1 = 1.07D2 =1.1449D3 = 1.2250P3 = 26.22Growth r.pdf
P0 = 21.40D1 = 1.07D2 =1.1449D3 = 1.2250P3 = 26.22Growth r.pdf
Nt = No er twhere density at time tNo= = starting densityNr=dN.pdf
Nt = No er twhere density at time tNo= = starting densityNr=dN.pdf
Normalization is necessay step in creation of database design becaus.pdf
Normalization is necessay step in creation of database design becaus.pdf
For sound intensity,ratio in dB is given byx = 10log(IIo)We.pdf
For sound intensity,ratio in dB is given byx = 10log(IIo)We.pdf
Exp- Listeria monocytogenes is a facultative anaerobic bacteria tha.pdf
Exp- Listeria monocytogenes is a facultative anaerobic bacteria tha.pdf
DNA controversy is a dispute about whether Rosalind Franklin and Wil.pdf
DNA controversy is a dispute about whether Rosalind Franklin and Wil.pdf
Delta is a measures of the change in price of an option for a one po.pdf
Delta is a measures of the change in price of an option for a one po.pdf
consider the cross between White petals and dark blue petalsFlower.pdf
consider the cross between White petals and dark blue petalsFlower.pdf
Recently uploaded
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
2024.06.01 Introducing a competency framework for languag learning materials ...
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
Embracing GenAI - A Strategic Imperative
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Recently uploaded (20)
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Hi, Please find my codeimport java.util.Random;public class Pro.pdf
- 1. Hi, Please find my code: import java.util.Random; public class ProcessArray { private int rows; //The attribute for number of rows in matrix private int columns; //The attribute for number of columns in matrix private int[][] firstArray; //The attribute for the first array private int[][] secondArray; //The attribute for the second array public int[][] getFirstArray() { return firstArray;} public int[][] getSecondArray() { return secondArray;} public ProcessArray(int rows, int columns){ //Constructor of object ProcessArray this.rows = rows; this.columns = columns; int[][] array = new int[rows][columns]; initializeArray(array); randomlyFillArray(); computeArrayValues(); printArray(secondArray); } public void initializeArray(int[][] array){ //Initializes first and second arrays and sets each value to 0 firstArray = new int[rows][columns]; secondArray = new int[rows][columns]; } public void randomlyFillArray(){ //Fills first array with random numbers for(int i = 0; i < firstArray.length;i++){ for(int j = 0; j < firstArray[0].length;j++){ Random r = new Random(); int num = r.nextInt(16); firstArray[i][j] = num; } } } public void computeArrayValues(){ int col = firstArray[0].length; int row = firstArray.length;
- 2. for(int i = 0; i < row; i++){ for(int j = 0; j< col; j++){ secondArray[i][j] = 0; if((i - 1) >=0){ secondArray[i][j] += firstArray[i-1][j]; if((j+1) < col) secondArray[i][j] += firstArray[i-1][j+1]; if(j > 0) secondArray[i][j] += firstArray[i-1][j-1]; } if((j+1) < col) secondArray[i][j] += firstArray[i][j+1]; if(j > 0) secondArray[i][j] += firstArray[i][j-1]; if((i+1) < row){ secondArray[i][j] += firstArray[i+1][j]; if((j+1) < col) secondArray[i][j] += firstArray[i+1][j+1]; if(j > 0) secondArray[i][j] += firstArray[i+1][j-1]; } } } } public void printArray(int[][] Array){ System.out.println(" Initial Array Filled With Random Numbers: "); for(int a = 0; a < firstArray.length; a++){ for(int b = 0; b < firstArray[0].length; b++){ if(b == 0) System.out.printf("%d ", firstArray[a][b]); else System.out.printf("%d ", firstArray[a][b]); }System.out.println(); }System.out.println(); System.out.println("Computed Array: ");
- 3. for(int a = 0; a < secondArray.length; a++){ for(int b = 0; b < secondArray[0].length; b++){ if(b == 0) System.out.printf("%d ", secondArray[a][b]); else System.out.printf("%d ", secondArray[a][b]); } System.out.println(); }System.out.println(); } public static void main(String[] args) { ProcessArray pr = new ProcessArray(3, 4); } } /* Sample Output: Initial Array Filled With Random Numbers: 7 3 6 12 10 2 11 10 12 14 1 7 Computed Array: 15 36 38 27 38 64 55 37 26 36 44 22 */ Solution Hi, Please find my code: import java.util.Random; public class ProcessArray { private int rows; //The attribute for number of rows in matrix private int columns; //The attribute for number of columns in matrix private int[][] firstArray; //The attribute for the first array private int[][] secondArray; //The attribute for the second array
- 4. public int[][] getFirstArray() { return firstArray;} public int[][] getSecondArray() { return secondArray;} public ProcessArray(int rows, int columns){ //Constructor of object ProcessArray this.rows = rows; this.columns = columns; int[][] array = new int[rows][columns]; initializeArray(array); randomlyFillArray(); computeArrayValues(); printArray(secondArray); } public void initializeArray(int[][] array){ //Initializes first and second arrays and sets each value to 0 firstArray = new int[rows][columns]; secondArray = new int[rows][columns]; } public void randomlyFillArray(){ //Fills first array with random numbers for(int i = 0; i < firstArray.length;i++){ for(int j = 0; j < firstArray[0].length;j++){ Random r = new Random(); int num = r.nextInt(16); firstArray[i][j] = num; } } } public void computeArrayValues(){ int col = firstArray[0].length; int row = firstArray.length; for(int i = 0; i < row; i++){ for(int j = 0; j< col; j++){ secondArray[i][j] = 0; if((i - 1) >=0){ secondArray[i][j] += firstArray[i-1][j]; if((j+1) < col) secondArray[i][j] += firstArray[i-1][j+1]; if(j > 0)
- 5. secondArray[i][j] += firstArray[i-1][j-1]; } if((j+1) < col) secondArray[i][j] += firstArray[i][j+1]; if(j > 0) secondArray[i][j] += firstArray[i][j-1]; if((i+1) < row){ secondArray[i][j] += firstArray[i+1][j]; if((j+1) < col) secondArray[i][j] += firstArray[i+1][j+1]; if(j > 0) secondArray[i][j] += firstArray[i+1][j-1]; } } } } public void printArray(int[][] Array){ System.out.println(" Initial Array Filled With Random Numbers: "); for(int a = 0; a < firstArray.length; a++){ for(int b = 0; b < firstArray[0].length; b++){ if(b == 0) System.out.printf("%d ", firstArray[a][b]); else System.out.printf("%d ", firstArray[a][b]); }System.out.println(); }System.out.println(); System.out.println("Computed Array: "); for(int a = 0; a < secondArray.length; a++){ for(int b = 0; b < secondArray[0].length; b++){ if(b == 0) System.out.printf("%d ", secondArray[a][b]); else System.out.printf("%d ", secondArray[a][b]); } System.out.println();
- 6. }System.out.println(); } public static void main(String[] args) { ProcessArray pr = new ProcessArray(3, 4); } } /* Sample Output: Initial Array Filled With Random Numbers: 7 3 6 12 10 2 11 10 12 14 1 7 Computed Array: 15 36 38 27 38 64 55 37 26 36 44 22 */