ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

•

0 likes•4 views

ArrayTest.java import java.util.Arrays; import java.util.Scanner; public class ArrayTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int table[] = new int[10]; int count = 0; Scanner scan = new Scanner(System.in); for(int i=0; i<10; i++){ System.out.println(\"Enter Array Element:\"); int n = scan.nextInt(); if(n < 0){ System.out.println(\"Invalid Number.\"); i--; if(count >= 5) break; }else{ table[i] = n; count++; } } int sum = 0; System.out.println(\"Array Elements are: \"+Arrays.toString(table)); for(int i=0; i avg){ high++; } else{ equal++; } } System.out.println(\"Number of elements less than average \"+less); System.out.println(\"Number of elements greater than average \"+high); System.out.println(\"Number of elements equal to average \"+equal); for(;;){ System.out.println(\"Enter Search Element (-1 to quit): \"); int searchNum = scan.nextInt(); if(searchNum == -1){ break; } int index = find(searchNum, table, count); if(index == -1){ System.out.println(\"Element not found\"); } else{ System.out.println(\"Element found at \"+index); } } smallest(table, count); } public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){ for(int i=0; i a[i]){ min = a[i]; index = i; } } System.out.println(\"The smallest element is \"+min+\" index is \"+index); int temp = a[0]; a[0] = a[index]; a[index] = temp; System.out.println(\"After swap array elements are :\"+Arrays.toString(a)); } } Output: Enter Array Element: 3 Enter Array Element: 4 Enter Array Element: 5 Enter Array Element: 2 Enter Array Element: 1 Enter Array Element: 6 Enter Array Element: 7 Enter Array Element: 8 Enter Array Element: -1 Invalid Number. Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0] The Sum is 36 The Average is : 4.5 Number of elements less than average 4 Number of elements greater than average 4 Number of elements equal to average 0 Enter Search Element (-1 to quit): 2 Element found at 3 Enter Search Element (-1 to quit): 3 Element found at 0 Enter Search Element (-1 to quit): 1 Element found at 4 Enter Search Element (-1 to quit): 6 Element found at 5 Enter Search Element (-1 to quit): -1 The smallest element is 1 index is 4 After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0] Solution ArrayTest.java import java.util.Arrays; import java.util.Scanner; public class ArrayTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int table[] = new int[10]; int count = 0; Scanner scan = new Scanner(System.in); for(int i=0; i<10; i++){ System.out.println(\"Enter Array Element:\"); int n = scan.nextInt(); if(n < 0){ System.out.println(\"Invalid Number.\"); i--; if(count >= 5) break; }else{ table[i] = n; count++; } } int sum = 0; System.out.println(\"Array Elements are: \"+Arrays.toString(table)); for(int i=0; i avg){ high++; } else{ equal++; } } System.out.println(\"Number of elements less than average \"+less); System.out.println(\"Number of.

Education

System.out.println("Number of elements less than average "+less);
System.out.println("Number of elements greater than average "+high);
System.out.println("Number of elements equal to average "+equal);
for(;;){
System.out.println("Enter Search Element (-1 to quit): ");
int searchNum = scan.nextInt();
if(searchNum == -1){
break;
}
int index = find(searchNum, table, count);
if(index == -1){
System.out.println("Element not found");
}
else{
System.out.println("Element found at "+index);
}
}
smallest(table, count);
}
public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){
for(int i=0; i a[i]){
min = a[i];
index = i;
}
}
System.out.println("The smallest element is "+min+" index is "+index);
int temp = a[0];
a[0] = a[index];
a[index] = temp;
System.out.println("After swap array elements are :"+Arrays.toString(a));
}
}
Output:

Enter Array Element:
3
Enter Array Element:
4
Enter Array Element:
5
Enter Array Element:
2
Enter Array Element:
1
Enter Array Element:
6
Enter Array Element:
7
Enter Array Element:
8
Enter Array Element:
-1
Invalid Number.
Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0]
The Sum is 36
The Average is : 4.5
Number of elements less than average 4
Number of elements greater than average 4
Number of elements equal to average 0
Enter Search Element (-1 to quit):
2
Element found at 3
Enter Search Element (-1 to quit):
3
Element found at 0
Enter Search Element (-1 to quit):
1
Element found at 4
Enter Search Element (-1 to quit):
6

Element found at 5
Enter Search Element (-1 to quit):
-1
The smallest element is 1 index is 4
After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0]
Solution
ArrayTest.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int table[] = new int[10];
int count = 0;
Scanner scan = new Scanner(System.in);
for(int i=0; i<10; i++){
System.out.println("Enter Array Element:");
int n = scan.nextInt();
if(n < 0){
System.out.println("Invalid Number.");
i--;
if(count >= 5)
break;
}else{
table[i] = n;
count++;
}
}
int sum = 0;
System.out.println("Array Elements are: "+Arrays.toString(table));

for(int i=0; i avg){
high++;
}
else{
equal++;
}
}
System.out.println("Number of elements less than average "+less);
System.out.println("Number of elements greater than average "+high);
System.out.println("Number of elements equal to average "+equal);
for(;;){
System.out.println("Enter Search Element (-1 to quit): ");
int searchNum = scan.nextInt();
if(searchNum == -1){
break;
}
int index = find(searchNum, table, count);
if(index == -1){
System.out.println("Element not found");
}
else{
System.out.println("Element found at "+index);
}
}
smallest(table, count);
}
public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){
for(int i=0; i a[i]){
min = a[i];
index = i;
}
}
System.out.println("The smallest element is "+min+" index is "+index);

