{"id":2593,"date":"2014-10-07T16:00:17","date_gmt":"2014-10-07T21:00:17","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2593"},"modified":"2025-12-11T20:59:02","modified_gmt":"2025-12-12T01:59:02","slug":"3eva2009tii_t1-funciones-combinatoria-y-factorial","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-3eva10\/3eva2009tii_t1-funciones-combinatoria-y-factorial\/","title":{"rendered":"3Eva2009TII_T1 Funciones combinatoria y factorial"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"3EvaIIT2009\">3ra Evaluaci\u00f3n II T\u00e9rmino 2009-2010. Febrero 23, 2010 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 1 <\/strong>(20 puntos) La <strong>Combinatoria<\/strong> se define como: <\/p>\n\n\n\n<figure class=\"wp-block-image aligncenter\"><img loading=\"lazy\" decoding=\"async\" width=\"202\" height=\"117\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2015\/03\/Combinatoria.gif\" alt=\"combinatoria formula\" class=\"wp-image-313\" \/><\/figure>\n\n\n\n<p>a. Escriba en una funci\u00f3n llamada <strong>combinatoria<\/strong>(<strong>n<\/strong>,<strong>k<\/strong>), la cual retorna el n\u00famero posible de combinaciones de <strong>n<\/strong> objetos tomando <strong>k<\/strong> de ellos.<\/p>\n\n\n\n<p>b. Implemente la funci\u00f3n <strong>factorial<\/strong>(<strong>n<\/strong>) en forma recursiva.<\/p>\n\n\n\n<p>c. Realice una prueba de escritorio para combinatoria(5,3).<\/p>\n\n\n\n<p><strong>R\u00fabrica<\/strong>: Definici\u00f3n de la funci\u00f3n (5 puntos), bloque de procedimiento (7 puntos), funci\u00f3n recursiva (5 puntos), prueba de escritorio (3 puntos)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>3ra Evaluaci\u00f3n II T\u00e9rmino 2009-2010. Febrero 23, 2010 \/ICM00794 Tema 1 (20 puntos) La Combinatoria se define como: a. Escriba en una funci\u00f3n llamada combinatoria(n,k), la cual retorna el n\u00famero posible de combinaciones de n objetos tomando k de ellos. b. Implemente la funci\u00f3n factorial(n) en forma recursiva. c. Realice una prueba de escritorio para [&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":[120],"tags":[156],"class_list":["post-2593","post","type-post","status-publish","format-standard","hentry","category-fp-3eva10","tag-funciones-recursivas"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2593","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=2593"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2593\/revisions"}],"predecessor-version":[{"id":17197,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2593\/revisions\/17197"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2593"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2593"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2593"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}