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

3. (5 points) describe what would be printed by the code below or what error would occur. const char* cstr = "0123456"; const char* ptr = & cstr[4]; cout < < ptr[-1] < < ptr < < endl; 1 4. (5 points) theseus has been trapped in a maze with a minotaur, which is trying to capture him. each round, theseus and the minotaur move through the maze; theseus towards the exit, and the minotaur towards theseus. theseus can move in any of the four cardinal directions, or he can wait for a round to see how the minotaur moves. write code that creates a data type to represent the possible moves that theseus could make.

Avariable definition defines the name of a variable that will be used in a program, as well as

What provides an array of buttons for quick access to commonly used commands and tools