{"id":3138,"date":"2014-03-05T09:00:57","date_gmt":"2014-03-05T14:00:57","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3138"},"modified":"2026-04-05T06:41:39","modified_gmt":"2026-04-05T11:41:39","slug":"1eva_it2005_t3-arreglo-aleatorio-binario-a-decimal","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva10\/1eva_it2005_t3-arreglo-aleatorio-binario-a-decimal\/","title":{"rendered":"1Eva2005TI_T3 Arreglo aleatorio binario a decimal"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"1EvaIT2005\">Parcial I T\u00e9rmino 2005 - 2006. Julio 05, 2005 \/ICM00794<\/h2>\n\n\n\n<figure class=\"wp-block-image alignright size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"281\" height=\"169\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/1Eva_IT2005_T3_binarioDecimal.png\" alt=\"1Eva_IT2005_T3 binario Decimal\" class=\"wp-image-16330\" \/><\/figure>\n\n\n\n<p><strong>Tema 3<\/strong>. (30 puntos). Suponga un vector <strong>B<\/strong>[i] de <strong>n<\/strong> componentes enteros.<\/p>\n\n\n\n<p>Dise\u00f1e un algoritmo estructurado que almacene en cada celda un n\u00famero aleatorio binario de una cifra (1 \u00f3 0).<\/p>\n\n\n\n<p>a) Determine si la cantidad de 1\u2019s es par o impar<\/p>\n\n\n\n<p>b) Calcule el equivalente num\u00e9rico decimal del n\u00famero binario almacenado.<\/p>\n\n\n\n<p>c) Muestre los resultados de los literales a) y b).<\/p>\n\n\n\n<p><strong>Ejemplo<\/strong>: Vector B[i] con n=8, equivalente a un binario B=11010010<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td>i<\/td><td><strong>B<\/strong>[i]<\/td><td>Equivalente decimal:<\/td><\/tr><tr><td>1<\/td><td>1<\/td><td>1*2<sup>7<\/sup>+<\/td><\/tr><tr><td>2<\/td><td>1<\/td><td>1*2<sup>6<\/sup>+<\/td><\/tr><tr><td>3<\/td><td>0<\/td><td>0*2<sup>5<\/sup>+<\/td><\/tr><tr><td>4<\/td><td>1<\/td><td>1*2<sup>4<\/sup>+<\/td><\/tr><tr><td>5<\/td><td>0<\/td><td>0*2<sup>3<\/sup>+<\/td><\/tr><tr><td>6<\/td><td>0<\/td><td>0*2<sup>2<\/sup>+<\/td><\/tr><tr><td>7<\/td><td>1<\/td><td>1*2<sup>1<\/sup>+<\/td><\/tr><tr><td>8<\/td><td>0<\/td><td>0*2<sup>0<\/sup><\/td><\/tr><tr><td colspan=\"2\">Total de 1\u2019s es Par<\/td><td>=210<sub>10<\/sub><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>R\u00fabrica<\/strong>: ingreso de tama\u00f1o de vector (3 puntos), ingreso de datos del vector, o generar aleatorios (7 puntos), literal a (5 puntos), literal b (10 puntos), literal c (5 puntos)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Parcial I T\u00e9rmino 2005 - 2006. Julio 05, 2005 \/ICM00794 Tema 3. (30 puntos). Suponga un vector B[i] de n componentes enteros. Dise\u00f1e un algoritmo estructurado que almacene en cada celda un n\u00famero aleatorio binario de una cifra (1 \u00f3 0). a) Determine si la cantidad de 1\u2019s es par o impar b) Calcule el [&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":[113],"tags":[145,149],"class_list":["post-3138","post","type-post","status-publish","format-standard","hentry","category-fp-1eva10","tag-acumuladores","tag-arreglos-vectores"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3138","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=3138"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3138\/revisions"}],"predecessor-version":[{"id":16332,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3138\/revisions\/16332"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3138"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3138"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3138"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}