{"id":35626,"date":"2016-03-10T21:04:02","date_gmt":"2016-03-11T02:04:02","guid":{"rendered":"http:\/\/fernandacano.wordpress.com\/?p=357"},"modified":"2016-04-07T21:43:03","modified_gmt":"2016-04-08T02:43:03","slug":"another-one-yes-%f0%9f%92%80","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/03\/another-one-yes-%f0%9f%92%80\/","title":{"rendered":"Another one? Yes 💀"},"content":{"rendered":"

Quiz 05 was about<\/p>\n

    \n
  1. 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 case).<\/li>\n<\/ol>\n

     <\/p>\n

    \"Captura<\/p>\n

     <\/p>\n

    2. Create 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)<\/p>\n

    \"Captura<\/p>\n

    To do this quiz I had to read my classmates quizzes and asked for help to a friend that already have done this last semester.<\/p>\n

    Anyway those are the screenshots for each one.<\/p>\n

    And here<\/a> are both codes.<\/p>\n

     <\/p>\n

     <\/p>\n

     <\/p>\n

    \"\"<\/a> \"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

    Quiz 05 was about 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 … Continue reading Another one? Yes 💀<\/span><\/a><\/p>\n","protected":false},"author":55,"featured_media":35648,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[209],"class_list":["post-35626","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-quiz5"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35626","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\/55"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=35626"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35626\/revisions"}],"predecessor-version":[{"id":35654,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35626\/revisions\/35654"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/35648"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=35626"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=35626"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=35626"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}