{"id":35683,"date":"2016-04-08T00:15:45","date_gmt":"2016-04-08T05:15:45","guid":{"rendered":"http:\/\/carolpzblog.wordpress.com\/?p=229"},"modified":"2016-04-08T00:16:18","modified_gmt":"2016-04-08T05:16:18","slug":"quiz-5-15","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz-5-15\/","title":{"rendered":"quiz 5"},"content":{"rendered":"<ul>\n<li>Create a function called is_palindrome which receives a string as a parameter and\u00a0returns true if that string is a palindrome, false otherwise. Remember that a palindrome\u00a0is a word that is the same forward or backward. For full points your function must ignore\u00a0case and must work with any character (not just letters).\u00a0So (\u201cDad$dad\u201d is a palindrome even though the D is capital and d is lower<\/li>\n<\/ul>\n<p>en este programa se \u00b4pide al usuario una palabra \u00a0que no contenga espacios y cuando la lee el programa por medio de la funci\u00f3n backwards va comparando la primera letra de la palabra con la ultima y asi sucesivamente con un ciclo for para indicarle al programa en que posici\u00f3n de la letra se quiere comparar, hasta llegar hacer un condicional if\/else de que si las letras al rev\u00e9s son las mismas que al derecho, debe de mostrar en pantalla que la palabra insertada es un pal\u00edndromo<\/p>\n<p>code <a href=\"https:\/\/github.com\/carolpzblog\/quiz-5-part-1\/blob\/master\/.gitignore\">github part 1<\/a><\/p>\n<p><img decoding=\"async\" class=\"alignnone size-full wp-image-239\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/2f051b5576e3519a7ec71881ae8a9e0c-1.jpg\" alt=\"Captura de pantalla 2016-04-08 00.06.00\"   \/><\/p>\n<ul>\n<li>\u00a0Create a function called find_threes that receives as a parameter a list (or Vector or array for C++ students) of numbers and\u00a0returns the sum of all numbers in that list that are evenly divisible by 3. Note if using vectors, you will need an additional parameter to represent the number of numbers in the array.\u00a0So if the list was [0,4,2,6,9,8,3,12], the function would return 30 (0+6+9+3+12)<\/li>\n<\/ul>\n<p>es este segundo programa se trata de que por medio de un vector el usuario va a indicar que tata cantidad de numeros queire insertar y una vez que lo inserte, entonces por medio de un ciclo for va a pedirle los numeros que quiere guardar en cada contador del vector. asi pues mientras se estan insertando los numeros se inserta tambien un condicional if\/else para que desde ese momento el numero que el usuario este <\/p>\n<div class=\"post-limited-image\"><img decoding=\"async\" class=\"alignnone size-full wp-image-246\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/73f0a5f657e9b9c3b3bf416d8e778f48.jpg\" alt=\"Captura de pantalla 2016-04-08 00.07.08\"   \/><\/div>\n<div class=\"post-limited-image\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/31b2c84c782a31eff2b2776a45e10fdd.jpg\" \/><\/div>\n<div class=\"post-limited-image\"><img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/49600aba629dc4318126d4ae93d48ae0.jpg#038;blog=105381171&#038;%23038;post=229&#038;%23038;subd=carolpzblog&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/div>\n<p><!--more--> se analice si es divisible entre tres y si es asi, entonces que se vayan sumando todos los numeros divisibles entre tres.<\/p>\n<p>code <a href=\"https:\/\/github.com\/carolpzblog\/quiz-5-part-2\/tree\/master\">github<\/a>\u00a0part 2<\/p>\n<p><img decoding=\"async\" class=\"alignnone size-full wp-image-246\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/73f0a5f657e9b9c3b3bf416d8e778f48.jpg\" alt=\"Captura de pantalla 2016-04-08 00.07.08\"   \/><\/p>\n<p>  <a rel=\"nofollow\" href=\"http:\/\/feeds.wordpress.com\/1.0\/gocomments\/carolpzblog.wordpress.com\/229\/\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/31b2c84c782a31eff2b2776a45e10fdd.jpg\" \/><\/a> <img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/49600aba629dc4318126d4ae93d48ae0.jpg#038;blog=105381171&#038;%23038;post=229&#038;%23038;subd=carolpzblog&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Create a function called is_palindrome which receives a string as a parameter and\u00a0returns true if that string is a palindrome, false otherwise. Remember that a palindrome\u00a0is a word that is the same forward or backward. For full points your function must ignore\u00a0case and must work with any character (not just letters).\u00a0So (\u201cDad$dad\u201d is a palindrome &hellip; <a href=\"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz-5-15\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">quiz 5<\/span><\/a><\/p>\n","protected":false},"author":74,"featured_media":35684,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[187,209,31,45],"class_list":["post-35683","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-pinkzone","tag-quiz5","tag-tc101","tag-sin-categoria"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35683","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/74"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=35683"}],"version-history":[{"count":3,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35683\/revisions"}],"predecessor-version":[{"id":35694,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35683\/revisions\/35694"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/35684"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=35683"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=35683"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=35683"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}