Lecture 1:

Calculate an upper bound for number of decimal digits of the nth term of Fibonacci.
Determine in which term the Fibonacci calculation overflows for short, int , long int and double types.
Calculate 1000th term of Fibonacci using BigInteger and implementing your own extended integer type.
Find average time for the MinSort.
Change the applet MinTimePlot for permutations with repetition. What is the number of different inputs for the Min algorithm in this program?
Complete the table of problem 1-1, p1-1.pdf, of CLRS and add a line for nn.
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?
Modify the applet Julia for Z^4-1.