All categories

3 years ago

An internal conflict is generally harder to write and still harder to convey in an interactive computer game

1 answer:

7 0

True, because of how the human mind works, you could have a fairly hard decision that could affect your life. So, An Internal conflict is more difficult to convey in an interactive computer game.

You might be interested in

Write a loop that reads strings from standard input where the string is either "land", "air", or "water". The loop terminates wh

____ [38]

Answer:

count_land = count_air = count_water = 0

while True:

s = input("Enter a string: ")

if s == "xxxxx":

break

else:

if s == "land":

count_land += 1

elif s == "air":

count_air += 1

elif s == "water":

count_water += 1

print("land: " + str(count_land))

print("air: " + str(count_air))

print("water: " + str(count_water))

Explanation:

*The code is in Python

Initialize the variables

Create a while loop that iterates until a specific condition is met. Inside the loop, ask the user to enter the string. If it is "xxxxx", stop the loop. Otherwise, check if it is "land", "air", or "water". If it is one of the given strings, increment its counter by 1

When the loop is done, print the number of strings entered in the required format

4 0

3 years ago

I'm skeptical about (b) , is this accurate or the ranges should be listed differently ?

Inessa05 [86]

Answer:

My guess would be C2-C11, But I may be wrong

Imagine a graph

Hope this helps....

4 0

3 years ago

Solve for x<br><br>4d+3/8=-2

Alexxx [7]

Answer:

-19/32

Explanation:

(If I assume d to be x)

4x+3/8=-2

or,4x=-2-3/8=-19/8

or,x=(-19/8)*(1/4)=-19/32

5 0

3 years ago

Organ transplants are rarely successful.

Maurinko [17]

False......................

6 0

3 years ago

Draw a timeline for each of the following scheduling algorithms. (It may be helpful to first compute a start and finish time for

12345 [234]

Answer:

See explanation below

Explanation:

Previos concepts

First Come First Serve (FCFS) "is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival".

Shortest job next (SJN), or the shortest job first (SJF) or shortest "is a scheduling policy that selects for execution the waiting process with the smallest execution time".

Shortest remaining time (SRF) "is a scheduling method that is a preemptive version of shortest job next scheduling'".

Round robin (RR) is an algorithm where the time parts "are assigned to each process in equal portions and in circular order, handling all processes without priority"

Solution for the problem

Assuming the dataset given on the plot attached.

Part a

For this algorithm the result would be:

Job A 0-6

Job B 6-(6+3) = 6-9

Job C 9-(9+1) = 9-10

Job D 10-(10+4) = 10-14

Part b

For this algorithm the result would be:

Job A 0-6

Job C 6-(6+1) = 6-7

Job B 7-(7+3) = 7-10

Job D 10-(10+4) = 10-14

Part c

For this algorithm the result would be:

Job A 0-1 until 14

Job B 2-(2+3) = 2-5

Job C 3-(3+2) = 3-5

Job D 9-(9+5) = 9-14

Part d

For this algorithm the result would be:

Job A 0-2 , 7-9, 12-14

Job B 2-4, 9-10

Job C 4-(4+1) = 4-5

Job D 5-7, 10-12

8 0

3 years ago