Lecture 1

• Calculate an upper bound for number of decimal digits of  the nth term of Fibonacci. view
• Determine in which term the Fibonacci calculation overflows for short, int , long int and double types. view
• Calculate 1000th term of Fibonacci  using BigInteger and implementing your own extended integer type. view
• Find average time for the MinSort. view
• Change the applet MinTimePlot for permutations with repetition. What is the number of different inputs for the Min algorithm in this program? view
• Complete the table of problem 1-1, p1-1.pdf, of CLRS and add a line for nn. view
• Run int matrix multiplication for an n that allows to estimate the time to execute an arithmetic operation, report the processor used and the estimations obtained. Adjust the limits established the table of problem 1-1, p1-1.pdf, according to the estimation obtained and run the MinTimePlot applets for permutations with and without repetitions for size problems  that have a predicted time of 5 minutes Is the real time close to the estimate? view
• Modify the applet Julia for  Z^4-1. view

Correctness

• Solve exercises 7,10, 12 and  13 of Ecaes. view
  • In problem 7 if in C i is increased by 1 each time,  what is the answer? view
• Solve exercises 2,3,7,9,10,13, 14,15, 17, 20, 26, 27, 63, 64 of GRE Computer Science. view
•  Read the correctness verification notes and solve the exercises from J. Gomez. view