Which type of computer are todays most widely used personal computers?

Can i get any information on this website i'd like to know what its for ?

zloy xaker [14]

Explanation: torsearch.org is a safe search engine mainly used for dark wed purposes. It does not track your location nor give any personal information.

8 0

2 years ago

Suppose you have two arrays of ints, arr1 and arr2, each containing ints that are sorted in ascending order. Write a static meth

telo118 [61]

Since both arrays are already sorted, that means that the first int of one of the arrays will be smaller than all the ints that come after it in the same array. We also know that if the first int of arr1 is smaller than the first int of arr2, then by the same logic, the first int of arr1 is smaller than all the ints in arr2 since arr2 is also sorted.

public static int[] merge(int[] arr1, int[] arr2) {
int i = 0; //current index of arr1
int j = 0; //current index of arr2
int[] result = new int[arr1.length+arr2.length]
while(i < arr1.length && j < arr2.length) {
result[i+j] = Math.min(arr1[i], arr2[j]);
if(arr1[i] < arr2[j]) {
i++;
} else {
j++;
}
}
boolean isArr1 = i+1 < arr1.length;
for(int index = isArr1 ? i : j; index < isArr1 ? arr1.length : arr2.length; index++) {
result[i+j+index] = isArr1 ? arr1[index] : arr2[index]
}
return result;
}

So this implementation is kind of confusing, but it's the first way I thought to do it so I ran with it. There is probably an easier way, but that's the beauty of programming.

A quick explanation:

We first loop through the arrays comparing the first elements of each array, adding whichever is the smallest to the result array. Each time we do so, we increment the index value (i or j) for the array that had the smaller number. Now the next time we are comparing the NEXT element in that array to the PREVIOUS element of the other array. We do this until we reach the end of either arr1 or arr2 so that we don't get an out of bounds exception.

The second step in our method is to tack on the remaining integers to the resulting array. We need to do this because when we reach the end of one array, there will still be at least one more integer in the other array. The boolean isArr1 is telling us whether arr1 is the array with leftovers. If so, we loop through the remaining indices of arr1 and add them to the result. Otherwise, we do the same for arr2. All of this is done using ternary operations to determine which array to use, but if we wanted to we could split the code into two for loops using an if statement.

4 0

3 years ago

A diagram of a flow chart to find the average of 10 numbers

Nat2105 [25]

Answer:

Kindly check attached picture

Explanation:

Flowchart gives a graphical representation of a steps taken towers the execution of a program.

In the flowchart attached, A variable was initialized and set to 0 ; then a for loop was used to iterate integers 1 up to 10, for each number. It is added to the initialized variable sum until all the 10 integer numbers are added. The the average is obtained by dividing by 10.

4 0

2 years ago

Tuple in Python code help pleaseee!!! And of course I'll make you as Branlist

GuDViN [60]

Question 9:

The correct answer would be either (b) or (d).

Question 10:

The correct answer would be (b).

Hope it helps. :)

7 0

2 years ago

In Java: Write a class called Shelf that contains instance data that repre-sents the length, breadth, and capacity of the shelf.

disa [49]

Answer:see explanation

Explanation:

Hello, the solution is the following:

in a file named Shelf.java :

public class Shelf{

int length;

int breadth;

int capacity;

boolean occupied;

Shelf(int length,int breadth, int capacity){

this.length = length;

this.breadth = breadth;

this.capacity = capacity;

this.occupied = false;

}

//set methods

public void setLength(int length){

this.length = length;

}

public void setBreadth(int breadth){

this.breadth = breadth;

}

public void setCapacity(int capacity){

this.capacity = capacity;

}

public void setOccupied(boolean occupied){

this.occupied = occupied;

}

//get methods

public int getLength(){

return this.length;

}

public int getBreadth(){

return this.breadth;

}

public int getCapacity(){

return this.capacity;

}

public boolean getOccupied(){

return this.occupied;

}

//tostring method

public String toString(){//overriding the toString() method

return "Shelf: \n"+" length: "+Integer.toString(this.length)+" breadth: "+Integer.toString(this.breadth)+" capacity: "+Integer.toString(this.capacity)+" occupied: "+Boolean.toString(this.occupied);

}

in another file named ShelfCheck.java

public class ShelfCheck {

public static void main(String[] args) {

Shelf s1=new Shelf(100,150,300);

Shelf s2=new Shelf(200,200,234);

Shelf s3=new Shelf(300,222,543);

Shelf s4=new Shelf(400,434,654);

System.out.println(s1);

System.out.println(s2);

System.out.println(s3);

System.out.println(s4);

s4.setLength(5);

System.out.println(s4);

s2.setBreadth(2);

System.out.println(s2);

s3.setCapacity(1);

System.out.println(s3);

s1.setOccupied(true);

System.out.println(s1);

}

OUTPUT:

Shelf:

length: 100 breadth: 150 capacity: 300 occupied: false

Shelf:

length: 200 breadth: 200 capacity: 234 occupied: false

Shelf:

length: 300 breadth: 222 capacity: 543 occupied: false

Shelf:

length: 400 breadth: 434 capacity: 654 occupied: false

Shelf:

length: 5 breadth: 434 capacity: 654 occupied: false

Shelf:

length: 200 breadth: 2 capacity: 234 occupied: false

Shelf:

length: 300 breadth: 222 capacity: 1 occupied: false

Shelf:

length: 100 breadth: 150 capacity: 300 occupied: true

5 0

2 years ago