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
Korvikt [17]
3 years ago
5

Describe how computer become in the next 35 year

Computers and Technology
1 answer:
marin [14]3 years ago
8 0
Well im going to say that it is going to be more advanced and easier to hack. Not only that but more and more people are going to be using it. You'll see ten year olds and five year olds using computers like they are professionals 
You might be interested in
in order to switch from paper to digital medical records the hospital bought in several individuals to introduce and implement t
VladimirAG [237]

Available options are:

A. Technical champions

B. Engaged filmmakers

C. Business partners

D. Compliance champions

Answer:

Technical champions

Explanation:

Given that a "Technical Champion" is someone whose responsibility is to introduce and perform the role of enabling the use of technology, development of skills across the organization, and strengthen communication between Information Technology and the staff or employees.

Hence, in this case, considering the job descriptions described in the question above, these individuals would best be described as TECHNICAL CHAMPIONS

6 0
3 years ago
The process that uses 3D modeling software to create a representation of a three dimensional object is called 3D modeling.
MissTica
This statement is (True)
5 0
3 years ago
Read 2 more answers
Which statement will call this module and pass 12 as the argument?
WITCHER [35]

Answer:

Call showValue (12)

Explanation:

The function is a block of the statement which performs the special task.

if you define the function, then you have to call that function.

Then, program control moves to the function and start to execute otherwise not execute the function.

the syntax for calling the function:

name(argument_1, argument_2,....);

we can put any number of arguments in the calling.

check the options one by one for finding the answer:

Call showValue( Integer): this is valid calling but it passes the variable, not the 12. this is not correct.

Call showValue( Integer 12): This is not valid calling, because it passes the data type as well which is incorrect.

Call showValue( Real): this is valid calling but it passes the variable, not the 12. this is not correct.

Call showValue (12): this valid calling and also pass the value 12.

Therefore, the correct answer is option b.

6 0
3 years ago
What can you say about the following Java class definition?
IrinaK [193]

Answer:

The class is called MyApp which inherits from JFrame and implements the ActionListener interface.

Explanation:

The class is called MyApp which extends the swing class JFrame and implements the ActionListener interface for event handling. As a results it needs to implement a method called actionPerformed for handling the relevant events that may be raised from the user interface. Since it extends JFrame, it has access to all the public and protected methods defined in JFrame(for example setTitle to set the title of the frame).

3 0
3 years ago
Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t
julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

 if(2n-1==1) return 1;

 return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

f(1)=1

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that f(n-1) returns indeed the sum of the first n-1 odd numbers, and we have to proof that f(n) returns the sum of the first n odd numbers. By the recursive logic, we have

f(n)=f(n-1)+2n-1

and by induction, f(n-1) is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, f(n) is the sum of the first n odd numbers, as required:

f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}

6 0
3 years ago
Other questions:
  • What's the risk or effect of software piracy?
    12·2 answers
  • Explain what might happen if two stations are accidentally assigned the same hardware address?
    15·1 answer
  • Carson's supervisor has asked him to review a variety of portable computers for possible purchase for their company's employees.
    13·1 answer
  • Which keys should you press to insert a comment? Ctrl+Alt+I Ctrl+Alt+C Ctrl+Alt+O Ctrl+Alt+N Ctrl+Alt+M
    15·1 answer
  • Henry is designing a document for his architecture project. In which order should Henry preform the different tasks that are req
    7·1 answer
  • Websites can have good content for a particular set of search phrases, yet rank poorly. Issues that may cause this to occur incl
    9·1 answer
  • When an instruction is sent to the CPU in a binary pattern, how does the CPU know what instruction the pattern means
    7·1 answer
  • How do professionals address their problems?
    14·2 answers
  • 2. "The only requirement for a person to use a computer is that you should be able to read and
    7·1 answer
  • A photographer stores digital photographs on her computer. In this case the photographs are considered the data. Each photograph
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!