{"id":2991,"date":"2014-07-06T12:00:07","date_gmt":"2014-07-06T17:00:07","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2991"},"modified":"2025-12-11T08:17:04","modified_gmt":"2025-12-11T13:17:04","slug":"2eva2012tii_t1-recursiva-multi","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva20\/2eva2012tii_t1-recursiva-multi\/","title":{"rendered":"2Eva2012TII_T1 Recursiva Multi"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">2da Evaluaci\u00f3n II T\u00e9rmino 2012-2013, Enero 29, 2013 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 1<\/strong> (20 puntos). La siguiente definici\u00f3n recursiva permite calcular la multiplicaci\u00f3n de dos n\u00fameros enteros no negativos.<\/p>\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> multi(p,q) = \\begin{cases} 0, &amp; q=0\\\\ p+multi(p,q-1), &amp; q&gt;0\\end{cases}<\/span>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Escriba una funci\u00f3n recursiva <strong><em>multi<\/em><\/strong>(p,q).<\/li>\n\n\n\n<li>Desarrolle una prueba de escritorio para <strong><em>multi<\/em><\/strong>(3,5)<\/li>\n<\/ul>\n\n\n\n<p><strong>R\u00fabrica<\/strong>: literal a (15 puntos), literal b (5 puntos)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>2da Evaluaci\u00f3n II T\u00e9rmino 2012-2013, Enero 29, 2013 \/ICM00794 Tema 1 (20 puntos). La siguiente definici\u00f3n recursiva permite calcular la multiplicaci\u00f3n de dos n\u00fameros enteros no negativos. R\u00fabrica: literal a (15 puntos), literal b (5 puntos)<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[95],"tags":[156],"class_list":["post-2991","post","type-post","status-publish","format-standard","hentry","category-fp-2eva20","tag-funciones-recursivas"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2991","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/users\/8043"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/comments?post=2991"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2991\/revisions"}],"predecessor-version":[{"id":16845,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2991\/revisions\/16845"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2991"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2991"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2991"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}