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
uysha [10]
3 years ago
6

*

Computers and Technology
1 answer:
asambeis [7]3 years ago
6 0

Answer:

I think they're all valid but the validility depends on the website your using the usernames on.

Explanation:

You might be interested in
What is and effective way to display calculation in a word document?
Tju [1.3M]
You only put a numerical expression in  numbers if it is over 100, it the calculation correctly.
<span />
8 0
4 years ago
Excel solver is the only method that one can utilize for automated linear programming solutions. True or False
klasskru [66]

Answer:

False

Explanation:

This is not true at all. This can be done with a wide variety of resources in the modern world. There is the CPLEX (IBM ILOG CPLEX Optimization Studio) software, which was developed by Robert E. Bixby in 1988, it passed to several other companies and it was later sold to IBM in January 2009. Today it's one of the world's most effective programs when it comes to automated linear programming solutions.

3 0
3 years ago
. Find the supplements of : 150' and 70°​
suter [353]
30 is the supplement of 150
7 0
3 years ago
Which of the following was the most significant impact the phonograph had on the recording arts industry?
liraira [26]

Answer:

The phonograph led to mass distribution of recordings.

Explanation:

I just took this assignment. :)

4 0
3 years ago
Read 2 more answers
Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and
levacccp [35]

Answer:

B. R is NP Hard

Explanation:

Given:

S is an NP complete problem

Q is not known to be in NP

R is not known to be in NP

Q is polynomial times reducible to S

S is polynomial times reducible to R  

Solution:

NP complete problem has to be in both NP and NP-hard. A problem is NP hard if all problems in NP are polynomial time reducible to it.

Option B is correct because as given in the question S is an NP complete problem and S is polynomial times reducible to R.

Option A is not correct because R is not known to be in NP

Option C is not correct because Q is also not known to be in NP

Option D is not correct because Q because no NP-complete problem is polynomial time reducible to Q.

5 0
3 years ago
Other questions:
  • Describe the use of technology in the promotional function
    5·2 answers
  • Data mining is defined as: a)Separating data and programs such that each can be changed without changing the other b)Allowing ma
    5·1 answer
  • Which of the following is a typical concern for developers while using prototypes?
    6·2 answers
  • Does the Main Content (MC) of a web page include searchboxes?
    10·1 answer
  • Write a while loop that prints
    13·1 answer
  • The calcCircleCircumf() method invoked within in the CircleStatsTester class is overloaded. Write the overloaded methods in the
    8·1 answer
  • It means fruit- trees garden.
    8·1 answer
  • WHAT DO U MEANS BY DIGITAL PROFILE​
    15·1 answer
  • Analyze the sentence below . choose your answer on the box below write your answer in your quiz notebook
    5·1 answer
  • An operating system with _____ capabilities allows a user to run more than one program concurrently.
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!