{"id":2900,"date":"2014-06-12T12:00:53","date_gmt":"2014-06-12T17:00:53","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2900"},"modified":"2025-12-11T06:26:06","modified_gmt":"2025-12-11T11:26:06","slug":"2eva2007ti_t1-funciones-par-e-impar-recursivas","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2007ti_t1-funciones-par-e-impar-recursivas\/","title":{"rendered":"2Eva2007TI_T1 Funciones par e impar recursivas"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"2EvaIT2007\">2da Evaluaci\u00f3n I T\u00e9rmino 2007-2008. Agosto 28, 2007 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 1.<\/strong> (20 puntos) Sean las funciones recursivas:<\/p>\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> par(n) = \\begin{cases} 1, &amp; n=0\\\\impar(n-1), &amp; n&gt;0 \\end{cases}<\/span>\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> impar(n) = \\begin{cases} 0, &amp; n=0\\\\par(n-1), &amp; n&gt;0 \\end{cases}<\/span>\n\n\n\n<pre class=\"wp-block-code\"><code>Ejemplos: \n &gt;&gt; par (4) retorna 1\n &gt;&gt; impar (4) retorna 0\n &gt;&gt; par (5) retorna 0\n &gt;&gt;impar (5) retorna 1<\/code><\/pre>\n\n\n\n<p>a. Escriba las funciones <strong>par<\/strong> e <strong>impar<\/strong>, dichas funciones retornan 1 si el n\u00famero tiene la caracter\u00edstica de la funci\u00f3n llamada.<\/p>\n\n\n\n<p>b. Escriba un programa principal donde se generen de forma aleatoria <strong>n<\/strong> n\u00fameros enteros comprendidos entre 10 y 50. Luego, utilizando las funciones anteriores, determine si la mayor\u00eda de los n\u00fameros generados fueron pares. El n\u00famero <strong>n<\/strong> debe ser pedido al usuario.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>2da Evaluaci\u00f3n I T\u00e9rmino 2007-2008. Agosto 28, 2007 \/ICM00794 Tema 1. (20 puntos) Sean las funciones recursivas: a. Escriba las funciones par e impar, dichas funciones retornan 1 si el n\u00famero tiene la caracter\u00edstica de la funci\u00f3n llamada. b. Escriba un programa principal donde se generen de forma aleatoria n n\u00fameros enteros comprendidos entre 10 [&hellip;]<\/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":[93],"tags":[156],"class_list":["post-2900","post","type-post","status-publish","format-standard","hentry","category-fp-2eva10","tag-funciones-recursivas"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2900","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=2900"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2900\/revisions"}],"predecessor-version":[{"id":16759,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2900\/revisions\/16759"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2900"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2900"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2900"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}