Answer:
E-mailweb browsingpeer-to peer servicesDerive the three-dimensional transformation matrix for scaling an object by a scaling factor s in a direction defined by the direction cosines alpha , beta , gamma
Answer:
i dont know
Explanation:
i dont knoe im doing this for the points hehe
Write the following generic method that sorts an ArrayList of Comparable items. The sort method must use the compareTo method.
public static > void sort(ArrayList list)
Write a test program that:
1. prompts the user to enter 10 integers, invokes this method to sort the numbers, and displays the numbers in ascending order
2. prompts the user to enter 5 strings, invokes this method to sort the strings, and displays the strings in ascending (alphabetical) order
Answer:
Explanation:
The following code is written in Java, it prompts the user to enter 10 integers and saves them to an ArrayList. Then it prompts for 5 strings and saves them to another ArrayList. Then, it calls the sort method and adds the lists as parameters. Finally, it prints out both lists completely sorted in ascending order.
import java.util.ArrayList;
import java.util.Scanner;
class Division{
public static double division(double a, double b) throws Exception {
if(b == 0)
//throw new Exception("Invalid number.");
return (a / b);
return a / b;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
ArrayList<Integer> mylist2 = new ArrayList<>();
for (int x = 0; x < 10; x++) {
System.out.println("Please Enter a Number: ");
int number = in.nextInt();
mylist2.add(number);
}
ArrayList<String> mylist = new ArrayList<>();
for (int x = 0; x < 5; x++) {
System.out.println("Please Enter a Word: ");
String word = in.nextLine();
mylist.add(word);
}
sort(mylist);
sort(mylist2);
for (String x: mylist) {
System.out.print(x + ", ");
}
System.out.println("");
for (int x: mylist2) {
System.out.print(x + ", ");
}
}
public static <E extends Comparable<E>> ArrayList<E> sort(ArrayList<E> list) {
E temp;
if (list.size()>1) // check if the number of orders is larger than 1
{
for (int x=0; x<list.size(); x++) // bubble sort outer loop
{
for (int i=0; i < list.size() - x - 1; i++) {
if (list.get(i).compareTo(list.get(i+1)) > 0)
{
temp = list.get(i);
list.set(i,list.get(i+1) );
list.set(i+1, temp);
}
}
}
}
return list;
}}
Write a recursive method called permut that accepts two integers n and r as parameters and returns the number of unique permutations of r items from a group of n items. For given values of n and r, this value P(n, r) can be computed as follows:
n!/(n - r)!
For example , permut (7, 4) should return 840.
Answer:
Following are the code to the given question:
public class Main//defining a class Main
{
static int permut(int n, int r)//defining a method permut that holds two variable
{
return fact(n)/fact(n-r);//use return keyword to return calcuate value
}
static int fact(int n)//defining a fact method as recursive to calculate factorials
{
return n==0?1:n*fact(n-1);//calling the method recursively
}
public static void main(String[] abs)//main function
{
//int n=7,r=4;//defining integer variable
System.out.println(permut(7,4));//use print method to call permut method and print its values
}
}
Output:
840
Explanation:
Following is the explanation for the above code.
Defining a class Main.Inside the class two methods, "permut and fact" were defined, in which the "permut" accepts two values for calculating its permutated value, and the fact is used for calculates factorial values recursively. At the last, the main method is declared, which uses the print method to call "permut" and prints its return values.What is a font?
O How the text for a paragraph appears
O A display of text characters in a specific style and size
O Text that has been made bold
O Artistic elements you can add to text
Suppose you are choosing between the following three algorithms:
• Algorithm A solves problems by dividing them into five subproblems of half the size, recursively solving each subproblem, and then combining the solutions in linear time.
• Algorithm B solves problems of size n by recursively solving two subproblems of size n − 1 and then combining the solutions in constant time.
• Algorithm C solves problems of size n by dividing them into nine sub-problems of size n=3, recursively solving each sub-problem, and then combining the solutions in O(n2) time.
What are the running times of each of these algorithms (in big-O notation), and which would you choose?
Answer:
Algorithm C is chosen
Explanation:
For Algorithm A
T(n) = 5 * T ( n/2 ) + 0(n)
where : a = 5 , b = 2 , ∝ = 1
attached below is the remaining part of the solution
Explain the paging concept and main disadvantages of pipelined
approaches? Compare the superscalar and super pipelined approaches
with block diagram?
Answer:
PAGINACIÓN En la gestión de memoria con intercambio, cuando ... Debido a que es posible separar los módulos, se hace más fácil la modificación de los mismos. ... Ventajas y Desventajas de la segmentación paginada
Explanation:
Time-management techniques work most effectively when performed in which order?
prioritize tasks, reward system, study-time survey, project schedule
project schedule, study-time survey, reward system, prioritize tasks
reward system, prioritize tasks, project schedule, study-time survey
study-time survey, project schedule, prioritize tasks, reward system
Answer:
study-time survey, project schedule, prioritize tasks, reward system.
Explanation:
Time management can be defined as a strategic process which typically involves organizing, planning and controlling the time spent on an activity, so as to effectively and efficiently enhance productivity. Thus, when time is properly managed, it avails us the opportunity to work smartly rather than tediously (hardly) and as such making it possible to achieve quite a lot within a short timeframe. Also, a good time management helps us to deal with work-related pressures and tight schedules through the process of properly allocating the right time to the right activity.
Hence, time-management techniques work most effectively when performed in the following sequential order; study-time survey, project schedule, prioritize tasks, and designing (creating) a reward system.
Answer:
The Answer is:
D. study-time survey, project schedule, prioritize tasks, reward system
Explanation:
got it right on edge