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

A computer processes data using only 1s and 0s true or false?

Computers and Technology
2 answers:
Molodets [167]3 years ago
7 0

Answer:

answer is binary so true

Explanation:

3241004551 [841]3 years ago
3 0

I just took the quiz its true

You might be interested in
An ipv4 address in the range 169.254.0.1 through 169.254.255.254 indicates a problem with what type of service
DENIUS [597]

Dynamic Host Configuration Protocol, also known as DHCP.

3 0
3 years ago
What type of desktop system is Sarah using in the following scenario? Sarah types the phrase “Open Document 3” onto a black scre
Vedmedyk [2.9K]

I'd go with command-line interface.

A CLI enables users to type commands in a console or a terminal window expressed as a sequence of characters and presses the enter key on the keyboard to execute that command. And in this case, Sarah is typing an “open document 3” command to the command-line interface to open a file in her computer.

4 0
3 years ago
Write a program that performs a simulation to estimate the probability of rolling five of a kind in a single toss of five six-si
VikaD [51]

Answer:

import random

def probability_five_of_a_kind(num_trials):

   sums = 0

   for _ in range(num_trials):

       roll_1 = random.randrange(1,6, 1)

       roll_2 = random.randrange(1,6, 1)

       roll_3 = random.randrange(1,6, 1)

       roll_4 = random.randrange(1,6, 1)

       roll_5 = random.randrange(1,6, 1)

       collection = roll_1 + roll_2 + roll_3 + roll_4 + roll_5

       if collection == 5:

           sums += 1

   prob = round(sums/7776, 8)

   print(f"The probability_five_of_a_kind is {prob}")

   

probability_five_of_a_kind(100)

probability_five_of_a_kind(10000)

probability_five_of_a_kind(1000000)

Explanation:

The random package of the python language is used to select an integer value from the range of one to six representing the sides of a die. All six rolls are randomized and the sum. If the sum is equal to 5, the sums counter is incremented. At the end of the loop, the sum is divided by the five dices events (which is 6^5 = 7776).

8 0
2 years ago
Which options most accurately describe the information that should be included in note-taking? SELECT ALL THAT APPLY
velikii [3]
I think: B,C,D. You do not need to write notes on a thing that you will only see, but you need a date, key words, and main ideas.
4 0
3 years ago
Read 2 more answers
Suppose we compute a depth-first search tree rooted at u and obtain a tree t that includes all nodes of g.
Temka [501]

G is a tree, per node has a special path from the root. So, both BFS and DFS have the exact tree, and the tree is the exact as G.

<h3>What are DFS and BFS?</h3>

An algorithm for navigating or examining tree or graph data structures is called depth-first search. The algorithm moves as far as it can along each branch before turning around, starting at the root node.

The breadth-first search strategy can be used to look for a node in a tree data structure that has a specific property. Before moving on to the nodes at the next depth level, it begins at the root of the tree and investigates every node there.

First, we reveal that G exists a tree when both BFS-tree and DFS-tree are exact.

If G and T are not exact, then there should exist a border e(u, v) in G, that does not belong to T.

In such a case:

- in the DFS tree, one of u or v, should be a prototype of the other.

- in the BFS tree, u and v can differ by only one level.

Since, both DFS-tree and BFS-tree are the very tree T,

it follows that one of u and v should be a prototype of the other and they can discuss by only one party.

This means that the border joining them must be in T.

So, there can not be any limits in G which are not in T.

In the two-part of evidence:

Since G is a tree, per node has a special path from the root. So, both BFS and DFS have the exact tree, and the tree is the exact as G.

The complete question is:

We have a connected graph G = (V, E), and a specific vertex u ∈ V.

Suppose we compute a depth-first search tree rooted at u, and obtain a tree T that includes all nodes of G.

Suppose we then compute a breadth-first search tree rooted at u, and obtain the same tree T.

Prove that G = T. (In other words, if T is both a depth-first search tree and a breadth-first search tree rooted at u, then G cannot contain any edges that do not belong to T.)

To learn more about  DFS and BFS, refer to:

brainly.com/question/13014003

#SPJ4

5 0
2 years ago
Other questions:
  • You have been doing a lot of web surfing lately as part of your research for your course and along the way you have noticed a gr
    14·1 answer
  • Integrated circuits are made up of _____ that carry the electrical current.
    14·1 answer
  • Name one app that currently has a positive impact on society and explain why you think it has had a positive effect.
    10·1 answer
  • In terms of object-oriented programming,after class is defined,________ can be created for that class.
    15·1 answer
  • Managing your calendar and emails can be easily accomplished through ___ software
    8·1 answer
  • If an engine has four cylinders and a total of 16 valves, how many valves would each cylinder have? A. Two B. One C. Four D. Thr
    12·1 answer
  • Simplify 0.2×0.03055 to 3 decimal places​
    15·2 answers
  • Which support function under Tech Mahindra is governing data privacy and protection related requirements
    15·1 answer
  • What would be the best tool to display the following information from a basketball game?
    6·1 answer
  • A sensitive manufacturing facility has recently noticed an abnormal number of assembly-line robot failures. Upon intensive inves
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!