There are two algorithms called alg1 and alg2 for a problem of size n. alg1 runs in n2 microseconds and alg2 runs in 100n log n microseconds. alg1 can be implemented using 4 hours of programmer time and needs 2 minutes of cpu time to develop. on the other hand, alg2 requires 15 hours of programmer time and 6 minutes of cpu time to develop. if programmers are paid 20 dollars per hour and cpu time costs 50 dollars per minute, how many times must a problem instance of size 500 be solved using alg2 in order to justify its development cost?

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

1. for which of the following are you not required to signal beforehand? a. changing lanes b. speeding up c. stopping

Some peer-to-peer networks have a server and some don't. true false