int temp = a[0];
a[0] = a[index];
a[index] = temp;
System.out.println("After swap array elements are :"+Arrays.toString(a));
}
}
Output:
Enter Array Element:
3
Enter Array Element:
4
Enter Array Element:
5
Enter Array Element:
2
Enter Array Element:
1
Enter Array Element:
6
Enter Array Element:
7
Enter Array Element:
8
Enter Array Element:
-1
Invalid Number.
Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0]
The Sum is 36
The Average is : 4.5
Number of elements less than average 4
Number of elements greater than average 4
Number of elements equal to average 0
Enter Search Element (-1 to quit):
2
Element found at 3
Enter Search Element (-1 to quit):

3
Element found at 0
Enter Search Element (-1 to quit):
1
Element found at 4
Enter Search Element (-1 to quit):
6
Element found at 5
Enter Search Element (-1 to quit):
-1
The smallest element is 1 index is 4
After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0]

Similar to ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

import java.util.Scanner; public class Digits { public static void main(String[] args) { int oddCount = 0, evenCount = 0, zeroCount = 0; //digit counters int value, digit; //stores input value and digit respectively int copy; //stores copy of entry Scanner scan = new Scanner(System.in); //Get value from user System.out.println(\"enter number :\"); int value=scan.nextInt(); copy=value; //Make the value positive value=Math.abs(value); //What if the value is actually zero? if(value==0) zeroCount++; while(value>0) { digit=value10; if(digit==0) zerocount++; if(digit%2==0) evenCount++; else oddCount++; value=value/10; } System.out.println(\"original value:\"+copy); System.out.println(\"zero digits :\"+zeroCount); System.out.println(\"odd digits :\"+oddCount); System.out.println(\"even digits :\"+evenCount) } } Solution import java.util.Scanner; public class Digits { public static void main(String[] args) { int oddCount = 0, evenCount = 0, zeroCount = 0; //digit counters int value, digit; //stores input value and digit respectively int copy; //stores copy of entry Scanner scan = new Scanner(System.in); //Get value from user System.out.println(\"enter number :\"); int value=scan.nextInt(); copy=value; //Make the value positive value=Math.abs(value); //What if the value is actually zero? if(value==0) zeroCount++; while(value>0) { digit=value10; if(digit==0) zerocount++; if(digit%2==0) evenCount++; else oddCount++; value=value/10; } System.out.println(\"original value:\"+copy); System.out.println(\"zero digits :\"+zeroCount); System.out.println(\"odd digits :\"+oddCount); System.out.println(\"even digits :\"+evenCount) } }.

import java.util.Scanner;public class Digits { public static v.pdf

apexelectronices01

Java file

simarsimmygrewal

Java file

simarsimmygrewal

/* An object of class StatCalc can be used to compute several simple statistics for a set of numbers. Numbers are entered into the dataset using the enter(double) method. Methods are provided to return the following statistics for the set of numbers that have been entered: The number of items, the sum of the items, the average, the standard deviation, the maximum, and the minimum. */ public class Stats { private int count; // Number of numbers that have been entered. private double sum; // The sum of all the items that have been entered. private double squareSum; // The sum of the squares of all the items. private double max = Double.NEGATIVE_INFINITY; // Largest item seen. private double min = Double.POSITIVE_INFINITY; // Smallest item seen. int[] myList; public int getCount() { System.out.println(myList.size()); count = myList.size(). // Return number of items that have been entered. return count; } public double getSum() { int sum = 0; for (int i = 0; i < myList.length; i++) { sum +=mylist[i]; } return sum; } public double getMean() { int sum = 0; for (int i = 0; i < myList.length; i++) { sum +=mylist[i]; } if(count > 0) return sum / count; else return -1; } public double getMin() { int smallest = myList[0]; int largetst = myList[0]; for(int i=1; i< mylist.length; i++) { if(mylist[i] > largetst) largetst = numbers[i]; else if (mylist[i] < smallest) smallest = numbers[i]; } return smallest; } public double getMax() { int smallest = myList[0]; int largetst = myList[0]; for(int i=1; i< mylist.length; i++) { if(mylist[i] > largetst) largetst = numbers[i]; else if (mylist[i] < smallest) smallest = numbers[i]; } return largetst; } stats(int [] data) { if(data.count <= count) { if(myList.size() > 0) System.arraycopy( myList, 0, data, 0, count ); } } stats() { Scanner s = new Scanner(System.in); int count = s.nextInt(); s.nextLine(); // throw away the newline. int [] numbers = new int[count]; Scanner numScanner = new Scanner(s.nextLine()); for (int i = 0; i < count; i++) { if (numScanner.hasNextInt()) { numbers[i] = numScanner.nextInt(); } else { System.out.println(\"You didn\'t provide enough numbers\"); break; } } System.arraycopy( myList, 0, numbers, 0, count ); } stats(int size) { setValue(size); } private void setValue(int size) { count = size; myList = new int[size]; } } // end class StatCalc public class SimpleStats { public static void main(String[] args) { Stat calc; // Computes stats for numbers entered by user. calc = new Stat(100); int arry[] = {20.20.40,30.80,,70,4,5,6,7,10} calc.setvalue(array); double item; // One number entered by the user. TextIO.putln(\"Enter your numbers. Enter 0 to end.\"); TextIO.putln(); do { TextIO.put(\"? \"); item = TextIO.getlnDouble(); if (item != 0) calc.enter(item); } while ( item != 0 ); TextIO.putln(\"\ Statistics about your calc:\ \"); TextIO.putln(\" Count: \" + calc.getCount()); TextIO.putln(\" Sum: \" + calc.getSum()); TextIO.putln(\" Minimum: \" + calc.getMin()); TextIO.putln(\" Maximum: \" + ca.

An object of class StatCalc can be used to compute several simp.pdf

aravlitraders2012

DS LAB RECORD.docx

davinci54

import java.util.;public class Program{public static void.pdf

optokunal1

import java.util.Scanner;public class Main {private static i.pdf

stopgolook

Java Assignment.Implement a binary search algorithm on an array..pdf

irshadoptical

Oot practical

Vipin Rawat @ daya

Illegal numbers.a. Complete the method find which accepts a collec.pdf

gopalk44

import java.util.ArrayList; import java.util.Collections; import java.util.List; import static java.lang.System.out; public class homework { public static void main(String[] args) { List<Integer> list = new ArrayList<>(); for (int i = 0; i < 10; i++) list.add(int) (Math.random()* 10) + 1); Collections.sort(list); System.out.println("The list id : " + list); int index =linearSearch(list, 10); if (index >+ 0) System.out.println("Linear search: the number 5 was found at index " + index); else System.out.println("Linear search: the number 5 is not found "); List<String> names = new ArrayList<>(); names.add("Tyson"); names.add("John"); names.add("Edgar"); names.add("LouLou"); Collections.sort(list); System.out.println("The names are : " + names); index = linearSearch(names, "JOhn"); if (index >= 0) System.out.println("Linear search: Edgar was found at index " + names); else System.out.println("Linear search: Edgar is not found" + names); } public static <E> int linearSearch(List<E> lsit, E data) { for (int i = 0; i < list.size(); i++) if (list.get(i).equals(data)) return i; return -1; } } Chapter 14 - Linear Search and Binary Search - Assignment Due Wednesday by 11:59pm P Points 100 Submitting a text entry box or a file upload Allowed Attempts 1 Available until Mar 1 at 11:59pm Modify the binarySearch method shown in the video lecture so that it's generic. Test it with at least two types to make sure it works. Hint 1: Examine the review problem and its solution, which modifies the linear search algorithm in the same way. Hint 2: Your binarySearch method signature should be: "private static < E extends Comparable > boolean binarySearch(List list, E data): Turn in the following, - The source files (no zip file, just the individual java files). - A screen shot of your program in action. It should show the result of the test run. .

import java-util-ArrayList- import java-util-Collections- import java-.pdf

adhityalapcare

JAVA LAB #8 - ARRAY BASED LISTS The next exercise is based on this implemetation for an UnorderedArrayList of integers: //Interface: ArrayListADT //works for int public interface ArrayListADT { public boolean isEmpty(); //Method to determine whether the list is empty. public boolean isFull(); //Method to determine whether the list is full. public int listSize(); //Method to return the number of elements in the list. public int maxListSize(); //Method to return the maximum size of the list. public void print(); //Method to output the elements of the list. public boolean isItemAtEqual(int location, int item); //Method to determine whether item is the same as the item in the list at location. public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at the position public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list. public void removeAt(int location); //Method to remove the item from the list at location. public int retrieveAt(int location); //Method to retrieve the element from the list at location. public void replaceAt(int location, int repItem); //Method to replace the element in the list at location with repItem. public void clearList(); //Method to remove all the elements from the list. public int search(int searchItem); //Method to determine whether searchItem is in the list. public void remove(int removeItem); //Method to remove an item from the list. } //Class: ArrayListClass implements //Interface: ArrayListADT public abstract class ArrayListClass implements ArrayListADT { protected int length; //to store the length of the list protected int maxSize; //to store the maximum size of the list protected int[] list; //array to hold the list elements //Default constructor public ArrayListClass() { maxSize = 100; length = 0; list = new int[maxSize]; } //Alternate Constructor public ArrayListClass(int size) { if(size <= 0) { System.err.println(\"The array size must be positive. Creating an array of size 100.\"); maxSize = 100; } else maxSize = size; length = 0; list = new int[maxSize]; } public boolean isEmpty() { return (length == 0); } public boolean isFull() { return (length == maxSize); } public int listSize() { return length; } public int maxListSize() { return maxSize; } public void print() { for (int i = 0; i < length; i++) System.out.print(list[i] + \" \"); System.out.println(); } public boolean isItemAtEqual(int location, int item) { if (location < 0 || location >= length) { System.err.println(\"The location of the item to be compared is out of range.\"); return false; } return list[location]== item; } public void clearList() { for (int i = 0; i < length; i++) list[i] = 0; length = 0; System.gc(); //invoke the Java garbage collector } public void removeAt(int location) { if (location < 0 || location >= length) System.err.println(\"The location of the item to be removed is out of range.\"); else { for(int i = location; i < length - 1; i++) list[i] = list[i + 1.

JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf

arpaqindia

Code javascript

Ray Ray

Write the code above and the ones below in netbeans IDE 8.1 3. (Eliminate duplicates) Write a method that returns a new array by eliminating the duplicate values in the array using the following method header: public static int[] eliminateDuplicates(int[] list) Write a test program that reads in ten integers, invokes the method, and displays the result. Here is the sample run of the program: Enter ten numbers: 1 2 3 2 1 6 3 4 5 2 [Enter] The distinct numbers are: 1 2 3 6 4 5 4. (Sort students) Write a program that prompts the user to enter the number of students, the students’ names, and their scores, and prints student names in decreasing order of their scores. Solution Please follow the code and comments for description : a) CODE : import java.util.Scanner; public class MeanSD { public static double deviation (double[] x) { // method to return the deviation double sum = 0, mean = 0, deviation = 0; // required initialisations double[] temp = new double[10]; // temporary array for (int i = 0; i < 10; i++) //calculate the standard deviation { temp[i] = Math.pow((x[i] - mean), 2); // assigning the value to the array sum += temp[i]; // adding up the values } mean = sum / 10; // getting the mean deviation = Math.sqrt(mean); // calculating the deviation return deviation; // returning the deviation } public static double mean (double[] x) { // method to return themean of the values entered double sum = 0, mean; // required initialisations for (int i = 0; i < 10; i++) //Take input in the array { sum += x[i]; //sum of all elements } mean = sum / 10; // calculating the mean return mean; // returning the mean value } public static void main(String[] args) { // driver method System.out.println(\"Enter the 10 numbers.\"); // prompt to enter the data Scanner in = new Scanner(System.in); // scanner class to get the data from the user double[] arr = new double[10]; // array that saves the data double sum = 0, mean = 0, deviation = 0; // required initialisations for (int i = 0; i < 10; i++) //Take input in the array { System.out.print(\"Enter a number : \"); // prompt to enter the number arr[i] = in.nextDouble(); // getting the data from the console } mean = mean(arr); // calling the method to return the mean value System.out.println(\"Mean : \" + mean); //Display mean of all elements deviation = deviation(arr); // calling the method to return teh deviation value System.out.println(\"Deviation : \" + deviation); // display the result } } OUPTPUT : Enter the 10 numbers. Enter a number : 1 Enter a number : 2 Enter a number : 3 Enter a number : 4 Enter a number : 5 Enter a number : 6 Enter a number : 7 Enter a number : 8 Enter a number : 9 Enter a number : 10 Mean : 5.5 Deviation : 6.2048368229954285 b) CODE : import java.util.Scanner; public class MyDuplicateElements { public static int[] eliminateDuplicates(int[] input) { // method to remove the duplicates int j = 0; // required initialisations int i = 1; //return if the array length is less than 2 if (input..

Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf

arihantmum

Write a method called uniqueNumbers that takes an int array as parameter, and returns a different int array, which only contains the list of unique numbers in the original array. Hint: Use the isPresent method defined below to accomplish your here is the code we need to add too Solution solution package com.mt.classes; import java.util.ArrayList; import java.util.List; public class Lab8e { public static void main(String[] args) { int[] numbers = new int[20]; // Generate random numbers between 0 and 99 and fill up the array for (int i = 0; i < numbers.length; i++) { numbers[i] = (int) (Math.random() * 50); } System.out.println(\"The list is:\"); printNumbers(numbers); // Task 1 System.out.println(\"The smallest number in the list is \" + smallestNumber(numbers)); // Task 2 System.out.println(\"The largest number in the list is \" + largestNumber(numbers)); // Task 3 System.out.println(\"The average of numbers in the list is \" + averageOfNumbers(numbers)); // Task 4: Extra Credit. Uncomment the following // two lines if you complete this task. System.out.println(\"The list of unique numbers is:\"); uniqueNumbers(numbers); } private static void uniqueNumbers(int[] numbers) { for (int i = 0; i < numbers.length; i++) { boolean isDuplicate = false; for (int j = 0; j < i; j++) { if (numbers[i] == numbers[j]) { isDuplicate = true; break; } } if (!isDuplicate) { System.out.print(numbers[i] + \" \"); } } } public static void printNumbers(int[] list) { for (int i = 0; i < list.length; i++) { System.out.print(list[i] + \" \"); } System.out.println(); } // 1. Write a method called smallestNumber that // takes an int array as parameter, and returns the // smallest number public static int smallestNumber(int[] list) { int small = 100; for (int i = 0; i < list.length; i++) { if (list[i] < small) { small = list[i]; } } return small; } // 2. Write a method called largestNumber that // takes an int array as parameter, and returns the // largest number public static int largestNumber(int[] list) { int large = 0; for (int i = 0; i < list.length; i++) { if (list[i] > large) { large = list[i]; } } return large; } // 3. Write a method called averageOfNumbers that // takes an int array as parameter, and returns the // average of the numbers public static double averageOfNumbers(int[] list) { double average = 0.0; for (int i = 0; i < list.length; i++) { average = average + list[i]; } average = average / list.length; return average; } public static boolean isPresent(int[] list, int target) { boolean found = false; for (int i = 0; i < list.length && !found && list[i] != 0; i++) { if (list[i] == target) { found = true; } } return found; } } output The list is: 16 14 11 31 7 8 18 49 27 43 9 39 38 18 6 16 8 30 32 15 The smallest number in the list is 6 The largest number in the list is 49 The average of numbers in the list is 21.75 The list of unique numbers is: 16 14 11 31 7 8 18 49 27 43 9 39 38 6 30 32 15.

Write a method called uniqueNumbers that takes an int array as param.pdf

fashioncollection2

Similar to ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf (15)

import java.util.Scanner;public class Digits { public static v.pdf

Java file

An object of class StatCalc can be used to compute several simp.pdf

DS LAB RECORD.docx

import java.util.;public class Program{public static void.pdf

import java.util.Scanner;public class Main {private static i.pdf

Java Assignment.Implement a binary search algorithm on an array..pdf

Oot practical

Illegal numbers.a. Complete the method find which accepts a collec.pdf

import java-util-ArrayList- import java-util-Collections- import java-.pdf

JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf

Code javascript

Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf

Write a method called uniqueNumbers that takes an int array as param.pdf

More from deepua8

Balancing ANY chemical equation is done exactly the same. Easiest way is to start with a primary element such as Carbon, then just work your way back and forth between products and reactants until everything is balanced. Be sure to check your equation once you\'re done to make sure everything is balanced completely. Types of Chemical reactions: 1.) Combustion: A combustion reaction is when oxygen combines with another compound to form water and carbon dioxide. These reactions are exothermic, meaning they produce heat. An example of this kind of reaction is the burning of propane: C3H8 + 5O2 --> 3CO2 + 4H2O *Hint: Combustion reactions always have O2 in the reactants and CO2 and H2O somewhere in the products. 2.) Synthesis: A synthesis reaction is when two or more simple compounds combine to form a more complicated one. These reactions come in the general form of: A + B -- -> AB One example of a synthesis reaction is the combination of iron and sulfur to form iron (II) sulfide: 8 Fe + S8 ---> 8 FeS 3.) Decomposition: A decomposition reaction is the opposite of a synthesis reaction - a complex molecule breaks down to make simpler ones. These reactions come in the general form: AB ---> A + B One example of a decomposition reaction is the electrolysis of water to make oxygen and hydrogen gas: 2 H2O ---> 2 H2 + O2 4.) Single displacement: This is when one element trades places with another element in a compound. These reactions come in the general form of: A + BC ---> AC + B One example of a single displacement reaction is when magnesium replaces hydrogen in water to make magnesium hydroxide and hydrogen gas: Mg + 2 H2O ---> Mg(OH)2 + H2 5) Double displacement: This is when the anions and cations of two different molecules switch places, forming two entirely different compounds. These reactions are in the general form: AB + CD ---> AD + CB One example of a double displacement reaction is the reaction of lead (II) nitrate with potassium iodide to form lead (II) iodide and potassium nitrate: Pb(NO3)2 + 2 KI ---> PbI2 + 2 KNO3 6) Acid-base: This is a special kind of double displacement reaction that takes place when an acid and base react with each other. The H+ ion in the acid reacts with the OH- ion in the base, causing the formation of water. Generally, the product of this reaction is some ionic salt and water: HA + BOH ---> H2O + BA One example of an acid-base reaction is the reaction of hydrobromic acid (HBr) with sodium hydroxide: HBr + NaOH ---> NaBr + H2O *Hint: An acid plus a base always produces a salt and H2O as a product. Solution Balancing ANY chemical equation is done exactly the same. Easiest way is to start with a primary element such as Carbon, then just work your way back and forth between products and reactants until everything is balanced. Be sure to check your equation once you\'re done to make sure everything is balanced completely. Types of Chemical reactions: 1.) Combustion: A combustion reaction is when oxygen combines with an.

Balancing ANY chemical equation is done exactly t.pdf

deepua8

Since the heat of reaction ..is negative,.... it loses heat to.. the surroundings and therefore.. is exothermic. 2 NO(g) + O2(g) ---> 2 NO2(g) change in H= -114.1kJ molecular weight of NO2=80 so no of moles= 113.8/80=1.4225 so amount of heat produced =- 114.1/(2*1.14225) =40 kJ Solution Since the heat of reaction ..is negative,.... it loses heat to.. the surroundings and therefore.. is exothermic. 2 NO(g) + O2(g) ---> 2 NO2(g) change in H= -114.1kJ molecular weight of NO2=80 so no of moles= 113.8/80=1.4225 so amount of heat produced =- 114.1/(2*1.14225) =40 kJ.

36.Kovacs reagent is used in Indole test. Kovacs reagent is 4 (p)-.pdf

deepua8

10.Real number1.Baseb. Consists of a set and rule for combining2.Bin.pdf

deepua8

O-N=O is a resonance structure. In a resonance structure, the atoms themselves do not move, but the bonds move. In O-O, the elements cannot change to a different element. In N=C, another atom cannot be added. And in O=N-F, the atoms cannot be moved around. Solution O-N=O is a resonance structure. In a resonance structure, the atoms themselves do not move, but the bonds move. In O-O, the elements cannot change to a different element. In N=C, another atom cannot be added. And in O=N-F, the atoms cannot be moved around..

1. Yeasts grow by budding. The cell buds and separates into 2 cells..pdf

deepua8

Most carbon compounds are poor conductors of electricity as we have seen . From the data on the boiling and melting points of the above compounds, we can conclude that the forces of attraction between these molecules are not very strong. Since these compounds are largely nonconductors of electricity, we can conclude that the bonding in these compounds does not give rise to any ions. Solution Most carbon compounds are poor conductors of electricity as we have seen . From the data on the boiling and melting points of the above compounds, we can conclude that the forces of attraction between these molecules are not very strong. Since these compounds are largely nonconductors of electricity, we can conclude that the bonding in these compounds does not give rise to any ions..

1. 252.125Solution1. 252.125.pdf

deepua8

(B) 0.815Solution(B) 0.815.pdf

deepua8

Suppose AFnSolution Suppose AFn.pdf

deepua8

For the ethanol water graph the simple distillation should be a steady smooth increase, the fractional distillation should look like an s, that sort of takes a straight up jump in the middle. I am unsure about the other mixture though sorry, hope that helps Solution For the ethanol water graph the simple distillation should be a steady smooth increase, the fractional distillation should look like an s, that sort of takes a straight up jump in the middle. I am unsure about the other mixture though sorry, hope that helps.

C code on linked list #include stdio.h #include stdlib.h.pdf

deepua8

e =mc^2. m is the defected mass, or mass that isn\'t there and is instead used as binding energy. For Mg, you have 25 nucleons: 12 protons and 13 neutrons. So your expected mass would be 1.007825x12 + 1.008665x13 = 25.206545. The defected mass is the supposed mass minus the actual mass. so its 25.206545-24.985839= .220706 amu. Then you have to convert this into kilograms. so, divide 220706 amu by 1 kg = 6.022 x 10^26 and you get: 3.664996*10^-28 Solution e =mc^2. m is the defected mass, or mass that isn\'t there and is instead used as binding energy. For Mg, you have 25 nucleons: 12 protons and 13 neutrons. So your expected mass would be 1.007825x12 + 1.008665x13 = 25.206545. The defected mass is the supposed mass minus the actual mass. so its 25.206545-24.985839= .220706 amu. Then you have to convert this into kilograms. so, divide 220706 amu by 1 kg = 6.022 x 10^26 and you get: 3.664996*10^-28.

Definition of Log-Normal DistributionA statistical distr.pdf

deepua8

calculate the mol of NaOH so mol= concentration * volume n=C x V n= 0.175 x 0.0206 = 0.0036 then you get the ratio of acid to base from the equation above which is 1:1 so the number of mol of base is equal to the number of mol of acid n(acid)=0.0036 the concentration of that which is C=n/V C= 0.0036/0.025 C=0.144M Solution calculate the mol of NaOH so mol= concentration * volume n=C x V n= 0.175 x 0.0206 = 0.0036 then you get the ratio of acid to base from the equation above which is 1:1 so the number of mol of base is equal to the number of mol of acid n(acid)=0.0036 the concentration of that which is C=n/V C= 0.0036/0.025 C=0.144M.

Step1 NaOH (aq) ----- Na(+)(aq) + Cl(-)(aq) Ste.pdf

deepua8

The compounds with low oxidation states (O.S.) be.pdf

deepua8

A) ionic compounds generally formed between the combination of 1st and 2nd group elements with 7th group elements . ex: NaCl, MgF, CaCl2 and so on B) Molecular compounds means vanderwall forces acting btw the molecule these may be crystals or liguids .ex Iodine(I2) is molecular crystal ,Quartz, phosphorous(P4), sulphur(S8) C) hydrocarbons in general contain carbon and hydrogen in some cases hetero atoms may present in the compound . ex CH4 , C2H6, C2H2, C6H5N02, C6H12O6 (glucose) etc D) in general 5th, 6th, 7th groups oxides , oxy acids behaves as acid . ex: N20, N205, F20,HNO3, HClO4, HCl, HF, H2SO4, H2S208 etc along with these metal with lower oxidation state can also act as acidic compound ex: MnO MnO2 MnO3 in the above three oxides oxidation states of metals in orderly +2,+4,+6. so first compound can act as an acid last one is a base Solution A) ionic compounds generally formed between the combination of 1st and 2nd group elements with 7th group elements . ex: NaCl, MgF, CaCl2 and so on B) Molecular compounds means vanderwall forces acting btw the molecule these may be crystals or liguids .ex Iodine(I2) is molecular crystal ,Quartz, phosphorous(P4), sulphur(S8) C) hydrocarbons in general contain carbon and hydrogen in some cases hetero atoms may present in the compound . ex CH4 , C2H6, C2H2, C6H5N02, C6H12O6 (glucose) etc D) in general 5th, 6th, 7th groups oxides , oxy acids behaves as acid . ex: N20, N205, F20,HNO3, HClO4, HCl, HF, H2SO4, H2S208 etc along with these metal with lower oxidation state can also act as acidic compound ex: MnO MnO2 MnO3 in the above three oxides oxidation states of metals in orderly +2,+4,+6. so first compound can act as an acid last one is a base.

A) ionic compounds generally formed between the c.pdf

deepua8

A ethers ethers contain R-O-R linkage not carbony.pdf

deepua8

The fact that a molecule vibrates does not in itself insure that the molecule will exhibit an IR spectrum. For a particular vibrational mode to absorb infrared radiation, the vibrational motion associated with that mode must produce a change in the dipole moment of the molecule. HCl, for example, with a center of positive charge at the H atom and a center of negative charge at the Cl atom, has a dipole moment. The magnitude of the dipole moment changes as the HCl bond stretches, so this vibration absorbs IR radiation. We say that the vibration is IR active. The N2 molecule, on the other hand, has no dipole moment. Further, stretching the N-N bond does not produce a change in dipole moment, so the vibration is infrared inactive (i.e., cannot directly absorb IR radiation). It is important to realize that there are many molecules that, although possessing no permanent dipole moment, still undergo vibrations that cause changes in the value of the dipole moment from 0 to some non-zero value. An example is CO2, which has no permanent dipole moment because the individual bond dipoles exactly cancel. However, when CO2 undergoes a bending vibration, its dipole moment changes from zero to some non-zero value. This vibration produces a change in dipole moment and is IR active. These vibrational modes are responsible for the \"greenhouse\" effect in which heat radiated from the earth is absorbed (trapped) by CO2 molecules in the atmosphere. The arrows indicate the directions of motion. Vibrations labeled A and B represent the stretching of the chemical bonds, one in a symmetric (A) fashion, in which both C=O bonds lengthen and contract together (in-phase), and the other in an asymmetric (B) fashion, in which one bond shortens while the other lengthens. The asymmetric stretch (B) is infrared active because there is a change in the molecular dipole moment during this vibration. Solution The fact that a molecule vibrates does not in itself insure that the molecule will exhibit an IR spectrum. For a particular vibrational mode to absorb infrared radiation, the vibrational motion associated with that mode must produce a change in the dipole moment of the molecule. HCl, for example, with a center of positive charge at the H atom and a center of negative charge at the Cl atom, has a dipole moment. The magnitude of the dipole moment changes as the HCl bond stretches, so this vibration absorbs IR radiation. We say that the vibration is IR active. The N2 molecule, on the other hand, has no dipole moment. Further, stretching the N-N bond does not produce a change in dipole moment, so the vibration is infrared inactive (i.e., cannot directly absorb IR radiation). It is important to realize that there are many molecules that, although possessing no permanent dipole moment, still undergo vibrations that cause changes in the value of the dipole moment from 0 to some non-zero value. An example is CO2, which has no permanent dipole moment because the individual bond dipo.

The fact that a molecule vibrates does not in its.pdf

deepua8

The compounds of interest are Na2S and H2SO4. The molecular equation then is: Na2S + H2SO4 ---> Na2SO4 + H2S. Just exchange one anion for the other. Now, we need to know a little bit about the properties of these compounds. Almost all sodium salts are soluble, so both Na2S and Na2SO4 are fully dissociated: 2 Na+ + S2- + 2 H+ + SO42- ---> 2 Na+ + SO42- + H2S. Crossing out terms that appear on both sides, we obtain the net ionic equation: 2 H+ + S2- ----> H2S. Conveniently, H2S is a gas, and escapes from solution. Thus, it selectively removes H+ and S2- ions from the equilibrium, driving the reaction to completion (favoring Na2SO4) Solution The compounds of interest are Na2S and H2SO4. The molecular equation then is: Na2S + H2SO4 ---> Na2SO4 + H2S. Just exchange one anion for the other. Now, we need to know a little bit about the properties of these compounds. Almost all sodium salts are soluble, so both Na2S and Na2SO4 are fully dissociated: 2 Na+ + S2- + 2 H+ + SO42- ---> 2 Na+ + SO42- + H2S. Crossing out terms that appear on both sides, we obtain the net ionic equation: 2 H+ + S2- ----> H2S. Conveniently, H2S is a gas, and escapes from solution. Thus, it selectively removes H+ and S2- ions from the equilibrium, driving the reaction to completion (favoring Na2SO4).

The compounds of interest are Na2S and H2SO4. Th.pdf

deepua8

sucrose has a formula of C12H22O11while ammonia h.pdf

deepua8

reduction strength Fe Pb As .pdf

deepua8

sp3d since it has 1s 3p and 1d orbitals available.pdf

deepua8

No standard potential data given. .pdf

deepua8

x2 + 4xSolutionx2 + 4x.pdf

deepua8

More from deepua8 (20)

Balancing ANY chemical equation is done exactly t.pdf

36.Kovacs reagent is used in Indole test. Kovacs reagent is 4 (p)-.pdf

10.Real number1.Baseb. Consists of a set and rule for combining2.Bin.pdf

1. Yeasts grow by budding. The cell buds and separates into 2 cells..pdf

1. 252.125Solution1. 252.125.pdf

(B) 0.815Solution(B) 0.815.pdf

Suppose AFnSolution Suppose AFn.pdf

C code on linked list #include stdio.h #include stdlib.h.pdf

Definition of Log-Normal DistributionA statistical distr.pdf

Step1 NaOH (aq) ----- Na(+)(aq) + Cl(-)(aq) Ste.pdf

The compounds with low oxidation states (O.S.) be.pdf

A) ionic compounds generally formed between the c.pdf

A ethers ethers contain R-O-R linkage not carbony.pdf

The fact that a molecule vibrates does not in its.pdf

The compounds of interest are Na2S and H2SO4. Th.pdf

sucrose has a formula of C12H22O11while ammonia h.pdf

reduction strength Fe Pb As .pdf

sp3d since it has 1s 3p and 1d orbitals available.pdf

No standard potential data given. .pdf

x2 + 4xSolutionx2 + 4x.pdf

Recently uploaded

In this webinar, Felipe Mondragon from Tech Impact shared the basic understanding of how cyberattacks happen and how to prevent them. Small to medium-sized nonprofit organizations are specifically susceptible due to their lack of cybersecurity policies and staff training. The good news is that there are lots of things you can do to protect your organization, even if you’re not a security expert.

Keeping Your Information Safe with Centralized Security Services

TechSoup

Mattingly "AI & Prompt Design: Limitations and Solutions with LLMs"

National Information Standards Organization (NISO)

Application of Matrices in real life. Presentation on application of matrices

Rased Khan

NCERT Solutions Power Sharing Class 10 Notes pdf

Vivekanand Anglo Vedic Academy

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

siemaillard

slides CapTechTalks Webinar May 2024 Alexander Perry.pptx

CapitolTechU

This PowerPoint presentation, titled "Research Methods in Psychology for Cambridge AS Level Students," provides a comprehensive overview of essential research methodologies in psychology. It covers fundamental concepts such as experimental, correlational, and observational methods, highlighting their advantages and limitations. The presentation delves into the design of experiments, including independent and dependent variables, control groups, and random assignment. It also addresses ethical considerations, data collection techniques, and statistical analysis. Emphasizing practical application, the presentation includes examples of classic psychological studies and offers tips for designing and conducting research projects. It concludes with a discussion on interpreting results and the importance of critical evaluation, preparing students for both theoretical understanding and practical application in their AS Level psychology coursework.

Research Methods in Psychology | Cambridge AS Level | Cambridge Assessment In...

Abhinav Gaur Kaptaan

Telling Your Story_ Simple Steps to Build Your Nonprofit's Brand Webinar.pdf

TechSoup

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

siemaillard

The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension. For more information, visit-www.vavaclasses.com

Sectors of the Indian Economy - Class 10 Study Notes pdf

Vivekanand Anglo Vedic Academy

Instructions for Submissions thorugh G- Classroom.pptx

Jheel Barad

GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...

Nguyen Thanh Tu Collection

We all have good and bad thoughts from time to time and situation to situation. We are bombarded daily with spiraling thoughts(both negative and positive) creating all-consuming feel , making us difficult to manage with associated suffering. Good thoughts are like our Mob Signal (Positive thought) amidst noise(negative thought) in the atmosphere. Negative thoughts like noise outweigh positive thoughts. These thoughts often create unwanted confusion, trouble, stress and frustration in our mind as well as chaos in our physical world. Negative thoughts are also known as “distorted thinking”.

How to Break the cycle of negative Thoughts

Col Mukteshwar Prasad

How to Split Bills in the Odoo 17 POS Module

Celine George

The Benefits and Challenges of Open Educational Resources

aileywriter

Jose-Rizal-and-Philippine-Nationalism-National-Symbol-2.pptx

ricssacare

Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX

MIRIAMSALINAS13

UNIT – IV_PCI Complaints: Complaints and evaluation of complaints, Handling o...

Sayali Powar

Gyanartha SciBizTech Quiz slideshare.pptx

Shibin Azad

This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024. He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.

Introduction to Quality Improvement Essentials

Excellence Foundation for South Sudan

Recently uploaded (20)

Keeping Your Information Safe with Centralized Security Services

Mattingly "AI & Prompt Design: Limitations and Solutions with LLMs"

Application of Matrices in real life. Presentation on application of matrices

NCERT Solutions Power Sharing Class 10 Notes pdf

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

slides CapTechTalks Webinar May 2024 Alexander Perry.pptx

Research Methods in Psychology | Cambridge AS Level | Cambridge Assessment In...

Telling Your Story_ Simple Steps to Build Your Nonprofit's Brand Webinar.pdf

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

Sectors of the Indian Economy - Class 10 Study Notes pdf

Instructions for Submissions thorugh G- Classroom.pptx

GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...

How to Break the cycle of negative Thoughts

How to Split Bills in the Odoo 17 POS Module

The Benefits and Challenges of Open Educational Resources

Jose-Rizal-and-Philippine-Nationalism-National-Symbol-2.pptx

Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX

UNIT – IV_PCI Complaints: Complaints and evaluation of complaints, Handling o...

Gyanartha SciBizTech Quiz slideshare.pptx

Introduction to Quality Improvement Essentials

ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

1. ArrayTest.java import java.util.Arrays; import java.util.Scanner; public class ArrayTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int table[] = new int[10]; int count = 0; Scanner scan = new Scanner(System.in); for(int i=0; i<10; i++){ System.out.println("Enter Array Element:"); int n = scan.nextInt(); if(n < 0){ System.out.println("Invalid Number."); i--; if(count >= 5) break; }else{ table[i] = n; count++; } } int sum = 0; System.out.println("Array Elements are: "+Arrays.toString(table)); for(int i=0; i avg){ high++; } else{ equal++; } }

