1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
EleoNora [17]
4 years ago
7

The point at coordinates (2, -18) is in what direction from the origin?

Computers and Technology
1 answer:
laila [671]4 years ago
4 0
On a graph, move 2 spaces to the right and from there move 18 spaces down. Now, where you've ended, make a dot. The distance fro the origin is -2/18 (as a fraction).
You might be interested in
Fill in the code in the underlined location to display the mouse point location when the mouse is pressed in the pane. pane.setO
Svet_ta [14]

Answer:

The correct option is  pane.setOnMouseClicked((e) -> System.out.println(e.getX() + ", " + e.getY()));

Explanation:

As the complete question is not provided, the complete question is attached herewith.

In order to handle the underlined location the way is to get the position using the MouseClicked event which will be activated when the mouse is clicked and then the values of X and Y position will be printed.

pane.setOnMouseClicked((e) -> System.out.println(e.getX() + ", " + e.getY()));

The other options are not correct as the handle used in them is not defined for this purpose.

6 0
4 years ago
I need some help with ideas
Troyanec [42]

Answer:

Maybe make a loud noise when there is an unacceptable speed

Explanation:

If you speed above the limit you will get a ticket to if it makes a loud noise you can be annoying and speed at the acceptable speed

5 0
3 years ago
How does the Lossy file format reduce the file size?
beks73 [17]

The answer is c. I just took it on apex n that’s what I got lol

3 0
4 years ago
Read 2 more answers
Write the following functions. Each function needs function comments that describes function and its parameters double sphereVol
luda_lava [24]

Answer:

Output

height: 10

radius: 2

Cylinder volume: 125.6

Cone Surface: 76.6037

Cone Volume: 41.8667

Sphere volume: 33.4933

Sphere surface: 50.24

Cylinder volume: 125.6

Explanation:

//Declaring variables

#include <iostream>

#include <cmath>

using namespace std;

//Defining Pi value

const double PI=3.14;

//Decliring the functions

//volume function for cone

double volumeCone(double r,double h){

       return  PI * r * r  * (h/3);

}

//volume function for sphere surface

double surfaceSphere(double r){

       return 4 * PI  * r * r;

}

//volume function for cylinderVol

double cylinderVol(double r,double h){

       return  PI * r * r * h;

}

//volume function for sphere volume

double sphereVol(double r){

       return 4/3.0 * PI * r * r * r;

}

//volume function for cone surface

double surfaceCone(double r,double h){

       return  PI * r * (r+sqrt(h *h + r  * r));

}

int main(){

       double r,h;

//print the values of height and radius

       cout<<"height: ";

       cin>>h;

       cout<<"radius: ";

       cin>>r;

//print the values of geometric forms

       cout<<"Cylinder volume: "<<cylinderVol(r,h)<<endl;

       cout<<"Cone Surface: "<<surfaceCone(r,h)<<endl;

       cout<<"Cone Volume: "<<volumeCone(r,h)<<endl;

       cout<<"Sphere volume: "<<sphereVol(r)<<endl;

       cout<<"Sphere surface: "<<surfaceSphere(r)<<endl;

       cout<<"Cylinder volume: "<<cylinderVol(r,h)<<endl;

       

       

}

4 0
3 years ago
Whats an effective way to sort linked lists in cpp.
irina [24]

Answer:

Using Merge Sort.

Explanation:

Merge Sort is preferred for sorting the linked list because the the data stored in linked list is not in serial memory address which makes the quick sort algorithm very slow and other sorting algorithms impossible.

Merge Sort is a divide and conquer algorithm.

In this algorithms we divide the linked list into sub parts and sort the sub parts of the linked list and then we merge them in sorted order. It is a very effective approach for linked list sorting.

The time complexity of merge sort is O(NLogN).

6 0
3 years ago
Other questions:
  • The ____ statement is used to execute specific programming code if the evaluation of a conditional expression returns a value of
    10·1 answer
  • What instruments are used the measure voltage, current, and resistance
    7·1 answer
  • To help determine which technology to use, Raul creates a table to help him compare the pros and cons of his choices. What part
    15·1 answer
  • What company or individual is responsible for developing the linux operating system?
    7·1 answer
  • The printing press helped spread the ideas of the Renaissance.<br> a. True <br> b. False
    14·1 answer
  • Are NOT likely to stop suddenly.
    14·1 answer
  • What is the 5 basic steps of computer programing?
    6·1 answer
  • You are about to install a new USB camera on your Linux system and you realize that there is no device special file available fo
    13·1 answer
  • When can design templates be applied to the presentation?
    5·1 answer
  • A malware which acts like a spy in computer system is called ___?​
    15·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!