MinOfFourNumbers.javaimport java.util.Scanner;public class MinOf.pdf
•
0 likes•2 views
If I assume you meant supply is determined as [q_(s)=3p^2-4p] and demand is determined as [q_(d)=-p^2+24] then I would calculate that the equilibrium is where [q_(s)=q_(d)] and p>0. So I set up the equation [3p^2-4p=-p^2+24] I add [p^2] to both sides of the equation yielding [4p^2- 4p=24] I subtract 24 from each side, yielding the quadratic equation [4p^2-4p-24=0] I factor the equation [(2p-6)(2p+4)=0] so that means [2p-6=0] or [2p+4=0] In the former case 2p=6 so p=3, and in the latter 2p=-4 so p=-2. The economic nature of the question requires p>0, so [p!=-2] and thus the equilibrium price is $3.00 each. Then to determine the equilibrium quantity, we solve either q expression for p=3. [q_(s)=3(3)^2-4(3)=3(9)-12=27-12=15] [q_(d)=-(3^2)+24=-9+24=15] So the equilibrium quantity is 15 items. The price and quantity for market equilibrium is 15 items at $3.00 each. Solution If I assume you meant supply is determined as [q_(s)=3p^2-4p] and demand is determined as [q_(d)=-p^2+24] then I would calculate that the equilibrium is where [q_(s)=q_(d)] and p>0. So I set up the equation [3p^2-4p=-p^2+24] I add [p^2] to both sides of the equation yielding [4p^2- 4p=24] I subtract 24 from each side, yielding the quadratic equation [4p^2-4p-24=0] I factor the equation [(2p-6)(2p+4)=0] so that means [2p-6=0] or [2p+4=0] In the former case 2p=6 so p=3, and in the latter 2p=-4 so p=-2. The economic nature of the question requires p>0, so [p!=-2] and thus the equilibrium price is $3.00 each. Then to determine the equilibrium quantity, we solve either q expression for p=3. [q_(s)=3(3)^2-4(3)=3(9)-12=27-12=15] [q_(d)=-(3^2)+24=-9+24=15] So the equilibrium quantity is 15 items. The price and quantity for market equilibrium is 15 items at $3.00 each..
Report
Share
Report
Share
Download to read offline
![MinOfFourNumbers.java
import java.util.Scanner;
public class MinOfFourNumbers {
public static void main(String[] args) {
//Creating an Integer array of size 4
int numbers[]=new int[4];
//declaring the variables
int min;
//Scanner object is used to get the values entered by the user.
Scanner sc=new Scanner(System.in);
/* This for loop will get the values from the user
* and populate into the array
*/
for(int i=0;i<4;i++)
{
//Getting the number from the user.
System.out.print("Enter Number "+(i+1)+" :");
numbers[i]=sc.nextInt();
}
//Store the first element of the array in min variable
min=numbers[0];
//This loop will calculate the minimum of 4 numbers
for(int i=0;i<4;i++)
{
/*Check each element of the array with the value value contained in the min variable.
* If the element of the array is less than min,then assign that element to min variable
*/
if(numbers[i]
Solution](https://image.slidesharecdn.com/minoffournumbers-230412073237-5f197512/85/MinOfFourNumbers-javaimport-java-util-Scanner-public-class-MinOf-pdf-1-320.jpg)
![MinOfFourNumbers.java
import java.util.Scanner;
public class MinOfFourNumbers {
public static void main(String[] args) {
//Creating an Integer array of size 4
int numbers[]=new int[4];
//declaring the variables
int min;
//Scanner object is used to get the values entered by the user.
Scanner sc=new Scanner(System.in);
/* This for loop will get the values from the user
* and populate into the array
*/
for(int i=0;i<4;i++)
{
//Getting the number from the user.
System.out.print("Enter Number "+(i+1)+" :");
numbers[i]=sc.nextInt();
}
//Store the first element of the array in min variable
min=numbers[0];
//This loop will calculate the minimum of 4 numbers
for(int i=0;i<4;i++)
{
/*Check each element of the array with the value value contained in the min variable.
* If the element of the array is less than min,then assign that element to min variable
*/
if(numbers[i]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Digits.javapackage week04;import java.util.Scanner; public cla.pdf
Digits.java
package week04;
import java.util.Scanner;
public class Digits {
public static void main(String[] args)
{
//Declaring variables
int sum=0,number,rem;
//Scanner class Object is sued to read the inputs entered by the user
Scanner input = new Scanner(System.in);
//Getting the number entered by the user
System.out.print(\"Enter an integer : \");
number=input.nextInt();
//this loop continue to execute until the number is graeter than zero
while (number>0 )
{
//Getting the last digit of the number every time
rem=number%10;
/*Getting the remaining part of
* the number except last digit every time
*/
number=number/10;
//Calculating the sum of the digits
sum+=rem;
}
//Displaying the sum of the digits of the number
System.out.print(\"The sum of digits is: \" +sum);
}
}
______________________________________________
Output:
Enter an integer : 123456789
The sum of digits is: 45
__________________________________________Thank You
Solution
Digits.java
package week04;
import java.util.Scanner;
public class Digits {
public static void main(String[] args)
{
//Declaring variables
int sum=0,number,rem;
//Scanner class Object is sued to read the inputs entered by the user
Scanner input = new Scanner(System.in);
//Getting the number entered by the user
System.out.print(\"Enter an integer : \");
number=input.nextInt();
//this loop continue to execute until the number is graeter than zero
while (number>0 )
{
//Getting the last digit of the number every time
rem=number%10;
/*Getting the remaining part of
* the number except last digit every time
*/
number=number/10;
//Calculating the sum of the digits
sum+=rem;
}
//Displaying the sum of the digits of the number
System.out.print(\"The sum of digits is: \" +sum);
}
}
______________________________________________
Output:
Enter an integer : 123456789
The sum of digits is: 45
__________________________________________Thank You.
Write a program that will test a name) method no sorting routine from.docx
Write a program that will test a name) method no sorting routine from
Part 1)#include stdio.h #include stdlib.h #include pthrea.pdf
Part 1)
#include
#include
#include
#include
/*Error handling for pthread_create and pthread_join*/
/*from the pthread_create man page*/
#define handle_error_en(en, msg) \\
do { errno = en; perror(msg); exit(EXIT_FAILURE); } while (0)
/* # of running threads */
volatile int running_threads = 0;
pthread_t thread[3]; /*Descriptors for our 3 threads*/
int numOfElements;/*Total # of elements from the user*/
struct Results{ /*Struct to hold the statistical results*/
int min;
int max;
int average;
}Results;
/*This function finds the minimum element of an array*/
void *findMin(void *array_ptr){
int i; /*counter*/
int *elements = (int*)array_ptr; /*re reference void array pointer*/
Results.min = elements[0]; /*set minimum to first element */
for(i = 0; i < numOfElements; i++){ /*iterate through array*/
if(elements[i] < Results.min){ /*if the current element is less than the current min*/
Results.min = elements[i]; /*store the new min*/
}
}
running_threads -= 1; /*Decrement thread count*/
return NULL;
}
/*This function finds the maximum element of an array*/
void *findMax(void *array_ptr){
int i; /*counter*/
int *elements = (int*)array_ptr; /*re reference void array pointer*/
for(i = 0; i < numOfElements; i++){ /*iterate through array*/
if(elements[i] > Results.max){ /*store the new max*/
Results.max = elements[i];
}
}
running_threads -= 1; /*Decrement thread count*/
return NULL;
}
/*This function finds the average of an array*/
void *findAverage(void *array_ptr){
int i; /*counter*/
int *elements = (int*)array_ptr; /*re reference void array pointer*/
for(i = 0; i < numOfElements; i++){ /*iterate through array*/
Results.average += elements[i]; /*add element @ i to average*/
}
Results.average = Results.average/numOfElements; /*Divide the sum by the number of
elements*/
running_threads -= 1; /*Decrement running threads counter*/
return NULL;
}
/* This method accepts a int n(initial size of array) and
pointer to an array and returns # of elements in the array
*/
int getArrayInput(int n, int *array_ptr){
int input;/*Store user input */
int numberOfElements = 0;/*Number of Integers inputed*/
printf(\"Creating Dynamic Array...\ -\ \");
for(;;){ /*infinite loop*/
printf(\"Enter a positive value:\ Negative Number to Stop\ -\ \");
//Get Int from console, store at address of input
if (scanf(\"%d\",&input) != 1){
printf(\"\ Oops that wasn\'t an Integer\ lets try filling the array again\ Remember
INTEGERS only!\ \");
exit(EXIT_FAILURE);
}
if (input >= 0){
if (numberOfElements == n){
n += 1; //Make room for the current input
array_ptr = realloc(array_ptr, n * sizeof(int));//realloc array and set pointer
}
array_ptr[numberOfElements++] = input;//Store input at next empty element
} else {
printf(\"\ Number of Integers: %d\ \", numberOfElements);
break;
}
}
return numberOfElements;
}
/*This function joins our n number of threads */
void joinThreads(int numberOfThreads){
int i; /*count*/
int s; /*error #*/
while(numberOfThreads >= 0){ /*Join our threads*/
s = pthread_jo.
CountPositiveNumbersInArray.javapackage org.students;import java.pdf
CountPositiveNumbersInArray.java
package org.students;
import java.util.Scanner;
public class CountPositiveNumbersInArray {
public static void main(String[] args) throws Exception {
int array[] = null;
//Declaring variables
int count_positive_nos;
//Scanner object is used to Get the values entered by the user.
Scanner sc = new Scanner(System.in);
//Getting the Array Size from the user.
System.out.print(\"\ Enter no of elements you want to store in Array :\");
int number = sc.nextInt();
//Creating an array with that size
array = new int[number];
//Populating the array with user enterd values.
for (int i = 0; i < number; i++) {
System.out.print(\"\ Enter the element \" + (i + 1) + \" :\");
array[i] = sc.nextInt();
}
//Calling the method by passing the array as argument.
count_positive_nos = countPositive(array);
//Displaying the no of positive numbers in the array
System.out.println(\"The number of Positive Numbers in the array :\"+ count_positive_nos);
}
/*
* This method checks and count number of positive numbers in the array
* @Params, array of integer type
* @return array
*/
private static int countPositive(int[] array)
{
//Declaring local variable
int count = 0;
try
{
if (array == null)
{
throw new NullPointerException();
}
else
{
for (int i = 0; i < array.length; i++)
{
if (array[i] > 0)
{
count++;
}
}
}
}
catch (Exception e)
{
System.out.println(\"Exception :\"+e);
}
return count;
}
}
_______________________________________________________________
Output:
Enter no of elements you want to store in Array :4
Enter the element 1 :-4
Enter the element 2 :0
Enter the element 3 :2
Enter the element 4 :2
The number of Positive Numbers in the array :2
____________________________________________________________________
Solution
CountPositiveNumbersInArray.java
package org.students;
import java.util.Scanner;
public class CountPositiveNumbersInArray {
public static void main(String[] args) throws Exception {
int array[] = null;
//Declaring variables
int count_positive_nos;
//Scanner object is used to Get the values entered by the user.
Scanner sc = new Scanner(System.in);
//Getting the Array Size from the user.
System.out.print(\"\ Enter no of elements you want to store in Array :\");
int number = sc.nextInt();
//Creating an array with that size
array = new int[number];
//Populating the array with user enterd values.
for (int i = 0; i < number; i++) {
System.out.print(\"\ Enter the element \" + (i + 1) + \" :\");
array[i] = sc.nextInt();
}
//Calling the method by passing the array as argument.
count_positive_nos = countPositive(array);
//Displaying the no of positive numbers in the array
System.out.println(\"The number of Positive Numbers in the array :\"+ count_positive_nos);
}
/*
* This method checks and count number of positive numbers in the array
* @Params, array of integer type
* @return array
*/
private static int countPositive(int[] array)
{
//Declaring local variable
int count = 0;
try
{
if (array == null)
{
throw new NullPointerException(.
Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf
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..
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.
This class maintains a list of 4 integers. This list .docx
This class maintains a list of 4 integers. This list .docx
Recommended
Digits.javapackage week04;import java.util.Scanner; public cla.pdf
Digits.java
package week04;
import java.util.Scanner;
public class Digits {
public static void main(String[] args)
{
//Declaring variables
int sum=0,number,rem;
//Scanner class Object is sued to read the inputs entered by the user
Scanner input = new Scanner(System.in);
//Getting the number entered by the user
System.out.print(\"Enter an integer : \");
number=input.nextInt();
//this loop continue to execute until the number is graeter than zero
while (number>0 )
{
//Getting the last digit of the number every time
rem=number%10;
/*Getting the remaining part of
* the number except last digit every time
*/
number=number/10;
//Calculating the sum of the digits
sum+=rem;
}
//Displaying the sum of the digits of the number
System.out.print(\"The sum of digits is: \" +sum);
}
}
______________________________________________
Output:
Enter an integer : 123456789
The sum of digits is: 45
__________________________________________Thank You
Solution
Digits.java
package week04;
import java.util.Scanner;
public class Digits {
public static void main(String[] args)
{
//Declaring variables
int sum=0,number,rem;
//Scanner class Object is sued to read the inputs entered by the user
Scanner input = new Scanner(System.in);
//Getting the number entered by the user
System.out.print(\"Enter an integer : \");
number=input.nextInt();
//this loop continue to execute until the number is graeter than zero
while (number>0 )
{
//Getting the last digit of the number every time
rem=number%10;
/*Getting the remaining part of
* the number except last digit every time
*/
number=number/10;
//Calculating the sum of the digits
sum+=rem;
}
//Displaying the sum of the digits of the number
System.out.print(\"The sum of digits is: \" +sum);
}
}
______________________________________________
Output:
Enter an integer : 123456789
The sum of digits is: 45
__________________________________________Thank You.
Write a program that will test a name) method no sorting routine from.docx
Write a program that will test a name) method no sorting routine from
Part 1)#include stdio.h #include stdlib.h #include pthrea.pdf
Part 1)
#include
#include
#include
#include
/*Error handling for pthread_create and pthread_join*/
/*from the pthread_create man page*/
#define handle_error_en(en, msg) \\
do { errno = en; perror(msg); exit(EXIT_FAILURE); } while (0)
/* # of running threads */
volatile int running_threads = 0;
pthread_t thread[3]; /*Descriptors for our 3 threads*/
int numOfElements;/*Total # of elements from the user*/
struct Results{ /*Struct to hold the statistical results*/
int min;
int max;
int average;
}Results;
/*This function finds the minimum element of an array*/
void *findMin(void *array_ptr){
int i; /*counter*/
int *elements = (int*)array_ptr; /*re reference void array pointer*/
Results.min = elements[0]; /*set minimum to first element */
for(i = 0; i < numOfElements; i++){ /*iterate through array*/
if(elements[i] < Results.min){ /*if the current element is less than the current min*/
Results.min = elements[i]; /*store the new min*/
}
}
running_threads -= 1; /*Decrement thread count*/
return NULL;
}
/*This function finds the maximum element of an array*/
void *findMax(void *array_ptr){
int i; /*counter*/
int *elements = (int*)array_ptr; /*re reference void array pointer*/
for(i = 0; i < numOfElements; i++){ /*iterate through array*/
if(elements[i] > Results.max){ /*store the new max*/
Results.max = elements[i];
}
}
running_threads -= 1; /*Decrement thread count*/
return NULL;
}
/*This function finds the average of an array*/
void *findAverage(void *array_ptr){
int i; /*counter*/
int *elements = (int*)array_ptr; /*re reference void array pointer*/
for(i = 0; i < numOfElements; i++){ /*iterate through array*/
Results.average += elements[i]; /*add element @ i to average*/
}
Results.average = Results.average/numOfElements; /*Divide the sum by the number of
elements*/
running_threads -= 1; /*Decrement running threads counter*/
return NULL;
}
/* This method accepts a int n(initial size of array) and
pointer to an array and returns # of elements in the array
*/
int getArrayInput(int n, int *array_ptr){
int input;/*Store user input */
int numberOfElements = 0;/*Number of Integers inputed*/
printf(\"Creating Dynamic Array...\ -\ \");
for(;;){ /*infinite loop*/
printf(\"Enter a positive value:\ Negative Number to Stop\ -\ \");
//Get Int from console, store at address of input
if (scanf(\"%d\",&input) != 1){
printf(\"\ Oops that wasn\'t an Integer\ lets try filling the array again\ Remember
INTEGERS only!\ \");
exit(EXIT_FAILURE);
}
if (input >= 0){
if (numberOfElements == n){
n += 1; //Make room for the current input
array_ptr = realloc(array_ptr, n * sizeof(int));//realloc array and set pointer
}
array_ptr[numberOfElements++] = input;//Store input at next empty element
} else {
printf(\"\ Number of Integers: %d\ \", numberOfElements);
break;
}
}
return numberOfElements;
}
/*This function joins our n number of threads */
void joinThreads(int numberOfThreads){
int i; /*count*/
int s; /*error #*/
while(numberOfThreads >= 0){ /*Join our threads*/
s = pthread_jo.
CountPositiveNumbersInArray.javapackage org.students;import java.pdf
CountPositiveNumbersInArray.java
package org.students;
import java.util.Scanner;
public class CountPositiveNumbersInArray {
public static void main(String[] args) throws Exception {
int array[] = null;
//Declaring variables
int count_positive_nos;
//Scanner object is used to Get the values entered by the user.
Scanner sc = new Scanner(System.in);
//Getting the Array Size from the user.
System.out.print(\"\ Enter no of elements you want to store in Array :\");
int number = sc.nextInt();
//Creating an array with that size
array = new int[number];
//Populating the array with user enterd values.
for (int i = 0; i < number; i++) {
System.out.print(\"\ Enter the element \" + (i + 1) + \" :\");
array[i] = sc.nextInt();
}
//Calling the method by passing the array as argument.
count_positive_nos = countPositive(array);
//Displaying the no of positive numbers in the array
System.out.println(\"The number of Positive Numbers in the array :\"+ count_positive_nos);
}
/*
* This method checks and count number of positive numbers in the array
* @Params, array of integer type
* @return array
*/
private static int countPositive(int[] array)
{
//Declaring local variable
int count = 0;
try
{
if (array == null)
{
throw new NullPointerException();
}
else
{
for (int i = 0; i < array.length; i++)
{
if (array[i] > 0)
{
count++;
}
}
}
}
catch (Exception e)
{
System.out.println(\"Exception :\"+e);
}
return count;
}
}
_______________________________________________________________
Output:
Enter no of elements you want to store in Array :4
Enter the element 1 :-4
Enter the element 2 :0
Enter the element 3 :2
Enter the element 4 :2
The number of Positive Numbers in the array :2
____________________________________________________________________
Solution
CountPositiveNumbersInArray.java
package org.students;
import java.util.Scanner;
public class CountPositiveNumbersInArray {
public static void main(String[] args) throws Exception {
int array[] = null;
//Declaring variables
int count_positive_nos;
//Scanner object is used to Get the values entered by the user.
Scanner sc = new Scanner(System.in);
//Getting the Array Size from the user.
System.out.print(\"\ Enter no of elements you want to store in Array :\");
int number = sc.nextInt();
//Creating an array with that size
array = new int[number];
//Populating the array with user enterd values.
for (int i = 0; i < number; i++) {
System.out.print(\"\ Enter the element \" + (i + 1) + \" :\");
array[i] = sc.nextInt();
}
//Calling the method by passing the array as argument.
count_positive_nos = countPositive(array);
//Displaying the no of positive numbers in the array
System.out.println(\"The number of Positive Numbers in the array :\"+ count_positive_nos);
}
/*
* This method checks and count number of positive numbers in the array
* @Params, array of integer type
* @return array
*/
private static int countPositive(int[] array)
{
//Declaring local variable
int count = 0;
try
{
if (array == null)
{
throw new NullPointerException(.
Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf
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..
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.
This class maintains a list of 4 integers. This list .docx
This class maintains a list of 4 integers. This list .docx
import java.util.Scanner;public class ArrayData { AR.pdf
import java.util.Scanner;
public class ArrayData {
/*
* ARRAY_SIZE variable to decalre the minimum array size
*/
static int ARRAY_SIZE = 5;
/*
* ARRAY_ELEMENTS variable to monitor the array elements at present [after user
operations]
*/
static int ARRAY_ELEMENTS = 0;
/*
* integerArray base array of size ARRAY_SIZE with elements \'0\'
*/
int[] integerArray = {0,0,0,0,0};
/*
* copy\'s the array passed to the base array
*/
public void copy(int[] from, int length){
for(int j=0;j= ARRAY_SIZE){
doubleArray();
}
System.out.println(\"integerArray length\"+integerArray.length);
int[] bigger = new int[integerArray.length];
int add = valueInsert;
boolean found = false;
int indexToInsert = 0;
for (int i = 0; i < integerArray.length-1; i++){
if ( !found && add >= integerArray[i]){
found = true;
indexToInsert = i;
bigger[indexToInsert] = add;
i--;
}
else{
if(found)
{
bigger[i+1] = integerArray[i];
}else
{
bigger[i] = integerArray[i];
}
}
}
if(!found)
{
indexToInsert = integerArray.length;
bigger[indexToInsert] = add;
}
System.out.println(\"integerArray length last\"+integerArray.length);
integerArray = bigger.clone();
ARRAY_ELEMENTS += 1;
}
/*
* Displays the base array elements when user gives wrong input
*/
public void display(){
for(int i=0;i
Solution
import java.util.Scanner;
public class ArrayData {
/*
* ARRAY_SIZE variable to decalre the minimum array size
*/
static int ARRAY_SIZE = 5;
/*
* ARRAY_ELEMENTS variable to monitor the array elements at present [after user
operations]
*/
static int ARRAY_ELEMENTS = 0;
/*
* integerArray base array of size ARRAY_SIZE with elements \'0\'
*/
int[] integerArray = {0,0,0,0,0};
/*
* copy\'s the array passed to the base array
*/
public void copy(int[] from, int length){
for(int j=0;j= ARRAY_SIZE){
doubleArray();
}
System.out.println(\"integerArray length\"+integerArray.length);
int[] bigger = new int[integerArray.length];
int add = valueInsert;
boolean found = false;
int indexToInsert = 0;
for (int i = 0; i < integerArray.length-1; i++){
if ( !found && add >= integerArray[i]){
found = true;
indexToInsert = i;
bigger[indexToInsert] = add;
i--;
}
else{
if(found)
{
bigger[i+1] = integerArray[i];
}else
{
bigger[i] = integerArray[i];
}
}
}
if(!found)
{
indexToInsert = integerArray.length;
bigger[indexToInsert] = add;
}
System.out.println(\"integerArray length last\"+integerArray.length);
integerArray = bigger.clone();
ARRAY_ELEMENTS += 1;
}
/*
* Displays the base array elements when user gives wrong input
*/
public void display(){
for(int i=0;i.
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting Started
Create a class called Lab8. Use the same setup for setting up your class and main method as you
did for the previous assignments. Be sure to name your file Lab8.java. Additionally, make
another file called Arrays.java. This file will be an object, so simply start it off by declaring an
Arrays class. You can copy the following skeleton and fill in the appropriate code below each of
the comments:
public class Arrays {
/ Instance Variables
// Constructors
// findMin 1
// findMax
// calcSum
// calcAverage
// toString
}
Task Overview
Your task for this lab is to create a class called Arrays with some array processing methods. This
class will maintain an array and the number of elements present in it. Additionally, methods will
be available to display the current min and max elements along with the average of all of them.
Finally, a toString() method will be available to cleanly display all the array elements. Finally,
you will write a simple driver class to test out the above Arrays class.
Part 1: Instance Variables for Arrays
The first thing to do for the Arrays class is to set up its instance variables. Declare the following
(private) instance variables:
• An int array called array ? this will be the array we will be writing methods for.
• An int called count - this represents the number of valid elements in the array.
Part 2:
Constructors for Arrays The Arrays class will have two constructors. The first constructor takes
the maximum size of the array as input as a parameter and initializes the array instance variable
appropriately. It also sets count to size. Finally, it will initialize all of the array elements to some
values between 0 and 10, inclusive. To create this constructor, follow these steps:
• Import java.util.Random to make use of the random number generator.
• Create a constructor with the following header: public Arrays(int size)
• Initialize your array variable and set its size to size (see the chart on page 252 for reference on
initializing arrays). Be very careful that you are setting the value of your array instance variable,
as opposed to creating a new variable called array.
• Set the value of the count variable to size because we will be populating the entire array.
• Copy the following code to the constructor in order to generate random values between 0 and
10, inclusive:
Random rand = new Random();
for (int i = 0; i < count; i++)
{
array[i] = (rand.nextInt(10));
}
Next, create another constructor with the following header: public Arrays(int[] arr). This
constructor will initialize the class by using the passed arr argument in order to fill its instance
variables. The following things need to be done inside of this constructor:
• Set the array variable equal to arr.
• Set the count variable equal to the length of the array.
Part 3: Displaying the Output findMin()
The first method of this class will search the array for the minimum element. Copy the following
code for the findMin method. Note how the count i.
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) .
The java program Jumble that prompts user to enter nu.pdf
/**
* The java program Jumble that prompts user to
* enter number of words.Then prompts for words
* of the string.
* Then calls the permute method of the class
* MyString and prints the permutations of
* the strings to console
* */
//Jumble.java
import java.util.Scanner;
public class Jumble
{
public static void main(String[] args)
{
//Create an instance of Scanner class
Scanner scanner=new Scanner(System.in);
//set num=0
int num = 0;
MyString ms=null;
System.out.println(\"How many words?\");
//prompt for num value
num=Integer.parseInt(scanner.nextLine());
//create an array of type string
String[] words=new String[num];
//prompt for words
System.out.println(\"Enter the words:\");
for (int i = 0; i < num; i++)
{
words[i]=scanner.nextLine();
}
//Run for loop for given words length
for (int i = 0; i < words.length; i++)
{
//create an instance of MyString with words at index
ms=new MyString(words[i]);
for (int j = 0; j < 4; j++)
{
//call permute
System.out.println(ms.permute());
}
}
}
}
----------------------------------------------------------------------------------------------------
//MyString.java
import java.util.Random;
public class MyString
{
//create an instance of Random class
private Random r=new Random();
//instance variable,str
private String str;
//constructor
public MyString(String str)
{
this.str=str;
}
//print the string
public void printMe()
{
System.out.println(str);
}
/*
* Permute method that permutes the string
* and return permuted string .
* */
public String permute()
{
//Create an instance of StringBuffer class with string value
StringBuffer sb=new StringBuffer(str);
//swap for n times
for (int i = sb.length()-1;i>0; i--)
{
int rand = r.nextInt(sb.length());
char temp = sb.charAt(i);
sb.setCharAt(i, sb.charAt(rand));
sb.setCharAt(rand, temp);
}
//swap for n times,so total 2n times
for (int i = sb.length()-1;i>0; i--)
{
int rand = r.nextInt(sb.length());
char temp = sb.charAt(i);
sb.setCharAt(i, sb.charAt(rand));
sb.setCharAt(rand, temp);
}
return new String(sb);
}
}
----------------------------------------------------------------------------------------------------
Sample output:
How many words?
3
Enter the words:
mixed
calendar
then
dmexi
imxed
emixd
idmex
nalrdaec
candreal
aalrdcen
claadner
tenh
tnhe
etnh
tneh
Solution
/**
* The java program Jumble that prompts user to
* enter number of words.Then prompts for words
* of the string.
* Then calls the permute method of the class
* MyString and prints the permutations of
* the strings to console
* */
//Jumble.java
import java.util.Scanner;
public class Jumble
{
public static void main(String[] args)
{
//Create an instance of Scanner class
Scanner scanner=new Scanner(System.in);
//set num=0
int num = 0;
MyString ms=null;
System.out.println(\"How many words?\");
//prompt for num value
num=Integer.parseInt(scanner.nextLine());
//create an array of type string
String[] words=new String[num];
//prompt for words
System.out.println(\"Enter the words:\");
for (int i = 0; i < num; i++).
when I compile to get the survey title the overload constructor asks.docx
when I compile to get the survey title the overload constructor asks for title name input else the default constructor sets a default name. My code ask for the title and after I enter it hangs until I enter it again
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
//package surveyproject;
public class Survey {
//declare variables
private static int respondentID;
public String surveyTitle;
public int initial_menu_Choice;
public int[][] ansArray = new int [3][3];
public String[] questArray = new String [3];
Scanner scan = new Scanner(System.in);
//default constructor
public Survey(){
surveyTitle = "Customer Survey";
}
//constructor with parameter
public Survey(String title){
respondentID = 0;
surveyTitle = title;
}
//method to get survey title
public String getSurveyTitle(){
return surveyTitle;
}
//method to get respondent ID
public int getRespondentID(){
return respondentID;
}
//method to generate respondent ID
public int generateRespondentID(){
//increments the respondent ID
respondentID++;
return respondentID;
}
public void setIntialMenuChoice(int inti_menu_choice){
initial_menu_Choice = inti_menu_choice;
}
//display survey results
public void displaySurveyResults(){
//print name of survey
//print ansArray
System.out.println("Survey: "+ surveyTitle);
System.out.println("Results of the survey: ");
System.out.print("Respondent ID| Q1\tQ2\tQ3 \n");
for(int i = 0; i < 3; i++){
System.out.print(" " + i + " | ");
for(int j = 0; j < 3; j++){
System.out.print(ansArray[i][j]+"\t");
}
System.out.println("\n");
}
}
public void displayQuestionStats(int questNum){
//display response entered for 'questNum'
System.out.println("Question stats for Question: "+questNum+" "+questArray[questNum-1]);
for(int i = 0; i < 3; i++){
System.out.println(ansArray[i][questNum-1]);
}
}
void enterQuestions(){
Scanner scan = new Scanner(System.in);
//user will enter 3 questions to be stored in string array
System.out.println("Enter 3 questions to create a survey");
for(int i = 0; i < 3; i++){
System.out.println("Enter question "+(i+1)+":");
questArray[i] = scan.next();
}
}
public void logResponse(int id, int questNum, int response){
//enter response in the matrix
ansArray[id][questNum] = response;
}
//user to fill in the survey questions
public void completeSurvey(int id){
System.out.println("Respondent "+ id+ " is taking survey");
Scanner inp = new Scanner(System.in);
int resp ;
System.out.println("Answer each question with number between 1 to 5");
for(int i=0; i<3; i++){
System.out.print("Question "+(i+1)+":");
//pres.
Implementation of Banker’s Algorithm using java is given below .pdf
Implementation of Banker’s Algorithm using java is given below:
package bankersalgorithm;
import javax.swing.JOptionPane;
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
int n = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Process:\"));
int m = Integer.parseInt(JOptionPane.showInputDialog(\"Resource Type Number:\"));
int available[] = new int[m];
int max[][] = new int[n][m];
int allocation[][] = new int[n][m];
int need[][] = new int[n][m];
String sequence = \"\";
for(int i = 0; i < m; i++)
{
available[i] = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Available Resource
\" + (i) + \":\"));
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
allocation[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"Allocation P \" + (i) + \" for
R \" + (j) + \":\"));
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
max[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"MAX P \" + (i) + \" for R \" + (j) +
\":\"));
need[i][j] = max[i][j] - allocation[i][j];
}
}
int work[] = available;
boolean finish[] = new boolean[n];
for(int i = 0; i < n; i++)
{
finish[i] = false;
}
boolean check = true;
while(check)
{
check = false;
for(int i = 0; i < n; i++)
{
if(!finish[i])
{
int j;
for(j = 0; j < m; j++)
{
if(need[i][j] > work[j])
{
break;
}
}
if(j == m)
{
for(j=0; j < m; j++)
{
work[j] = work[j] + allocation[i][j];
}
finish[i] = true;
check = true;
sequence += i + \", \";
}
}
}
}
int i;
for(i = 0; i < n; i++)
{
if(!finish[i])
break;
}
if(i==n)
{
JOptionPane.showMessageDialog(null, \"SAFE And Sequence is:\"+sequence);
}
else
{
JOptionPane.showMessageDialog(null, \"DEAD LOCK\");
}
}
}
Solution
Implementation of Banker’s Algorithm using java is given below:
package bankersalgorithm;
import javax.swing.JOptionPane;
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
int n = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Process:\"));
int m = Integer.parseInt(JOptionPane.showInputDialog(\"Resource Type Number:\"));
int available[] = new int[m];
int max[][] = new int[n][m];
int allocation[][] = new int[n][m];
int need[][] = new int[n][m];
String sequence = \"\";
for(int i = 0; i < m; i++)
{
available[i] = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Available Resource
\" + (i) + \":\"));
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
allocation[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"Allocation P \" + (i) + \" for
R \" + (j) + \":\"));
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
max[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"MAX P \" + (i) + \" for R \" + (j) +
\":\"));
need[i][j] = max[i][j] - allocation[i][j];
}
}
int work[] = available;
boolean finish[] = new boolean[n];
for(int i = 0; i < n; i++)
{
finish[i] = false;
}
boolean check = true;
while(check)
{
check = false;
for(int i = 0; i < n; i++)
{
if(!finish[i])
{
int j;
f.
Write a method called uniqueNumbers that takes an int array as param.pdf
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 function which return a list of all of the n element subset .pdf
Write a function which return a list of all of the n element subset of a given set
Implement in JAVA Question 3 Write a function that returns a list of all of the n-element subsets
of a given set. For example, if the given set is [1,2,3] and n is 2, then the returned list should
contain [1,2], [1,3], and [2,3]. The order of the elements is not important.
Solution
The program for this problem is as follows:
Comments are included in the program for explaining the steps.
A sample output is attached below the program.
package com.temp;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Program to find sublists of a list.
* @author Rohit Phatak
*
*/
public class subset {
/**
* This list will contain the resultant sublists.
*/
static List list = new ArrayList<>();
public static void main(String arg[]){
/**
* Input a list comma separated.
*/
System.out.println(\"Enter a list : \");
Scanner scanner = new Scanner(System.in);
String s = scanner.nextLine();
String[] sArr = s.split(\",\");
/**
* Input a value of n.
*/
System.out.println(\"Enter value of n : \");
Integer n = scanner.nextInt();
/**
* Check if value of n is greater than entered list.
*/
if(sArr.length < n){
System.out.println(\"Length of list is less than value of n\");
} else if(sArr.length > 0){
getSubsetList(sArr,n);
System.out.println(\"List is as :\");
/**
* Printing the sublists.
*/
for(String[] str : list){
String printVar = \"\";
for(String temps : str)
printVar+=temps+\",\";
System.out.println(\"[\"+printVar.substring(0, printVar.length()-1)+\"]\");
}
} else {
System.out.println(\"Please enter atleast one element:\");
}
scanner.close();
}
/**
* This method calls the recursive function which is used to obtain the sublists.
* @param sArr
* @param n
* @return
*/
public static List getSubsetList(String[] sArr,Integer n){
List lista = new ArrayList<>();
sublist(sArr, 0, n, new String[n]);
return lista;
}
/**
* This is a recursive function.
* This function will iterate over itself for finding the sublist.
*
* Parameters are as follows:
*
* @param arr -> List entered by the user.
* @param n -> Value of sublist entered by user.
* @param startPosition -> index to start creating the sublist.
* @param result -> resultant sublist
*/
public static void sublist(String[] arr, int startPosition, int n, String[] result){
/**
* Check for the value of n ==0.
* If n==0 break from the recursion.
*/
if (n == 0){
/**
* Add the sublist \'result\' in the list.
*/
list.add(result.clone());
return;
}
/**
* Iterate through for loop starting from startPosition till length of list minus entered value
n.
*/
for (int i = startPosition; i <= arr.length-n; i++){
/**
* Here result is a temporary sublist.
* This for loop adds an element to the temporary sublist in each iteration.
* The element is added from the complete list entered by user.
* Location of element is iTh index.
*/
result[result.length - n] = arr[i];
/**
* After adding the element to the temporary sublist, the sublist an.
using recursive method .pdf
/******************* using recursive method **********************/
/**
* 1.2.1 Java program to calculate the Fibonacci Number using recursion
*/
import java.util.Scanner;
public class Fibo {
public static void main(String args[]){
Scanner scan= new Scanner(System.in); //Scanner object to read from the user
int n;
System.out.println(\"Enter the value of n\");
n=scan.nextInt();
System.out.println(\"The \"+n+\". Fibonacci number is \"+calFibonacci(n+1));// Calling the
recursive method
scan.close();
}
//method to calculate Fibonacci number recursively
public static long calFibonacci(int index){
if (index == 1)
return 0;
if (index == 2)
return 1;
return calFibonacci(index - 1) + calFibonacci(index - 2);
}
}
/** Outputs
* Enter the value of n 25
The 25. Fibonacci number is 75025
*/
/******************************using iterative
method************************************/
/**
* 1.2.2 Java program to calculate the fibonacci number using iterative method
*/
import java.util.Scanner;
public class Fibo2 {
public static void main(String args[]){
Scanner scan= new Scanner(System.in); //Scanner object to read from the user
int n;
System.out.println(\"Enter the value of n\");
n=scan.nextInt();
System.out.println(\"The \"+n+\". Fibonacci number is \"+calFibonacci(n+1)); // Calling the
iterative method to calculate fibonacci number
scan.close();
}
public static long calFibonacci(int index){
int first=0;
int second=1;
for(int i=2;i<=index;i++){
int temp=first;
first=first+second;
second=temp;
}
return first;
}
}
/** Output
*
* Enter the value of n 25
The 25. Fibonacci number is 75025
*
*/
/**************************************************/
The efficient method is the iterative way of calculating the number
Explaination
In recursion method we calculate the the numbers from current index till 0. So for each index we
do calculate the fibonacci number again and again. Hence it takes a lot time to calculate the
answers. Whereas in iterative method we do not rework like recursion. Here we store the
previous two numbers(first and second in above code) and calculate the next one. So its a
efficient way to calculate the number. The time complexity in this will be O(n).
Thanks a lot. Please feel free to ask doubts if you have any. God bless you.
Solution
/******************* using recursive method **********************/
/**
* 1.2.1 Java program to calculate the Fibonacci Number using recursion
*/
import java.util.Scanner;
public class Fibo {
public static void main(String args[]){
Scanner scan= new Scanner(System.in); //Scanner object to read from the user
int n;
System.out.println(\"Enter the value of n\");
n=scan.nextInt();
System.out.println(\"The \"+n+\". Fibonacci number is \"+calFibonacci(n+1));// Calling the
recursive method
scan.close();
}
//method to calculate Fibonacci number recursively
public static long calFibonacci(int index){
if (index == 1)
return 0;
if (index == 2)
return 1;
return calFibonacci(index - 1) + calFibonacci(index - 2);
}
}
/** Outputs
* .
What will be the output from the following code if the user enters 4.pdf
What will be the output from the following code if the user enters 4.
int[] list = {1, 4, 4, 2, 5, -3, 6, 2};
int toSearch = input.nextInt();
int location = -1;
for(int i = 0; i < list.length; i++) {
if(list[i] == toSearch) {
location = i;
}
}
System.out.print(location);
Solution
Program:
import java.io.*;
import java.util.Scanner;
public class Ary
{
public static void main(String[] args)
{
int[] list = {1, 4, 4, 2, 5, -3, 6, 2};
Scanner input = new Scanner(System.in); // here we are scanning the input from the user
int toSearch = input.nextInt();
int location = -1;
for(int i = 0; i < list.length; i++) {
if(list[i] == toSearch) {
location = i;
}
}
System.out.println(location); // here we are printing the corresponding element in the list based
on user input
}
}
//if the user enters number 4 the output of the above code is as follows
Output:
4
2.
Complete the classes shown below 1. The MinHeap Class Write necessa.pdf
Complete the classes shown below: 1. The MinHeap Class Write necessary code in the method
buildMinHeap, downHeap and upHeap. Add your necessary changes in the section where this
block of code is written: /*** *** Write YOUR CODE HERE *** ***/ The driver generates a
Sorted List of decreasing order using HeapSort after the specified heap operations are performed.
The details of these methods are given below, also additional hints are provided in the code as
comments. Also we have added helper methods for generating output. Do not edit any helper
methods, they are necessary for Gradescope. Complete the code before the due date. Submit the
completed MinHeap.java file via Gradescope module in folio. Details of Methods:
buildMinHeap: Given an array of N elements, stored from indices 1 thru N, build a min-heap
using bottom-up construction. The helper functions in the DriverPA2.java file read the size and
populate the input array before calling on your buildMinHeap operation. downHeap: downHeap
is an operation that is used to maintain the heap property after removing the root node from a
heap. When the root node is removed, the last node in the heap is moved to the root position, and
the downHeap operation is applied to this node to restore the heap property During downHeap,
the node is compared with its children, and if its value is greater than the value of its children , it
is swapped with the child that has the lowest value. This process is repeated until the heap
property is restored. downHeap will restore the heap-order property by swapping key k along a
downward path from the root. You need to maintain the Min Heap properties within the reduced
size of the array. upHeap: upHeap is an operation that is used to maintain the heap property after
inserting a new node into the heap. When a new node is inserted, it is placed at the bottom of the
heap and the upHeap operation is applied to this node to restore the heap property. During
upHeap, the node is compared with its parent, and if its value is less than the value of its parent ,
it is swapped with its parent. This process is repeated until the heap property is restored. upHeap
will restore the heap-order property by swapping k along an upward path from the insertion
node. During each insertion process, you need to ensure the MinHeap property is maintained.
Input File Structure: Example: minheap0.txt 7 // Input array size(size_n) 21 16 13 12 9 7 3 //
Input Array for MinHeap build (int[] minHeap) 10 30 20 5 15 // Integer array to be inserted in
the MinHeap(int[] newelements) Sample Output in DriverPA2: Result after buildheap: 3 9 7 12
16 21 13 Removed Elements: 3 7 9 12 13 HeapSort result: 30 21 20 16 15 10 5 We have added 5
more input files, you can test them as well changing the file name in the Driver.java main
method. These are the files: minheap1.txt minheap2.txt minheap3.txt minheap4.txt minheap5.txt
Additional Notes: We have allocated the size of the Input Array more than enough capacity f.
Name- Gold leaved white PoplarGenus- Populusspecies- albaAutho.pdf
In python,Tkinter is a Graphical user interface package.So,Tkinter tookit for GUI programming
supports protocol handler mechanism.
Protocol is taking care of how interaction takes place between application and windows manager.
self.parent.protocol(\"WM_DELETE_WINDOW\",self.quit_handler)
in the above line \"WM_DELETE_WINDOW\" is a protocol.What this protocl does is :it define
what is going to happen when a user who uses the application and closes window explicitely
using windows manager.
Then this protocol \"WM_DELETE_WINDOE\" bypasses to quit_handler().
That quit_handler() asks user \"whether he or she wants to quit or not\" then simply quit the
window.
Solution
In python,Tkinter is a Graphical user interface package.So,Tkinter tookit for GUI programming
supports protocol handler mechanism.
Protocol is taking care of how interaction takes place between application and windows manager.
self.parent.protocol(\"WM_DELETE_WINDOW\",self.quit_handler)
in the above line \"WM_DELETE_WINDOW\" is a protocol.What this protocl does is :it define
what is going to happen when a user who uses the application and closes window explicitely
using windows manager.
Then this protocol \"WM_DELETE_WINDOE\" bypasses to quit_handler().
That quit_handler() asks user \"whether he or she wants to quit or not\" then simply quit the
window..
molarity = 0.252101.1 =0.001236 M percent =0.251002 =12.5 .pdf
If this is not soluble in water, this must be nonpolar,
if it si soluble in hexane, this must be nonpolar as well
therefore, we are certain this is nonpolar substance
with low vap pressure...
From the list, nearest BP for that pressure is chloroform with 60ºC (vs 58.) which is ok, since no
range is given.
CCl4 is nonpolar
In order to ensure this, you could use a chromatography with previous data, i.e. use chloroform
standard and run chromatography vs. unkown. If they behave the same ( same Rf value, and
retention time ) then this is most likely chloroform
Solution
If this is not soluble in water, this must be nonpolar,
if it si soluble in hexane, this must be nonpolar as well
therefore, we are certain this is nonpolar substance
with low vap pressure...
From the list, nearest BP for that pressure is chloroform with 60ºC (vs 58.) which is ok, since no
range is given.
CCl4 is nonpolar
In order to ensure this, you could use a chromatography with previous data, i.e. use chloroform
standard and run chromatography vs. unkown. If they behave the same ( same Rf value, and
retention time ) then this is most likely chloroform.
More Related Content
Similar to MinOfFourNumbers.javaimport java.util.Scanner;public class MinOf.pdf
import java.util.Scanner;public class ArrayData { AR.pdf
import java.util.Scanner;
public class ArrayData {
/*
* ARRAY_SIZE variable to decalre the minimum array size
*/
static int ARRAY_SIZE = 5;
/*
* ARRAY_ELEMENTS variable to monitor the array elements at present [after user
operations]
*/
static int ARRAY_ELEMENTS = 0;
/*
* integerArray base array of size ARRAY_SIZE with elements \'0\'
*/
int[] integerArray = {0,0,0,0,0};
/*
* copy\'s the array passed to the base array
*/
public void copy(int[] from, int length){
for(int j=0;j= ARRAY_SIZE){
doubleArray();
}
System.out.println(\"integerArray length\"+integerArray.length);
int[] bigger = new int[integerArray.length];
int add = valueInsert;
boolean found = false;
int indexToInsert = 0;
for (int i = 0; i < integerArray.length-1; i++){
if ( !found && add >= integerArray[i]){
found = true;
indexToInsert = i;
bigger[indexToInsert] = add;
i--;
}
else{
if(found)
{
bigger[i+1] = integerArray[i];
}else
{
bigger[i] = integerArray[i];
}
}
}
if(!found)
{
indexToInsert = integerArray.length;
bigger[indexToInsert] = add;
}
System.out.println(\"integerArray length last\"+integerArray.length);
integerArray = bigger.clone();
ARRAY_ELEMENTS += 1;
}
/*
* Displays the base array elements when user gives wrong input
*/
public void display(){
for(int i=0;i
Solution
import java.util.Scanner;
public class ArrayData {
/*
* ARRAY_SIZE variable to decalre the minimum array size
*/
static int ARRAY_SIZE = 5;
/*
* ARRAY_ELEMENTS variable to monitor the array elements at present [after user
operations]
*/
static int ARRAY_ELEMENTS = 0;
/*
* integerArray base array of size ARRAY_SIZE with elements \'0\'
*/
int[] integerArray = {0,0,0,0,0};
/*
* copy\'s the array passed to the base array
*/
public void copy(int[] from, int length){
for(int j=0;j= ARRAY_SIZE){
doubleArray();
}
System.out.println(\"integerArray length\"+integerArray.length);
int[] bigger = new int[integerArray.length];
int add = valueInsert;
boolean found = false;
int indexToInsert = 0;
for (int i = 0; i < integerArray.length-1; i++){
if ( !found && add >= integerArray[i]){
found = true;
indexToInsert = i;
bigger[indexToInsert] = add;
i--;
}
else{
if(found)
{
bigger[i+1] = integerArray[i];
}else
{
bigger[i] = integerArray[i];
}
}
}
if(!found)
{
indexToInsert = integerArray.length;
bigger[indexToInsert] = add;
}
System.out.println(\"integerArray length last\"+integerArray.length);
integerArray = bigger.clone();
ARRAY_ELEMENTS += 1;
}
/*
* Displays the base array elements when user gives wrong input
*/
public void display(){
for(int i=0;i.
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting Started
Create a class called Lab8. Use the same setup for setting up your class and main method as you
did for the previous assignments. Be sure to name your file Lab8.java. Additionally, make
another file called Arrays.java. This file will be an object, so simply start it off by declaring an
Arrays class. You can copy the following skeleton and fill in the appropriate code below each of
the comments:
public class Arrays {
/ Instance Variables
// Constructors
// findMin 1
// findMax
// calcSum
// calcAverage
// toString
}
Task Overview
Your task for this lab is to create a class called Arrays with some array processing methods. This
class will maintain an array and the number of elements present in it. Additionally, methods will
be available to display the current min and max elements along with the average of all of them.
Finally, a toString() method will be available to cleanly display all the array elements. Finally,
you will write a simple driver class to test out the above Arrays class.
Part 1: Instance Variables for Arrays
The first thing to do for the Arrays class is to set up its instance variables. Declare the following
(private) instance variables:
• An int array called array ? this will be the array we will be writing methods for.
• An int called count - this represents the number of valid elements in the array.
Part 2:
Constructors for Arrays The Arrays class will have two constructors. The first constructor takes
the maximum size of the array as input as a parameter and initializes the array instance variable
appropriately. It also sets count to size. Finally, it will initialize all of the array elements to some
values between 0 and 10, inclusive. To create this constructor, follow these steps:
• Import java.util.Random to make use of the random number generator.
• Create a constructor with the following header: public Arrays(int size)
• Initialize your array variable and set its size to size (see the chart on page 252 for reference on
initializing arrays). Be very careful that you are setting the value of your array instance variable,
as opposed to creating a new variable called array.
• Set the value of the count variable to size because we will be populating the entire array.
• Copy the following code to the constructor in order to generate random values between 0 and
10, inclusive:
Random rand = new Random();
for (int i = 0; i < count; i++)
{
array[i] = (rand.nextInt(10));
}
Next, create another constructor with the following header: public Arrays(int[] arr). This
constructor will initialize the class by using the passed arr argument in order to fill its instance
variables. The following things need to be done inside of this constructor:
• Set the array variable equal to arr.
• Set the count variable equal to the length of the array.
Part 3: Displaying the Output findMin()
The first method of this class will search the array for the minimum element. Copy the following
code for the findMin method. Note how the count i.
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) .
The java program Jumble that prompts user to enter nu.pdf
/**
* The java program Jumble that prompts user to
* enter number of words.Then prompts for words
* of the string.
* Then calls the permute method of the class
* MyString and prints the permutations of
* the strings to console
* */
//Jumble.java
import java.util.Scanner;
public class Jumble
{
public static void main(String[] args)
{
//Create an instance of Scanner class
Scanner scanner=new Scanner(System.in);
//set num=0
int num = 0;
MyString ms=null;
System.out.println(\"How many words?\");
//prompt for num value
num=Integer.parseInt(scanner.nextLine());
//create an array of type string
String[] words=new String[num];
//prompt for words
System.out.println(\"Enter the words:\");
for (int i = 0; i < num; i++)
{
words[i]=scanner.nextLine();
}
//Run for loop for given words length
for (int i = 0; i < words.length; i++)
{
//create an instance of MyString with words at index
ms=new MyString(words[i]);
for (int j = 0; j < 4; j++)
{
//call permute
System.out.println(ms.permute());
}
}
}
}
----------------------------------------------------------------------------------------------------
//MyString.java
import java.util.Random;
public class MyString
{
//create an instance of Random class
private Random r=new Random();
//instance variable,str
private String str;
//constructor
public MyString(String str)
{
this.str=str;
}
//print the string
public void printMe()
{
System.out.println(str);
}
/*
* Permute method that permutes the string
* and return permuted string .
* */
public String permute()
{
//Create an instance of StringBuffer class with string value
StringBuffer sb=new StringBuffer(str);
//swap for n times
for (int i = sb.length()-1;i>0; i--)
{
int rand = r.nextInt(sb.length());
char temp = sb.charAt(i);
sb.setCharAt(i, sb.charAt(rand));
sb.setCharAt(rand, temp);
}
//swap for n times,so total 2n times
for (int i = sb.length()-1;i>0; i--)
{
int rand = r.nextInt(sb.length());
char temp = sb.charAt(i);
sb.setCharAt(i, sb.charAt(rand));
sb.setCharAt(rand, temp);
}
return new String(sb);
}
}
----------------------------------------------------------------------------------------------------
Sample output:
How many words?
3
Enter the words:
mixed
calendar
then
dmexi
imxed
emixd
idmex
nalrdaec
candreal
aalrdcen
claadner
tenh
tnhe
etnh
tneh
Solution
/**
* The java program Jumble that prompts user to
* enter number of words.Then prompts for words
* of the string.
* Then calls the permute method of the class
* MyString and prints the permutations of
* the strings to console
* */
//Jumble.java
import java.util.Scanner;
public class Jumble
{
public static void main(String[] args)
{
//Create an instance of Scanner class
Scanner scanner=new Scanner(System.in);
//set num=0
int num = 0;
MyString ms=null;
System.out.println(\"How many words?\");
//prompt for num value
num=Integer.parseInt(scanner.nextLine());
//create an array of type string
String[] words=new String[num];
//prompt for words
System.out.println(\"Enter the words:\");
for (int i = 0; i < num; i++).
when I compile to get the survey title the overload constructor asks.docx
when I compile to get the survey title the overload constructor asks for title name input else the default constructor sets a default name. My code ask for the title and after I enter it hangs until I enter it again
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
//package surveyproject;
public class Survey {
//declare variables
private static int respondentID;
public String surveyTitle;
public int initial_menu_Choice;
public int[][] ansArray = new int [3][3];
public String[] questArray = new String [3];
Scanner scan = new Scanner(System.in);
//default constructor
public Survey(){
surveyTitle = "Customer Survey";
}
//constructor with parameter
public Survey(String title){
respondentID = 0;
surveyTitle = title;
}
//method to get survey title
public String getSurveyTitle(){
return surveyTitle;
}
//method to get respondent ID
public int getRespondentID(){
return respondentID;
}
//method to generate respondent ID
public int generateRespondentID(){
//increments the respondent ID
respondentID++;
return respondentID;
}
public void setIntialMenuChoice(int inti_menu_choice){
initial_menu_Choice = inti_menu_choice;
}
//display survey results
public void displaySurveyResults(){
//print name of survey
//print ansArray
System.out.println("Survey: "+ surveyTitle);
System.out.println("Results of the survey: ");
System.out.print("Respondent ID| Q1\tQ2\tQ3 \n");
for(int i = 0; i < 3; i++){
System.out.print(" " + i + " | ");
for(int j = 0; j < 3; j++){
System.out.print(ansArray[i][j]+"\t");
}
System.out.println("\n");
}
}
public void displayQuestionStats(int questNum){
//display response entered for 'questNum'
System.out.println("Question stats for Question: "+questNum+" "+questArray[questNum-1]);
for(int i = 0; i < 3; i++){
System.out.println(ansArray[i][questNum-1]);
}
}
void enterQuestions(){
Scanner scan = new Scanner(System.in);
//user will enter 3 questions to be stored in string array
System.out.println("Enter 3 questions to create a survey");
for(int i = 0; i < 3; i++){
System.out.println("Enter question "+(i+1)+":");
questArray[i] = scan.next();
}
}
public void logResponse(int id, int questNum, int response){
//enter response in the matrix
ansArray[id][questNum] = response;
}
//user to fill in the survey questions
public void completeSurvey(int id){
System.out.println("Respondent "+ id+ " is taking survey");
Scanner inp = new Scanner(System.in);
int resp ;
System.out.println("Answer each question with number between 1 to 5");
for(int i=0; i<3; i++){
System.out.print("Question "+(i+1)+":");
//pres.
Implementation of Banker’s Algorithm using java is given below .pdf
Implementation of Banker’s Algorithm using java is given below:
package bankersalgorithm;
import javax.swing.JOptionPane;
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
int n = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Process:\"));
int m = Integer.parseInt(JOptionPane.showInputDialog(\"Resource Type Number:\"));
int available[] = new int[m];
int max[][] = new int[n][m];
int allocation[][] = new int[n][m];
int need[][] = new int[n][m];
String sequence = \"\";
for(int i = 0; i < m; i++)
{
available[i] = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Available Resource
\" + (i) + \":\"));
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
allocation[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"Allocation P \" + (i) + \" for
R \" + (j) + \":\"));
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
max[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"MAX P \" + (i) + \" for R \" + (j) +
\":\"));
need[i][j] = max[i][j] - allocation[i][j];
}
}
int work[] = available;
boolean finish[] = new boolean[n];
for(int i = 0; i < n; i++)
{
finish[i] = false;
}
boolean check = true;
while(check)
{
check = false;
for(int i = 0; i < n; i++)
{
if(!finish[i])
{
int j;
for(j = 0; j < m; j++)
{
if(need[i][j] > work[j])
{
break;
}
}
if(j == m)
{
for(j=0; j < m; j++)
{
work[j] = work[j] + allocation[i][j];
}
finish[i] = true;
check = true;
sequence += i + \", \";
}
}
}
}
int i;
for(i = 0; i < n; i++)
{
if(!finish[i])
break;
}
if(i==n)
{
JOptionPane.showMessageDialog(null, \"SAFE And Sequence is:\"+sequence);
}
else
{
JOptionPane.showMessageDialog(null, \"DEAD LOCK\");
}
}
}
Solution
Implementation of Banker’s Algorithm using java is given below:
package bankersalgorithm;
import javax.swing.JOptionPane;
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
int n = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Process:\"));
int m = Integer.parseInt(JOptionPane.showInputDialog(\"Resource Type Number:\"));
int available[] = new int[m];
int max[][] = new int[n][m];
int allocation[][] = new int[n][m];
int need[][] = new int[n][m];
String sequence = \"\";
for(int i = 0; i < m; i++)
{
available[i] = Integer.parseInt(JOptionPane.showInputDialog(\"Number Of Available Resource
\" + (i) + \":\"));
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
allocation[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"Allocation P \" + (i) + \" for
R \" + (j) + \":\"));
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
max[i][j] = Integer.parseInt(JOptionPane.showInputDialog(\"MAX P \" + (i) + \" for R \" + (j) +
\":\"));
need[i][j] = max[i][j] - allocation[i][j];
}
}
int work[] = available;
boolean finish[] = new boolean[n];
for(int i = 0; i < n; i++)
{
finish[i] = false;
}
boolean check = true;
while(check)
{
check = false;
for(int i = 0; i < n; i++)
{
if(!finish[i])
{
int j;
f.
Write a method called uniqueNumbers that takes an int array as param.pdf
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 function which return a list of all of the n element subset .pdf
Write a function which return a list of all of the n element subset of a given set
Implement in JAVA Question 3 Write a function that returns a list of all of the n-element subsets
of a given set. For example, if the given set is [1,2,3] and n is 2, then the returned list should
contain [1,2], [1,3], and [2,3]. The order of the elements is not important.
Solution
The program for this problem is as follows:
Comments are included in the program for explaining the steps.
A sample output is attached below the program.
package com.temp;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Program to find sublists of a list.
* @author Rohit Phatak
*
*/
public class subset {
/**
* This list will contain the resultant sublists.
*/
static List list = new ArrayList<>();
public static void main(String arg[]){
/**
* Input a list comma separated.
*/
System.out.println(\"Enter a list : \");
Scanner scanner = new Scanner(System.in);
String s = scanner.nextLine();
String[] sArr = s.split(\",\");
/**
* Input a value of n.
*/
System.out.println(\"Enter value of n : \");
Integer n = scanner.nextInt();
/**
* Check if value of n is greater than entered list.
*/
if(sArr.length < n){
System.out.println(\"Length of list is less than value of n\");
} else if(sArr.length > 0){
getSubsetList(sArr,n);
System.out.println(\"List is as :\");
/**
* Printing the sublists.
*/
for(String[] str : list){
String printVar = \"\";
for(String temps : str)
printVar+=temps+\",\";
System.out.println(\"[\"+printVar.substring(0, printVar.length()-1)+\"]\");
}
} else {
System.out.println(\"Please enter atleast one element:\");
}
scanner.close();
}
/**
* This method calls the recursive function which is used to obtain the sublists.
* @param sArr
* @param n
* @return
*/
public static List getSubsetList(String[] sArr,Integer n){
List lista = new ArrayList<>();
sublist(sArr, 0, n, new String[n]);
return lista;
}
/**
* This is a recursive function.
* This function will iterate over itself for finding the sublist.
*
* Parameters are as follows:
*
* @param arr -> List entered by the user.
* @param n -> Value of sublist entered by user.
* @param startPosition -> index to start creating the sublist.
* @param result -> resultant sublist
*/
public static void sublist(String[] arr, int startPosition, int n, String[] result){
/**
* Check for the value of n ==0.
* If n==0 break from the recursion.
*/
if (n == 0){
/**
* Add the sublist \'result\' in the list.
*/
list.add(result.clone());
return;
}
/**
* Iterate through for loop starting from startPosition till length of list minus entered value
n.
*/
for (int i = startPosition; i <= arr.length-n; i++){
/**
* Here result is a temporary sublist.
* This for loop adds an element to the temporary sublist in each iteration.
* The element is added from the complete list entered by user.
* Location of element is iTh index.
*/
result[result.length - n] = arr[i];
/**
* After adding the element to the temporary sublist, the sublist an.
using recursive method .pdf
/******************* using recursive method **********************/
/**
* 1.2.1 Java program to calculate the Fibonacci Number using recursion
*/
import java.util.Scanner;
public class Fibo {
public static void main(String args[]){
Scanner scan= new Scanner(System.in); //Scanner object to read from the user
int n;
System.out.println(\"Enter the value of n\");
n=scan.nextInt();
System.out.println(\"The \"+n+\". Fibonacci number is \"+calFibonacci(n+1));// Calling the
recursive method
scan.close();
}
//method to calculate Fibonacci number recursively
public static long calFibonacci(int index){
if (index == 1)
return 0;
if (index == 2)
return 1;
return calFibonacci(index - 1) + calFibonacci(index - 2);
}
}
/** Outputs
* Enter the value of n 25
The 25. Fibonacci number is 75025
*/
/******************************using iterative
method************************************/
/**
* 1.2.2 Java program to calculate the fibonacci number using iterative method
*/
import java.util.Scanner;
public class Fibo2 {
public static void main(String args[]){
Scanner scan= new Scanner(System.in); //Scanner object to read from the user
int n;
System.out.println(\"Enter the value of n\");
n=scan.nextInt();
System.out.println(\"The \"+n+\". Fibonacci number is \"+calFibonacci(n+1)); // Calling the
iterative method to calculate fibonacci number
scan.close();
}
public static long calFibonacci(int index){
int first=0;
int second=1;
for(int i=2;i<=index;i++){
int temp=first;
first=first+second;
second=temp;
}
return first;
}
}
/** Output
*
* Enter the value of n 25
The 25. Fibonacci number is 75025
*
*/
/**************************************************/
The efficient method is the iterative way of calculating the number
Explaination
In recursion method we calculate the the numbers from current index till 0. So for each index we
do calculate the fibonacci number again and again. Hence it takes a lot time to calculate the
answers. Whereas in iterative method we do not rework like recursion. Here we store the
previous two numbers(first and second in above code) and calculate the next one. So its a
efficient way to calculate the number. The time complexity in this will be O(n).
Thanks a lot. Please feel free to ask doubts if you have any. God bless you.
Solution
/******************* using recursive method **********************/
/**
* 1.2.1 Java program to calculate the Fibonacci Number using recursion
*/
import java.util.Scanner;
public class Fibo {
public static void main(String args[]){
Scanner scan= new Scanner(System.in); //Scanner object to read from the user
int n;
System.out.println(\"Enter the value of n\");
n=scan.nextInt();
System.out.println(\"The \"+n+\". Fibonacci number is \"+calFibonacci(n+1));// Calling the
recursive method
scan.close();
}
//method to calculate Fibonacci number recursively
public static long calFibonacci(int index){
if (index == 1)
return 0;
if (index == 2)
return 1;
return calFibonacci(index - 1) + calFibonacci(index - 2);
}
}
/** Outputs
* .
What will be the output from the following code if the user enters 4.pdf
What will be the output from the following code if the user enters 4.
int[] list = {1, 4, 4, 2, 5, -3, 6, 2};
int toSearch = input.nextInt();
int location = -1;
for(int i = 0; i < list.length; i++) {
if(list[i] == toSearch) {
location = i;
}
}
System.out.print(location);
Solution
Program:
import java.io.*;
import java.util.Scanner;
public class Ary
{
public static void main(String[] args)
{
int[] list = {1, 4, 4, 2, 5, -3, 6, 2};
Scanner input = new Scanner(System.in); // here we are scanning the input from the user
int toSearch = input.nextInt();
int location = -1;
for(int i = 0; i < list.length; i++) {
if(list[i] == toSearch) {
location = i;
}
}
System.out.println(location); // here we are printing the corresponding element in the list based
on user input
}
}
//if the user enters number 4 the output of the above code is as follows
Output:
4
2.
Complete the classes shown below 1. The MinHeap Class Write necessa.pdf
Complete the classes shown below: 1. The MinHeap Class Write necessary code in the method
buildMinHeap, downHeap and upHeap. Add your necessary changes in the section where this
block of code is written: /*** *** Write YOUR CODE HERE *** ***/ The driver generates a
Sorted List of decreasing order using HeapSort after the specified heap operations are performed.
The details of these methods are given below, also additional hints are provided in the code as
comments. Also we have added helper methods for generating output. Do not edit any helper
methods, they are necessary for Gradescope. Complete the code before the due date. Submit the
completed MinHeap.java file via Gradescope module in folio. Details of Methods:
buildMinHeap: Given an array of N elements, stored from indices 1 thru N, build a min-heap
using bottom-up construction. The helper functions in the DriverPA2.java file read the size and
populate the input array before calling on your buildMinHeap operation. downHeap: downHeap
is an operation that is used to maintain the heap property after removing the root node from a
heap. When the root node is removed, the last node in the heap is moved to the root position, and
the downHeap operation is applied to this node to restore the heap property During downHeap,
the node is compared with its children, and if its value is greater than the value of its children , it
is swapped with the child that has the lowest value. This process is repeated until the heap
property is restored. downHeap will restore the heap-order property by swapping key k along a
downward path from the root. You need to maintain the Min Heap properties within the reduced
size of the array. upHeap: upHeap is an operation that is used to maintain the heap property after
inserting a new node into the heap. When a new node is inserted, it is placed at the bottom of the
heap and the upHeap operation is applied to this node to restore the heap property. During
upHeap, the node is compared with its parent, and if its value is less than the value of its parent ,
it is swapped with its parent. This process is repeated until the heap property is restored. upHeap
will restore the heap-order property by swapping k along an upward path from the insertion
node. During each insertion process, you need to ensure the MinHeap property is maintained.
Input File Structure: Example: minheap0.txt 7 // Input array size(size_n) 21 16 13 12 9 7 3 //
Input Array for MinHeap build (int[] minHeap) 10 30 20 5 15 // Integer array to be inserted in
the MinHeap(int[] newelements) Sample Output in DriverPA2: Result after buildheap: 3 9 7 12
16 21 13 Removed Elements: 3 7 9 12 13 HeapSort result: 30 21 20 16 15 10 5 We have added 5
more input files, you can test them as well changing the file name in the Driver.java main
method. These are the files: minheap1.txt minheap2.txt minheap3.txt minheap4.txt minheap5.txt
Additional Notes: We have allocated the size of the Input Array more than enough capacity f.
Similar to MinOfFourNumbers.javaimport java.util.Scanner;public class MinOf.pdf (20)
import java.util.Scanner;public class ArrayData { AR.pdf
import java.util.Scanner;public class ArrayData { AR.pdf
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
The java program Jumble that prompts user to enter nu.pdf
The java program Jumble that prompts user to enter nu.pdf
when I compile to get the survey title the overload constructor asks.docx
when I compile to get the survey title the overload constructor asks.docx
Implementation of Banker’s Algorithm using java is given below .pdf
Implementation of Banker’s Algorithm using java is given below .pdf
Write a method called uniqueNumbers that takes an int array as param.pdf
Write a method called uniqueNumbers that takes an int array as param.pdf
Lab02kdfshdfgajhdfgajhdfgajhdfgjhadgfasjhdgfjhasdgfjh.pdf
Lab02kdfshdfgajhdfgajhdfgajhdfgjhadgfasjhdgfjhasdgfjh.pdf
Write a function which return a list of all of the n element subset .pdf
Write a function which return a list of all of the n element subset .pdf
What will be the output from the following code if the user enters 4.pdf
What will be the output from the following code if the user enters 4.pdf
Complete the classes shown below 1. The MinHeap Class Write necessa.pdf
Complete the classes shown below 1. The MinHeap Class Write necessa.pdf
More from aptex1
Name- Gold leaved white PoplarGenus- Populusspecies- albaAutho.pdf
In python,Tkinter is a Graphical user interface package.So,Tkinter tookit for GUI programming
supports protocol handler mechanism.
Protocol is taking care of how interaction takes place between application and windows manager.
self.parent.protocol(\"WM_DELETE_WINDOW\",self.quit_handler)
in the above line \"WM_DELETE_WINDOW\" is a protocol.What this protocl does is :it define
what is going to happen when a user who uses the application and closes window explicitely
using windows manager.
Then this protocol \"WM_DELETE_WINDOE\" bypasses to quit_handler().
That quit_handler() asks user \"whether he or she wants to quit or not\" then simply quit the
window.
Solution
In python,Tkinter is a Graphical user interface package.So,Tkinter tookit for GUI programming
supports protocol handler mechanism.
Protocol is taking care of how interaction takes place between application and windows manager.
self.parent.protocol(\"WM_DELETE_WINDOW\",self.quit_handler)
in the above line \"WM_DELETE_WINDOW\" is a protocol.What this protocl does is :it define
what is going to happen when a user who uses the application and closes window explicitely
using windows manager.
Then this protocol \"WM_DELETE_WINDOE\" bypasses to quit_handler().
That quit_handler() asks user \"whether he or she wants to quit or not\" then simply quit the
window..
molarity = 0.252101.1 =0.001236 M percent =0.251002 =12.5 .pdf
If this is not soluble in water, this must be nonpolar,
if it si soluble in hexane, this must be nonpolar as well
therefore, we are certain this is nonpolar substance
with low vap pressure...
From the list, nearest BP for that pressure is chloroform with 60ºC (vs 58.) which is ok, since no
range is given.
CCl4 is nonpolar
In order to ensure this, you could use a chromatography with previous data, i.e. use chloroform
standard and run chromatography vs. unkown. If they behave the same ( same Rf value, and
retention time ) then this is most likely chloroform
Solution
If this is not soluble in water, this must be nonpolar,
if it si soluble in hexane, this must be nonpolar as well
therefore, we are certain this is nonpolar substance
with low vap pressure...
From the list, nearest BP for that pressure is chloroform with 60ºC (vs 58.) which is ok, since no
range is given.
CCl4 is nonpolar
In order to ensure this, you could use a chromatography with previous data, i.e. use chloroform
standard and run chromatography vs. unkown. If they behave the same ( same Rf value, and
retention time ) then this is most likely chloroform.
Initial concentration of Br- = 2.25 x 10e-3M1V1=M2V2therefore M2.pdf
From the graph, we can see that there are three values at which f(x)= 0
These are- x= -6,-2,3
Hence the answer is Option D
Solution
From the graph, we can see that there are three values at which f(x)= 0
These are- x= -6,-2,3
Hence the answer is Option D.
import java.util.Scanner;public class HornersPolynomial { .pdf
For a first order reaction rate constant , k = ( 2.303 /t )x log ( a / (a-x))
Where
a = initial amount
a-x = amount left after time t = a / 10
t = time = ?
k = rate constant = 3.43x10 -2 d -2
Plug the values we get t = ( 2.303 /k )x log ( a / (a-x))
= ( 2.303 / 3.43x10 -2 )x log ( a / (a/10))
= 67.14 days
Solution
For a first order reaction rate constant , k = ( 2.303 /t )x log ( a / (a-x))
Where
a = initial amount
a-x = amount left after time t = a / 10
t = time = ?
k = rate constant = 3.43x10 -2 d -2
Plug the values we get t = ( 2.303 /k )x log ( a / (a-x))
= ( 2.303 / 3.43x10 -2 )x log ( a / (a/10))
= 67.14 days.
Direct memory access (DMA) is a function that allows an inputoutput.pdf
approximately all of the propoerty crimes are between 3 standard deviations from the mean
mean,u = 3377.2
standard deviation,s = 847.4
u - 3s = 835
u + 3s = 5919.4
OPTION B
p(Z
Solution
approximately all of the propoerty crimes are between 3 standard deviations from the mean
mean,u = 3377.2
standard deviation,s = 847.4
u - 3s = 835
u + 3s = 5919.4
OPTION B
p(Z.
Ethanol is miscible in water because of the hydroxyl functional grou.pdf
b) Security requirements
Security requirements are the outputs of the risk management activity. Inputs to the risk
management and information security strategy include business strategy, business processes, risk
assessments, business input analysis, information resources, and regulatory requirements.
Solution
b) Security requirements
Security requirements are the outputs of the risk management activity. Inputs to the risk
management and information security strategy include business strategy, business processes, risk
assessments, business input analysis, information resources, and regulatory requirements..
the diluted concentration of HCl = (0.120 M x 25..pdf
the diluted concentration of HCl = (0.120 M x 25.0 mL) / (25.0 + 40.0) mL =
0.0462 M [H+] = [HCl] = 0.0462 M pH = -log[H+] = -log0.0462 = 1.33
Solution
the diluted concentration of HCl = (0.120 M x 25.0 mL) / (25.0 + 40.0) mL =
0.0462 M [H+] = [HCl] = 0.0462 M pH = -log[H+] = -log0.0462 = 1.33.
Simple Nobody Knows The Answer .pdf
Simple Nobody Knows The Answer
Solution
Simple Nobody Knows The Answer.
AnswerThe net equation of the reaction catalyzed by the protein c.pdf
a) [21]+[19] = [40] = [4] {since 40 when divided ny 12 leaves a remainder of 4 }
b) [37][27] = [ 999] = [9] { Since now the remiander will be 9 when divided by 45}
c) [33]([83] - [67]) = [33] [16] = [528] = [28]
d) [18] + [8] = [26] = [0]. Hence additive inverse of [18] is [8].
Solution
a) [21]+[19] = [40] = [4] {since 40 when divided ny 12 leaves a remainder of 4 }
b) [37][27] = [ 999] = [9] { Since now the remiander will be 9 when divided by 45}
c) [33]([83] - [67]) = [33] [16] = [528] = [28]
d) [18] + [8] = [26] = [0]. Hence additive inverse of [18] is [8]..
Answer i command.The vi editor always starts in command mode. For.pdf
A Shareholder of a company is holding a share in the assets of the company. A shareholder is
also entitled to the profits which company makes by using those assets. As the basic fomat of
company distinguishes the Management function from the ownership, People managing the
company may or maynot be the owners i.e share holders of the company. Regulators often
require the companies to obtain approval of the shareholders via a resolution in the shareholders
meeting, thus the deciding power rests with the shareholders. However the extent of powers are
contained in the Legislature governing that corporation.
Shareholders have right in the assets of the corporation not in the day to day mangement of the
corporation.
Solution
A Shareholder of a company is holding a share in the assets of the company. A shareholder is
also entitled to the profits which company makes by using those assets. As the basic fomat of
company distinguishes the Management function from the ownership, People managing the
company may or maynot be the owners i.e share holders of the company. Regulators often
require the companies to obtain approval of the shareholders via a resolution in the shareholders
meeting, thus the deciding power rests with the shareholders. However the extent of powers are
contained in the Legislature governing that corporation.
Shareholders have right in the assets of the corporation not in the day to day mangement of the
corporation..
Answer (b) systems security and control.The businesses are now a .pdf
A chemical formula is an expression indicating the atoms and their number in a particular
compound.
Each element/atom is identified by its symbol and the number of atoms are given in the
subscript.
For example, one molecule of water contain 2 atoms of hydrogen and one atom of oxygen:
H2O
Hope this helps
Solution
A chemical formula is an expression indicating the atoms and their number in a particular
compound.
Each element/atom is identified by its symbol and the number of atoms are given in the
subscript.
For example, one molecule of water contain 2 atoms of hydrogen and one atom of oxygen:
H2O
Hope this helps.
A. Temeperature of refrigeratorsIntervalB. Horspower of .pdf
2) b) Understory is rich in humidity hence supports fungi
3) a) canopy includes plant crowns
4) c) herbaceous
5) d) leaf litter/soil
Solution
2) b) Understory is rich in humidity hence supports fungi
3) a) canopy includes plant crowns
4) c) herbaceous
5) d) leaf litter/soil.
48. The answer is Botulism. Botulism ia an illness that brings about.pdf
1 gallon gasoline = 3.785 L = 3.785 x 803 grams
Now, total heat produced = weight(in gms) x heat of combustion = 3.785 x 803 x 48 kJ
=145889.04 kJ =145.9 MJ
IT IS VERY LARGE NUMBER !!!!
Solution
1 gallon gasoline = 3.785 L = 3.785 x 803 grams
Now, total heat produced = weight(in gms) x heat of combustion = 3.785 x 803 x 48 kJ
=145889.04 kJ =145.9 MJ
IT IS VERY LARGE NUMBER !!!!.
2) b) Understory is rich in humidity hence supports fungi3) a) can.pdf
(A) The answer is b. increases
Electricity in the form of electrons are transported through the solution by charged ions of the
electrolyte. As the electrolyte concentration increases, so does the number of charge carriers and
hence the amount of charge and electricity conducted increases.
(B) Acetic acid (CH3COOH) is a weak acid and partially ionizes in water:
CH3COOH + H2O => CH3COO- + H3O+
The charged acetate (CH3COO- ) and hydroxonium (H3O+) ions are responsible for electrical
conductivity.
In 6 M acetic acid, water is in excess and and the ionization proceeds as shown above to give an
electrolyte solution with charged ions that conduct electricity.
In glacial acetic acid, there is very little water present and ionization is negliglble. Almost all the
acetic acid remains in the non-conducting molecular form (CH3COOH) and there are no charged
ions present. Thus glacial acetic acid does not conduct electricity.
Solution
(A) The answer is b. increases
Electricity in the form of electrons are transported through the solution by charged ions of the
electrolyte. As the electrolyte concentration increases, so does the number of charge carriers and
hence the amount of charge and electricity conducted increases.
(B) Acetic acid (CH3COOH) is a weak acid and partially ionizes in water:
CH3COOH + H2O => CH3COO- + H3O+
The charged acetate (CH3COO- ) and hydroxonium (H3O+) ions are responsible for electrical
conductivity.
In 6 M acetic acid, water is in excess and and the ionization proceeds as shown above to give an
electrolyte solution with charged ions that conduct electricity.
In glacial acetic acid, there is very little water present and ionization is negliglble. Almost all the
acetic acid remains in the non-conducting molecular form (CH3COOH) and there are no charged
ions present. Thus glacial acetic acid does not conduct electricity..
1.Discuss in detail Emile Durkheim and his contributions to the fiel.pdf
#include
#include
#include
int check(char*);
int k=0;
char a[100];
void shift(int,int);
int main()
{
int i,j=0,l=0,m,p,z;
do
{
if(j)
cout<<\"Enter the string\";
fgets(a,100,stdin);
j=check(a);
} while(j);
for(i=0;i0 && m!=2;j--)
{
m=2;
if(a[j]==\'+\'||a[j]==\'-\'||a[j]==\'*\'||a[j]==\'/\')
l++;
}
if(m==2)
{
for(m=j-2,p=1,z=1;z!=2&&m>0;m--)
{
if(p==1)
if(a[m]==\'(\')
p=2;
if(p==2)
{
if(a[m]==\'(\'&&(a[m-1]==\'+\' ||a[m-1]==\'-\' ||a[m-1]==\'*\'||a[m-1]==\'/\'))
{
m--;
z=2;
}
}
}
j=m;
}
if(j<0)
j=0;
else
j=j+2;
shift(l,j);
a[j]=\'(\';
k--;
i++;
}
}
if(k)
cout<<\"Your putput is\"<<\"\ \";
cout<=0;i--)
{
if(a[i]==\')\')
k++;
if(a[i]==\'(\')
return 1;
}
Output:
Enter the string 1+2)*3-4)5-6)))
Your output is
((1+2)*((3-4)*(5-6))
Solution
#include
#include
#include
int check(char*);
int k=0;
char a[100];
void shift(int,int);
int main()
{
int i,j=0,l=0,m,p,z;
do
{
if(j)
cout<<\"Enter the string\";
fgets(a,100,stdin);
j=check(a);
} while(j);
for(i=0;i0 && m!=2;j--)
{
m=2;
if(a[j]==\'+\'||a[j]==\'-\'||a[j]==\'*\'||a[j]==\'/\')
l++;
}
if(m==2)
{
for(m=j-2,p=1,z=1;z!=2&&m>0;m--)
{
if(p==1)
if(a[m]==\'(\')
p=2;
if(p==2)
{
if(a[m]==\'(\'&&(a[m-1]==\'+\' ||a[m-1]==\'-\' ||a[m-1]==\'*\'||a[m-1]==\'/\'))
{
m--;
z=2;
}
}
}
j=m;
}
if(j<0)
j=0;
else
j=j+2;
shift(l,j);
a[j]=\'(\';
k--;
i++;
}
}
if(k)
cout<<\"Your putput is\"<<\"\ \";
cout<=0;i--)
{
if(a[i]==\')\')
k++;
if(a[i]==\'(\')
return 1;
}
Output:
Enter the string 1+2)*3-4)5-6)))
Your output is
((1+2)*((3-4)*(5-6)).
1) YELLOW FEVERGroup Group IV ((+) ssRNA)Order Unassigned.pdf
#include
#include
#define TRUE 1
/* Put your lab 4 functions prototypes here, as well as the prototype for lab 5 */
double mag(double ax, double ay, double az);
int close_to (double tolerance, double point, double value);
int clearAll (int *a, int *b, int *c, int *d, int *e, int *f);
int main(void) {
int t, b1, b2, b3, b4, b5, s;
double ax, ay, az;
double tolerance = 0.25, point = 1.0, value;
int a,b,c,d,e,f;
while (TRUE && b2 != 1 && ( mag ( ax, ay, az)-1<(tolerance*3))) {
scanf(\"%d, %lf, %lf, %lf, %d, %d, %d, %d, %d, %d\", &t, &ax, &ay, &az, &b1, &b2, &b3,
&b4, &b5, &s );
if(close_to(tolerance, point, ax)==1 && a != 1){
printf(\"RIGHT\ \ \");
clearAll ( &a, &b, &c, &d, &e, &f);
a = 1;
fflush(stdout);
}
if(close_to(tolerance, point, ay)==1 && b != 1){
printf(\"FRONT\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
b = 1;
}
if(close_to(tolerance, point, az)==1 && c != 1){
printf(\"TOP\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
c = 1;
}
if(close_to(tolerance, point, ax)==2 && d != 1){
printf(\"LEFT\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
d = 1;
}
if(close_to(tolerance, point, ay)==2 && e != 1){
printf(\"BACK\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
e = 1;
}
if(close_to(tolerance, point, az)==2 && f != 1){
printf(\"BOTTOM\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
f = 1;
}
return 0;
}
}
/* Put your lab 4 functions here, as well as your new function close_to */
double mag(double ax, double ay, double az){
double y = sqrt(ax*ax + ay*ay + az*az);
return y;
}
int close_to (double tolerance, double point, double value){
if (value>0){
if (sqrt((value-point)*(value-point))<(tolerance)){
return 1;
}
else{
return 0;
}
}
else{
if(sqrt((value+point)*(value+point))<(tolerance)) //? it used to not have sqrt
return 2;
}
}
int clearAll (int *a, int *b, int *c, int *d, int *e, int *f){
*a = *b = *c = *d = *e = *f = 0;
}
Solution
#include
#include
#define TRUE 1
/* Put your lab 4 functions prototypes here, as well as the prototype for lab 5 */
double mag(double ax, double ay, double az);
int close_to (double tolerance, double point, double value);
int clearAll (int *a, int *b, int *c, int *d, int *e, int *f);
int main(void) {
int t, b1, b2, b3, b4, b5, s;
double ax, ay, az;
double tolerance = 0.25, point = 1.0, value;
int a,b,c,d,e,f;
while (TRUE && b2 != 1 && ( mag ( ax, ay, az)-1<(tolerance*3))) {
scanf(\"%d, %lf, %lf, %lf, %d, %d, %d, %d, %d, %d\", &t, &ax, &ay, &az, &b1, &b2, &b3,
&b4, &b5, &s );
if(close_to(tolerance, point, ax)==1 && a != 1){
printf(\"RIGHT\ \ \");
clearAll ( &a, &b, &c, &d, &e, &f);
a = 1;
fflush(stdout);
}
if(close_to(tolerance, point, ay)==1 && b != 1){
printf(\"FRONT\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
b = 1;
}
if(close_to(tolerance, point, az)==1 && c != 1){
printf(\"TOP\ \ \");
fflush(stdout);
clearAll ( &a, &b, &c, &d, &e, &f);
c = 1;
}
if(close_to(tolerance, point, ax)==2 && d != 1){
printf(\"LEFT\ \ \");
fflush(stdout);
cl.
Thermodynamic entropy is a non-conserved state fu.pdf
Thermodynamic entropy is a non-conserved state function that is of great
importance in the sciences of physics and chemistry. Historically, the concept of entropy evolved
in order to explain why some processes (permitted by conservation laws) occur spontaneously
while their time reversals (also permitted by conservation laws) do not; systems tend to progress
in the direction of increasing entropy. For isolated systems, entropy never decreases. This fact
has several important consequences in science: first, it prohibits \"perpetual motion\" machines;
and second, it implies the arrow of entropy has the same directionality as the arrow of time.
Increases in entropy correspond to irreversible changes in a system, because some energy is
expended as waste heat, limiting the amount of work a system can do. In statistical mechanics,
entropy is a measure of the number of ways in which a system may be arranged, often taken to
be a measure of \"disorder\" (the higher the entropy, the higher the disorder). This definition
describes the entropy as being proportional to the natural logarithm of the number of possible
microscopic configurations of the individual atoms and molecules of the system (microstates)
which could give rise to the observed macroscopic state (macrostate) of the system. The constant
of proportionality is the Boltzmann constant. - Wiki
Solution
Thermodynamic entropy is a non-conserved state function that is of great
importance in the sciences of physics and chemistry. Historically, the concept of entropy evolved
in order to explain why some processes (permitted by conservation laws) occur spontaneously
while their time reversals (also permitted by conservation laws) do not; systems tend to progress
in the direction of increasing entropy. For isolated systems, entropy never decreases. This fact
has several important consequences in science: first, it prohibits \"perpetual motion\" machines;
and second, it implies the arrow of entropy has the same directionality as the arrow of time.
Increases in entropy correspond to irreversible changes in a system, because some energy is
expended as waste heat, limiting the amount of work a system can do. In statistical mechanics,
entropy is a measure of the number of ways in which a system may be arranged, often taken to
be a measure of \"disorder\" (the higher the entropy, the higher the disorder). This definition
describes the entropy as being proportional to the natural logarithm of the number of possible
microscopic configurations of the individual atoms and molecules of the system (microstates)
which could give rise to the observed macroscopic state (macrostate) of the system. The constant
of proportionality is the Boltzmann constant. - Wiki.
I is oxidized by 6 electrons as the oxidation sta.pdf
I is oxidized by 6 electrons as the oxidation state of I in I- is -1 while in IO3- is +5.
Solution
I is oxidized by 6 electrons as the oxidation state of I in I- is -1 while in IO3- is +5..
The main difference is that Democritus was not a .pdf
The main difference is that Democritus was not a scientist he was a philosopher as
such he only theorized that matter could not be indefinitely divided, that there is a limit (now
know to be the atom). Dalton on the other had based his theory of atoms on scientific
experimentation and observation. Demeocritus used reason vs. Dalton used scientific method
Solution
The main difference is that Democritus was not a scientist he was a philosopher as
such he only theorized that matter could not be indefinitely divided, that there is a limit (now
know to be the atom). Dalton on the other had based his theory of atoms on scientific
experimentation and observation. Demeocritus used reason vs. Dalton used scientific method.
for acidic nature is should give H+ equation H.pdf
for acidic nature is should give H+ equation : HSO3- -----> H+ + SO3^2-
ANSWER
Solution
for acidic nature is should give H+ equation : HSO3- -----> H+ + SO3^2-
ANSWER.
More from aptex1 (20)
Name- Gold leaved white PoplarGenus- Populusspecies- albaAutho.pdf
Name- Gold leaved white PoplarGenus- Populusspecies- albaAutho.pdf
molarity = 0.252101.1 =0.001236 M percent =0.251002 =12.5 .pdf
molarity = 0.252101.1 =0.001236 M percent =0.251002 =12.5 .pdf
Initial concentration of Br- = 2.25 x 10e-3M1V1=M2V2therefore M2.pdf
Initial concentration of Br- = 2.25 x 10e-3M1V1=M2V2therefore M2.pdf
import java.util.Scanner;public class HornersPolynomial { .pdf
import java.util.Scanner;public class HornersPolynomial { .pdf
Direct memory access (DMA) is a function that allows an inputoutput.pdf
Direct memory access (DMA) is a function that allows an inputoutput.pdf
Ethanol is miscible in water because of the hydroxyl functional grou.pdf
Ethanol is miscible in water because of the hydroxyl functional grou.pdf
the diluted concentration of HCl = (0.120 M x 25..pdf
the diluted concentration of HCl = (0.120 M x 25..pdf
AnswerThe net equation of the reaction catalyzed by the protein c.pdf
AnswerThe net equation of the reaction catalyzed by the protein c.pdf
Answer i command.The vi editor always starts in command mode. For.pdf
Answer i command.The vi editor always starts in command mode. For.pdf
Answer (b) systems security and control.The businesses are now a .pdf
Answer (b) systems security and control.The businesses are now a .pdf
A. Temeperature of refrigeratorsIntervalB. Horspower of .pdf
A. Temeperature of refrigeratorsIntervalB. Horspower of .pdf
48. The answer is Botulism. Botulism ia an illness that brings about.pdf
48. The answer is Botulism. Botulism ia an illness that brings about.pdf
2) b) Understory is rich in humidity hence supports fungi3) a) can.pdf
2) b) Understory is rich in humidity hence supports fungi3) a) can.pdf
1.Discuss in detail Emile Durkheim and his contributions to the fiel.pdf
1.Discuss in detail Emile Durkheim and his contributions to the fiel.pdf
1) YELLOW FEVERGroup Group IV ((+) ssRNA)Order Unassigned.pdf
1) YELLOW FEVERGroup Group IV ((+) ssRNA)Order Unassigned.pdf
Thermodynamic entropy is a non-conserved state fu.pdf
Thermodynamic entropy is a non-conserved state fu.pdf
I is oxidized by 6 electrons as the oxidation sta.pdf
I is oxidized by 6 electrons as the oxidation sta.pdf
The main difference is that Democritus was not a .pdf
The main difference is that Democritus was not a .pdf
for acidic nature is should give H+ equation H.pdf
for acidic nature is should give H+ equation H.pdf
Recently uploaded
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowyHow to Make a Field invisible in Odoo 17
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
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.
How to Break the cycle of negative Thoughts
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”.
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.
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/
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Introduction to Quality Improvement Essentials
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.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Template Jadual Bertugas Kelas (Boleh Edit)
Jadual Bertugas kelas dalam bentuk softcopy PowerPoint. Cikgu boleh download >> edit >> print >> laminate. Semoga bermanfaat.
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 geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
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.
Recently uploaded (20)
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
MinOfFourNumbers.javaimport java.util.Scanner;public class MinOf.pdf
- 1. MinOfFourNumbers.java import java.util.Scanner; public class MinOfFourNumbers { public static void main(String[] args) { //Creating an Integer array of size 4 int numbers[]=new int[4]; //declaring the variables int min; //Scanner object is used to get the values entered by the user. Scanner sc=new Scanner(System.in); /* This for loop will get the values from the user * and populate into the array */ for(int i=0;i<4;i++) { //Getting the number from the user. System.out.print("Enter Number "+(i+1)+" :"); numbers[i]=sc.nextInt(); } //Store the first element of the array in min variable min=numbers[0]; //This loop will calculate the minimum of 4 numbers for(int i=0;i<4;i++) { /*Check each element of the array with the value value contained in the min variable. * If the element of the array is less than min,then assign that element to min variable */ if(numbers[i] Solution
- 2. MinOfFourNumbers.java import java.util.Scanner; public class MinOfFourNumbers { public static void main(String[] args) { //Creating an Integer array of size 4 int numbers[]=new int[4]; //declaring the variables int min; //Scanner object is used to get the values entered by the user. Scanner sc=new Scanner(System.in); /* This for loop will get the values from the user * and populate into the array */ for(int i=0;i<4;i++) { //Getting the number from the user. System.out.print("Enter Number "+(i+1)+" :"); numbers[i]=sc.nextInt(); } //Store the first element of the array in min variable min=numbers[0]; //This loop will calculate the minimum of 4 numbers for(int i=0;i<4;i++) { /*Check each element of the array with the value value contained in the min variable. * If the element of the array is less than min,then assign that element to min variable */ if(numbers[i]