2. System.out.println("Number of elements less than average "+less); System.out.println("Number of elements greater than average "+high); System.out.println("Number of elements equal to average "+equal); for(;;){ System.out.println("Enter Search Element (-1 to quit): "); int searchNum = scan.nextInt(); if(searchNum == -1){ break; } int index = find(searchNum, table, count); if(index == -1){ System.out.println("Element not found"); } else{ System.out.println("Element found at "+index); } } smallest(table, count); } public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){ for(int i=0; i a[i]){ min = a[i]; index = i; } } System.out.println("The smallest element is "+min+" index is "+index); int temp = a[0]; a[0] = a[index]; a[index] = temp; System.out.println("After swap array elements are :"+Arrays.toString(a)); } } Output:

3. Enter Array Element: 3 Enter Array Element: 4 Enter Array Element: 5 Enter Array Element: 2 Enter Array Element: 1 Enter Array Element: 6 Enter Array Element: 7 Enter Array Element: 8 Enter Array Element: -1 Invalid Number. Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0] The Sum is 36 The Average is : 4.5 Number of elements less than average 4 Number of elements greater than average 4 Number of elements equal to average 0 Enter Search Element (-1 to quit): 2 Element found at 3 Enter Search Element (-1 to quit): 3 Element found at 0 Enter Search Element (-1 to quit): 1 Element found at 4 Enter Search Element (-1 to quit): 6

