PLSS HELP ASAP ILL GIVE BRAINLIEST THANKS

Round 74,361 to the nearest 10

grandymaker [24]

Answer:

74,400 i think

Explanation:

8 0

3 years ago

Assuming that the .data segment begins at location 0400000h, what would be memory layout for the below declarations be? Specify

Nezavi [6.7K]

Answer:

the memory layout will be like this

Explanation:

Let's say we have a system that needs to be used to develop the layout.

This may be interpreted as follows:

int may be drawn as = int

the pointer may be represented as a jagged wavy line

Then the space can be presented as a box

4 0

3 years ago

A company is performing an analysis on the computers at its main office. The computers are spaced along a single row. The analys

harina [27]

Answer:

array = input("Enter the list of computer memory: ").split(',')

int_arr = [int(x) for x in array]

segment = int(input("Enter the length of segment to analyze: "))

list_len = len(int_arr)

segList = []

mini = []

for x,i in enumerate(int_arr):

seg = int_arr[i-1:segment+i-1]

if len(seg) == segment:

segList.append(seg)

for x in segList:

mini.append(min(x))

result = mini.index(min(mini))

print("Segment with the minimum memory is: ",segList[result])

Explanation:

The python program prints out the segment after analysis, with the smallest disk memory space. The code gets the array of computer rows from the user input and segments the array with the number of segment input, then the minimum is compared for all segments in the network.

5 0

3 years ago

Design a program takes as input, X, an unsorted list of numbers, and returns the sorted list of numbers in X. The program must b

Lelechka [254]

Answer:

The program in python is as follows:

def split(X):

L = []; G = []

for i in range(len(X)):

if X[i]>=X[0]:

G.append(X[i])

else:

L.append(X[i])

L.sort(); G.sort()

return L,G

X = []

n = int(input("Length of X: "))

for i in range(n):

inp = int(input(": "))

X.append(inp)

if len(X) == 0 or len(X) == 1:

print(X)

else:

X1,X2=split(X)

newList = sorted(X1 + X2)

print(newList)

Explanation:

The following represents the split function in the previous problem

def split(X):

This initializes L and G to empty lists

L = []; G = []

This iterates through X

for i in range(len(X)):

All elements of X greater than 0 equal to the first element are appended to G

if X[i]>=X[0]:

G.append(X[i])

Others are appended to L

else:

L.append(X[i])

This sorts L and G

L.sort(); G.sort()

This returns sorted lists L and G

return L,G

The main function begins here

This initializes X

X = []

This gets the length of list X

n = int(input("Length of X: "))

This gets input for list X

for i in range(n):

inp = int(input(": "))

X.append(inp)

This prints X is X is empty of has 1 element

if len(X) == 0 or len(X) == 1:

print(X)

If otherwise

else:

This calls the split function to split X into 2

X1,X2=split(X)

This merges the two lists returned (sorted)

newList = sorted(X1 + X2)

This prints the new list

print(newList)

7 0

3 years ago

11. What are the two DFS models?12.When you move a file from the Spreadsheets folder to the Corp Documents folder on a Windows S

Vesnalui [34]

Answer/Explanation:

11. Standalone and Domain-based models

12. The moved file takes with it the permission it had in the Spreadsheets folder.

Cheers.

7 0

3 years ago