PEDRO ANDRES ORTEGA MOSSOS      

COD: 257076          GRUPO: 01

HOMEWORKS

ULTIMAS NOTICIAS

@ El grupo de trabajo para los entregables del primer parcial consta de

• Sergio Aristizabal

• Daniel Armando Infante

• Julian Felipe Rivera

     Los entregables se pueden observar el pagina de "Daniel Infante"

@ (NUEVO) La solucion del PARCIAL FINAL se puede observar en el siguiente Link

• Solucion Parcial  Final

@ (NUEVO) El grupo para presentar las tareas finales es el mismo en que se hizo los entregables del primer parcial, en la pagina de "Daniel Infante" se pueden observar las tareas.

 

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 nⁿ.

• 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

LECTURE   2

• Calculate the  table and frecuency and probabilty  graphs of  t(5) for insertion sort of n=5  [t(4) is in Isortn4.xls]

• Applet for average time estimation of Insertion Sort on random permutations without repetitions for "big" n's (n > 15).

• Applet for average time calculation of  Insertion Sort when input is a uniform random permutation with repetitions for (n<10)

• Applet for average time estimation of Insertion Sort on random permutations with repetitions for "big" n's (n > 10).

• Find the average time formula for Insertion Sort when input is a uniform random permutation with repetitions.

• Modfiy the animation applet InsertionSortAnim  for one of the following: Min Sort, Bubble Sort or Binary Seach.

• Solve three exercises and two problems form CLRS chapter 2.

LECTURE   3

LECTURE   4

LECTURE   5

LECTURE   6

LECTURE    7