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

Why is computer science hardware needed to solve problems with computers?

Computers and Technology
1 answer:
dybincka [34]3 years ago
3 0

Answer:

Computer science is the study of problems, problem-solving, and the solutions that come out of the problem-solving process. Given a problem, a computer scientist's goal is to develop an algorithm, a step-by-step list of instructions for solving any instance of the problem that might arise. ... Algorithms are solutions.

Explanation:

#CarryOnLearning

You might be interested in
In a system where Round Robin is used for CPU scheduling, the following is TRUE when a process cannot finish its computation dur
masha68 [24]

Answer:

B. The process will be terminated by the operating system.

Explanation:

When Round Robin is used for CPU scheduling, a time scheduler which is a component of the operating system is used in regulating the operation. A time limit is set for each of the processes to be run.

So, when a process fails to complete running before its time elapses, the time scheduler would log it off and return it to the queue. This queue is in a circular form and gives each of the processes a chance to run its course.

7 0
3 years ago
_______ is a variation of phishing that uses voice communication technology to obtain the information the attacker is seeking.
Zanzabum
It's voice phishing but it's also sometimes referred to as vishing 
4 0
3 years ago
Determine if the situation below is a safe practice: Julia needs to hang some industrial shelvinv, so she carefully selects the
hichkok12 [17]
I think Julia did good.











Its safe 
7 0
4 years ago
Read 2 more answers
Which of the following is NOT a valid method to increase a variable named score by 1?
Fofino [41]

Answer:

a.

++score = score + 1

Explanation:

First you have to understand the increment operator;

There are three possible ways to increment the value of variable by 1.

1.  <u>post increment</u>

syntax:

name++

it using in expression first then increase the value by 1.

2. <u>Pre increment</u><u> </u>

syntax:

++name

it increase the value by 1 before it using in expression.

3. simple method

name = name +1

In the question,

option 1: ++score = score + 1

it increase the value of score by 2 because their are two increment is used first for (score + 1) and second ++score.

Therefore, the correct option is a.

5 0
3 years ago
Produce an infinite collection of sets A1,A2,A3, . . . with the property that every Ai has an infinite number of elements, Ai ∩
atroni [7]

Answer:

Produce an infinite collection of sets A1,A2,A3, . . . with the property that every Ai has an infinite number of elements, Ai ∩ Aj = ∅ for all i = j, and [infinity] i=1 Ai = N.

Explanation:

Solution

For n ∈ N,

define  A_n = {2 ^n−1  ,(3)(2n−1 ),(5)(2^n−1 ),(7)(2^n−1 ), . . .}

I.e. A_n is all odd multiples of 2^n−1 . We must show that these sets satisfy the desired properties.

• (Infinite Number of Elements).

It is clear that the set A_n = {2 ^n−1 ,(3)(2^n−1 )(5)(2^n−1 ),(7)(2^n−1 ), . . .}  has infinitely many elements.

• (Disjoint).

Given A_n and A_m with n ≠ m, we can assume, without loss of generality, that n < m. Suppose  that there existed some x ∈ A_n ∩ A_m. Then by definition of these sets, there exists some odd numbers k  and l such that x = 2^n−1 . k = 2^m−1  . l.

However since n < m, we have that n ≤ m − 1, and therefore we  can write 2^m−1 = (2^n )(2 i ) with i ≥ 0. Hence we have 2^n−1 . k = 2^n. 2 ^i. l  

Dividing both sides by 2^n−1 yields  k = (2)(2^i ) .l, which contradicts the assumption that k is odd. Therefore A_n ∩ A_m = ∅.

• (Union is N).

We want to show that  [infinity] i=1 A_n = N.

(⊆). Since each A_n is a subset of N, the union of these sets is a subset of N as well.

(⊇).Given any x ∈ N, we can write x = 2^n−1 . k for some n ∈ N where k is odd. Then x ∈ A_n, as  desired.

5 0
3 years ago
Other questions:
  • Which are characteristics of pseudocode? Select all that apply.
    6·1 answer
  • What is the chief ethical concern concerning all the new sources of data available through new technological means like internet
    9·1 answer
  • Sharon is a skilled professional who operates logging equipment.
    12·2 answers
  • Jemima is reviewing her history report and notices that her headings are not formatted the same throughout the
    7·1 answer
  • What is one advantage of using object-oriented programming?
    14·2 answers
  • Hey guys im just curious.... whats ur favorite number
    6·2 answers
  • 3.6 Code Practice on Edhesive
    10·1 answer
  • Can anyone help me with these assignments??? Hands On Assignments- Insertion of Symbols, Special Characters, and Images.... and
    9·1 answer
  • Write any two rules for writing algorithm​
    10·1 answer
  • How can we avoid falling victim to a phishing or pharming scheme
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!