{"id":36140,"date":"2016-04-13T00:05:50","date_gmt":"2016-04-13T05:05:50","guid":{"rendered":"http:\/\/carlosdanielmartinezblog.wordpress.com\/?p=950"},"modified":"2016-04-13T00:40:53","modified_gmt":"2016-04-13T05:40:53","slug":"wsq13","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/wsq13\/","title":{"rendered":"#WSQ13"},"content":{"rendered":"<h3 style=\"text-align:center;\"><span style=\"color:#10b4c9;\">&#8220;Exam 2&#8221;<\/span><\/h3>\n<p style=\"text-align:center;\">Fundamentals of Programming, First Partial Examination<\/p>\n<p style=\"text-align:center;\">Thursday, April 7, 2015<\/p>\n<p style=\"text-align:justify;\">1. Escribe el funci\u00f3n distancia cual recibe 4 n\u00fameros (x1, y1, x2, y2) cuales representan dos puntos en espacio (x1,y1) y (x2,y2). El m\u00e9todo debe regresar la distancia entre los dos puntos. Recuerda que el valor cuadrada del hipotenusa del triangulo es igual que la suma de las cuadradas de los otro dos lados del triangulo (the hypotenuse squared is equal to the sum of the squares of the other two sides).<\/p>\n<p style=\"text-align:justify;\"><img loading=\"lazy\" decoding=\"async\" class=\"  wp-image-965 aligncenter\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/69e29ace10208e6a4598b220b0bbb14c.jpg#038;h=63\" alt=\"for_dist_2_ptos\" width=\"303\" height=\"63\" \/><\/p>\n<p style=\"text-align:justify;\">Aqu\u00ed est\u00e1 mi c\u00f3digo funcionando:<\/p>\n<p><span style=\"color:#0000ff;\">import<\/span> math<\/p>\n<p><span style=\"color:#0000ff;\">def<\/span> <span style=\"color:#800080;\">distancia<\/span> (x1,y1,x2,y2):<br \/>\nresultado=math.sqrt((x2+x1)**<span style=\"color:#99cc00;\">2<\/span>+(y2+y1)**<span style=\"color:#99cc00;\">2<\/span>)<br \/>\n<span style=\"color:#0000ff;\">return<\/span> resultado<\/p>\n<p>fin=distancia(<span style=\"color:#99cc00;\">1<\/span>,<span style=\"color:#99cc00;\">2<\/span>,<span style=\"color:#99cc00;\">3<\/span>,<span style=\"color:#99cc00;\">4<\/span>)<br \/>\n<span style=\"color:#0000ff;\">print<\/span>(fin)<\/p>\n<p>Por aqu\u00ed el enlace a <a href=\"https:\/\/github.com\/iDannymt\/Fundamentos-De-Programaci-n\/blob\/master\/%23WSQ13\">Github<\/a>.<\/p>\n<p style=\"text-align:justify;\">2. Escribe un funci\u00f3n que se llama triangulo cual recibe un par\u00e1metro size y imprime un triangulo derecho como el siguiente. El rengl\u00f3n mas grande debe llevar size numero de \u201cT\u201d. SOLO imprime los \u201cT\u201ds y los endlines. Nota que no hay characteres (espacios) a la derecha de los T&#8217;s. Debe usar un ciclo \u201cfor\u201d para controlar el repetici\u00f3n. Ejemplo es si size era 6.<\/p>\n<p style=\"text-align:justify;\">Aqu\u00ed est\u00e1 mi c\u00f3digo:<\/p>\n<p>numero=<span style=\"color:#0000ff;\">int<\/span>(<span style=\"color:#0000ff;\">input<\/span>(<span style=\"color:#ff9900;\">&#8220;Por favor dame el tama\u00f1o de tu triangulo &#8220;<\/span>))<\/p>\n<p><span style=\"color:#0000ff;\">def<\/span> <span style=\"color:#800080;\">triangulo<\/span> (var):<br \/>\nr=range(1,var)<br \/>\nr2=range(var,<span style=\"color:#99cc00;\">0<\/span>,<span style=\"color:#99cc00;\">-1<\/span>)<\/p>\n<p><span style=\"color:#0000ff;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 for<\/span> x <span style=\"color:#0000ff;\">in<\/span> r:<br \/>\nresultado=<span style=\"color:#ff9900;\">&#8220;T&#8221;<\/span>*x<br \/>\n<span style=\"color:#0000ff;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print<\/span>(resultado)<\/p>\n<p><span style=\"color:#0000ff;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 for<\/span> y <span style=\"color:#0000ff;\">in<\/span> r2:<br \/>\notra=<span style=\"color:#ff9900;\">&#8220;T&#8221;<\/span>*y<br \/>\n<span style=\"color:#0000ff;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print<\/span>(otra)<\/p>\n<p>triangulo(numero)<\/p>\n<p style=\"text-align:justify;\">\u00a0Por aqu\u00ed el enlace a <a href=\"https:\/\/github.com\/iDannymt\/Fundamentos-De-Programaci-n\/blob\/master\/%23WSQ13\">Github<\/a>.<\/p>\n<p style=\"text-align:justify;\">3. Escribe un funci\u00f3n que se llama superpower(a,b) con dos parameters de (enteros \/ int). Debe regresar el valor del primer parametro al poder del segundo, o mejor decir a b . No puedes <\/p>\n<div class=\"post-limited-image\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/67ef5d63c3e1587146be4dbe4324e64d.jpg\" \/><\/div>\n<div class=\"post-limited-image\"><img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/8f7376b4c3b3bb7bc86902eaad099c1e.jpg#038;blog=105448664&#038;%23038;post=950&#038;%23038;subd=carlosdanielmartinezblog&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/div>\n<p><!--more--> un funci\u00f3n de modulos de Python para hacerlo directo, pero con un ciclo usando multiplicaci\u00f3n. Ejemplos: superpower(4,2) es 16 superpower(3,4) es 81<\/p>\n<p style=\"text-align:justify;\">Aqu\u00ed est\u00e1 mi c\u00f3digo:<\/p>\n<p style=\"text-align:justify;\"><span style=\"color:#0000ff;\">def<\/span> <span style=\"color:#800080;\">superpower<\/span> (a,b):<br \/>\ncontador=<span style=\"color:#99cc00;\">1<\/span><br \/>\nz=a<br \/>\n<span style=\"color:#0000ff;\">while<\/span>(contador&lt;b):<\/p>\n<p>a=a*z<br \/>\ncontador=contador+<span style=\"color:#99cc00;\">1<\/span><br \/>\n<span style=\"color:#0000ff;\">return<\/span> a<\/p>\n<p>r=superpower(<span style=\"color:#99cc00;\">3<\/span>,<span style=\"color:#99cc00;\">3<\/span>)<br \/>\n<span style=\"color:#0000ff;\">print<\/span>(r)<\/p>\n<p style=\"text-align:justify;\">Por aqu\u00ed el enlace a <a href=\"https:\/\/github.com\/iDannymt\/Fundamentos-De-Programaci-n\/blob\/master\/%23WSQ13\">Github<\/a>.<\/p>\n<p style=\"text-align:justify;\">4. Escribe un funci\u00f3n que se llama fibonacci cual recibe como parametro un entero no negativo (int) \u201cn\u201d y regresa un entero cual representa el numero en la serie de fibonacci en posicion n. La definici\u00f3n (modificado) del serie de Fibonacci para hoy es: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 &#8230;&#8230;&#8230;.. Entonces fibonacci(0) es 0, fibonacci(5) es 5, fibonacci(8) es 21, fibonacci(10) es 55<\/p>\n<p style=\"text-align:justify;\">Aqu\u00ed est\u00e1 mi c\u00f3digo:<\/p>\n<p>import os<br \/>\nos.system(&#8220;clear&#8221;)<br \/>\nprint(&#8220;Fibonacci&#8221;)<br \/>\ndtener=int(input(&#8220;Por favor dime que posicion de la serie quieres saber &#8220;))<\/p>\n<p><span style=\"color:#0000ff;\">def<\/span><span style=\"color:#800080;\"> fibonacci<\/span> (variable):<br \/>\ncontador=<span style=\"color:#99cc00;\">1<\/span><br \/>\nfibo=<span style=\"color:#99cc00;\">0<\/span><br \/>\nchico=<span style=\"color:#99cc00;\">0<\/span><br \/>\ngrande=<span style=\"color:#99cc00;\">1<\/span><\/p>\n<p><span style=\"color:#0000ff;\">if<\/span>(variable==<span style=\"color:#99cc00;\">0<\/span>):<br \/>\ngrande=<span style=\"color:#99cc00;\">0<\/span><\/p>\n<p><span style=\"color:#0000ff;\">if<\/span>(variable&lt;<span style=\"color:#99cc00;\">0<\/span>):<br \/>\n<span style=\"color:#0000ff;\">print<\/span> (<span style=\"color:#ff9900;\">&#8220;error NO USES VALORES NEGATIVOS&#8221;<\/span>)<\/p>\n<p><span style=\"color:#0000ff;\">else<\/span>:<br \/>\n<span style=\"color:#0000ff;\">while<\/span>(contador&lt;variable <span style=\"color:#0000ff;\">or<\/span> contador==1 ):<br \/>\nfibo=grande+chico<br \/>\nchico=grande<br \/>\ngrande=fibo<\/p>\n<p>contador=contador+<span style=\"color:#99cc00;\">1<\/span><\/p>\n<p><span style=\"color:#0000ff;\">print<\/span>(<span style=\"color:#ff9900;\">&#8220;El numero&#8221;<\/span>, dtener,<span style=\"color:#ff9900;\">&#8220;en fibonacci es:&#8221;<\/span>,fibo)<\/p>\n<p>fibonacci(dtener)<\/p>\n<p style=\"text-align:justify;\">\u00a0Por aqu\u00ed el enlace a <a href=\"https:\/\/github.com\/iDannymt\/Fundamentos-De-Programaci-n\/blob\/master\/%23WSQ13\">Github<\/a>.<\/p>\n<p style=\"text-align:justify;\">  <a rel=\"nofollow\" href=\"http:\/\/feeds.wordpress.com\/1.0\/gocomments\/carlosdanielmartinezblog.wordpress.com\/950\/\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/67ef5d63c3e1587146be4dbe4324e64d.jpg\" \/><\/a> <img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/8f7376b4c3b3bb7bc86902eaad099c1e.jpg#038;blog=105448664&#038;%23038;post=950&#038;%23038;subd=carlosdanielmartinezblog&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>&#8220;Exam 2&#8221; Fundamentals of Programming, First Partial Examination Thursday, April 7, 2015 1. Escribe el funci\u00f3n distancia cual recibe 4 n\u00fameros (x1, y1, x2, y2) cuales representan dos puntos en espacio (x1,y1) y (x2,y2). El m\u00e9todo debe regresar la distancia entre los dos puntos. Recuerda que el valor cuadrada del hipotenusa del triangulo es igual &hellip; <a href=\"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/wsq13\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">#WSQ13<\/span><\/a><\/p>\n","protected":false},"author":48,"featured_media":36142,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[41],"class_list":["post-36140","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-wsqs"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/36140","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/48"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=36140"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/36140\/revisions"}],"predecessor-version":[{"id":36147,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/36140\/revisions\/36147"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/36142"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=36140"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=36140"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=36140"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}