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
Sergio [31]
3 years ago
10

Help fast plzzzzzzzzzzzz ​

Computers and Technology
2 answers:
MrRissso [65]3 years ago
7 0
These are the ones I knew

1a
4 c
5d
7b
8a
9c
10 a
eimsori [14]3 years ago
4 0

Answer:

Which question would you like help with?

You might be interested in
What is the minimum number of bits required to store 11 different values?
yawa3891 [41]

Answer:

4 bits are required. 4 bits can represent 16 different values (2*2*2*2 or ). 3 bits can only represent 8 different values. In the general case n bits can represent values, or correspondingly m values can be represented by bits.

5 0
3 years ago
Output the following 21%4​
Vadim26 [7]
21%4 is 1.

21-4=17
17-4=13
13-4=9
9-4=5
5-4=1
4 0
3 years ago
A(n) ____ is an entry in a cell that contains text such as "2016 Sales" or "Travel Expenses."
slavikrds [6]

Answer:

B- label

Explanation:

A label is an entry such as a text within a cell that describes particular rows and columns. Labels are usually found at the top of the particular row/column they are identifying.

Hence, the texts "2016 Sales" and "Travel Expenses" are labels that identify cells such as the values of the sales in 2016 of a company and expenses spent on travel in a year of a family.

6 0
3 years ago
Suppose we are given an arbitrary digraph G = (V, E) that may or may not be a DAG. Modify the topological ordering algorithm so
lianna [129]

Answer:

Check the explanation

Explanation:

We can utilize the above algorithm with a little in modification. If in each of the iteration, we discover a node with no inward edges, then we we’re expected succeed in creating a topological ordering.

If in a number of iteration, it becomes apparent that each of the node has a minimum of one inward edge, then there must be a presence of cycle in the graph.

So our algorithm in finding the cycle is this: continually follow an edge into the node we’re presently at (which is by choosing the first one on the adjacency list of inward edges to decrease the running time).

Since the entire node has an inward edge, we can do this continually or constantly until we revisit a node v for the first time.

The set of nodes that we will come across among these two successive visits is a cycle (which is traversed in the reverse direction).

3 0
3 years ago
How does the author of let bindi have the limelight persuade readers to consider the importance of wildlife conservation
Likurg_2 [28]

Answer:

She describes the  wildlife supporter who continues to foster her father's legacy and become a television personality.She delivers bindi's message and accomplishment.

Explanation:

6 0
3 years ago
Read 2 more answers
Other questions:
  • Discuss your theory on why the light bulbs in the combination circuit have different brightness.
    6·1 answer
  • What is a database query?
    12·2 answers
  • Why is e-mail better for informative and positive messages than for negative ones?
    6·1 answer
  • The true or false questions.
    13·1 answer
  • When a person or organization uses the services of another professional, that person or organization is called the _______
    15·1 answer
  • A<br>A<br>printount<br>of your report or a till slip is an<br>example of what​
    15·1 answer
  • Does anyone know what i did wrong?
    13·1 answer
  • Series-connected 11-pF and 21-pF capacitors are placed in parallel with series-connected 22- pF and 30-pF capacitors. Determine
    10·1 answer
  • Which Save As element allows a user to save a presentation on a computer?
    11·1 answer
  • What is a disruptive technology? Give an example of an aspect of society that has been impacted by technological change.
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!