{"id":5688,"date":"2014-03-09T12:55:41","date_gmt":"2014-03-09T17:55:41","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/ccpg1001\/?p=5688"},"modified":"2026-04-05T17:50:46","modified_gmt":"2026-04-05T22:50:46","slug":"s2eva2005ti_t3-adivina-palabra-ahorcado","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s2eva10\/s2eva2005ti_t3-adivina-palabra-ahorcado\/","title":{"rendered":"s2Eva2005TI_T3 Adivina palabra (ahorcado)"},"content":{"rendered":"\n<p><em><strong>Ejercicio<\/strong><\/em>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2005ti_t3-adivina-palabra-ahorcado\/\" data-type=\"post\" data-id=\"2889\">2Eva2005TI_T3 Adivina palabra (ahorcado)<\/a><\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Manejo de Texto como Cadenas de caracteres en Python. Ejercicio: Adivina palabra, Ahorcado\" width=\"500\" height=\"281\" src=\"https:\/\/www.youtube.com\/embed\/gWarFana9a4?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\">Algoritmo en Python<\/h2>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; title: ; notranslate\" title=\"\">\n# 2Eva_IT2005_T3 Adivina palabra (ahorcado)\n# ICM00794-Fundamentos de Computaci\u00f3n - FCNM-ESPOL\n# propuesta: edelros@espol.edu.ec\n\ndef esvocal(letra):\n    letra = letra.upper()\n    vocal = 'AEIOU'\n    tipo = 0\n    if letra in vocal:\n        tipo = 1\n    return(tipo)\n\n# INGRESO\npalabra = input('\u00bfCu\u00e1l palabra?: ')\nm = len(palabra)\nwhile m&gt;9:\n    print(' palabra de hasta 9 letras')\n    palabra = input('\u00bfCu\u00e1l palabra?: ')\n    m = len(palabra)\n\n# PROCEDIMIENTO\nm = len(palabra)\npalabra = palabra.upper()\ncadena  = ''\nvocal ='AEIOU'\nfalla = 0\n\ni = 0\nwhile i&lt;m:\n    cadena = cadena + str(i+1)\n    i = i + 1\n\n# una letra\nj = 0\nwhile (j&lt;m) and falla&lt;5:\n    letra = palabra&#x5B;j]\n    cual  = esvocal(letra)\n    if cual==1:\n        pista = ' es vocal'\n    else:\n        pista = ' es consonante'\n    print(cadena)\n    print(str(j+1)+pista + ', fallas:'+str(falla))\n\n    unaletra = input('\u00bfcu\u00e1l letra?: ')\n    unaletra = unaletra.upper()\n\n    if unaletra == letra:\n        print(' adivinado..!')\n        j = j + 1\n        nueva = palabra&#x5B;0:j]+cadena&#x5B;j:]\n        cadena = nueva\n    else:\n        print(' fallaste, no es la letra..!')\n        falla = falla + 1\n\nif falla&gt;=5:\n    print(' Fallaste 5 veces, perdiste..!')\nelse:\n    print(' Felicitaciones, ganaste...!!')\n<\/pre><\/div>\n\n\n<p><strong>Tarea<\/strong>: validar que el ingreso del usuario sea de una sola letra.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">resultado del algoritmo<\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>\u00bfCu\u00e1l palabra?: conocimiento\n palabra de hasta 9 letras\n\u00bfCu\u00e1l palabra?: sabiduria\n123456789\n1 es consonante, fallas:0\n\u00bfcu\u00e1l letra?: s\n adivinado..!\nS23456789\n2 es vocal, fallas:0\n\u00bfcu\u00e1l letra?: i\n fallaste, no es la letra..!\nS23456789\n2 es vocal, fallas:1\n\u00bfcu\u00e1l letra?: o\n fallaste, no es la letra..!\nS23456789\n2 es vocal, fallas:2\n\u00bfcu\u00e1l letra?: a\n adivinado..!\nSA3456789\n3 es consonante, fallas:2\n\u00bfcu\u00e1l letra?: x\n fallaste, no es la letra..!\nSA3456789\n3 es consonante, fallas:3\n\u00bfcu\u00e1l letra?: y\n fallaste, no es la letra..!\nSA3456789\n3 es consonante, fallas:4\n\u00bfcu\u00e1l letra?: z\n fallaste, no es la letra..!\n Fallaste 5 veces, perdiste..!\n&gt;&gt;&gt;<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Ejercicio: 2Eva2005TI_T3 Adivina palabra (ahorcado) Algoritmo en Python Tarea: validar que el ingreso del usuario sea de una sola letra. resultado del algoritmo<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejemplos","format":"standard","meta":{"footnotes":""},"categories":[131],"tags":[58,157],"class_list":["post-5688","post","type-post","status-publish","format-standard","hentry","category-fp-s2eva10","tag-ejemplos-python","tag-fundamentos-programacion"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/5688","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=5688"}],"version-history":[{"count":5,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/5688\/revisions"}],"predecessor-version":[{"id":23655,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/5688\/revisions\/23655"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=5688"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=5688"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=5688"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}