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
shepuryov [24]
2 years ago
12

Help me please, I'm attempting a test​

Computers and Technology
2 answers:
dusya [7]2 years ago
8 0
It’s A it’s a keyboard
tigry1 [53]2 years ago
6 0

Answer:

keyboard is an example of input device.

You might be interested in
Suppose you are currently in the /home/hnewman/os/fall/2013 directory and would like to navigate to /home/hnewman/discreteStruct
Alex Ar [27]

Answer:

C

Explanation:

ive been doing this same one so its C

6 0
3 years ago
We are building a word processor and we would like to implement a "reflow" functionality that full-justifies text.Given a maximu
adoni [48]

Answer:

The code is given below in Java with appropriate comments

Explanation:

Reflow is an function which helps you to justify your functionality

You need to input a string array and the max width and you will get the

output in a list(string).

public List<String> Reflow(String[] input, int width) {

   List<String> result = new ArrayList<String>();

 

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

       return result;

   }

 

 

   int count=0;

   int last=0;

   ArrayList<String> list = new ArrayList<String>();

   for(int i=0; i<input.length; i++){

       count = count + input[i].length();

 

       if(count+i-last>width){

           int wl = count-input[i].length();

           int sl = maxWidth-wl;

           int each = 1;

           int el = 0;

 

           if(i-last-1>0){

               each = sl/(i-last-1);

               el = sl%(i-last-1);

           }

 

           StringBuilder sb = new StringBuilder();

 

           for(int k=last; k<i-1; k++){

               sb.append(input[k]);

 

               int ce = 0;

               while(ce<each){

                   sb.append(" ");

                   ce++;

               }

 

               if(el>0){

                   sb.append(" ");

                   el--;

               }

           }

 

           sb.append(input[i-1]);//last input in the line

           //if only one word in this line, need to fill left with space

           while(sb.length()<width){

               sb.append(" ");

           }

 

           result.add(sb.toString());

 

           last = i;

           count=input[i].length();

       }

   }

 

   int lastLen = 0;

   StringBuilder sb = new StringBuilder();

 

   for(int i=last; i<input.length-1; i++){

       count = count+input[i].length();

       sb.append(input[i]+" ");

   }

 

   sb.append(input[input.length-1]);

   int d=0;

   while(sb.length()<maxWidth){

       sb.append(" ");

   }

   result.add(sb.toString());

 

   return result;

}

6 0
3 years ago
To make a profit the price of the items sold in the furniture store are marked up by 80 %after marking up the prices each item i
Verdich [7]

Answer:

The algorithm is as follows:

1. Start

2. Display "Input Item Price: "

3. Input Price

4. Markup = Price + 80% * Price

5. Selling_Price = 10% * Markup

6. Display "The Selling Price is "+Selling_Price

7. Stop

Explanation:

This signals the beginning of the algorithm

1. Start

This is a prompt that asks for the price of the item

2. Display "Input Item Price: "

This gets the price of the item

3. Input Price

This calculates the Markup (80% of the inputted price)

4. Markup = Price + 80% * Price

This calculates the selling price (10% of the markup)

5. Selling_Price = 10% * Markup

This prints the selling price

6. Display "The Selling Price is "+Selling_Price

This signals the end of the algorithm

7. Stop

7 0
2 years ago
Which of the following shows a list of Big-Oh running times in order from slowest to fastest?
Rufina [12.5K]

Answer:

O(N!), O(2N), O(N2), O(N), O(logN)

Explanation:

N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.

2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.

Rest of them should be easier.

N² is slower than N and N is slower than logN as you can check in a graphing calculator.

NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.

5 0
2 years ago
Read 2 more answers
What is the purpose of using specialized supply chain software?
weeeeeb [17]

Answer:

The purpose of supply chain management is

On the most basic level, the purpose of supply chain management is to make inventory readily available in customer facing positions to fulfill demand. ... Supply chain partners must work together to maximize resource productivity, develop standardized processes, eliminate duplicate efforts, and minimize inventory levels

Explanation:

4 0
2 years ago
Other questions:
  • The program prompts the user to interactively enter eight batting averages, which the program stores in an array. The program sh
    9·1 answer
  • The FaceSnap app has permission to use many devices on your smartphone, including the camera. A data privacy concern that arises
    6·1 answer
  • Which of the following attributes of a website indicates a more reliable source for information?
    8·1 answer
  • What are some pros for having your phone during school hours?
    10·2 answers
  • Candice’s first job was at the grocery store making deli food. While in culinary school, she worked part time in a restaurant ki
    12·2 answers
  • Write a program that asks the user to enter a student's name and 8 numeric tests scores (out of 100 for each test). The name wil
    13·1 answer
  • What technique involves graphical methods and nontechnical language that represent the system at various stages of development a
    14·1 answer
  • What is 4x+2x(-3-3) thanku
    11·2 answers
  • 4.11 lesson practice quizz need help on 2 and 3
    5·1 answer
  • What is algorithm and how does it works​
    11·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!