{"id":3001,"date":"2014-03-24T12:30:11","date_gmt":"2014-03-24T17:30:11","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3001"},"modified":"2025-12-11T08:31:58","modified_gmt":"2025-12-11T13:31:58","slug":"2eva2013ti_t2-una-tabla-de-bingo","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva20\/2eva2013ti_t2-una-tabla-de-bingo\/","title":{"rendered":"2Eva2013TI_T2 Una Tabla de Bingo con arreglos"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">2da Evaluaci\u00f3n I T\u00e9rmino 2013-2014, Agosto 27, 2013 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 2<\/strong>. (20 puntos). Para una tarde de bingo se usaran tablas generadas con las siguientes reglas:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Los 5 n\u00fameros en cada columna son aleatorios ordenados no repetidos de acuerdo al rango asignado por columna.<\/li>\n\n\n\n<li>La casilla central de la tabla tiene valor marcado cero o \u2018libre\u2019.<\/li>\n<\/ul>\n\n\n\n<p>Realice un programa para generar una tabla de bingo.<\/p>\n\n\n\n<div class=\"wp-block-columns is-layout-flex wp-container-core-columns-is-layout-28f84493 wp-block-columns-is-layout-flex\">\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\">\n<p>Columna \/Rango:<br><strong>B<\/strong> entre 1 - 15<br><strong>I<\/strong> entre 16 - 30<br><strong>N<\/strong> entre 31 \u2013 45<br><strong>G<\/strong> entre 46 \u2013 60<br><strong>O<\/strong> entre 61 \u2013 75<\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-column is-layout-flow wp-block-column-is-layout-flow\">\n<p>Tabla de Bingo<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><thead><tr><th>B<\/th><th>I<\/th><th>N<\/th><th>G<\/th><th>O<\/th><\/tr><\/thead><tbody><tr><td>2<\/td><td>16<\/td><td>32<\/td><td>46<\/td><td>61<\/td><\/tr><tr><td>4<\/td><td>19<\/td><td>34<\/td><td>47<\/td><td>63<\/td><\/tr><tr><td>6<\/td><td>22<\/td><td><mark style=\"background-color:#FFEE58\" class=\"has-inline-color\">libre<\/mark><\/td><td>49<\/td><td>66<\/td><\/tr><tr><td>7<\/td><td>25<\/td><td>37<\/td><td>54<\/td><td>70<\/td><\/tr><tr><td>8<\/td><td>26<\/td><td>42<\/td><td>60<\/td><td>73<\/td><\/tr><\/tbody><\/table><\/figure>\n<\/div>\n<\/div>\n\n\n\n<p>Nota: Puede hacer uso de la funci\u00f3n del tema anterior sorteoentre(K,a,b). <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-eval\/fp-2e15\/2eva2013ti_t1-funcion-sorteoentrekab\/\" data-type=\"post\" data-id=\"2999\">2Eva2013TI_T1 Funci\u00f3n sorteoentre(k,a,b)<\/a><\/p>\n\n\n\n<p><strong>R\u00fabrica<\/strong>: Programa estructurado (5 puntos), uso de funciones (5 puntos), llenado de matriz (5 puntos), salida (5 puntos)<\/p>\n\n\n\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>2da Evaluaci\u00f3n I T\u00e9rmino 2013-2014, Agosto 27, 2013 \/ICM00794 Tema 2. (20 puntos). Para una tarde de bingo se usaran tablas generadas con las siguientes reglas: Realice un programa para generar una tabla de bingo. Columna \/Rango:B entre 1 - 15I entre 16 - 30N entre 31 \u2013 45G entre 46 \u2013 60O entre 61 [&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":[95],"tags":[148,155],"class_list":["post-3001","post","type-post","status-publish","format-standard","hentry","category-fp-2eva20","tag-arreglos-matrices","tag-funciones"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3001","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=3001"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3001\/revisions"}],"predecessor-version":[{"id":16855,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3001\/revisions\/16855"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3001"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3001"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3001"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}