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
qaws [65]
3 years ago
15

which of the following is not a step of the scientific method A.identifying the problem B.making observations C. making a hypoth

esis D.making a law
Computers and Technology
1 answer:
dangina [55]3 years ago
3 0
I believe the correct answer is choice D. Making a law.

I don't believe the scientific method says anything about making a law.

I hope this helps you and have a great day!
You might be interested in
Your car's engine, transmission, power steering, and brakes all require __________ inspection and changes.
kvasek [131]

The answer is C


All parts require fluid

4 0
3 years ago
Read 2 more answers
Jill edited James's document using Track Changes. James agrees with all of the edits and wants to incorporate them into his text
OLga [1]
   Hey friends

The answer would be B

              ~Katie

8 0
2 years ago
Read 2 more answers
What does this translate to?: 01001001 01110011 00100000 01100010 01110010 01100001 01101001 01101110 01101100 01111001 00100000
Anastasy [175]
"Is Brainly down?" would be the text translation
7 0
3 years ago
The Sleeping-Barber Problem:
s2008m [1.1K]

Answer:

Explanation:

Following are the Semaphores:

Customers: Counts waiting customers;

Barbers: Number of idle barbers (0 or 1)

mutex: Used for mutual exclusion.

Cutting: Ensures that the barber won’t cut another customer’s hair before the previous customer leaves

Shared data variable:

count_cust: Counts waiting customers. ------------copy of customers. As value of semaphores can’t access directly.

// shared data

semaphore customers = 0; semaphore barbers = 0; semaphore cutting = 0; semaphore mutex = 1;

int count_cust= 0;

void barber() {

while(true) { //shop is always open

wait(customers); //sleep when there are no waiting customers

wait(mutex); //mutex for accessing customers1

count_cust= count_cust-1; //customer left

signal(barbers);

signal(mutex);

cut_hair();

}

}

void customer() {

wait(mutex); //mutex for accessing count_cust

if (count_cust< n) {

count_cust= count_cust+1; //new customer

signal(customers); signal(mutex);

wait(barbers); //wait for available barbers get_haircut();

}

else { //do nothing (leave) when all chairs are used. signal(mutex);

}

}

cut_hair(){ waiting(cutting);

}

get_haircut(){

get hair cut for some time; signal(cutting);

}

6 0
3 years ago
In two to three sentences, describe one advanced search strategy and how it is useful.
Lerok [7]
A search stagey is useful because you can make complicated searches easily and also get reliable data.
6 0
3 years ago
Other questions:
  • Jesse purchases a new smartphone and is immediately able to use it to send a photo over the Internet to a friend who lives in a
    12·1 answer
  • Which of the following characters at the beginning of a cell signifies to Excel that it should perform a calculation for the val
    13·1 answer
  • You can leave out the ____ statements in a switch structure.
    15·1 answer
  • You would set a ___________ to prevent users from immediately changing their password several times in one day to return to the
    15·2 answers
  • Which relationship is possible when two tables share the same primary key? one-to-one one-to-many many-to-one many-to-many
    15·2 answers
  • Which is an advantage that electronic scheduling tools have over paper calendars?
    13·2 answers
  • How can you enter Task Manager in Windows? Select 3 options. press Ctrl + Shift + Tab press Ctrl+Alt+Delete and then click Task
    8·1 answer
  • Network address 192.10.10.0<br>​
    12·1 answer
  • In paragraph form, explain and describe at least three common situations in which you would yield the right-of-way.
    5·1 answer
  • The L-exclusion problem is a variant of the starvation-free mutual exclusion problem. We make two changes: as many as L threads
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!