Divide and Conquer You have a list A[1...n] of n integers. A local minimum of a list is an index i such that A[i] < A[i −1] and A[i] < A[i +1]. A[1] and A[n] are local minimums only if they are less than their single neighbor. You will develop an algorithm to find one local minimum in a list (there may be more than one in the list but you only have to find one). a) Circle the local minimums in this list. A= [10,7,5,3,5,7,9,6,4,2
b) Write a formal statement of this problem. That is, state the input and output criteria as precisely as possible.
c) Let LM(A[a...b) express the output of the local minimum problem. State a self-reduction relating the solution to the main problem to solutions to its sub-problems.
d) What is the worst case running time of the algorithm you have designed.

Axel is finally documenting his work. what could he be writing?

The instruction ishl (shift left integer) exists in jvm but not in ijvm. it uses the top two values on the stack, replacing the two with a single value, the result. the sec- ond-from-top word of the stack is the operand to be shifted. its content is shifted left by a value between 0 and 31, inclusive, depending on the value of the 5 least signifi- cant bits of the top word on the stack (the other 27 bits of the top word are ignored). zeros are shifted in from the right for as many bits as the shift count. the opcode for ishl is 120 (0x78).a. what is the arithmetic operation equivalent to shifting left with a count of 2? b. extend the microcode to include this instruction as a part of ijv.

Write a program in plp assembly that counts up by one starting from zero (or one) inside a loop and writes this value to the leds every time the value is increased. the memory address of the leds is 0xf0200000. the table below shows the meaning and an example usage of the instructions covered in the video, plp instructions for project 1. instruction example usage meaning load immediate li $t0, 8 register $t0 is set to the value, 8. store word sw $t2, 0($t1) the value in register $t1 is used as the memory address. the value in register $t2 is copied into this memory address. add addiu $t4, $t3, 29 register $t4 is assigned the sum of 29 and the value in register $t3. jump j your_label_name the program jumps to the line following the label, "your_label_name: ". label your label name: defines a label called "your_label_name: " that can be jumped to