Quiz 07

Here is my blog for the Quiz 07

Create a function called dot_product that receives two lists of numbers (say list1 and
list2). The function returns what is the dot product of the two lists.

For full marks, if the lists are not the same size, then the function should return the
special value of NaN (which represents not a number). Here is the link to my GitHub.

Course Review

Me dare la libertad de escribir este blog en español para poder expresarme de una forma más completa.

Quisiera empezar dejando claro que en este curso aprendi muchas cosas de las cuales estoy seguro que van a ser fundamentales a lo largo de mi carrera, las aprendi de una forma u otra, pero en lugar de hacer este blog muy largo y tedioso dare lo que me llevo del curso en general.

Este tipo de curso es muy diferente a los demás, porque aquí tu aprendes bajo tu propia cuenta, si, el Ken va a estar allí contigo para cualquier pregunta que necesites o duda, pero este modelo de curso se basa principalmente en el auto estudio, y en mi opinion personal siento que es algo que enriquece mucho tu aprendizaje y te hace ver los problemas desde una ángulo diferente.

Es una metodología diferente la cual probablemente no estamos preparados en este país, es un curso para las personas entusiastas de aprender y no ser conformistas.

*Me gustaría aclarar que aunque este blog dice que lo subí el día mayo 5, no es así y lo estoy subiendo el 4 de mayo, no se porque hace ese cambio de horario, es igual para mis blogs pasados.

Quiz 06

Here is my blog post for the quiz 06

1. Write a function to calculate the greatest common denominator of two positive integers using Euclid’s algorithm. Here is the link to my GitHub.

Quiz 05

Here is my blog post to my Quiz 05.

• Create a function called is_palindrome which receives a string as a parameter and returns true if that string is a palindrome, false otherwise. Remember that a palindrome is a word that is the same forward or backward. For full points your function must ignore case and must work with any character (not just letters). So (“Dad$dad” is a palindrome even though the D is capital and d is lower case). Here is the link for my link to GitHub.

• Create a function called find_threes that receives as a parameter a list (or Vector or array for C++ students) of numbers and returns the sum of all numbers in that list that are evenly divisible by 3. Note if using vectors, you will need an additional parameter to represent the number of numbers in the array. So if the list was [0,4,2,6,9,8,3,12], the function would return 30 (0+6+9+3+12). Here is my code to GitHub.

Quiz 04

Here is the Blog post for my Quiz number 4.

1. Create a function called euler_calc with a single parameter precision. The value of precision is used to determine when to stop calculating. Your calculation will stop when the two consecutive values estimating e differ by less than precision (remember to use absolute value when calculating the difference between two values here). Here is the link to my GitHub.

 

 

Quiz 03

Here is my blog post for the Quiz 3

1. Write a function called distance (x1,y1,x2,y2) which receives four numbers which represent two points in the cartesian plane. The function should return the distance between the two points (x1,y1) and (x2,y2). Remember that the square of the hypotenuse of a right angle triangle is equal to the sum of the squares of the two other sides. Here is the link to my GitHub.

   

 

1. Write a function called fibonacci which receives a single parameter“n”(anon-negative integer) and returns the nth number in the fibonacci series which is:
   0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89… Here is the link to my GitHub

QUIZ 02

Hi again everyone!! I’m going to leave the links to my codes for the quiz number 2 and also, some photos for the evidence, I got to say that was kind of tricky….

The links, Superpower and Stars.

Quiz 01

Well is kind of late to do the blogpost for the first quiz but, better late than never.

I had some troubles with the first program but with some help I could finish it.

Here are the links to my three codes on GitHub Prog1, Prog2 and Prog3. The last two programs were very similar to a WSQ, if I remember was the WSQ03. Well to finish this blogpost I will show you some images of my codes running.