Mostrando entradas con la etiqueta WSQs. Mostrar todas las entradas
Mostrando entradas con la etiqueta WSQs. Mostrar todas las entradas

lunes, 27 de abril de 2015

#WSQ16 cars cars.

I did this WSQ with help of this blogpost.

with this WSQ I learned how to open files in python. and do different things with them.

"open() returns a file object, and is most commonly used with two arguments: open(filename, mode).
>>>
>>> f = open('workfile', 'w')
>>> print f
<open file 'workfile', mode 'w' at 80a0960> 
The first argument is a string containing the filename. The second argument is another string containing a few characters describing the way in which the file will be used. mode can be 'r' when the file will only be read, 'w' for only writing (an existing file with the same name will be erased), and 'a'opens the file for appending; any data written to the file is automatically added to the end. 'r+' opens the file for both reading and writing. The modeargument is optional; 'r' will be assumed if it’s omitted." - Python.org 

I reversed engeneered Efrain's code to see what he tried to do in order to learn.

LINK TO CODE.


lunes, 20 de abril de 2015

#Final Dash

To finish this course I:

1. Will finish WSQ´s by the end of this week, hopefully
2. Will finish my Masteries by the end of the month, I'll try to make mostly videos.
3. Study off of old exams to study for the final.


WSQ14, calculating e

For this program I changed my float to a String, and in order to print the exact amount of decimal points I used it as a list, and I printend just the values I wanted (learn more):

Code:
https://github.com/EduardoMerino/Sharing-for-Class/blob/master/wsq-14.py

Reference links:
https://docs.python.org/3/tutorial/introduction.html#lists

http://en.wikipedia.org/wiki/E_%28mathematical_constant%29


sábado, 21 de marzo de 2015

#WSQ12

click here for code

this program uses recursion to use a function inside itself (woah! functionception) witch isnt the first time we do that in this blog.

this program finds the Greatest Common Divisor of a pair of int. numbers.


miércoles, 18 de marzo de 2015

#WSQ11

Click here to see code

This program seen here uses fuctions in a fun way to determine weather a number is a palindrome or not.

in this program the number will count as a palindrome if it can become a palindrome, example:

11 = palindrome 

31= (31+13=44) =palindrome

28=(28+82=110)=(110+011=121)=palindrome

The only way that a number will be considered a non palindrome by this program is if it takes +30 steps to turn into a palindrome.

miércoles, 11 de marzo de 2015

#WSQ10

This program is all about lists. Click here to see the code

It has some fuctions made by me and a couple of while loops to make things easy.

I used the python documentation to help me do it. check python documentation on lists.


jueves, 26 de febrero de 2015

#WSQ09

click here for code

in this program we are doing the factorial multiplication of a number:

I crated a fuction to do so, using a counter and an accumulator within a loop. the program also uses many while and if statements, so the program ca repeat itself until the user wants to stop.


miércoles, 18 de febrero de 2015

lunes, 9 de febrero de 2015

#WSQ07 Sum of numbers

This was quite a fun program to make. I used a While loop, you can see the code and the terminal runing in the picture, as well as a online calculator prooving that that the answer is right.

jueves, 5 de febrero de 2015

jueves, 22 de enero de 2015

WSQ #02: Flipped classroom, the dawn of the double letters.

This post is all about flipped class:

flipped class allows for a more work efficient enviroment that allows for a ctivity centric class room and you wont spent valuable time on lectures.

this cute video sums it all up in an ellegant manner.


lunes, 19 de enero de 2015

WSQ1

#wsq1.

I downloaded python on my laptop, I want to thank Oscar who posted a video to his blog that helped me with the process.

Here is a screenshot of all the downloaded files to prove it. FIN

I signed Page 1

#wsq00

Hey Ken,

I signed page one, see:

signature.