Given six memory partitions of 300 kb, 600 kb, 350 kb, 200 kb, 750 kb, and 125 kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 kb, 500 kb, 358 kb, 200 kb, and
375 kb (in order)? rank the algorithms in terms of how efficiently they use memory.
a) first fit:
115 -> 300
500-> 600
358 -> 750
200 -> 350
375 -> not able to allocate
b) best fit:
115 -> 125
500 -> 600
358 -> 750
200 -> 200
375 -> not able to allocate
c) worst fit:
115 -> 750
500 -> 600
358 -> not able to allocate
200 -> 350
375 -> not able to allocate

Octothorpe is another name for what common computer keyboard symbol?

How do you set up a slide show to play continuously, advancing through all the slides without requiring your interaction? a. click set up slide show, and then select the loop continuously until ‘esc' and show without narration options. b. click set up slide show, and then select the loop continuously until ‘esc' and use timings, if present options. c. click set up slide show, and then select the show presenter view and use timings, if present options. d. click set up slide show, and then select the show without animation and browsed at a kiosk (full screen) options.

Consider the following function main: int main() { int alpha[20]; int beta[20]; int matrix[10][4]; . . } a. write the definition of the function inputarray that prompts the user to input 20 numbers and stores the numbers into alpha. b. write the definition of the function doublearray that initializes the elements of beta to two times the corresponding elements in alpha. make sure that you prevent the function from modifying the elements of alpha. c. write the definition of the function copyalphabeta that stores alpha into the first five rows of matrix and beta into the last five rows of matrix. make sure that you prevent the function from modifying the elements of alpha and beta. d. write the definition of the function printarray that prints any onedimensional array of type int. print 15 elements per line. e. write a c11 program that tests the function main and the functions discussed in parts a through d. (add additional functions, such as printing a two-dimensional array, as needed.)