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
rodikova [14]
3 years ago
9

Multiple choice

Computers and Technology
2 answers:
Bezzdna [24]3 years ago
7 0
The answer is D. The colors that we see are all being reflected.
siniylev [52]3 years ago
3 0
The red ball (sphere) reflects red colors and absorbs all other colors
You might be interested in
In the u.s.all financial institutions are required to conduct business at a physical location only
Ad libitum [116K]

Answer:

The answer is false.

Explanation:

5 0
3 years ago
To create a query string, you add a ____ immediately after a url, followed by the query string.
salantis [7]
The answer is question mark (?).  To create a query string, you add a question mark (?) immediately after a url, followed by the query string.
5 0
3 years ago
Describe the system unit​
mestny [16]

Answer:

A system unit is the part of a computer that houses the primary devices that perform operations and produce results for complex calculations

6 0
3 years ago
Read 2 more answers
a) (20 points) Define the method inDogish recursively such that it returns true if the word is in dog-ish and false if it is not
tia_tia [17]

Answer:

/ Main.java

class Main {

     public static void main(String[] args) {

           //System.out.println(inDogish("aplderogad"));

           //System.out.println(inXish("aplderogad", "dog"));

     }

     // returns true if the word is in dog-ish

     // returns false if word is not in dog-ish

     public static boolean inDogish(String word) {

           /**

           * Note: we can use the inXish() method to complete this method in a

           * single line if you want. just write 'return inXish(word,"dog");' and

           * you are done.

           */

           // if word is null or empty, returning false

           if (word == null || word.length() == 0) {

                 return false;

           }

           // converting word to lower case

           word = word.toLowerCase();

           // if 'd' does not exist on the word, returning false

           if (!dogishHelper(word, 'd')) {

                 return false;

           }

           // removing the characters upto first 'd' in word

           word = word.substring(word.indexOf('d') + 1);

           // if 'o' does not exist on the word, returning false

           if (!dogishHelper(word, 'o')) {

                 return false;

           }

           // removing the characters upto first 'o' in word

           word = word.substring(word.indexOf('o') + 1);

           // if 'g' does not exist on the word, returning false, otherwise

           // returning true

           if (!dogishHelper(word, 'g')) {

                 return false;

           } else {

                 return true;

           }

     }

     // necessary to implement inDogish recursively.

     // returns true if letter is in word, else not.

     public static boolean dogishHelper(String word, char letter) {

           // if word is empty, returning -1

           if (word == null || word.length() == 0) {

                 return false;

           }

           // if first character in word is letter, returning 0

           if (word.charAt(0) == letter) {

                 return true;

           }

           return dogishHelper(word.substring(1), letter);

     }

     // the best thing about the above helper method is that we can use it in

     // inXish method also

     // a generalized version of the inDogish method

     public static boolean inXish(String word, String x) {

           // if x is empty, returning true (base case, which means all the letters

           // in x are in word in that order)

           if (x.length() == 0) {

                 return true;

           }

           // getting first character of x

           char first = x.charAt(0);

           // if first character does not exist on the word, returning false

           if (!dogishHelper(word, first)) {

                 return false;

           }

           // calling and returning inXish recursively, passing the word after

           // removing characters upto first occurrance of char first, and x after

           // removing first character from it

           return inXish(word.substring(word.indexOf(first) + 1), x.substring(1));

     }

}

Explanation:

7 0
4 years ago
Social media allows businesses to use which proven marketing principle? Select one: a. Reciprocity b. Social proof c. Authority
riadik2000 [5.3K]

B is the most reasonable one

3 0
3 years ago
Read 2 more answers
Other questions:
  • True or False? A supervisory control and data acquisition (SCADA) device is a computer that controls motors, valves, and other d
    13·1 answer
  • which of the following is not an operating system? A. leopard B. linux C. firefox D. windows
    11·2 answers
  • Tara has found a CTSO she’s interested in joining. How can Tara become a member of the CTSO? Tara can become a member of the CTS
    8·2 answers
  • Attempting to determine a password that is not known to the attacker is often called ____.
    13·1 answer
  • What is a google search query that will search for xml files on the domain example.Com
    8·1 answer
  • Information technology has powerful effects on social behavior. Which of the following issues should NOT be expected when intera
    11·1 answer
  • What is a command-line interactive scripting environment that provides the commands for almost any management task in a Windows
    9·1 answer
  • 17. When an industrial electrical circuit requires a 220 VAC single phase power supply, the electric power supply circuit is nor
    15·1 answer
  • Need answer ASAP!!!!!
    6·1 answer
  • Vocational counselors group career and occupation specialties into <br> career clusters.
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!