4. Element found at 5 Enter Search Element (-1 to quit): -1 The smallest element is 1 index is 4 After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0] Solution ArrayTest.java import java.util.Arrays; import java.util.Scanner; public class ArrayTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int table[] = new int[10]; int count = 0; Scanner scan = new Scanner(System.in); for(int i=0; i<10; i++){ System.out.println("Enter Array Element:"); int n = scan.nextInt(); if(n < 0){ System.out.println("Invalid Number."); i--; if(count >= 5) break; }else{ table[i] = n; count++; } } int sum = 0; System.out.println("Array Elements are: "+Arrays.toString(table));

5. for(int i=0; i avg){ high++; } else{ equal++; } } System.out.println("Number of elements less than average "+less); System.out.println("Number of elements greater than average "+high); System.out.println("Number of elements equal to average "+equal); for(;;){ System.out.println("Enter Search Element (-1 to quit): "); int searchNum = scan.nextInt(); if(searchNum == -1){ break; } int index = find(searchNum, table, count); if(index == -1){ System.out.println("Element not found"); } else{ System.out.println("Element found at "+index); } } smallest(table, count); } public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){ for(int i=0; i a[i]){ min = a[i]; index = i; } } System.out.println("The smallest element is "+min+" index is "+index);

6. int temp = a[0]; a[0] = a[index]; a[index] = temp; System.out.println("After swap array elements are :"+Arrays.toString(a)); } } Output: Enter Array Element: 3 Enter Array Element: 4 Enter Array Element: 5 Enter Array Element: 2 Enter Array Element: 1 Enter Array Element: 6 Enter Array Element: 7 Enter Array Element: 8 Enter Array Element: -1 Invalid Number. Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0] The Sum is 36 The Average is : 4.5 Number of elements less than average 4 Number of elements greater than average 4 Number of elements equal to average 0 Enter Search Element (-1 to quit): 2 Element found at 3 Enter Search Element (-1 to quit):

7. 3 Element found at 0 Enter Search Element (-1 to quit): 1 Element found at 4 Enter Search Element (-1 to quit): 6 Element found at 5 Enter Search Element (-1 to quit): -1 The smallest element is 1 index is 4 After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0]

ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

Recommended

Recommended

More Related Content

Similar to ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf

Similar to ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf (15)

More from deepua8

More from deepua8 (20)

Recently uploaded

Recently uploaded (20)

ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf